Projects
LUCS: Learning to Understand and Control nation-wide Smart grids of energy prosumers

The world energy market is changing, with many developed countries investing into green energy as well as distributed energy production. This transformation has led to the possibility of prosumers- the producer of relatively small and sporadic amounts of energy, to significantly influence the market and the power quality in the grid. Nonetheless, a wider proliferation of privately owned solar collectors, windmills, and other kinds of green generators make it challenging to manage the flow of energy that is no longer uni-directional.
LUCS is bringing together research groups and educational institutions that are committed to educating the next generation of researchers and engineers by joining forces to provide knowledge and experience that will assist Masters and early doctoral students with experiment design and performance analyses of smart grid systems. The research-related objectives of LUCS are to facilitate interaction of researchers for the purpose of developing and implementing novel approaches to improve the performance and robustness of the smart grid systems.
Final goal
LUCS will conduct four main activities:
-
Organize 4 summer schools
- Develop a common smart grid curriculum at University of Oslo and Technical University of Berlin
- Organize 3 research workshops
- Sponsor the mobility of researchers to strengthen the group collaboration
Summer schools
3 summer schools have been held since 2018, and the final summer school, led by University of Oslo (UiO), will be in the summer of 2022 at Sundvollen.
-
Future Energy Information Networks, was held in Oslo from September 3rd to 7th, 2018.
- Smart Cities for Sustainable Energy Future - from design to practice, was held in Berlin from August 19th to 30th, 2019.
- Green Computing meets Green Energy, was held in Lille from September 5th to 10th, 2021. The Lille summer school was the first in-person event since the pandemic. More information on this summer school is found in this article.
Workshops
3 collaborative LUCS-PACE research workshops have been held.
-
The first workshop was a combined kick-off held in Oslo.
- The second LUCS-PACE workshop was held virtually due to Covid-19, from 25th to 26th of April, 2021. A summary of the workshop is available through this article.
- The final workshop was led by the Technical University of Munich (TuM), and took place at their premises in Munich, from 2nd to 4th of March, 2022. Read more about this workshop.
Funding source
INTPART-International Partnerships for Excellent Education and Research
All partners
- Simula Research Laboratory, Norway
- University of Oslo, Norway
- Technical University of Berlin (TU Berlin), Germany
- German Turkish Advanced Research Center for ICT (GT-ARC) Germany
Project leader
David Hayes, Center for Resilient Networks and Applications, SimulaMet, Norway
From Energy Systems to Energy Justice

Summer school for early-stage PhD students and MSc students. Time and place: Aug. 29, 2022–Sep. 2, 2022, Sundvolden Hotel, Dronningveien 2, 3531 Krokkleiva, Norway. Hosted by University of Oslo.
The partners of the two projects LUCS and PACE, University of Oslo, Norway, Simula Metropolitan Center for Digital Engineering, Norway, University of Stavanger, Norway, University of Lille, France, Technical University of Berlin, Germany, GT-ARC, Germany, and Technical University of Munich, Germany, are jointly organizing the Summer School From Energy Systems to Energy Justice.
The target audience for the summer school is early-stage PhD students and MSc students in the related degree programs of any institution worldwide*. Well qualified Bachelor students are also welcome to apply, but priority will be given to higher-level applicants. Students from the host universities and institutes are particularly encouraged to apply.
Location: Sundvolden Hotel, Dronningveien 2, 3531 Krokkleiva, which is close to the city of Oslo, Norway. Hosted by University of Oslo.
Dates: August 29—September 2, 2022.


The transition to a globally sustainable low-carbon emission society requires a significant increase in the use of renewable energy, improving energy efficiency, and reducing energy consumption. We are facing increased decentralized energy production, and digitalization of the whole value chain. We must learn to exploit state-of-the-art ICT methods, tools and techniques to achieve sustainable energy generation and use. However, the technical aspect is just one part of this equation, where the social aspect is just as important. There is a need to integrate technological and social science research to develop solutions that adopt the perspectives of social inclusion and energy justice in developing new solutions. That is, inclusion of all groups in society and policy approaches to support fair distribution of energy generated on-site, costs and benefits, the recognition of all involved groups, and fair representation in decision making. New knowledge is increasingly at the intersection of Energy technology, Energy Informatics, Communication systems, Social Sciences Psychology, and Data and Energy Law.
This year's summer school focuses on these areas of intersection and tools that facilitate research at these intersections. Energy sharing and decentralized markets require mechanisms to securely and privately facilitate the interactions in fair and equitable ways. Battery management and storage systems help enable stable connectivity. Simulation and emulation tools help us to examine how these interactions will play out in future systems. Optimization is a powerful tool to help us to find the best approaches to the interactions. Adopting this approach will enable us to address the cross disciplinary aspects necessary to develop a holistic and autonomous framework for transactive energy management.
The list of speakers will be updated continually. To find a list of confirmed speakers and their titles and abstracts, please go here. The final program, when ready, will be available in this document.
The summer school will cover contemporary topics in energy systems along with the interaction to socio-technical perspectives. These include:
- Energy sharing: Local Markets and Community Energy Storage
- Battery Management Systems and Industry Scale Storage Solutions
- Energy system simulation and emulation
- Microgrids and Virtual power plants
- Energy justice: Social, psychological, and regulatory aspects of the energy transition
- Security and Privacy of Energy Systems and Local Energy Markets
- Decentralized Markets Design and Models for Sustainable Energy Systems
The lectures will cover the recent trends and modern approaches in the above topics. Lectures in each field will be presented from various perspectives, encompassing technical and social aspects from both academics and industry. In addition, the summer school will include hands-on work in the form of a tutorial on optimization conducted by the authors of the Julia package on Unit Commitment. Finally, 1-minute madness presentations from students to introduce their current research will align interests and lead to future collaborations.
Applying for the summer school
Please apply here. Included in the application, you will be asked to upload a CV, letter of support from your supervisor, transcripts and a motivation statement. Deadline for applications is 19 June, 2022. Accepted students will be notified by the beginning of July.
Travel and Accommodation
Accommodation in double rooms will be provided to the admitted students for the entire duration of the summer school. Arrival at the hotel will be Sunday, the 28th of August with checkout by noon on the 2nd of September. All meals from the evening of the 28th until lunch on the 2nd are included. Upon presentation of documentation, travel expenses will be reimbursed after the summer school with a maximum of €500 for travels within Europe. For travel from outside of Europe, expenses will be reimbursed up to a maximum of €1200. Please note, only economy class travel will be reimbursed. Reimbursable travel expenses include airplane tickets, train or bus.
Currently there are no restrictions in Norway due to Covid-19. As we get closer to the event, updated travel information will be made available.
Contact Information
If you are part of one of the host institutions, please contact your local coordinator listed below:
David Hayes, Email: davidh@simula.no; Tel.: (+47)99870774
If you are not part of a host institution, questions can be directed to:
Russel Wolff, Email: russel.wolff@uis.no; Tel.: (+47)47903118
David Hayes, Email: davidh@simula.no; Tel.: (+47)99870774
Partners:







Contact person: Frank Eliassen
Local contact person: David Hayes
*Subject to being able to travel to Norway and meeting relevant entry requirements. These are subject to change, but currently there are few restrictions (see koronavirus-covid-19-restrictions) in addition to the normal visa requirements. Ensuring that you have been sufficiently vaccinated for covid-19, and have the necessary documentation, may help if the situation suddenly changes.
Publications
Journal Article
Estimating an Additive Path Cost with Explicit Congestion Notification
IEEE Transactions on Control of Network Systems 8, no. 2 (2021): 859-871.Status: Published
Estimating an Additive Path Cost with Explicit Congestion Notification
Network Utility Maximization (NUM) is a well accepted theoretical framework that describes how congestion controls cooperate to achieve an ideal sending rate allocation, for given utility functions of senders and constraints of the network. These network constraints are expressed as a "cost'' in the framework. In practice, most congestion control mechanisms obtain feedback that is different from the framework's "cost''. This paper focuses on Explicit Congestion Notification (ECN), which has been shown to be advantageous when it is available, e.g. with the popular Datacenter TCP (DCTCP) mechanism. However, different from the framework's cost, ECN marks are not additive. We present a practical solution to this problem. Our solution changes how end hosts interpret the ECN signal, while for the router side, a special configuration of RED is used.
Afilliation | Communication Systems |
Project(s) | Department of Mobile Systems and Analytics |
Publication Type | Journal Article |
Year of Publication | 2021 |
Journal | IEEE Transactions on Control of Network Systems |
Volume | 8 |
Issue | 2 |
Pagination | 859--871 |
Date Published | 06/2021 |
Publisher | IEEE |
ISSN | 2325-5870 |
Notes | Currently published in early access on IEEExplore. |
URL | https://doi.org/10.1109/TCNS.2021.3053179 |
DOI | 10.1109/TCNS.2021.3053179 |
Proceedings, refereed
Reliable Consistent Multipath mmWave Communication
In International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'21). New York, NY, USA: ACM, 2021.Status: Published
Reliable Consistent Multipath mmWave Communication
Reliable consistent communication over millimeter-wave (mmWave) channels is a challenging problem due to their sensitivity to blocking of Line of Sight connections. Even though mmWave is a key building block in 5G and future generation cellular networks, making solutions to this problem space important. Our aim is to use predictive control to manage and simultaneously use multiple available mmWave paths to achieve reliable consistent communication (i.e. steady transmission rate with low delay) with a multipath proxy. To this end we investigate transient solutions of Markov Modulated Fluid Queue models (MMFQ), apt because the mmWave blocking has been modeled with Markovian models. We propose a combination of models that can be solved using newly proposed matrix analytic techniques in a timely enough manner for use in real-time control. This gives us a prediction of either proxy queue distributions or probabilities of reaching proxy buffer levels over a short time horizon, enabling the proxy to make preemptive path decisions to maintain a desired Quality of Service. A proof of concept simulation study demonstrates the efficacy of our proposed MMFQ-based predictive approach over either static or purely reactive control approaches.
Afilliation | Communication Systems |
Project(s) | Department of Mobile Systems and Analytics |
Publication Type | Proceedings, refereed |
Year of Publication | 2021 |
Conference Name | International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'21) |
Pagination | 149–158 |
Date Published | 11/2021 |
Publisher | ACM |
Place Published | New York, NY, USA |
ISBN Number | 9781450390774 |
Notes | Authors' version of the work available. Please refer to DOI for the definitive version. |
URL | https://doi.org/10.1145/3479239.3485684 |
DOI | 10.1145/3479239.3485684 |
Talks, contributed
Update on SBD (RFC 8382)
In The Internet Engineering Task Force, IETF 112. IETF, 2021.Status: Published
Update on SBD (RFC 8382)
Comparative evaluation of RFC 8382, comparing vanilla RFC 8382, RFC 8382 stats with dynamic online clustering, offline wavelet filtered cross-correlation, online adaption of the wavelet filtered cross-correlation. Concludes with recommendations for future work.
Afilliation | Communication Systems |
Project(s) | Department of Mobile Systems and Analytics |
Publication Type | Talks, contributed |
Year of Publication | 2021 |
Location of Talk | The Internet Engineering Task Force, IETF 112 |
Publisher | IETF |
Type of Talk | Talk to the RMCAT working group |
Notes | https://datatracker.ietf.org/meeting/112/proceedings |
URL | https://datatracker.ietf.org/meeting/112/materials/slides-112-rmcat-upda... |
Journal Article
Online Identification of Groups of Flows Sharing a Network Bottleneck
IEEE/ACM Transactions on Networking 28 (2020): 2229-2242.Status: Published
Online Identification of Groups of Flows Sharing a Network Bottleneck
Abstract—Most Internet hosts today support multiple access technologies and network interfaces. Multipath transport protocols, like MPTCP, are being deployed (e.g., in smartphones), allowing transparent simultaneous use of multiple links. Besides providing increased resilience to link failures, multipath trans- ports may better exploit available (aggregate) capacity across all interfaces. The safest way to ensure fairness is to assume that any subflows of a multipath end-to-end connection may share bottleneck links, but knowledge of non-shared bottlenecks could allow multipath senders to exploit more capacity without being unfair to other flows. The problem of reliably detecting the existence of (non)-shared bottlenecks is not trivial and is compounded by the fact that bottlenecks may change due to traffic dynamics. In this paper we focus on practical methods to reliably group flows that share, possibly dynamic, bottlenecks online and in a passive manner (i.e., without injecting measurement traffic). We introduce a novel dynamic clustering algorithm that we apply to update our previous shared bottleneck flow grouping (SBFG) method standardized by the IETF, based on delay statistics. We also adapt an offline SBFG method based on wavelet filters to enable it for online operation. These SBFG methods are evaluated by a simple testbed, rigorous simulation and real-world Internet experiments in a testbed comprised of multihomed hosts. Our results suggest that there is no clear winner, and selection of the “best” SBFG method will have to consider tradeoffs regarding accuracy, lag, and application requirements.
Afilliation | Communication Systems |
Project(s) | RITE: Reducing Internet Transport Latency, Department of Mobile Systems and Analytics |
Publication Type | Journal Article |
Year of Publication | 2020 |
Journal | IEEE/ACM Transactions on Networking |
Volume | 28 |
Number | 5 |
Pagination | 2229--2242 |
Publisher | IEEE/ACM |
ISSN | Print ISSN: 1063-6692, Electronic ISSN: 1558-2566 |
Keywords | dynamic clustering, Internet congestion control, multipath congestion control., shared bottleneck detection |
Notes | Published in the Early Access area on IEEE Xplore. The content is final as presented with the exception of pagination and |
DOI | 10.1109/TNET.2020.3007346 |
Technical reports
Estimating an Additive Path Cost with Explicit Congestion Notification (extended version)
University of Oslo, 2019.Status: Published
Estimating an Additive Path Cost with Explicit Congestion Notification (extended version)
Abstract—Network Utility Maximization (NUM) is a well accepted theoretical concept that describes how congestion controls could cooperate to achieve an ideal sending rate allocation, for given utility functions of senders and constraints of the network. These network constraints are expressed as a “cost” in the framework. In practice, most congestion control mechanisms obtain feedback that is different from a “cost”. This paper focuses on Explicit Congestion Notification (ECN), which has been shown to be quite advantageous when it is available, e.g. with the popular Datacenter TCP (DCTCP) mechanism. However, different from a cost, ECN marks are not additive. We present a practical solution to this problem. Our solution changes how end hosts interpret the ECN signal, while the router side can be implemented via an unusual configuration of RED parameters.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Technical reports |
Year of Publication | 2019 |
Number | 487 |
Date Published | 03/2019 |
Publisher | University of Oslo |
ISBN Number | 978-82-7368-452-3 |
ISSN Number | 0806-3036 |
Notes | Submitted 2018, awaiting completion of reviews |
URL | https://heim.ifi.uio.no/michawe/research/publications/NUM-ECN_report_201... |
Proceedings, refereed
On the importance of TCP splitting proxies for future 5G mmWave communications
In IEEE Local Computer Networks (LCN) Symposium on Emerging Topics in Networking. IEEE, 2019.Status: Published
On the importance of TCP splitting proxies for future 5G mmWave communications
Abstract—5G mmWave technology promises capacities 10 to 100 times that of 4G. However, mmWave links are very sensitive to having direct line of sight between sender and receiver, with dramatically fluctuating capacities due to transient blocking and shadow fading, which can substantially degrade TCP performance. TCP-splitting proxies (SPEPs) are often used to improve TCP performance over wireless links. We investigate current operator SPEPs (used in 4G LTE networks) under mmWave-like dynamics using the MONROE testbed. We introduce a mmWave emulation model for an urban canyon scenario, and use it to evaluate how current operational SPEPs impact the performance. Our results from experiments including four operators and three countries, indicate that SPEPs will be even more important for 5G mmWave than they are in LTE. Current 4G SPEPs provide significant, though not optimal, benefits under mmWave-like conditions, allowing them to be utilized as the network transitions to 5G technology.
Afilliation | Communication Systems |
Project(s) | MAMI: Measurement and Architecture for a Middleboxed Internet, MONROE: Measuring Mobile Broadband Networks in Europe , Department of Mobile Systems and Analytics |
Publication Type | Proceedings, refereed |
Year of Publication | 2019 |
Conference Name | IEEE Local Computer Networks (LCN) Symposium on Emerging Topics in Networking |
Pagination | 108--116 |
Date Published | 10/2019 |
Publisher | IEEE |
ISBN Number | 978-1-7281-2561-9 |
URL | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9000661&isnumber... |
DOI | 10.1109/LCNSymposium47956.2019.9000661 |
Proceedings, refereed
ctrlTCP: Reducing Latency through Coupled, Heterogeneous Multi-Flow TCP Congestion Control
In 21st IEEE Global Internet Symposium (GI 2018). Honolulu, HI, USA: IEEE, 2018.Status: Published
ctrlTCP: Reducing Latency through Coupled, Heterogeneous Multi-Flow TCP Congestion Control
Afilliation | Communication Systems |
Project(s) | NEAT: A New, Evolutive API and Transport-Layer Architecture for the Internet |
Publication Type | Proceedings, refereed |
Year of Publication | 2018 |
Conference Name | 21st IEEE Global Internet Symposium (GI 2018) |
Date Published | 04/2018 |
Publisher | IEEE |
Place Published | Honolulu, HI, USA |
Notes | In conjunction with IEEE INFOCOM, Honolulu, HI, USA |
URL | https://www.duo.uio.no/handle/10852/71297 |
DOI | 10.1109/INFCOMW.2018.8406887 |
Miscellaneous
Shared Bottleneck Detection for Coupled Congestion Control for RTP Media
In RFC 8382. Internet Requests for Comments ed. RFC Editor, 2018.Status: Published
Shared Bottleneck Detection for Coupled Congestion Control for RTP Media
This document describes a mechanism to detect whether end-to-end data flows share a common bottleneck. This mechanism relies on summary statistics that are calculated based on continuous measurements and used as input to a grouping algorithm that runs wherever the knowledge is needed
Afilliation | Communication Systems |
Project(s) | RITE: Reducing Internet Transport Latency |
Publication Type | Miscellaneous |
Year of Publication | 2018 |
Publisher | RFC Editor |
Notes | Internet Engineering Task Force (IETF) Request for Comments: 8382 Category: Experimental ISSN: 2070-1721 |
URL | https://www.rfc-editor.org/info/rfc8382 |
DOI | 10.17487/RFC8382 |
TR-Number | 8382 |
Proceedings, refereed
A Framework for Less than Best Effort Congestion Control with Soft Deadlines
In 2017 IFIP Networking Conference (IFIP Networking) and Workshops. IEEE, 2017.Status: Published
A Framework for Less than Best Effort Congestion Control with Soft Deadlines
Applications like inter data-centre synchronisation or client-to-cloud backups require a reliable end-to-end data transfer, however, they typically do not have strong capacity or latency constraints, just a loose delivery deadline. Besides, their potential to disrupt more quality-constrained flows should be kept to a minimum. These applications could be well served by a transport protocol providing a less-than-best-effort (LBE) or scavenger service rather than TCP but, neither TCP nor standard LBE methods like LEDBAT consider any notion of deadline or completion time. TCP simply tries to maximise the use of available capacity, while LEDBAT tries to enforce an LBE behaviour regardless of any timeliness requirements.
This paper introduces a framework for adding both LBE behaviour and awareness of “soft” delivery deadlines to any congestion control (CC) algorithm, whether loss-based, delay-based or explicit signaling-based. This effectively allows it to turn an arbitrary CC protocol into a scavenger protocol that dynamically adapts its sending rate to network conditions and remaining time before the deadline, to balance timeliness and transmission aggressiveness. Network utility maximization (NUM) theory provides a solid foundation for the proposal. The effectiveness of the approach is validated by numerical and simulation experiments, with TCP Cubic and Vegas used as examples.
Afilliation | Communication Systems |
Project(s) | NEAT: A New, Evolutive API and Transport-Layer Architecture for the Internet |
Publication Type | Proceedings, refereed |
Year of Publication | 2017 |
Conference Name | 2017 IFIP Networking Conference (IFIP Networking) and Workshops |
Publisher | IEEE |
ISBN Number | 978-3-901882-94-4 |
URL | http://dl.ifip.org/db/conf/networking/networking2017/1570334752.pdf |
DOI | 10.23919/IFIPNetworking.2017.8264853 |
Evaluating CAIA Delay Gradient as a Candidate for Deadline-Aware Less-than-Best-Effort Transport
In Workshop on Future of Internet Transport (FIT 2017). IFIP, 2017.Status: Published
Evaluating CAIA Delay Gradient as a Candidate for Deadline-Aware Less-than-Best-Effort Transport
Less-than-best-effort (LBE) congestion control offers a low-priority service for applications tolerant to high latency and low throughput, like peer-to-peer file transfers or automatic software updates. There are, however, situations where it would be beneficial for the application to specify a soft deadline for task completion. Examples of such situations could be completion of backup tasks or synchronisation between CDN data centres. Since network conditions change over time, a deadline-aware LBE (DA-LBE) congestion control would need the ability to dynamically adapt how aggressively it competes for capacity to meet the soft deadline, trading low-priority behaviour for timeliness. One candidate that shows promise as a LBE congestion control is CAIA Delay Gradient (CDG). CDG uses changes in measured end-to-end delay to control the congestion window. CDG has several parameters that might help tune its “aggressiveness” in a way that might help achieve the goal of DA-LBE congestion control. We have evaluated CDG in order to establish how it can be tuned to exhibit different degrees of LBE behaviour under varying network conditions. Our results show that it is possible to control CDG to vary its aggressiveness in a consistent way, making it a prime candidate to implement a DA-LBE congestion control system.
Afilliation | Communication Systems |
Project(s) | NEAT: A New, Evolutive API and Transport-Layer Architecture for the Internet |
Publication Type | Proceedings, refereed |
Year of Publication | 2017 |
Conference Name | Workshop on Future of Internet Transport (FIT 2017) |
Publisher | IFIP |
ISBN Number | 978-3-901882-94-4 |
Keywords | congestion control, deadline-aware congestion control, Less-than-Best-Effort Service, scavenger service |
URL | http://dl.ifip.org/db/conf/networking/networking2017/1570350870.pdf |
DOI | 10.23919/IFIPNetworking.2017.8264882 |
Journal Article
NEAT: A Platform- and Protocol-Independent Internet Transport API
IEEE Communications Magazine 55, no. 6 (2017): 46-54.Status: Published
NEAT: A Platform- and Protocol-Independent Internet Transport API
The sockets Applications Programming Interface (API) has become the standard way that applications access the transport services offered by the Internet Protocol stack. This paper presents NEAT, a user-space library that can provide an alternate transport API. NEAT allows applications to request the service they need using a new design that is agnostic to the specific choice of transport protocol underneath. This not only allows applications to take advantage of common protocol machinery, but also eases introduction of new network mechanisms and transport protocols. The paper describes the components of the NEAT library and illustrates the important benefits that can be gained from this new approach. NEAT is a software platform for developing advanced network applications that was designed in accordance with the standardization efforts on Transport Services (TAPS) in the Internet Engineering Task Force (IETF), but its features exceed the envisioned functionality of a TAPS system.
Afilliation | Communication Systems |
Project(s) | NEAT: A New, Evolutive API and Transport-Layer Architecture for the Internet |
Publication Type | Journal Article |
Year of Publication | 2017 |
Journal | IEEE Communications Magazine |
Volume | 55 |
Issue | 6 |
Pagination | 46-54 |
Date Published | 06/2017 |
Publisher | IEEE |
ISSN | 0163-6804 |
DOI | 10.1109/MCOM.2017.1601052 |
Research Notes | https://www.neat-project.org/publications/#papers |
Proceedings, refereed
Even Lower Latency, Even Better Fairness:Logistic Growth Congestion Control in Datacenters
In The 41st IEEE Conference on Local Computer Networks (LCN). IEEE, 2016.Status: Published
Even Lower Latency, Even Better Fairness:Logistic Growth Congestion Control in Datacenters
Datacenter transport has attracted much recent interest, however, most proposed improvements require changing the datacenter fabric, which hinders their applicability and deployability over commodity hardware. In this paper, we present a novel congestion controller, Logistic Growth Control (LGC), for datacenters which does not require changes to the datacenter fabric. LGC uses a similar ECN marking as in DCTCP, but adapts to congestion using the logistic growth function. This function has been proven to have nice characteristics including stability, convergence, fairness, and scalability, which are very appealing for congestion control. As a result, our LGC mechanism operates in the datacenter network in a more stable and fair manner, leading to less queuing and latency. LGC also behaves better than DCTCP, and it converges to the fair share of the bottleneck link capacity irrespective of the Round-Trip-Time (RTT). We discuss the stability and fairness of LGC using a fluid model, and show its performance improvement with simulations.
Afilliation | Communication Systems |
Project(s) | No Simula project |
Publication Type | Proceedings, refereed |
Year of Publication | 2016 |
Conference Name | The 41st IEEE Conference on Local Computer Networks (LCN) |
Pagination | 10--18 |
Date Published | 11/2016 |
Publisher | IEEE |
ISBN Number | 978-1-5090-2054-6 |
Notes | Dubai, UAE. November 7-10. |
DOI | 10.1109/LCN.2016.12 |
Research Notes | Open access on IEEE Xplore |
Feedback in Recursive Congestion Control
In Computer Performance Engineering: 13th European Workshop on Performance Engineering, EPEW 2016, Proceedings. Lecture Notes in Computer Science ed. Vol. 9951. Cham: Springer International Publishing, 2016.Status: Published
Feedback in Recursive Congestion Control
In recursive network architectures such as RINA or RNA, it is natural for multiple layers to carry out congestion control. These layers can be stacked in arbitrary ways and provide more ways to use feedback than before (which of the many controllers along an end-to-end path should be notified?). This in turn raises concerns regarding stability and performance of such a system of interacting congestion control mechanisms. In this paper, we report on a first analysis of feedback methods in recursive networks that we carried out using a fluid model with a packet queue approximation. We find that the strict pushback feedback based on queue size can have stability issues, but robust control can be achieved when each congestion controller receives feedback from all sources of congestion within and below its layer.
Afilliation | Communication Systems, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2016 |
Conference Name | Computer Performance Engineering: 13th European Workshop on Performance Engineering, EPEW 2016, Proceedings |
Volume | 9951 |
Edition | Lecture Notes in Computer Science |
Pagination | 109--125 |
Date Published | 09/2016 |
Publisher | Springer International Publishing |
Place Published | Cham |
ISBN Number | 978-3-319-46433-6 |
Notes | Chios, Greece, October 5-7 |
URL | http://dx.doi.org/10.1007/978-3-319-46433-6_8 |
DOI | 10.1007/978-3-319-46433-6_8 |
Managing real-time media flows through a flow state exchange
In NOMS 2016 IEEE/IFIP Network Operations and Management Symposium, 2016.Status: Published
Managing real-time media flows through a flow state exchange
When multiple congestion controlled flows traverse the same network path, their resulting rate is usually an outcome of their competition at the bottleneck. The WebRTC / RTCWeb suite of standards for inter-browser communication is required to allow prioritization. This is addressed by our previously presented mechanism for coupled congestion control, called the Flow State Exchange (FSE). Here, we present our first simulation results using two mechanisms that have been proposed for IETF standardization: Google Congestion Control (GCC) and Network-Assisted Dynamic Adaptation (NADA). These two mechanisms exhibit aspects that allow us to use a simpler “passive” algorithm in our FSE. Passive coupling allows a less time-constrained request-response style of signaling between congestion control mechanisms and the FSE, which enables the FSE to run as a stand-alone management tool.
Afilliation | Communication Systems |
Project(s) | RITE: Reducing Internet Transport Latency |
Publication Type | Proceedings, refereed |
Year of Publication | 2016 |
Conference Name | NOMS 2016 IEEE/IFIP Network Operations and Management Symposium |
Pagination | 112--120 |
Date Published | 04/2016 |
DOI | 10.1109/NOMS.2016.7502803 |
Revisiting Congestion Control for Multipath TCP with Shared Bottleneck Detection
In IEEE International Conference on Computer Communications (INFOCOM). San Francisco, California/U.S.A.: IEEE, 2016.Status: Published
Revisiting Congestion Control for Multipath TCP with Shared Bottleneck Detection
Multipath TCP (MPTCP) enables the simultaneous usage of multiple links for bandwidth aggregation, better resource utilization and improved reliability. Its coupled congestion control intends to reap the increased bandwidth of multiple links, while avoiding to be more aggressive than regular TCP flows on every used link. We argue that this leads to a very conservative behavior when paths do not share a bottleneck. Therefore, in this paper, we first quantify the penalty of the coupled congestion control for the links that do not share a bottleneck. Then, in order to overcome this penalty, we design and implement a practical shared bottleneck detection (SBD) algorithm for MPTCP, namely MPTCP-SBD. Through extensive emulations, we show that MPTCP-SBD outperforms all currently deployed MPTCP coupled congestion controls by accurately detecting bottlenecks resulting in throughput gains of up to 30\% in the absence of shared bottlenecks while remaining fair to TCP in shared bottlenecks scenarios. We complement the emulation results with real-network experiments justifying it is safeness for deployment.
Afilliation | Communication Systems |
Project(s) | The Center for Resilient Networks and Applications |
Publication Type | Proceedings, refereed |
Year of Publication | 2016 |
Conference Name | IEEE International Conference on Computer Communications (INFOCOM) |
Pagination | 2419-2427 |
Date Published | 04/2016 |
Publisher | IEEE |
Place Published | San Francisco, California/U.S.A. |
ISBN Number | 978-1-4673-9953-1 |
Keywords | congestion control, coupled congestion control, Multi-Path TCP (MPTCP), shared bottleneck detection |
DOI | 10.1109/INFOCOM.2016.7524599 |
Proceedings, refereed
Internet Latency: Causes, Solutions and Trade-offs
In EuCNC Special session on latency, 2015.Status: Published
Internet Latency: Causes, Solutions and Trade-offs
This paper is a digest of [1], an extensive survey
discussing the merits of over 300 techniques for reducing Internet
latency. It gives a broad overview of the causes, solutions, and
trade-offs involved in reducing latency in the Internet. The
overview covers key sources of delays and proposed solutions:
due to the structural arrangement of the network, how network
end-points interact, along the end-to-end path, related to link
capacities, within end-hosts, and those that address multiple
sources. Trade-offs are discussed in terms of the latency reduction
different techniques provide versus their deployability
Afilliation | Communication Systems, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2015 |
Conference Name | EuCNC Special session on latency |
Date Published | 05/2015 |
URL | https://riteproject.files.wordpress.com/2015/12/p548-hayes.pdf |
Proceedings, refereed
Practical Passive Shared Bottleneck Detection Using Shape Summary Statistics
In 39th Annual IEEE Conference on Local Computer Networks. IEEE, 2014.Status: Published
Practical Passive Shared Bottleneck Detection Using Shape Summary Statistics
Afilliation | Communication Systems |
Project(s) | RITE: Reducing Internet Transport Latency |
Publication Type | Proceedings, refereed |
Year of Publication | 2014 |
Conference Name | 39th Annual IEEE Conference on Local Computer Networks |
Pagination | 150--158 |
Publisher | IEEE |
Keywords | Conference |
DOI | 10.1109/LCN.2014.6925767 |
Research Notes | Open access on IEEE Xplore |
Journal Article
Reducing Internet Latency: A Survey of Techniques and their Merits
IEEE Communications Surveys and Tutorials 18, no. 3 (2014): 2149-2196.Status: Published
Reducing Internet Latency: A Survey of Techniques and their Merits
Latency is increasingly becoming a performance bottleneck for Internet Protocol (IP) networks, but historically networks have been designed with aims of maximizing throughput and utilization. This article offers a broad survey of techniques aimed at tackling latency in the literature up to August 2014, and their merits. A goal of this work is to be able to quantify and compare the merits of the different Internet latency reducing techniques, contrasting their gains in delay reduction versus the pain required to implement and deploy them. We found that classifying techniques according to the sources of delay they alleviate provided the best insight into the following issues: 1) the structural arrangement of a network, such as placement of servers and suboptimal routes, can contribute significantly to latency; 2) each interaction between communicating endpoints adds a Round Trip Time (RTT) to latency, especially significant for short flows; 3) in addition to base propagation delay, several sources of delay accumulate along transmission paths, today intermittently dominated by queuing delays; 4) it takes time to sense and use available capacity, with overuse inflicting latency on other flows sharing the capacity; and 5) within end systems delay sources include operating system buffering, head-of-line blocking, and hardware interaction. No single source of delay dominates in all cases, and many of these sources are spasmodic and highly variable. Solutions addressing these sources often both reduce the overall latency and make it more predictable.
Afilliation | Communication Systems, Communication Systems |
Project(s) | RITE: Reducing Internet Transport Latency |
Publication Type | Journal Article |
Year of Publication | 2014 |
Journal | IEEE Communications Surveys and Tutorials |
Volume | 18 |
Issue | 3 |
Pagination | 2149–2196 |
Date Published | 10/2016 |
Publisher | IEEE Communications Society |
ISSN | 1553-877X |
Other Numbers | ISSN: 1553-877X |
Keywords | Internet, latency, network |
URL | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6... |
DOI | 10.1109/COMST.2014.2375213 |
Talks, invited
Shared Bottleneck Detection Evaluation With NorNet
In Proceedings of the 2nd International NorNet Users Workshop (NNUW-2), 2014.Status: Published
Shared Bottleneck Detection Evaluation With NorNet
Afilliation | , Communication Systems |
Publication Type | Talks, invited |
Year of Publication | 2014 |
Location of Talk | Proceedings of the 2nd International NorNet Users Workshop (NNUW-2) |
Proceedings, refereed
Multimedia-Unfriendly TCP Congestion Control and Home Gateway Queue Management
In MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems. New York: ACM, 2011.Status: Published
Multimedia-Unfriendly TCP Congestion Control and Home Gateway Queue Management
Consumer broadband services are increasingly a mix of TCP-based and UDP-based applications, often with quite distinct requirements for interactivity and network performance. Consumers can experience degraded service when application traffic collides at a congestion point between home LANs, service provider edge networks and fractional-Mbit/sec {`}broadband' links. We illustrate two key issues that arise from the impact of TCP-based data transfers on real-time traffic (such as VoIP or online games) sharing a broadband link. First, well-intentioned modifications to traditional TCP congestion control can noticeably increase the latencies experienced by VoIP or online games. Second, superficially-similar packet dropping rules in broadband gateways can induce distinctly different packet loss rates in VoIP and online game traffic. Our observations provide cautionary guidance to researchers who model such traffic mixes, and to vendors implementing equipment at either end of consumer links.
Afilliation | Communication Systems, Communication Systems |
Publication Type | Proceedings, refereed |
Year of Publication | 2011 |
Conference Name | MMSys '11 Proceedings of the second annual ACM conference on Multimedia systems |
Pagination | 35-44 |
Date Published | February |
Publisher | ACM |
Place Published | New York |
ISBN Number | 978-1-4503-0518-1 |