On selecting the cost function for source routing

Document Type

Article

Publication Date

11-8-2006

Abstract

Many proposed source routing algorithms tackle the Multiple Additively Constrained Path (MACP) selection, an NP-complete problem, by transforming it into the shortest path selection problem, which is P-complete, with an integrated cost function that maps the multi-constraints of each link into a single cost. However, how to select an appropriate cost function is an important issue that has rarely been addressed in literature. In this paper, we provide a theoretical framework for picking a cost function that can improve the performance of source routing in terms of complexity, convergence, and probability of finding a feasible path. © 2006 Elsevier B.V. All rights reserved.

Identifier

33750294775 (Scopus)

Publication Title

Computer Communications

External Full Text Location

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

ISSN

01403664

First Page

3602

Last Page

3608

Issue

17

Volume

29

Grant

0435250

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS