By Topic

On the Computational Complexity and Effectiveness of N-Hub Shortest-Path Routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cohen, R. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa ; Nakibly, G.

In this paper, we study the computational complexity and effectiveness of a concept we term ldquoN-hub shortest-path routingrdquo in IP networks. N-hub shortest-path routing allows the ingress node of a routing domain to determine up to N intermediate nodes (ldquohubsrdquo) 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.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:16 ,  Issue: 3 )