2,352 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
Random Access Game and Medium Access Control Design
Motivated partially by a control-theoretic viewpoint, we propose a game-theoretic model, called random access game, for contention control. We characterize Nash equilibria of random access games, study their dynamics, and propose distributed algorithms (strategy evolutions) to achieve Nash equilibria. This provides a general analytical framework that is capable of modeling a large class of system-wide quality-of-service (QoS) models via the specification of per-node utility functions, in which system-wide fairness or service differentiation can be achieved in a distributed manner as long as each node executes a contention resolution algorithm that is designed to achieve the Nash equilibrium. We thus propose a novel medium access method derived from carrier sense multiple access/collision avoidance (CSMA/CA) according to distributed strategy update mechanism achieving the Nash equilibrium of random access game. We present a concrete medium access method that adapts to a continuous contention measure called conditional collision probability, stabilizes the network into a steady state that achieves optimal throughput with targeted fairness (or service differentiation), and can decouple contention control from handling failed transmissions. In addition to guiding medium access control design, the random access game model also provides an analytical framework to understand equilibrium and dynamic properties of different medium access protocols
Optimizing Service Differentiation Scheme with Sized-based Queue Management in DiffServ Networks
In this paper we introduced Modified Sized-based Queue Management as a
dropping scheme that aims to fairly prioritize and allocate more service to
VoIP traffic over bulk data like FTP as the former one usually has small packet
size with less impact to the network congestion. In the same time, we want to
guarantee that this prioritization is fair enough for both traffic types. On
the other hand we study the total link delay over the congestive link with the
attempt to alleviate this congestion as much as possible at the by function of
early congestion notification. Our M-SQM scheme has been evaluated with NS2
experiments to measure the packets received from both and total link-delay for
different traffic. The performance evaluation results of M-SQM have been
validated and graphically compared with the performance of other three legacy
AQMs (RED, RIO, and PI). It is depicted that our M-SQM outperformed these AQMs
in providing QoS level of service differentiation.Comment: 10 pages, 9 figures, 1 table, Submitted to Journal of
Telecommunication
Explicit congestion control algorithms for time-varying capacity media
Tese de doutoramento. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 200
Design of an adaptive congestion control protocol for reliable vehicle safety communication
[no abstract
Implementation and performance evaluation of explicit congestion control algorithms
Estágio realizado no INESC-Porto e orientado pelo Eng.º Filipe Lameiro AbrantesTese de mestrado integrado. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 200
An Optimal Medium Access Control with Partial Observations for Sensor Networks
We consider medium access control (MAC) in multihop sensor networks, where only partial information about the shared medium is available to the transmitter. We model our setting as a queuing problem in which the service rate of a queue is a function of a partially observed Markov chain representing the available bandwidth, and in which the arrivals are controlled based on the partial observations so as to keep the system in a desirable mildly unstable regime. The optimal controller for this problem satisfies a separation property: we first compute a probability measure on the state space of the chain, namely the information state, then use this measure as the new state on which the control decisions are based. We give a formal description of the system considered and of its dynamics, we formalize and solve an optimal control problem, and we show numerical simulations to illustrate with concrete examples properties of the optimal control law. We show how the ergodic behavior of our queuing model is characterized by an invariant measure over all possible information states, and we construct that measure. Our results can be specifically applied for designing efficient and stable algorithms for medium access control in multiple-accessed systems, in particular for sensor networks
Controlo de congestionamento em redes sem fios
Doutoramento em Engenharia ElectrotécnicaCongestion control in wireless networks is an important and open issue.
Previous research has proven the poor performance of the Transport
Control Protocol (TCP) in such networks. The factors that contribute
to the poor performance of TCP in wireless environments concern its
unsuitability to identify/detect and react properly to network events,
its TCP window based
ow control algorithm that is not suitable for
the wireless channel, and the congestion collapse due to mobility. New
rate based mechanisms have been proposed to mitigate TCP performance
in wired and wireless networks. However, these mechanisms
also present poor performance, as they lack of suitable bandwidth estimation
techniques for multi-hop wireless networks.
It is thus important to improve congestion control performance in wireless
networks, incorporating components that are suitable for wireless
environments. A congestion control scheme which provides an e -
cient and fair sharing of the underlying network capacity and available
bandwidth among multiple competing applications is crucial to the definition
of new e cient and fair congestion control schemes on wireless
multi-hop networks.
The Thesis is divided in three parts. First, we present a performance
evaluation study of several congestion control protocols against TCP,
in wireless mesh and ad-hoc networks. The obtained results show that
rate based congestion control protocols need an eficient and accurate
underlying available bandwidth estimation technique. The second part
of the Thesis presents a new link capacity and available bandwidth estimation
mechanism denoted as rt-Winf (real time wireless inference).
The estimation is performed in real-time and without the need to intrusively
inject packets in the network. Simulation results show that
rt-Winf obtains the available bandwidth and capacity estimation with
accuracy and without introducing overhead trafic in the network.
The third part of the Thesis proposes the development of new congestion
control mechanisms to address the congestion control problems
of wireless networks. These congestion control mechanisms use cross
layer information, obtained by rt-Winf, to accurately and eficiently estimate
the available bandwidth and the path capacity over a wireless
network path. Evaluation of these new proposed mechanisms, through
ns-2 simulations, shows that the cooperation between rt-Winf and the
congestion control algorithms is able to significantly increase congestion
control eficiency and network performance.O controlo de congestionamento continua a ser extremamente importante
quando se investiga o desempenho das redes sem fios. Trabalhos
anteriores mostram o mau desempenho do Transport Control Proto-
col (TCP) em redes sem fios. Os fatores que contribuem para um
pior desempenho do TCP nesse tipo de redes s~ao: a sua falta de capacidade
para identificar/detetar e reagir adequadamente a eventos da
rede; a utilização de um algoritmo de controlo de
uxo que não é adequado
para o canal sem fios; e o colapso de congestionamento devido
á mobilidade. Para colmatar este problemas foram propostos novos
mecanismos de controlo de congestionamento baseados na taxa de
transmissão. No entanto, estes mecanismos também apresentam um
pior desempenho em redes sem fios, já que não utilizam mecanismos
adequados para a avaliação da largura de banda disponível. Assim, é
importante para melhorar o desempenho do controlo de congestionamento
em redes sem fios, incluir componentes que são adequados para
esse tipo de ambientes. Um esquema de controlo de congestionamento
que permita uma partilha eficiente e justa da capacidade da rede e da
largura de banda disponível entre múltiplas aplicações concorrentes é
crucial para a definição de novos, eficientes e justos mecanismos de
controlo congestionamento para as redes sem fios.
A Tese está dividida em três partes. Primeiro, apresentamos um estudo
sobre a avaliação de desempenho de vários protocolos de controlo de
congestionamento relativamente ao TCP, em redes sem fios em malha
e ad-hoc. Os resultados obtidos mostram que os protocolos baseados
na taxa de transmissão precisam de uma técnica de avaliação da largura
de banda disponível que seja eficiente e precisa . A segunda parte da
Tese apresenta um novo mecanismo de avaliação da capacidade da
ligação e da largura de banda disponível, designada por rt-Winf (real
time wireless inference). A avaliação é realizada em tempo real e sem
a necessidade de inserir tráfego na rede. Os resultados obtidos através
de simulação e emulação mostram que o rt-Winf obtém com precisão
a largura de banda disponível e a capacidade da ligação sem sobrecarregar
a rede. A terceira parte da Tese propõe novos mecanismos de
controlo de congestionamento em redes sem fios. Estes mecanismos
de controlo de congestionamento apresentam um conjunto de caracter
ísticas novas para melhorar o seu desempenho, de entre as quais
se destaca a utilização da informação de largura de banda disponível
obtida pelo rt-Winf. Os resultados da avaliação destes mecanismos,
utilizando o simulador ns-2, permitem concluir que a cooperação entre
o rt-Winf e os algoritmos de controlo de congestionamento aumenta
significativamente o desempenho da rede
Layering as Optimization Decomposition: Questions and Answers
Network protocols in layered architectures have historically been obtained on an ad-hoc basis, and much of the recent cross-layer designs are conducted through piecemeal approaches. Network protocols may instead be holistically analyzed and systematically designed as distributed solutions to some global optimization problems in the form of generalized Network Utility Maximization (NUM), providing insight on what they optimize and on the structures of network protocol stacks. In the form of 10 Questions and Answers, this paper presents a short survey of the recent efforts towards a systematic understanding of "layering" as "optimization decomposition". The overall communication network is modeled by a generalized NUM problem, each layer corresponds to a decomposed subproblem, and the interfaces among layers are quantified as functions of the optimization variables coordinating the subproblems. Furthermore, there are many alternative decompositions, each leading to a different layering architecture. Industry adoption of this unifying framework has also started. Here we summarize the current status of horizontal decomposition into distributed computation and vertical decomposition into functional modules such as congestion control, routing, scheduling, random access, power control, and coding. We also discuss under-explored future research directions in this area. More importantly than proposing any particular crosslayer design, this framework is working towards a mathematical foundation of network architectures and the design process of modularization
Control of transport dynamics in overlay networks
Transport control is an important factor in the performance of Internet protocols, particularly in the next generation network applications involving computational steering, interactive visualization, instrument control, and transfer of large data sets. The widely deployed Transport Control Protocol is inadequate for these tasks due to its performance drawbacks. The purpose of this dissertation is to conduct a rigorous analytical study on the design and performance of transport protocols, and systematically develop a new class of protocols to overcome the limitations of current methods. Various sources of randomness exist in network performance measurements due to the stochastic nature of network traffic. We propose a new class of transport protocols that explicitly accounts for the randomness based on dynamic stochastic approximation methods. These protocols use congestion window and idle time to dynamically control the source rate to achieve transport objectives. We conduct statistical analyses to determine the main effects of these two control parameters and their interaction effects. The application of stochastic approximation methods enables us to show the analytical stability of the transport protocols and avoid pre-selecting the flow and congestion control parameters. These new protocols are successfully applied to transport control for both goodput stabilization and maximization. The experimental results show the superior performance compared to current methods particularly for Internet applications. To effectively deploy these protocols over the Internet, we develop an overlay network, which resides at the application level to provide data transmission service using User Datagram Protocol. The overlay network, together with the new protocols based on User Datagram Protocol, provides an effective environment for implementing transport control using application-level modules. We also study problems in overlay networks such as path bandwidth estimation and multiple quickest path computation. In wireless networks, most packet losses are caused by physical signal losses and do not necessarily indicate network congestion. Furthermore, the physical link connectivity in ad-hoc networks deployed in unstructured areas is unpredictable. We develop the Connectivity-Through-Time protocols that exploit the node movements to deliver data under dynamic connectivity. We integrate this protocol into overlay networks and present experimental results using network to support a team of mobile robots
- …