Finding a least hop(s) path subject to multiple additive constraints

Document Type

Article

Publication Date

2-1-2006

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. © 2005 Elsevier B.V. All rights reserved.

Identifier

31144436484 (Scopus)

Publication Title

Computer Communications

External Full Text Location

https://doi.org/10.1016/j.comcom.2005.05.009

ISSN

01403664

First Page

392

Last Page

401

Issue

3

Volume

29

Grant

0435250

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS