|
ABSTRACT
Modern networks face the daunting task of handling increasingly diverse traffic that is displaying a growing intolerance to disruptions. This has given rise to many initiatives, and in this paper we focus on multiple topology routing as the primary vehicle for meeting those demands. Specifically, we seek routing solutions capable of not just accommodating different performance goals, but also preserving them in the presence of disruptions. The main challenge is computational, i.e., to identify among the enormous number of possible routing solutions the one that yields the best compromise between performance and robustness. This is where our principal contribution lies, as we expand the definition of critical links -- a key concept in improving the efficiency of routing computation -- and develop a precise methodology to efficiently converge on those solutions. Using this new methodology, we demonstrate that one can compute routing solutions that are both flexible in accommodating different performance requirements and robust in maintaining them in the presence of failures and traffic fluctuations.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
G. Apostolopoulos. Using multiple topologies for IP-only protection against network failures: A routing performance perspective. Technical report, ICS-FORTH, Greece, 2006.
|
| |
2
|
A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, October 1999.
|
| |
3
|
J. Cao, D. Davis, S. V. Wiel, and B. Yu. Time-varying network tomography: Router link data. Journal of the American Statistical Association, Dec 2000.
|
 |
4
|
|
| |
5
|
B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In IEEE INFOCOM, 2000.
|
| |
6
|
B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. IEEE JSAC, May 2002.
|
| |
7
|
B. Fortz and M. Thorup. Robust optimization of OSPF/IS-IS weights. In International Network Optimization Conference, 2003.
|
| |
8
|
|
 |
9
|
Gianluca Iannaccone , Chen-nee Chuah , Richard Mortier , Supratik Bhattacharyya , Christophe Diot, Analysis of link failures in an IP backbone, Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, November 06-08, 2002, Marseille, France
[doi> 10.1145/637201.637238]
|
| |
10
|
A. Kvalbein, A. F. Hansen, T. Cicic, S. Gjessing, and O. Lysne. Fast IP network recovery using multiple routing configurations. In IEEE INFOCOM, 2006.
|
 |
11
|
|
| |
12
|
K.-W. Kwong, R. Guérin, A. Shaikh, and S. Tao. Balancing performance, robustness and flexibility in routing systems. Technical report, University of Pennsylvania, 2008.
|
 |
13
|
A. Medina , N. Taft , K. Salamatian , S. Bhattacharyya , C. Diot, Traffic matrix estimation: existing techniques and new directions, Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, August 19-23, 2002, Pittsburgh, Pennsylvania, USA
|
| |
14
|
|
 |
15
|
|
 |
16
|
|
| |
17
|
T. Przygienda, N. Shen, and N. Sheth. M-ISIS: Multi topology (MT) routing in IS-IS. IETF RFC 5120, February 2008.
|
| |
18
|
P. Psenak, S. Mirtorabi, A. Roy, L. Nguyen, and P. Pillay-Esnault. Multi-topology (MT) routing in OSPF. IETF RFC 4915, June 2007.
|
| |
19
|
A. Sridharan and R. Guérin. Making IGP routing robust to link failures. In Networking, 2005.
|
| |
20
|
D. Yuan. A bicriteria optimization approach for robust OSPF routing. In IEEE Workshop on IPOM, 2003.
|
|