Go there. This is where I really have everything.
Tags:
Network,
Internet,
transport layer
Publications
-
-
Teymoori, Peyman; Welzl, Michael & Hayes, David Andrew
(2023).
LGCC: A Novel High-Throughput and Low Delay Paradigm Shift in Multi-Hop Congestion Control.
IEEE/ACM Transactions on Networking.
ISSN 1063-6692.
32(1),
p. 761–776.
doi:
10.1109/TNET.2023.3301291.
Full text in Research Archive
Show summary
Technological advancements have provided wireless links with very high data rate capacity for 5G/6G mobile networks and WiFi 6, which will be widely deployed by 2025. However, the capacity can have substantial fluctuations, violating the assumption at the transport layer that the capacity is (almost) steady. In this paper, we present a general and efficient, yet deployable solution to this problem through a novel design empowered with a rich theory, allowing a significantly improved experience in using new technologies, especially mobile cellular services. We employ the well-known theory of food-chain models in biology, where a bottleneck link can be modeled as prey, while flows are predators. We extend this model to a chain of predators and preys to form a multi-hop congestion controller, called LGCC. Through simulation evaluation with real-life 5G traces we show the effectiveness of LGCC, compared with the state-of-the-art ABC (Accel-Brake Control). Our results show an order of magnitude bottleneck queuing delay decrease, with only a small decrease in throughput because LGCC tries to never exceed link capacities. LGCC’s design can additionally open a new paradigm in stable multi-hop congestion control and flow aggregation.
-
Ciko, Kristjon; Welzl, Michael & Teymoori, Peyman
(2023).
Going Dark: A Software "Light Switch" for Internet Servers.
IEEE Workshop on Local and Metropolitan Area Networks.
ISSN 1944-0367.
doi:
10.1109/LANMAN58293.2023.10189419.
Full text in Research Archive
Show summary
To fight global warming, carbon emissions must urgently be reduced. In this paper, we look at opportunities to do so by diminishing the operational energy usage of an important always-on element of the Internet: server systems. Our measurements from a server host indicate that there is probably not much to be gained by making a significant software change - but, depending on the system, a simple, easily overlooked configuration update may make a difference at no performance cost. This difference is small per server (in the order of an LED light bulb). Given the multitude of permanently operational servers in the world, it may however be significant at scale.
-
-
Islam, Safiqul; Hiorth, Kristian Andreas; Griwodz, Carsten & Welzl, Michael
(2022).
Is it really necessary to go beyond a fairness metric for next-generation congestion control?
ANRW '22: Proceedings of the Workshop on Applied Networking Research.
Association for Computing Machinery (ACM).
ISSN 978-1-4503-9444-4.
p. 1–7.
doi:
10.1145/3547115.3547192.
Show summary
A recent article suggests that the potential for deployment of
congestion control mechanisms in the future Internet should
be evaluated using a new concept called “harm” instead of
measuring “fairness”. While there are good arguments in
favor of this new approach, its practical benefits have not
yet been experimentally evaluated, and calculating harm
requires producing more experimental data. We apply the
harm concept to data produced in real-life experiments with
competing pairs of various TCP variants: Cubic vs. Reno,
BBR vs. Cubic, and Reno vs. Vegas. These experiments cover
various levels of “aggression” as well as different feedback
types that the controls are based upon. We present a new
linear representation of relative harm between scenarios,
which can help us to assess the differences in harm between
a variety of situations. Among other results, we can see that
BBR is on average 1.6 times more harmful to Cubic in high-
BDP situations (when Cubic is most aggressive) than Cubic
is to Reno.
-
-
Ciko, Kristjon; Teymoori, Peyman & Welzl, Michael
(2022).
LGC-ShQ: Datacenter Congestion Control with Queueless Load-Based ECN Marking.
Computer communication review.
ISSN 0146-4833.
52(4),
p. 2–11.
doi:
10.1145/3577929.3577931.
Show summary
We present LGC-ShQ, a new ECN-based congestion control mechanism for datacenters. LGC-ShQ relies on ECN feedback from a Shadow Queue, and it uses ECN not only to decrease the rate, but it also increases the rate in relation to this signal. Real-life tests in a Linux testbed show that LGC-ShQ keeps the real queue at low levels while achieving good link utilization and fairness.
-
Welzl, Michael; Teymoori, Peyman; Islam, Md Safiqul; Hutchison, David & Gjessing, Stein
(2022).
Future Internet Congestion Control: The Diminishing Feedback Problem.
IEEE Communications Magazine.
ISSN 0163-6804.
60(9),
p. 87–92.
doi:
10.1109/MCOM.006.2200008.
Show summary
It is increasingly difficult for Internet congestion control mechanisms to obtain the feedback that they need. This lack of feedback can have severe performance implications, and it is bound to become worse. In the long run, the problem may only be fixable by fundamentally changing the way congestion control is done in the Internet. We substantiate this claim by looking at the evolution of the Internet's infrastructure over the past 30 years, and by examining the most common behavior of Internet traffic. Considering the goals that congestion control mechanisms are intended to address, and taking into account contextual developments in the Internet ecosystem, we arrive at conclusions and recommendations about possible future congestion control design directions. In particular, we argue that congestion control mechanisms should move away from their strict “end-to-end” adherence. This change would benefit from avoiding a “one size fits all circumstances” approach, and moving toward a more selective set of mechanisms that will result in a better performing Internet. We also discuss how this future vision differs from today's use of performance enhancing proxies.
-
Islam, Md Safiqul; Welzl, Michael & Fladby, Tobias
(2022).
Real-Life Implementation and Evaluation of Coupled Congestion Control for WebRTC Media and Data Flows.
IEEE Access.
ISSN 2169-3536.
10,
p. 95046–95066.
doi:
10.1109/ACCESS.2022.3206041.
Show summary
WebRTC enables users to simultaneously transfer media (over the Real-Time Transport Protocol (RTP)) and data (over the Stream Control Transmission Protocol (SCTP)) between web browsers, multiplexed onto a single UDP port pair. This design choice of using two different transport protocols, each with their own congestion control mechanism, can lead to competition between the flows, resulting in undesirable spikes in queuing delay and packet loss. In this paper, we investigate solutions to the harmful effects WebRTC flows cause on each other by having the different congestion controllers of the flows collaborate. Using implementations in the Chromium browser, we show that our mechanism can combine a set of heterogeneous congestion control mechanisms, fairly allocate the available bandwidth between the flows, and reduce overall delay and losses.
-
-
-
-
Barik, Runa; Welzl, Michael; Fairhurst, Gorry; Elmokashfi, Ahmed; Dreibholz, Thomas & Gjessing, Stein
(2020).
On the Usability of Transport Protocols other than TCP: A Home Gateway and Internet Path Traversal Study.
Computer Networks.
ISSN 1389-1286.
173.
doi:
10.1016/j.comnet.2020.107211.
Full text in Research Archive
-
-
-
Barik, Runa; Welzl, Michael; Teymoori, Peyman; Islam, Safiqul & Gjessing, Stein
(2020).
Performance Evaluation of In-network Packet Retransmissions using Markov Chains,
2020 International Conference on Computing, Networking and Communications (ICNC)
.
IEEE conference proceedings.
ISSN 978-1-7281-4905-9.
Full text in Research Archive
-
-
-
Islam, Safiqul; Welzl, Michael & Gjessing, Stein
(2019).
How to Control a TCP: Minimally-Invasive Congestion Management for Datacenters.
In Ansari, Nirwan & Wang, Honggang (Ed.),
Proceedings of the 2019 International Conference on Computing, Networking and Communications (ICNC): Green Computing, Networking, and Communications.
IEEE Sarnoff Symposium.
ISSN 978-1-5386-9223-3.
p. 121–125.
doi:
10.1109/ICCNC.2019.8685516.
Full text in Research Archive
-
Welzl, Michael; Islam, Safiqul; Barik, Runa; Gjessing, Stein & Elmokashfi, Ahmed Mustafa Abdalla
(2019).
Investigating the Delay Impact of the DiffServ Code Point (DSCP).
In Ansari, Nirwan & Wang, Honggang (Ed.),
Proceedings of the 2019 International Conference on Computing, Networking and Communications (ICNC): Green Computing, Networking, and Communications.
IEEE Sarnoff Symposium.
ISSN 978-1-5386-9223-3.
p. 612–616.
doi:
10.1109/ICCNC.2019.8685538.
Full text in Research Archive
-
Ciko, Kristjon & Welzl, Michael
(2019).
First Contact: Can Switching to RINA save the Internet?
In Galis, Alex; Guillemin, Fabrice; Noldus, Rogier; Secci, Stefano; Filip, Idzikowski & Sayit, Müge Fesci (Ed.),
22nd Conference on Innovation in Clouds, Internet and Networks and Workshops, ICIN 2019.
IEEE (Institute of Electrical and Electronics Engineers).
ISSN 978-1-5386-8336-1.
p. 37–42.
doi:
10.1109/ICIN.2019.8685912.
-
Hiorth, Kristian Andreas & Welzl, Michael
(2019).
Design Considerations for RINA Congestion Control over WiFi Links.
In Galis, Alex; Guillemin, Fabrice; Noldus, Rogier; Secci, Stefano; Idzikowski, Filip & Sayit, Müge Fesci (Ed.),
2019 22nd Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN).
IEEE (Institute of Electrical and Electronics Engineers).
ISSN 978-1-5386-8336-1.
p. 54–59.
doi:
10.1109/ICIN.2019.8685874.
-
Barik, Runa; Welzl, Michael; Elmokashfi, Ahmed; Dreibholz, Thomas; Islam, Safiqul & Gjessing, Stein
(2019).
On the Utility of Unregulated IP DiffServ Code Point (DSCP) Usage by End Systems.
Performance evaluation (Print).
ISSN 0166-5316.
135.
doi:
10.1016/j.peva.2019.102036.
Full text in Research Archive
-
-
Ijaz, Humaira; Jameel, Bushra & Welzl, Michael
(2019).
A survey and comparison on overlay‐underlay mapping techniques in peer‐to‐peer overlay networks.
International Journal of Communication Systems.
ISSN 1074-5351.
32(3),
p. 1–26.
doi:
10.1002/dac.3872.
Full text in Research Archive
-
-
Barik, Runa; Welzl, Michael; Elmokashfi, Ahmed Mustafa Abdalla; Dreibholz, Thomas & Gjessing, Stein
(2018).
Can WebRTC QoS Work? A DSCP Measurement Study.
In Reichl, Peter; Hossfeld, Tobias; Guiseppe, Bianchi; Zinner, Tobias & Altman, Eitan (Ed.),
ITC 30 - Teletraffic in a Smart World.
IEEE Press.
ISSN 978-0-9883045-5-0.
p. 167–175.
doi:
https:/doi.org/10.1109/ITC30.2018.00034.
-
Bianchi, Giuseppe; Welzl, Michael; Tulumello, Angelo; Belocchi, Belocci; Faltelli, Marco & Pontarelli, Salvatore
(2018).
A fully portable TCP implementation using XFSMs,
Proceedings of ACM SIGCOMM 2018 Conference on Posters and Demos.
Association for Computing Machinery (ACM).
ISSN 978-1-4503-5915-3.
p. 99–101.
doi:
10.1145/3234200.3234237.
-
-
Islam, Safiqul; Welzl, Michael; Hiorth, Kristian Andreas; Hayes, David; Armitage, Grenville & Gjessing, Stein
(2018).
ctrlTCP: Reducing latency through coupled, heterogeneous multi-flow TCP congestion control,
IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).
IEEE Sarnoff Symposium.
ISSN 978-1-5386-5979-3.
p. 214–219.
doi:
10.1109/INFCOMW.2018.8406887.
Full text in Research Archive
-
Marek, Marcel; Teymoori, Peyman; Welzl, Michael & Gjessing, Stein
(2018).
Computer-Aided Reproducibility.
In IEEE, . (Eds.),
Proceedings of International Conference on Computing, Networking and Communications (ICNC 2018).
IEEE conference proceedings.
ISSN 1111111111.
p. 127–133.
doi:
10.1109/ICCNC.2018.8390274.
Full text in Research Archive
-
-
Barik, Runa; Divakaran, Dinil Mon & Welzl, Michael
(2017).
Characterizing the Effects of TCP's Initial Window.
In Vuran, Mehmet Can & Xie, Linda Jiang (Ed.),
2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
.
IEEE Sarnoff Symposium.
ISSN 978-1-5386-2784-6.
p. 886–891.
doi:
https:/doi.org/10.1109/INFCOMW.2017.8116493.
-
Khademi, Naeem; Welzl, Michael; Armitage, Grenville; Ros, David; Zander, Sebastian & Fairhurst, Gorry
(2017).
Alternative Backoff: Achieving Low Latency and High Throughput with ECN and AQM,
16th International IFIP TC6 Networking Conference, Networking 2017.
IFIP Open Digital Library.
ISSN 978-3-901882-94-4.
doi:
10.23919/ifipnetworking.2017.8264863.
Show summary
A number of recently proposed Active Queue Management (AQM) mechanisms instantiate shallow buffers with burst tolerance to minimise the time that packets spend enqueued at a bottleneck. However, shallow buffering causes noticeable TCP performance degradation as a path’s underlying round trip time (RTT) heads above typical intra-country levels. Using less-aggressive multiplicative backoffs in TCP can compensate for shallow bottleneck buffering. AQM mechanisms may either drop packets or mark them using Explicit Congestion Notification (ECN), depending on whether the sender marked packets as ECN-capable. While a drop may therefore stem from any type of queue, an ECN-mark indicates that an AQM mechanism has done its job, and therefore the queue is likely to be shallow. We propose ABE: "Alternative Backoff with ECN", which consists of enabling ECN and letting individual TCP senders back off less aggressively in reaction to ECN-marks from AQM-enabled bottlenecks. Using controlled testbed experiments with standard NewReno and CUBIC flows, we show significant performance gains in lightly-multiplexed scenarios, without losing the delay-reduction benefits of deploying AQM. ABE is a sender-side-only modification that can be deployed across networks incrementally (requiring no flag-day) and offers a compelling reason to deploy and enable ECN across the Internet.
-
-
Papastergiou, Giorgos; Fairhurst, Gorry; Ros, David; Brunstrom, Anna; Grinnemo, Karl-Johan & Hurtig, Per
[Show all 11 contributors for this article]
(2017).
De-Ossifying the Internet Transport Layer: A Survey and Future Perspectives.
IEEE Communications Surveys and Tutorials.
ISSN 1553-877X.
19(1),
p. 619–639.
doi:
10.1109/COMST.2016.2626780.
Full text in Research Archive
Show summary
It is widely recognized that the Internet transport layer has become ossified, where further evolution has become hard or even impossible. This is a direct consequence of the ubiquitous deployment of middleboxes that hamper the deployment of new transports, aggravated further by the limited flexibility of the application programming interface (API) typically presented to applications. To tackle this problem, a wide range of solutions have been proposed in the literature, each aiming to address a particular aspect. Yet, no single proposal has emerged that is able to enable evolution of the transport layer. In this paper, after an overview of the main issues and reasons for transport-layer ossification, we survey proposed solutions and discuss their potential and limitations. The survey is divided into five parts, each covering a set of point solutions for a different facet of the problem space: (1) designing middlebox-proof transports; (2) signaling for facilitating middlebox traversal; (3) enhancing the API between the applications and the transport layer; (4) discovering and exploiting end-to-end capabilities; and (5) enabling user-space protocol stacks. Based on this analysis, we then identify further development needs toward an overall solution. We argue that the development of a comprehensive transport layer framework, able to facilitate the integration and cooperation of specialized solutions in an application-independent and flexible way, is a necessary step toward making the Internet transport architecture truly evolvable. To this end, we identify the requirements for such a framework and provide insights for its development.
-
-
Barik, Runa; Welzl, Michael; Ferlin, Simone & Alay, Ozgu
(2016).
LISA: A linked slow-start algorithm for MPTCP.
In Bregni, Stefano & Fonseca, Nelson (Ed.),
IEEE International Conference on Communications (ICC 2016).
IEEE Sarnoff Symposium.
ISSN 978-1-4799-6664-6.
doi:
10.1109/ICC.2016.7510786.
-
-
Islam, Safiqul & Welzl, Michael
(2016).
Start Me Up: Determining and Sharing TCP's Initial Congestion Window,
Proceedings of the 2016 Applied Networking Research Workshop.
Association for Computing Machinery (ACM).
ISSN 978-1-4503-4443-2.
p. 52–54.
doi:
10.1145/2959424.2959440.
Full text in Research Archive
Show summary
When multiple TCP connections are used between the same host pair, they often share a common bottleneck – especially when they are encapsulated together, e.g. in VPN scenarios. Then, all connections after the first should not have to guess the right initial value for the congestion window, but rather get the appropriate value from other connections. This allows short flows to complete much faster – but it can also lead to large bursts that cause problems on their own. Prior work used timer-based pacing methods to alleviate this problem; we introduce a new algorithm that “paces” packets by instead correctly maintaining the ACK clock, and show its positive impact in combination with a previously presented congestion coupling algorithm.
-
Islam, Safiqul; Welzl, Michael; Hayes, David Andrew & Gjessing, Stein
(2016).
Managing Real-Time Media Flows through a Flow State Exchange.
In Badonnel, Semma (Eds.),
Proceedings of NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium.
IEEE conference proceedings.
ISSN 978-1-5090-0223-8.
p. 112–120.
doi:
10.1109/NOMS.2016.7502803.
-
-
Teymoori, Peyman; Hayes, David Andrew; Welzl, Michael & Gjessing, Stein
(2016).
Even Lower Latency, Even Better Fairness: Logistic Growth Congestion Control in Datacenter.
In Kanhere, Salil & Mnaouer, Adel Ben (Ed.),
Proceedings 2016 IEEE 41st Conference on Local Computer Networks (LCN) 2016.
IEEE (Institute of Electrical and Electronics Engineers).
ISSN 978-1-5090-2054-6.
p. 10–18.
doi:
10.1109/LCN.2016.12.
-
Welzl, Michael; Gjessing, Stein & Jahre, Håkon Botnmark
(2016).
Fighting fire with fire: Eliminating standing queues with large UDP packet floods.
In Yang, Liuqing (Eds.),
Proceedings of International Conference on Computing, Networking and Communications (ICNC), 2016.
IEEE conference proceedings.
ISSN 978-1-4673-8579-4.
p. 656–660.
doi:
10.1109/ICCNC.2016.7440667.
-
-
-
-
-
Islam, Safiqul; Welzl, Michael; Gjessing, Stein & Khademi, Naeem
(2015).
Coupled congestion control for RTP media.
Computer communication review.
ISSN 0146-4833.
44(4).
doi:
10.1145/2630088.2630089.
-
-
-
-
-
Yousaf, Muhammad & Welzl, Michael
(2014).
Network-Aware HEFT Scheduling for Grid.
Scientific World Journal.
ISSN 1537-744X.
2014.
doi:
10.1155/2014/317284.
-
Yousaf, Muhammad Murtaza & Welzl, Michael
(2013).
On the Accurate Identification of Network Paths Having a Common Bottleneck.
Scientific World Journal.
ISSN 1537-744X.
doi:
10.1155/2013/890578.
-
-
-
-
-
Khademi, Naeem; Welzl, Michael & Gjessing, Stein
(2012).
Experimental evaluation of TCP performance in multi-rate 802.11 WLANs.
In Banchs, Albert & Prabhakaran, Balakrishnan (Ed.),
2012 IEEE international symposium on a world of wireless, mobile, and multimedia networks, WoWMoM.
IEEE conference proceedings.
ISSN 978-1-4673-1238-7.
p. 1–9.
doi:
10.1109/wowmom.2012.6263696.
Show summary
The goal of Rate Adaptation (RA) mechanisms in 802.11 WLANs is to provide optimum system throughput under varying channel conditions (e.g. in presence of noise) by carrying out run-time prediction and selection of the most appropriate bit-rate. The cross-layer interaction of TCP, as the major transport protocol in the Internet, with different RA mechanisms and DCF is yet to be thoroughly investigated. Previously reported efforts A) have never included real-life measurements of uplink TCP traffic; B) lack a practical view because they do not consider the RA mechanisms commonly deployed in today's off-the-shelf 802.11 devices; C) miss the study of RA mechanisms in low-noise environments. This paper covers all the above shortages, by conducting real-life measurements in two different test-beds (NDlab and Emulab) alongside with simulations, to study the performance of TCP coupled with different commonly deployed RA mechanisms. Our measurements reveal that 1) most conventional RA mechanisms are unable to distinguish frame errors due to collisions from channel noise/interference, and will respond to them negatively to some extent; 2) different than downlink TCP, uplink TCP can be adversely affected by collision-triggered rate downshifts that some RA schemes exhibit even under perfect channel conditions or in low-noise environments; 3) the relatively recent Minstrel RA mechanism can counter this negative uplink behavior well, yielding almost equal performance as in the downlink case.
-
Munir, Kashif; Lo Cigno, Renato; Primet Vicat-Blanc, Pascale & Welzl, Michael
(2012).
Planning Data Transfers in Grids: A Multi-Service Queueing Approach.
Concurrency and Computation.
ISSN 1532-0626.
24(4),
p. 407–422.
doi:
10.1002/cpe.1742.
-
Schier, Michael & Welzl, Michael
(2012).
Optimizing Selective ARQ for H. 264 Live Streaming: A Novel Method for Predicting Loss-Impact in Real Time.
IEEE transactions on multimedia.
ISSN 1520-9210.
14(2),
p. 415–430.
doi:
10.1109/TMM.2011.2178235.
-
-
Welzl, Michael; Abfalterer, Armin & Gjessing, Stein
(2011).
XCP vs. CUBIC with Quick-Start: Observations on Implicit vs. Explicit Feedback for Congestion Control.
IEEE International Conference on Communications.
ISSN 1550-3607.
doi:
10.1109/icc.2011.5963377.
-
-
-
-
-
-
-
-
-
-
-
-
-
Schier, Michael & Welzl, Michael
(2010).
Content-Aware Selective Reliability for DCCP Video Streaming.
In Falah, Abdul Aziz (Eds.),
Multimedia Computing and Information Technology (MCIT), 2010 International Conference On.
IEEE Sarnoff Symposium.
ISSN 978-1-4244-7003-7.
p. 53–56.
View all works in Cristin
-
Welzl, Michael; Oepen, Stephan; Cezary Jaskula, Cezary; Griwodz, Carsten & Islam, Safiqul
(2021).
Collaboration in the IETF: an initial analysis of two decades in email discussions.
Computer communication review.
ISSN 0146-4833.
51(3),
p. 29–32.
doi:
10.1145/3477482.3477488.
Show summary
RFC 9000, published in May 2021, marks an important milestone for the Internet's standardization body, the Internet Engineering Task Force (IETF): finally, the specification of the QUIC protocol is available. QUIC is the result of a five-year effort - and it is also the second of two major protocols (the first being SPDY, which later became HTTP/2) that Google LLC first deployed, and then brought to the IETF for standardization. This begs the question: when big players follow such a "shoot first, discuss later" approach, is IETF collaboration still "real", or is the IETF now being (mis-)used to approve protocols for standardization when they are already practically established, without really actively involving anyone but the main proponents?
-
Khademi, Naeem; Welzl, Michael; Armitage, Grenville & Gjessing, Stein
(2016).
Improving the Fairness of Alternative Backoff with ECN (ABE).
Show summary
Abstract:
Explicit Congestion Notification (ECN) lets a bottleneck's Active Queue Management (AQM) mechanism inform an endpoint about congestion without having to drop a packet. A recently proposed sender-side modification called Alternative Backoff with ECN (ABE) enables reduced latency while maintaining good utilization with ECN. However, under certain circumstances ABE can produce a degree of unfair behavior between ABE-enabled TCP senders and conventional TCP senders. We propose specific guidance for configuring bottleneck AQMs to assist in fairness between ABE-enabled and conventional TCP flows. We evaluate our proposal using RED, then describe how it can be applied to other AQM mechanisms and incrementally introduced into the Internet.
-
Islam, Safiqul; Welzl, Michael & Gjessing, Stein
(2013).
One Control to Rule Them All - Coupled Congestion Control for RTP Media.
-
Ciko, Kristjon; Welzl, Michael & Teymoori, Peyman
(2022).
Improving Internet Performance with a "Clean-Slate" Network Architecture - The Case of RINA.
Universitetet i Oslo.
ISSN 1501-7710.
Full text in Research Archive
Show summary
Today’s Internet is facing significant challenges as the number of the connected devices, applications, and the amount of traffic grow tremendously. The challenges are particularly related to the insufficient security and performance, complexity in providing mobility and multihoming, and the inability to easily accommodate new protocols and technologies.
Over the last two decades, there has been considerable effort by the networking research community to evolve or redesign the Internet architecture. Unlike evolutionary approaches, “clean-slate” designs follow a more drastic path to overcome the fundamental architecture limitations of the current Internet. However, such solutions are facing large deployment barriers, mainly because the Internet does not provide architectural modularity. Among the “clean-slate” initiatives, RINA—the Recursive InterNetwork Architecture—is perhaps the most drastic one which attempts to offer a general solution with a complete networking theory. In addition, the recursive nature of RINA introduces potential benefits in many aspects of networking such as management, routing, security, and congestion control.
This dissertation tackles the deployment challenges and investigates several strategies to deploy a new clean-slate architecture such as RINA in the current networks. These strategies are: (1) direct usage with a fall-back, (2) adapting the Application Programming Interface (API), and (3) a gateway to translate between protocols. Real-life experiments of the first congestion control approach that is suitable for a flexible recursive architecture show the performance improvement that can be attained with these strategies.
-
Ciko, Kristjon; Welzl, Michael & Teymoori, Peyman
(2021).
PEP-DNA: a Performance Enhancing Proxy for Deploying Network Architectures.
Universitetet i Oslo.
ISSN 978-82-7368-600-8.
Full text in Research Archive
Show summary
Deploying a new network architecture in the Internet requires changing some, but not necessarily all elements between communicating applications. One way to achieve gradual deployment is a proxy or gateway which “translates” between the new architecture and TCP/IP. We present such a proxy, called “Performance Enhancing Proxy for Deploying Network Architectures (PEP-DNA)”, which allows TCP/IP applications to benefit from advanced features of a new network architecture without having to be redeveloped. Our proxy is a kernel-based Linux implementation which can be installed wherever a translation needs to occur between a new architecture and TCP/IP domains. We discuss the proxy operation in detail and evaluate its efficiency and performance in a local testbed, demonstrating that it achieves high throughput with low additional latency and low CPU and memory overhead. In our experiments we use the Recursive InterNetwork Architecture (RINA) and Information- Centric Networking (ICN) as examples, but our proxy is modular and flexible, and hence enables realistic gradual deployment of any new “clean-slate” approaches.
-
Teymoori, Peyman & Welzl, Michael
(2020).
LGCC: Food Chain Multi-Hop Congestion Control.
University of Oslo.
ISSN 978-82-7368-459-2.
Full text in Research Archive
-
Teymoori, Peyman; Hayes, David Andrew; Welzl, Michael & Gjessing, Stein
(2019).
Estimating an Additive Path Cost with Explicit Congestion Notification.
Universitetet i Oslo.
ISSN 978-82-7368-452-3.
Full text in Research Archive
-
Li, Qian & Welzl, Michael
(2017).
Vulture – Variable Aggressiveness Ultra Low Impact Transport Using Receiver-based Flow-control Mechanism.
7Letras.
ISSN 978-82-7368-439-4.
Full text in Research Archive
-
Islam, Safiqul; Welzl, Michael; Gjessing, Stein & Khademi, Naeem
(2014).
Coupled Congestion Control for RTP Media.
University of Oslo.
ISSN 978-82-7368-405-9.
Full text in Research Archive
Show summary
Congestion occurs at a bottleneck along an Internet path; multiple
flows between the same sender and receiver pairs can benefit from using
only a single congestion control instance when they share the same bottleneck.
These benefits include the ability to control the rate allocation
between flows and reduced overall delay (multiple congestion control instances
cause more queuing delay than one since each has no knowledge of
the congestion episodes experienced by the others). We present a mechanism
for coupling congestion control for real-time media and show its
benefits by coupling multiple congestion controlled flows that share the
same bottleneck.
-
Khademi, Naeem; Ros, David & Welzl, Michael
(2013).
The New AQM Kids on the Block: Much Ado About Nothing?
Universitetet i Oslo.
ISSN 82-7368-399-0.
Full text in Research Archive
Show summary
Active Queue Management (AQM) design has again come into the
spotlight of network operators, vendors and OS developers. This reflects the growing concern and sensitivity about the end-to-end latency perceived by today’s Internet users. Indeed, delays on the order of seconds have become common due to the deployment of excessively-sized FIFO/DropTail buffers at the edge of many networks. CoDel and PIE are two AQM mechanisms that have recently been presented and discussed at
the IRTF and the IETF. However, to the best of our knowledge, they have not yet been thoroughly evaluated or compared against each other except by simulation. We set thus to perform an experimental evaluation using real-world implementations, in both wired and wireless testbeds. We
have in addition compared them with a decade-old variant of RED called Adaptive RED, which shares with CoDel and PIE the goal of “knob-free” operation. Surprisingly, in many instances results were much more favorable towards Adaptive RED. We do not call into question the need for new AQMs, however, there are lessons yet to be learned from old designs.
View all works in Cristin
Published
Nov. 4, 2010 2:25 PM
- Last modified
Jan. 15, 2024 11:12 AM