Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Shortest path first with emergency exits
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Flexible routing and addressing for a next generation IP
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Security problems in the TCP/IP protocol suite
ACM SIGCOMM Computer Communication Review
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Improved Approximation Algorithms for Unsplittable Flow Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Two phase load balanced routing using OSPF
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we study the computational complexity and effectiveness of a concept we term "N-hub Shortest-Path Routing" in IP networks. N-hub Shortest-Path Routing allows the ingress node of a routing domain to determine up to N intermediate nodes ("hubs") through which a packet will pass before reaching its final destination. This facilitates better utilization of the network resources, while allowing the network routers to continue to employ the simple and well-known shortest-path routing paradigm. Although this concept has been proposed in the past, this paper is the first to investigate it in depth. We apply N-hub Shortest-Path Routing to the problem of minimizing the maximum load in the network. We show that the resulting routing problem is NP-complete and hard to approximate. However, we propose efficient algorithms for solving it both in the online and the offline contexts. Our results show that N-hub Shortest-Path Routing can increase network utilization significantly even for N = 1. Hence, this routing paradigm should be considered as a powerful mechanism for future datagram routing in the Internet.