Title :
A distributed algorithm for unicast QoS-routing using path feasibility prediction
Author :
Shariff, A.R.M. ; Woodward, M.E.
Author_Institution :
Dept. of Comput., Bradford Univ.
Abstract :
We propose a new delay-constrained distributed algorithm (DCDRA) for unicast-routing. DCDRA uses a novel path feasibility predictor (PFP) inequality model that is able to predict the feasibility of a tentative routing path, and employs a crankback facility. It is a hybrid distributed algorithm where it uniquely integrates the use of local-link state and the global binary connectivity information maintained at each node to compute routing paths. Simulation results show that average message overhead is modest with good connection success rates
Keywords :
delays; distributed algorithms; quality of service; telecommunication links; telecommunication network routing; DCDRA; PFP inequality model; crankback facility; delay-constrained distributed algorithm; global binary connectivity information; link state information; path feasibility prediction; quality of service; unicast-QoS routing; Computational modeling; Databases; Delay; Distributed algorithms; Distributed computing; Floods; Predictive models; Quality of service; Routing protocols; Unicast;
Conference_Titel :
High Performance Switching and Routing, 2006 Workshop on
Conference_Location :
Poznan
Print_ISBN :
0-7803-9569-7
DOI :
10.1109/HPSR.2006.1709713
