Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs

By David L. Applegate, Edith Cohen. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2003

386 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Optimal oblivious routing in polynomial time (2003, neutral): “These questions are addressed in subsequent work [1].”
P4p: provider portal for applications (2008, background): “The traditional approach to improving network efficiency is traffic engineering (e.g., [ 2 , 10]).”
Power Awareness in Network Design and Routing (2008, background): “Recent work by Applegate and Cohen uses an optimization framework to investigate how changing traffic profiles can affect network utilization [13].”
GreenTE: Power-aware traffic engineering (2010, methodology): “Since link capacities and trafﬁc matrices are not available for the Rocketfuel topologies, we assign capacities to links using the method described in [16] and generate trafﬁc matrices using the gravity model [17] [18].”
Optimal hierarchical decompositions for congestion minimization in networks (2008, methodology): “This problem was addressed by Azar et al. [9] (see also [3]) who gave a polynomial time algorithm to construct an optimal oblivious routing scheme for a given graph without using a hierarchical decomposition.”