A new class of online minimum-interference routing algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2345, Issue , 2002, Pages 959-971

  Iliadis, Ilias ^a   Bauer, Daniel ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH;

MINIMUM INTERFERENCE; MINIMUM INTERFERENCE ROUTING ALGORITHMS; NUMERICAL RESULTS; ON-LINE ALGORITHMS; RESIDUAL BANDWIDTHS; SERVICE PROVIDER; STATIC NETWORKS; TRANSPORT NETWORKS;

ROUTING ALGORITHMS;

EID: 84948128366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47906-6_78     Document Type: Conference Paper

References (9)

1. Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. RFC 3031 (January 2001).
2. The ATM Forum: Private Network-Network Interface Specification Version 1.0. Specification Number af-pnni-0055.000 (March 1996).
3. Ma, Q., Steenkiste, P.: On Path Selection for Traffic with Bandwidth Guarantees. In: Proc. IEEE Int’l Conf. on Network Protocols, Atlanta, GA (1997) 191-202.
4. Gawlick, R., Kalmanek, C., Ramakrishnan, K. G.: On-line Routing for Permanent Virtual Circuits. In: Proc. IEEE INFOCOM ‘95, Boston, MA, Vol. 1 (1998) 278-288.
5. Kar, K., Kodialam, M., Lakshman, T. V.: Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications. IEEE J. Sel. Areas Commun. 18 (2000) 2566-2579.
6. Gibbens, R. J., Kelly, F. P., Key, P. B.: Dynamic Alternative Routing – Modelling and Behavior. In: Proc. 12th Int’l Teletraffic Congress, Turin, Italy (1988) 1019-1025.
7. Suri, S., Waldvogel, M., Warkhede, P. R.: Profile-Based Routing: A New Framework for MPLS Traffic Engineering. In: Boavida, F., Ed., Quality of Future Internet Services, LNCS 2156 (Springer, Berlin, 2001).
8. Dijkstra, E. W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1 (1959) 269-271.
9. Aumann, Y., Rabani, Y.: An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM J. Comput. 27 (1998) 291-301.