Pre-computation based selective probing (PCSP) scheme for distributed QoS routing

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Won-Ick Lee, Byeong Gi Lee
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Computer simulation
Cost function
Delay
Joining processes
Probes
Routing
Signal processing algorithms
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/GLOCOM.2000.891941