Title :
Limited scope probing: a distributed approach for QoS-based routing
Author :
Teng, Kia Seong ; Maheswaran, Muthucumaru
Author_Institution :
Dept. of Comput. Sci., Manitoba Univ., Winnipeg, Man., Canada
fDate :
6/23/1905 12:00:00 AM
Abstract :
Two new QoS-based unicast routing algorithms for high-speed internetworks are proposed as part of this work. Both algorithms, Limited-Scope Probing (LSP) and Limited-Scope Hop-by-Hop Probing (LSHP) use the route update messages generated by the Open Shortest-Path-First (OSPF) algorithm to create hybrid routing tables. The LSP and LSHP are semi-distributed routing algorithms. They assume that the network "state" information maintained by the OSPF is accurate in "close" vicinity of the maintaining node. Therefore, the LSP and LSHP propose to use source-based routing techniques to route along paths that are "centrally" computed by the node. The extent of the vicinity can be set by an appropriate parameter. Extensive simulations are performed to compare our algorithms with existing QoS-based unicast routing algorithms
Keywords :
distributed algorithms; internetworking; probes; quality of service; telecommunication computing; telecommunication network routing; distributed QoS-based routing; high-speed internetworks; hybrid routing tables; limited-scope hop-by-hop probing; limited-scope probing; network state information; open shortest-path-first algorithm; semi-distributed routing algorithms; simulations; source-based routing techniques; unicast routing algorithms; vicinity extent parameter; Computational modeling; Computer science; Floods; Hybrid power systems; IP networks; Laboratories; Probes; Quality of service; Routing; Unicast;
Conference_Titel :
Network Computing and Applications, 2001. NCA 2001. IEEE International Symposium on
Print_ISBN :
0-7695-1432-4
DOI :
10.1109/NCA.2001.962553
