Internet Routing and Related Topology Issues

DOI10.1137/S0895480100377428zbMath1043.90012MaRDI QIDQ4443120

Eric Gourdin, Walid Ben-Ameur

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph topologyshortest path routingInternet network

Mathematics Subject Classification ID

Trees (05C05) Numerical mathematical programming methods (65K05) Communication networks in operations research (90B18) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Routing of uncertain traffic demands, Unnamed Item, An Integer Programming Algorithm for Routing Optimization in IP Networks, Robust multiobjective optimization with application to Internet routing, Routing and Capacity Optimization for IP Networks, Valid cycles: A source of infeasibility in open shortest path first routing, Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty, Intra-domain traffic engineering with shortest path routing protocols, An integer programming algorithm for routing optimization in IP networks, Intra-domain traffic engineering with shortest path routing protocols, Approximability of unsplittable shortest path routing problems, A New Necessary Condition for Shortest Path Routing, Efficient techniques and tools for intra-domain traffic engineering, A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion, Optimization of OSPF Routing in IP Networks