Efficient path selection for QoS routing in load balancing

chichung cheung
chichung cheung

APCC 2003: 9TH ASIA-PACIFIC CONFERENCE ON COMMUNICATION, VOLS 1-3, PROCEEDINGS, pp. 988-992, 2003.

Cited by: 7|Views8

Abstract:

In this paper, we propose a new efficient QoS path searching algorithm called the Largest Widest Shortest Path with Limited Choices (LWSP-LC) for load balancing in the Internet. This algorithm is modified from the Widest Shortest Path (WSP) with two important modifications: our algorithm considers an addition parameter in the path selecti...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments