Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Controlling alternate routing in general-mesh packet flow networks
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A literature survey on traffic dispersion
IEEE Network: The Magazine of Global Internetworking
Deliver Multimedia Streams with Flexible QoS via a Multicast DAG
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Enhancing both network and user performance for networks supporting best effort traffic
IEEE/ACM Transactions on Networking (TON)
Adaptive control algorithms for decentralized optimal traffic engineering in the internet
IEEE/ACM Transactions on Networking (TON)
Biologically inspired self-adaptive multi-path routing in overlay networks
Communications of the ACM - Self managed systems
On the performance of traffic equalizers on heterogeneous communication links
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Resilient multi-path routing based on a biological attractor selection scheme
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
| Hi-index | 0.00 |
In this paper we study the dynamic multi-path routing problem. We focus on an operating regime where traffic flows arrive at and depart from the network in a bursty fashion, and where the delays involved in link state advertisement may lead to "synchronization" effects that adversely impact the performance of dynamic single-path routing schemes.We start by analyzing a simple network of parallel links, where the goal is to minimize the average increase in network congestion on the time scale of link state advertisements. We consider an asymptotic regime leading to an optimization problem permitting closed-form analysis of the number of links over which dynamic multi-path routing should be conducted. Based on our analytical result we examine three types of dynamic routing schemes, and identify a robust policy, i.e., routing the traffic to a set of links with loads within a factor of the least loaded, that exhibits robust performance. We then propose a similar policy for mesh networks and show by simulation some of its desirable properties. The main results suggest that our proposal would provide significant performance improvement for high speed networks carrying bursty traffic flows.