Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Finding a least hop(s) path subject to multiple additive constraints Gang Cheng, Nirwan Ansari*
 

Summary: Finding a least hop(s) path subject to multiple additive constraints
Gang Cheng, Nirwan Ansari*
Authors are with the Advanced Networking Laboratory, ECE Department, NJIT, Newark, NJ 07012, USA
Received 1 November 2004; revised 9 May 2005; accepted 10 May 2005
Available online 13 June 2005
Abstract
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s)
multiple additively constrained path (LHMACP) selection, which is NP-complete. Then, we propose the k-shortest paths Extended Bellman-
Ford (k-EB) algorithm, which is capable of computing All Hops k-shortest Paths (AHKP) between a source and a destination. Through
extensive analysis and simulations, we show that the heuristic algorithm, based on k-EB, is highly effective in finding a least hop path subject
to multiple additive constraints with very low computational complexity; it achieves near 100% success ratio in finding a feasible path while
minimizing its average hop count.
q 2005 Elsevier B.V. All rights reserved.
Keywords: Multiple additively constrained QoS routing; Cost function; NP-complete; Least hop(s)
1. Introduction
The tremendous growth of the global Internet has given
rise to a variety of applications that require quality-of-
service (QoS) beyond what is provided by the current best-
effort IP packet delivery service. One of the challenging
issues is to select feasible paths that satisfy different quality-

  

Source: Ansari, Nirwan - Department of Electrical and Computer Engineering, New Jersey Institute of Technology

 

Collections: Engineering