Sciweavers

6 search results - page 1 / 2
» Minimum failure explanations for path vector routing changes
Sort
View
JCO
2006
64views more  JCO 2006»
13 years 5 months ago
Minimum failure explanations for path vector routing changes
Mohit Lad, Daniel Massey, Adam Meyerson, Akash Nan...
ICNP
2003
IEEE
13 years 10 months ago
The Temporal and Topological Characteristics of BGP Path Changes
BGP has been deployed in Internet for more than a decade. However, the events that cause BGP topological changes are not well understood. Although large traces of routing updates ...
Di-Fa Chang, Ramesh Govindan, John S. Heidemann
NETWORKS
2007
13 years 4 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...
PADS
2005
ACM
13 years 10 months ago
Simulating Realistic Packet Routing without Routing Protocols
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
George F. Riley, Dheeraj Reddy
ICC
2008
IEEE
141views Communications» more  ICC 2008»
13 years 11 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan