4,273 research outputs found
TCP-friendly Congestion Control for Real-time Streaming Applications
This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in transmission rate upon congestion
A duality model of TCP and queue management algorithms
We propose a duality model of end-to-end congestion control and apply it to understanding the equilibrium properties of TCP and active queue management schemes. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a distributed primal-dual algorithm over the Internet to maximize aggregate utility subject to capacity constraints. The primal iteration is carried out by TCP algorithms such as Reno or Vegas, and the dual iteration is carried out by queue management algorithms such as DropTail, RED or REM. We present these algorithms and their generalizations, derive their utility functions, and study their interaction
Multiobjective Tactical Planning under Uncertainty for Air Traffic Flow and Capacity Management
We investigate a method to deal with congestion of sectors and delays in the
tactical phase of air traffic flow and capacity management. It relies on
temporal objectives given for every point of the flight plans and shared among
the controllers in order to create a collaborative environment. This would
enhance the transition from the network view of the flow management to the
local view of air traffic control. Uncertainty is modeled at the trajectory
level with temporal information on the boundary points of the crossed sectors
and then, we infer the probabilistic occupancy count. Therefore, we can model
the accuracy of the trajectory prediction in the optimization process in order
to fix some safety margins. On the one hand, more accurate is our prediction;
more efficient will be the proposed solutions, because of the tighter safety
margins. On the other hand, when uncertainty is not negligible, the proposed
solutions will be more robust to disruptions. Furthermore, a multiobjective
algorithm is used to find the tradeoff between the delays and congestion, which
are antagonist in airspace with high traffic density. The flow management
position can choose manually, or automatically with a preference-based
algorithm, the adequate solution. This method is tested against two instances,
one with 10 flights and 5 sectors and one with 300 flights and 16 sectors.Comment: IEEE Congress on Evolutionary Computation (2013). arXiv admin note:
substantial text overlap with arXiv:1309.391
Computational Methods for Probabilistic Inference of Sector Congestion in Air Traffic Management
This article addresses the issue of computing the expected cost functions
from a probabilistic model of the air traffic flow and capacity management. The
Clenshaw-Curtis quadrature is compared to Monte-Carlo algorithms defined
specifically for this problem. By tailoring the algorithms to this model, we
reduce the computational burden in order to simulate real instances. The study
shows that the Monte-Carlo algorithm is more sensible to the amount of
uncertainty in the system, but has the advantage to return a result with the
associated accuracy on demand. The performances for both approaches are
comparable for the computation of the expected cost of delay and the expected
cost of congestion. Finally, this study shows some evidences that the
simulation of the proposed probabilistic model is tractable for realistic
instances.Comment: Interdisciplinary Science for Innovative Air Traffic Management
(2013
Price of Anarchy in Bernoulli Congestion Games with Affine Costs
We consider an atomic congestion game in which each player participates in
the game with an exogenous and known probability , independently
of everybody else, or stays out and incurs no cost. We first prove that the
resulting game is potential. Then, we compute the parameterized price of
anarchy to characterize the impact of demand uncertainty on the efficiency of
selfish behavior. It turns out that the price of anarchy as a function of the
maximum participation probability is a nondecreasing
function. The worst case is attained when players have the same participation
probabilities . For the case of affine costs, we provide an
analytic expression for the parameterized price of anarchy as a function of
. This function is continuous on , is equal to for , and increases towards when . Our work can be interpreted as
providing a continuous transition between the price of anarchy of nonatomic and
atomic games, which are the extremes of the price of anarchy function we
characterize. We show that these bounds are tight and are attained on routing
games -- as opposed to general congestion games -- with purely linear costs
(i.e., with no constant terms).Comment: 29 pages, 6 figure
A Spectrum of TCP-friendly Window-based Congestion Control Algorithms
The increasing diversity of Internet application requirements has spurred recent interest in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The control rules are parameterized so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. This paper presents a comprehensive study of a new spectrum of window-based congestion controls, which are TCP-friendly as well as TCP-compatible under RED
Control-Based Resource Management Procedures for Satellite Networks
This paper describes the resource management of a DVBRCS
geostationary satellite network. The functional modules
of the access layer aim at efficiently exploiting the link
resources while assuring the contracted Quality of Service
(QoS) to the traffic entering the satellite network. The main
novelty is the integration between the Connection Admission
Control and the Congestion Control procedures. Both them
exploit the estimation of the traffic load, performed by a
Kalman filter. The proposed solution has been analysed via
computer simulations, which confirmed their effectiveness
Defending against Sybil Devices in Crowdsourced Mapping Services
Real-time crowdsourced maps such as Waze provide timely updates on traffic,
congestion, accidents and points of interest. In this paper, we demonstrate how
lack of strong location authentication allows creation of software-based {\em
Sybil devices} that expose crowdsourced map systems to a variety of security
and privacy attacks. Our experiments show that a single Sybil device with
limited resources can cause havoc on Waze, reporting false congestion and
accidents and automatically rerouting user traffic. More importantly, we
describe techniques to generate Sybil devices at scale, creating armies of
virtual vehicles capable of remotely tracking precise movements for large user
populations while avoiding detection. We propose a new approach to defend
against Sybil devices based on {\em co-location edges}, authenticated records
that attest to the one-time physical co-location of a pair of devices. Over
time, co-location edges combine to form large {\em proximity graphs} that
attest to physical interactions between devices, allowing scalable detection of
virtual vehicles. We demonstrate the efficacy of this approach using
large-scale simulations, and discuss how they can be used to dramatically
reduce the impact of attacks against crowdsourced mapping services.Comment: Measure and integratio
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
This paper studies the problem of scheduling in single-hop wireless networks
with real-time traffic, where every packet arrival has an associated deadline
and a minimum fraction of packets must be transmitted before the end of the
deadline. Using optimization and stochastic network theory we propose a
framework to model the quality of service (QoS) requirements under delay
constraints. The model allows for fairly general arrival models with
heterogeneous constraints. The framework results in an optimal scheduling
algorithm which fairly allocates data rates to all flows while meeting
long-term delay demands. We also prove that under a simplified scenario our
solution translates into a greedy strategy that makes optimal decisions with
low complexity
- …