مرکز منطقه ای اطلاع رساني علوم و فناوري - Finding a least hop(s) path subject to multiple additive constraints

Title of article :

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

Author/Authors :

Gang Cheng، نويسنده , , Nirwan Ansari، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2006

Pages :

From page :

392

To page :

401

Keywords :

Multiple additively constrained QoS routing , Cost function , NP-complete , Least hop(s)

Journal title :

Computer Communications

Serial Year :

2006

Journal title :

Computer Communications

Record number :

310203

Link To Document :