Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Abstract--Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and has been
 

Summary: Abstract-- 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.
Index Terms-- Multiple additively constrained QoS routing,
cost function, NP-complete.
I. INTRODUCTION
he 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-of-service

  

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

 

Collections: Engineering