| 1. |
- Ahlgren, Bengt, et al.
(författare)
-
Are MIRCC and Rate-based Congestion Control in ICN READY for Variable Link Capacity?
- 2017
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Information-centric networking (ICN) has been introduced as a potential future networking architecture. ICN promises an architecture that makes information independent from lo- cation, application, storage, and transportation. Still, it is not without challenges. Notably, there are several outstanding issues regarding congestion control: Since ICN is more or less oblivious to the location of information, it opens up for a single application flow to have several sources, something which blurs the notion of transport flows, and makes it very difficult to employ traditional end-to-end congestion control schemes in these networks. Instead, ICN networks often make use of hop-by-hop congestion control schemes. How- ever, these schemes are also tainted with problems, e.g., several of the proposed ICN congestion controls assume fixed link capacities that are known beforehand. Since this seldom is the case, this paper evaluates the consequences in terms of latency, throughput, and link usage, variable link capacities have on a hop-by-hop congestion control scheme, such as the one employed by the Multipath-aware ICN Rate-based Congestion Control (MIRCC). The evaluation was carried out in the OMNeT++ simulator, and demonstrates how seemingly small variations in link capacity significantly deterio- rate both latency and throughput, and often result in inefficient network link usage.
|
|
| 2. |
- Ahlgren, Bengt, et al.
(författare)
-
ICN congestion control for wireless links
- 2018
-
Ingår i: IEEE WCNC 2018 Conference Proceedings. - New York : IEEE.
-
Konferensbidrag (refereegranskat)abstract
- Information-centric networking (ICN) with its design around named-based forwarding and in-network caching holds great promises to become a key architecture for the future Internet. Many proposed ICN hop-by-hop congestion control schemes assume a fixed and known link capacity, which rarely - if ever - holds true for wireless links. Firstly, we demonstrate that although these congestion control schemes are able to fairly well utilise the available wireless link capacity, they greatly fail to keep the delay low. In fact, they essentially offer the same delay as in the case with no hop-by-hop, only end-to-end, congestion control. Secondly, we show that by complementing these schemes with an easy-to-implement, packet-train capacity estimator, we reduce the delay to a level significantly lower than what is obtained with only end-to-end congestion control, while still being able to keep the link utilisation at a high level.
|
|
| 3. |
- Ahlgren, Bengt, et al.
(författare)
-
Latency-aware Multipath Scheduling inInformation-centric Networks
- 2019
-
Ingår i: Proceedings of the Fifteenth Swedish National Computer Networking Workshop (SNCNW), Luleå, Sweden. 4-5 June 2019..
-
Konferensbidrag (refereegranskat)abstract
- We present the latency-aware multipath schedulerZQTRTT that takes advantage of the multipath opportunities ininformation-centric networking. The goal of the scheduler is touse the (single) lowest latency path for transaction-oriented flows,and use multiple paths for bulk data flows. A new estimatorcalled zero queue time ratio is used for scheduling over multiplepaths. The objective is to distribute the flow over the paths sothat the zero queue time ratio is equal on the paths, that is,so that each path is ‘pushed’ equally hard by the flow withoutcreating unwanted queueing. We make an initial evaluation usingsimulation that shows that the scheduler meets our objectives.
|
|
| 4. |
- Alfredsson, Freysteinn, et al.
(författare)
-
XDQ : Enhancing XDP with Queuing and Packet Scheduling
- 2024
-
Ingår i: Proceedings of the 27th Conference on Innovation in Clouds, Internet and Networks, ICIN 2024. - : IEEE. - 9798350393774 - 9798350393767 ; , s. 52-56
-
Konferensbidrag (refereegranskat)abstract
- Modern internet users expect seamless, uninterrupted communication when using real-time applications, even when sharing the network connection with devices that produce heavy traffic. This trend has pushed the demand for more sophisticated packet schedulers on routers. However, given the limited resources on these routers, it is increasingly important to reduce the overhead associated with these schedulers. This paper presents XDP Queuing (XDQ), our ongoing work on achieving faster packet scheduling on the Linux operating system, which is popular on networking equipment. Linux provides eXpress Data Path (XDP), a high-performance programmable network data path using the eBPF framework, which allows code to process packets early from the driver. While XDP has found numerous uses in the industry, such as Denial-of-Service attack mitigation, load-balancers, and intrusion prevention systems, it currently has no mechanism for queueing or reordering packets and cannot implement traffic scheduling policies. Our contribution, XDQ, is a programmable packet scheduling extension for the XDP framework. XDQ uses recently proposed schemes for programmable queues. It allows writing packet schedulers using eBPF while benefiting from the XDP fast data path.
|
|
| 5. |
- Garcia, Johan, 1970-, et al.
(författare)
-
Deterministic network emulation using KauNetEm
- 2016
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- This paper presents KauNetEm, an extension to the Linux-based NetEm emulator that provides deterministic network emulation. KauNetEm enables precise and repeatable placement of NetEm emulation effects, a functionality that canconsiderably simplify several aspects of protocol evaluation. KauNetEm can be instructed to drop specific packets, apply a configurable delay or other emulation effects at predefinedpoints in time. The motivation for deterministic emulation, the overall design of KauNetEm, and usage examples are provided
|
|
| 6. |
- Garcia, Johan, 1970-, et al.
(författare)
-
Evaluating and Modeling 5G MPTCP Performance
- 2022
-
Ingår i: International Conference on Wireless and Mobile Computing, Networking and Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781665469753 ; , s. 406-411
-
Konferensbidrag (refereegranskat)abstract
- Multipath connectivity and aggregation of multiple communication links is actively being researched with the aim to achieve higher throughput and lower latency. In this work we perform an emulation-based evaluation of the relative goodput of MPTCP and TCP in a 5G usage context. A large range of path capacity and delay conditions is explored, for both the primary and secondary paths, with over 2000 different configurations evaluated. Evaluations are performed over eight combinations of MPTCP schedulers and congestion controls. The results show that MPTCP running over two links provide lower goodput than TCP over a single link for the majority of cases. Asymmetry in link conditions is in many cases a major complication for the MPTCP scheduler. To examine the predictability of poor performance, and to obtain further insight on the structure of this phenomena, we perform regression modeling of the relative good put. In addition to the traditional approaches of Linear Regression and Random Forest, we also employ Sym-bolic Regression to obtain mathematical expressions capable of providing insight on the path conditions most contributing to poor MPTCP performance. Such regression expressions can be informative when evaluating different schedulers or link aggregation approaches.
|
|
| 7. |
- Garcia, Johan, 1970-, et al.
(författare)
-
Getting What You Want When You Want It : Deterministic Network Emulation
- 2016
-
Konferensbidrag (refereegranskat)abstract
- This paper presents KauNetEm, an extension to the Linux-based NetEm emulator that provides deterministic network emulation. KauNetEm enables precise and repeatable placement of NetEm emulation effects, a functionality that can considerably simplify several aspects of protocol evaluation. KauNetEm can be instructed to drop specific packets, apply a configurable delay or other emulation effects at predefined points in time. The motivation for deterministic emulation, the overall design of KauNetEm, and usage examples are provided.
|
|
| 8. |
- Garcia, Johan, 1970-, et al.
(författare)
-
KauNet : Design and Usage
- 2008
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- KauNet is an emulation system that allows deterministic placement of packet losses and bit-errors as well as more precise control over bandwidth and delay changes. KauNet is an extension to the well-known Dummynet emulator in FreeBSD and allows the use of pattern and scenario files to increase control and repeatability. This report provides a comprehensive description of the usage of KauNet, as well as a technical description of the design and implementation of KauNet.
|
|
| 9. |
- Grinnemo, Karl-Johan, 1968-, et al.
(författare)
-
Deliverable D3.1 - Initial Report on the Extended Transport System
- 2017
-
Rapport (refereegranskat)abstract
- The NEAT System offers an enhanced API for applications that disentangles them from the actual transport protocol being used. The system also enables applications to communicate their service requirements to the transport system in a generic, transport-protocol independent way. Moreover, the architecture of the NEAT System promotes the evolution of new transport services. Work Package 3 (WP3) enhances and extends the core parts of the NEAT Transport. Efforts have been devoted to developing transport-protocol mechanisms that enable a wider spectrum of NEAT Transport Services, and that assist the NEAT System in facilitating several of the commercial use cases. Work has also started on the development of optimal transport-selection mechanisms; mechanisms that enable for the NEAT System to make optimal transport selections on the basis of application requirements and network measurements. Lastly, another research activity has been initiated on how to use SDN to signal application requirements to routers, switches, and similar network elements. This document provides an initial report on all these WP3 activities—both on completed and on near-termplanned work.
|
|
| 10. |
- Grinnemo, Karl-Johan, 1968-, et al.
(författare)
-
Deliverable D3.2 - Final Report on Transport Protocol Enhancements
- 2017
-
Rapport (refereegranskat)abstract
- This deliverable provides a final report on the work on transport protocol enhancements done inWork Package 3. First, we report on the extensions made to the SCTP protocol that turn it into a viable alternative to TCP and allow to deliver a lower-latency transport service. Next, we describe our work to develop a framework for providing a deadline-aware, less-than-best-effort transport service, targeting background traffic and thus addressing requirements on NEAT from the EMC use case. We also present our efforts to design and implement a latency-aware scheduler for MPTCP, which enables NEAT to offer a transport service that meets the needs of latency-sensitive applications, and that efficiently utilises available network resources. Lastly, this document informs on our work on coupled congestion control for TCP, a mechanism that treats a bundle of parallel TCP flows between the same pair of hosts as a single unit. By efficiently multiplexing concurrent TCP flows, our coupled congestion control alleviates the effects of queueing, and tends to result in a more efficient usage of available bandwidth, where the flows’ aggregate capacity share can be apportioned based on application preferences.
|
|
