MIS-LB: a QoS routing algorithm with min-sharing interference and load balancing based on nonlinear path distance

Min Zhang; Xiaolong Yang; Xuefei Tang; Hui Liu

doi:10.1117/12.516689

15 April 2004 MIS-LB: a QoS routing algorithm with min-sharing interference and load balancing based on nonlinear path distance

Min Zhang, Xiaolong Yang, Xuefei Tang, Hui Liu

Author Affiliations +

Proceedings Volume 5282, Network Architectures, Management, and Applications; (2004) https://doi.org/10.1117/12.516689
Event: Asia-Pacific Optical and Wireless Communications, 2003, Wuhan, China

Abstract

As known, the QoS routing under multiple constraints, which can be additive, multiplicative and concave, is a NP-complete problem, and is difficult to get a polynomial-time solution. Currently, many heuristic algorithms have been proposed to solve this problem, where the path distance usually acts as the most important factor during the routing decision-making. However, most of heuristic algorithms are based on linear path distance, which has the greatest shortcoming, i.e., the search of feasible solutions is inefficient. Besides, they also consider the link sharing interference and load balancing. To improve their performance, this paper proposes a novel QoS routing for multiple constraints based on the nonlinear path distance, which is called MIS-LB. At first, this paper represents the additive and multiplicative QoS metrics in the uniform metric, i.e. the nonlinear path distance. Then, the paper also brings the link sharing and load balancing into the uniform metric. Based on the shortest-first criterion, MIS-LB can not only find feasible paths as the normal routing algorithm (e.g., Dijkstra algorithm), but also adjust the link sharing, and balance the network loads between multiple feasible paths. So compared with TAMCRA and H_MCOP, the simulation results show that MIS-LB can further improve network performance.

Citation Download Citation

Min Zhang, Xiaolong Yang, Xuefei Tang, and Hui Liu "MIS-LB: a QoS routing algorithm with min-sharing interference and load balancing based on nonlinear path distance", Proc. SPIE 5282, Network Architectures, Management, and Applications, (15 April 2004); https://doi.org/10.1117/12.516689

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
7 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Reliability

Lithium

Computer science

Mathematics

Networks

Optimization (mathematics)

Computer programming

Show All Keywords

Keywords/Phrases

Search In:

Publication Years