Sciweavers

3 search results - page 1 / 1
» Scheduling routing table calculations to achieve fast conver...
Sort
View
BROADNETS
2007
IEEE
13 years 11 months ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
ISCAPDCS
2003
13 years 6 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
AINA
2006
IEEE
13 years 8 months ago
EQ-BGP: an efficient inter-domain QoS routing protocol
In this paper we propose the Enhanced QoS Border Gateway Protocol1 (EQ-BGP) aimed at performing the inter-domain QoS routing in a multi-domain IP network. The objective of EQ-BGP ...
Andrzej Beben