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.
The IEEE 802.11p is the technology dedicated to vehicular communications to support road safety, efficiency, and comfort applications. A large number of research activities have been carried out to study the characteristics of the IEEE 802.11p. The key weakness of the IEEE 802.11p is the channel congestion issue, where the wireless channel gets saturated when the road density increases. The European Telecommunications Standardization Institute (ETSI) is in the progress of studying the channel congestion problem and proposed so-called Reactive Distributed Congestion Control (DCC) algorithm as a…
In this work, we provide the design and implementation of a switch-assisted congestion control algorithm for data center networks (DCNs). In particular, we provide a prototype of the switch-driven congestion control algorithm and deploy it in a real data center. The prototype is based on few simple modifications to the switch software. The modifications imposed by the algorithm on the switch are to enable the switch to modify the TCP receive-window field in the packet headers. By doing so, the algorithm can enforce a pre-calculated (or target rate) to limit the sending rate at the sources. The…
Active queue control aims to improve the overall communication network throughput while providing lower delay and small packet loss rate. The basic idea is to actively trigger packet dropping (or marking provided by explicit congestion notification (ECN)) before buffer overflow. In this paper, two artificial neural networks (ANN)-based control schemes are proposed for adaptive queue control in TCP communication networks. The structure of these controllers is optimized using genetic algorithm (GA) and the output weights of ANNs are optimized using particle swarm optimization (PSO) algorithm. Th…
Addressing performance degradations in end-to-end congestion control has been one of the most active research areas in the last decade. Active queue management (AQM) aims to improve the overall network throughput, while providing lower delay and reduce packet loss and improving network. The basic idea is to actively trigger packet dropping (or marking provided by explicit congestion notification (ECN)) before buffer overflow. Radial bias function (RBF)-based AQM controller is proposed in this paper. RBF controller is suitable as an AQM scheme to control congestion in TCP communication networks…
This paper focuses on Hopf bifurcation control in a dual model of Internet congestion control algorithms which is modeled as a delay differential equation (DDE). By choosing communication delay as a bifurcation parameter, it has been demonstrated that the system loses stability and a Hopf bifurcation occurs when communication delay passes through a critical value. Therefore, a time-delayed feedback control method is applied to the system for delaying the onset of undesirable Hopf bifurcation. Theoretical analysis and numerical simulations confirm that the delayed feedback controller is efficie…
In the Tor network, anonymity is achieved through a multi-layered architecture, which comes at the cost of a complex network. Scheduling data in this network is a challenging task and the current approach shows to be incapable of avoiding network congestion and allocating fair data rates. We propose PredicTor, a distributed model predictive control approach, to tackle these challenges. PredicTor is designed to schedule incoming and outgoing data rates on individual nodes of the Tor architecture, leading to a scalable approach. We successfully avoid congestion through exchanging information of …
Realizing that it is inherently difficult to precisely match the sending rates at the endhost with the available capacity on dynamic cellular links, we build a system, Octopus, that sends real-time data streams over cellular networks using an imprecise controller (that errs on the side of over-estimating network capacity), and then drops appropriate packets in the cellular network buffers to match the actual capacity. We design parameterized primitives for implementing the packet dropping logic, that the applications at the endhost can configure differently to express different content adaptat…
A new era in wireless sensor network technology has been ushered in through the introduction of multimedia sensor networks, which has a major bottleneck in the form of network congestion. Congestion occurs when resources are in high demand during the active period while the data processing and transmission speeds lag behind the speed of the incoming traffic. This may disrupt normal network operations by buffer overflow, packet loss, increased latency, excessive energy consumption and even worse, a collapse of the entire operation. In this paper we propose a novel Trust Integrated Congestion-aw…
Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such algorithms inherit much of the properties of congestion controllers implementing one of the possible combination of AQM/ECN schemes at nodes and flow control at sources. In this paper we propose a linear program formulation of the multi-commodity flow problem with congestion control, under max-min fairness, comprising demands with or without exogenous peak ra…
The centralized architecture in software-defined network (SDN) provides a global view of the underlying network, paving the way for enormous research in the area of SDN traffic engineering (SDN TE). This research focuses on the load balancing aspects of SDN TE, given that the existing reactive methods for data-plane load balancing eventually result in packet loss and proactive schemes for data plane load balancing do not address congestion propagation. In the proposed work, the SDN controller periodically monitors flow level statistics and utilization on each link in the network and over-utili…
Due to the rapid development of IoT technology, automatic guided vehicles (AGVs) interact with an industrial control system (ICS) through the wireless network to support the freight distribution in the automated warehouse. However, the message exchange among AGVs and the ICS would experience large packet loss or long transmission delay, in the presence of wireless network link failure and link congestion. Therefore, the performance of warehouse automation would be degraded. In this paper, we propose the Software Defined Fast Failure Recovery(SD-FFR) mechanism, aiming to improve network reliabi…
We present ez-Segway, a decentralized mechanism to consistently and quickly update the network state while preventing forwarding anomalies (loops and black-holes) and avoiding link congestion. In our design, the centralized SDN controller only pre-computes information needed by the switches during the update execution. This information is distributed to the switches, which use partial knowledge and direct message passing to efficiently realize the update. This separation of concerns has the key benefit of improving update performance as the communication and computation bottlenecks at the cont…
Recent research has shown the link between congestion control in communication networks and feedback control system. In this paper, the design of an active queue management (AQM) which can be viewed as a controller, is considered. Based on a state space representation of a linearized fluid flow model of TCP, the AQM design is converted to a state feedback synthesis problem for time delay systems. Finally, an example extracted from the literature and simulations via a network simulator NS (under cross traffic conditions) support our study.
Active Queue Management (AQM) for mitigating Internet congestion has been addressed via various feedback control syntheses, among which P, PI, and PID regulators are quite popular and often associated to a Smith predictor. Here, to better account for the many uncertainties, like the round trip time or the number of TCP sessions, the above controllers are replaced by an intelligent proportional controller associated to Model-Free Control (MFC) and by forecasting techniques derived from a new approach to time series. Several computer simulations via a well accepted linear modeling, where the del…
From Prior-Guided Heuristics to Deployable Agents: Accelerating Demonstration-Driven Reinforcement Learning for Deadline-Constrained Network Control
University of Naples Federico II（那不勒斯费德里科二世大学）；New York University（纽约大学）；University of Southern California（南加州大学）；University of Trento（特伦托大学）；Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)（加泰罗尼亚电信技术中心）
Traditional network monitoring solutions usually lack of scalability due to their centralized nature collecting heartbeats from all network components via a single controller. As a solution, In-Band Network Telemetry (INT) framework has been recently proposed to collect network telemetry information more autonomously and distributedly by employing programmable switches. However, it imposes further challenges to (i) find suitable INT paths to optimize the control overhead and information freshness and (ii) ensure reliable delivery of control information over multi-hop INT paths. In this work, w…
