A theoretical framework for selecting the cost function for source routing

Gang Cheng, Nirwan Ansari

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations


Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and has been extensively studied. Many proposed source routing algorithms tackle this 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.

Original languageEnglish (US)
Pages (from-to)631-635
Number of pages5
JournalIEEE International Conference on Communications
StatePublished - 2003
Event2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States
Duration: May 11 2003May 15 2003

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Networks and Communications


  • Cost function
  • Multiple additively constrained QoS routing
  • NP-complete


Dive into the research topics of 'A theoretical framework for selecting the cost function for source routing'. Together they form a unique fingerprint.

Cite this