Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Load Balancing in the Internet with Strict Delay Constraints
 

Summary: Load Balancing in the Internet with Strict Delay
Constraints
Matthew Andrews
Bell Labs, Murray Hill NJ
Email: andrews@research.bell­labs.com
Supported in part by the DARPA CBMANET project
Abstract--- We study the problem of routing traffic in the
Internet with strict delay constraints. This problem arises in
the context of routing delay­sensitive traffic such as Voice­over­
IP. We consider a set of demands that can be routed along a
candidate set of paths. Each demand must be split among its
paths in such a way that the total delay experienced by any of
the traffic is less than a fixed threshold.
In this paper we analyze the complexity of the problem
and also present experimental results for heuristics that can
be implemented in practice. In contrast to some other recent
work on network optimization, our problem has a combinatorial
aspect since we only enforce the delay bound on paths that have
non­zero traffic. Our main theoretical result is that this causes
the problem to be computationally hard, even if we only wish

  

Source: Andrews, Matthew - Mathematics of Networks and Systems, Mathematical Sciences Research Center, Bell Laboratories

 

Collections: Mathematics; Computer Technologies and Information Sciences