DocumentCode
2732313
Title
Pre-computation based selective probing (PCSP) scheme for distributed QoS routing
Author
Lee, Byeong Gi ; Lee, Won-Ick
Author_Institution
Telecommun. & Signal Process Lab., Seoul Nat. Univ., South Korea
Volume
3
fYear
2000
fDate
2000
Firstpage
1778
Abstract
We propose a new distributed QoS routing scheme called PCSP that uses pre-computation based selective probing for routing decisions. This algorithm pre-computes the cost and QoS metrics respectively for the least cost and the best QoS paths. The pre-computed information enables to strictly limit the set of neighboring nodes involved in the probing process, thereby reducing the message complexity without sacrificing cost optimality. Computer simulation reveals that the PCSP scheme indeed has low message complexity and high success ratio with guaranteed optimal search
Keywords
communication complexity; quality of service; telecommunication network routing; PCSP scheme; QoS metrics; computer simulation; cost optimality; distributed QoS routing; guaranteed optimal search; high success ratio; least cost paths; message complexity reduction; pre-computation based selective probing scheme; Bandwidth; Computer simulation; Cost function; Delay; Joining processes; Probes; Routing; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE
Conference_Location
San Francisco, CA
Print_ISBN
0-7803-6451-1
Type
conf
DOI
10.1109/GLOCOM.2000.891941
Filename
891941
Link To Document