Proactive multi-path routing

Authors:
Jing Shen;Jiaoying Shi;Jon Crowcroft
Affiliations:
State Key Lab of CAD&CG, ZheJiang University, P.R.China;State Key Lab of CAD&CG, ZheJiang University, P.R.China;Computer Lab, University of Cambridge, UK
Venue:
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
Year:
2002

Citing 7
Cited 1

Controlling alternate routing in general-mesh packet flow networks

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Self-similarity in World Wide Web traffic: evidence and possible causes

IEEE/ACM Transactions on Networking (TON)
Load-sensitive routing of long-lived IP flows

Proceedings of the 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
Dynamic multi-path routing: asymptotic approximation and simulations

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On Selection of Paths for Multipath Routing

IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
A literature survey on traffic dispersion

IEEE Network: The Magazine of Global Internetworking

Throughput-competitive advance reservation with bounded path dispersion

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Internet service provider faces a daunting challenge in provisioning network efficiently. We introduce a proactive multipath routing scheme that tries to route traffic according to its built-in properties. Based on mathematical analysis, our approach disperses incoming traffic flows onto multiple paths according to path qualities. Long-lived flows are detected and migrated to the shortest path if their QoS could be guaranteed there. Suggesting nondisjoint path set, four types of dispersion policies are analyzed, and flow classification policy which relates flow trigger with link state update period is investigated. Simulation experiments show that our approach outperforms traditional single path routing significantly.