COPE
Authors:
Open Access
- 11 August 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 36 (4) , 99-110
Abstract
Traffic engineering plays a critical role in determining the performance and reliability of a network. A major challenge in traffic engineering is how to cope with dynamic and unpredictable changes in traffic demand. In this paper, we propose COPE, a class of traffic engineering algorithms that optimize for the expected scenarios while providing a worst-case guarantee for unexpected scenarios. Using extensive evaluations based on real topologies and traffic traces, we show that COPE can achieve efficient resource utilization and avoid network congestion in a wide variety of scenarios.Keywords
This publication has 38 references indexed in Scilit:
- BPG routing policies in ISP networksIEEE Network, 2005
- BGP routing changesACM SIGCOMM Computer Communication Review, 2005
- Traffic Matrix Reloaded: Impact of Routing Changes2005
- Robust linear optimization under general normsOperations Research Letters, 2004
- Guidelines for interdomain traffic engineeringACM SIGCOMM Computer Communication Review, 2003
- Traffic engineering with traditional IP routing protocolsIEEE Communications Magazine, 2002
- Implications of Interdomain Traffic Characteristics on Traffic EngineeringEuropean Transactions on Telecommunications, 2002
- Traffic engineering with MPLS in the InternetIEEE Network, 2000
- MPLS and traffic engineering in IP networksIEEE Communications Magazine, 1999
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982