This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Efficient and Robust Routing of Highly Variable Traffic Murali Kodialam T. V. Lakshman Sudipta Sengupta Bell Laboratories, Lucent Technologies 101 Crawfords Corner Road Holmdel, NJ 07733, USA ABSTRACT We consider the following issues related to robust net- work routing in a highly dynamic and changing traffic environment: What network routing should an Inter- net Service Provider use so as to (i) accommodate users demanding “good” service while being unpredictable in the traffic that they would like to send to different destinations, (ii) minimize the amount of “overprovi- sioning” that needs to be done in the network in or- der to make “best effort networking better” without re- sorting to sophisticated traffic prediction and manage- ment mechanisms, (iii) operate the network efficiently with mostly static routing configurations and without dynamic routing adjustments to avoid congestion due to drastic changes in traffic flows between a network’s ingress and egress routers. Achieving these goals has been difficult and has led to networks being very much overprovisioned in order to avoid the management com- plexity of implementing traffic management schemes that adapt network routing to changed traffic demands. In this paper, we propose a simple network routing scheme that is not much more complex to implement than shortest path routing with the following proper- ties: (i) it effectively handles all traffic patterns permis- sible within the capacity constraints of ingress-egress links, (ii) it avoids congestion without requiring dy- namic reconfiguration of routing parameters (such as link weights), and (ii) it is bandwidth efficient despite the ability to handle all traffic matrices. We argue that the routing scheme we propose is very effective in avoid- ing network congestion under extreme traffic variability while being static in the routing configuration and par- simonious in its “overprovisioning”. 1. INTRODUCTION In this paper, we propose a simple static routing scheme that is robust to extreme traffic fluctuations without requiring significant network overprovisioning. Specif- ically, the method we propose has the following prop- erties: (i) It can handle any traffic pattern permissible within the constraints imposed by the network’s edge- link capacities, (ii) It avoids network congestion under high traffic variability without requiring dynamic link weight or routing policy adjustments, (iii) Its capacity requirements are close to that needed to accommodate one “upper bound” traffic pattern even though it can handle all possible traffic patterns subject to ingress- egress capacity constraints. The ability to handle large traffic variations with a fixed routing scheme can greatly simplify network operation and our scheme is effective because these goals can be achieved without incurring high overheads in capacity costs....
View Full Document
This note was uploaded on 10/26/2011 for the course CS 7260 taught by Professor Staff during the Spring '08 term at Georgia Institute of Technology.
- Spring '08