2,136 research outputs found
ABC: A Simple Explicit Congestion Controller for Wireless Networks
We propose Accel-Brake Control (ABC), a simple and deployable explicit
congestion control protocol for network paths with time-varying wireless links.
ABC routers mark each packet with an "accelerate" or "brake", which causes
senders to slightly increase or decrease their congestion windows. Routers use
this feedback to quickly guide senders towards a desired target rate. ABC
requires no changes to header formats or user devices, but achieves better
performance than XCP. ABC is also incrementally deployable; it operates
correctly when the bottleneck is a non-ABC router, and can coexist with non-ABC
traffic sharing the same bottleneck link. We evaluate ABC using a Wi-Fi
implementation and trace-driven emulation of cellular links. ABC achieves
30-40% higher throughput than Cubic+Codel for similar delays, and 2.2X lower
delays than BBR on a Wi-Fi path. On cellular network paths, ABC achieves 50%
higher throughput than Cubic+Codel
Congestion Control using FEC for Conversational Multimedia Communication
In this paper, we propose a new rate control algorithm for conversational
multimedia flows. In our approach, along with Real-time Transport Protocol
(RTP) media packets, we propose sending redundant packets to probe for
available bandwidth. These redundant packets are Forward Error Correction (FEC)
encoded RTP packets. A straightforward interpretation is that if no losses
occur, the sender can increase the sending rate to include the FEC bit rate,
and in the case of losses due to congestion the redundant packets help in
recovering the lost packets. We also show that by varying the FEC bit rate, the
sender is able to conservatively or aggressively probe for available bandwidth.
We evaluate our FEC-based Rate Adaptation (FBRA) algorithm in a network
simulator and in the real-world and compare it to other congestion control
algorithms
The Road Ahead for Networking: A Survey on ICN-IP Coexistence Solutions
In recent years, the current Internet has experienced an unexpected paradigm
shift in the usage model, which has pushed researchers towards the design of
the Information-Centric Networking (ICN) paradigm as a possible replacement of
the existing architecture. Even though both Academia and Industry have
investigated the feasibility and effectiveness of ICN, achieving the complete
replacement of the Internet Protocol (IP) is a challenging task.
Some research groups have already addressed the coexistence by designing
their own architectures, but none of those is the final solution to move
towards the future Internet considering the unaltered state of the networking.
To design such architecture, the research community needs now a comprehensive
overview of the existing solutions that have so far addressed the coexistence.
The purpose of this paper is to reach this goal by providing the first
comprehensive survey and classification of the coexistence architectures
according to their features (i.e., deployment approach, deployment scenarios,
addressed coexistence requirements and architecture or technology used) and
evaluation parameters (i.e., challenges emerging during the deployment and the
runtime behaviour of an architecture). We believe that this paper will finally
fill the gap required for moving towards the design of the final coexistence
architecture.Comment: 23 pages, 16 figures, 3 table
iRED: A disaggregated P4-AQM fully implemented in programmable data plane hardware
Routers employ queues to temporarily hold packets when the scheduler cannot
immediately process them. Congestion occurs when the arrival rate of packets
exceeds the processing capacity, leading to increased queueing delay. Over
time, Active Queue Management (AQM) strategies have focused on directly
draining packets from queues to alleviate congestion and reduce queuing delay.
On Programmable Data Plane (PDP) hardware, AQMs traditionally reside in the
Egress pipeline due to the availability of queue delay information there. We
argue that this approach wastes the router's resources because the dropped
packet has already consumed the entire pipeline of the device. In this work, we
propose ingress Random Early Detection (iRED), a more efficient approach that
addresses the Egress drop problem. iRED is a disaggregated P4-AQM fully
implemented in programmable data plane hardware and also supports Low Latency,
Low Loss, and Scalable Throughput (L4S) framework, saving device pipeline
resources by dropping packets in the Ingress block. To evaluate iRED, we
conducted three experiments using a Tofino2 programmable switch: i) An in-depth
analysis of state-of-the-art AQMs on PDP hardware, using 12 different network
configurations varying in bandwidth, Round-Trip Time (RTT), and Maximum
Transmission Unit (MTU). The results demonstrate that iRED can significantly
reduce router resource consumption, with up to a 10x reduction in memory usage,
12x fewer processing cycles, and 8x less power consumption for the same traffic
load; ii) A performance evaluation regarding the L4S framework. The results
prove that iRED achieves fairness in bandwidth usage for different types of
traffic (classic and scalable); iii) A comprehensive analysis of the QoS in a
real setup of a DASH) technology. iRED demonstrated up to a 2.34x improvement
in FPS and a 4.77x increase in the video player buffer fill.Comment: Preprint (TNSM under review
Possible Improvements of TCP Protocol with the Use of Heuristic Methods
This paper describes the possibility of applying heuristic methods for parameter optimization in the TCP protocol. The proposed concept provides for a TCP protocol adjusting its parameters for greater efficiency through testing the network state and adapting accordingly. This can be achieved through careful analysis of the network state both before and during data transfer connections. The proposed solution introduces an innovative approach, incorporating the possibility of self-learning and self-adjusting capabilities. This sophisticated algorithm should define the next parameter values in terms of finding optimal parameter settings. Each TCP connection plays a crucial role as iteration in the process of finding the optimal solution. The concept focuses on calculating TCP parameter values at the network ends in order to optimize network traffic and to maximize the use of network resources. The approach has been tested on a dedicated test platform, validating its potential for verifying the network protocols functionality and for optimizing their parameters. The proposed solution, here referred to as the modified TCP, showed better performance compared to other versions of the TCP protocol. Notably, even under heavy traffic loads on links, the results for the modified TCP consistently outperform the standard TCP, delivering results that are several times better
- …