Sciweavers

482 search results - page 4 / 97
» On routing table growth
Sort
View
PADS
2003
ACM
13 years 11 months ago
Reducing the Size of Routing Tables for Large-scale Network Simulation
In simulating large-scale networks, due to the limitation of available resources on computers, the size of the networks and the scale of simulation scenarios are often restricted....
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
ICPADS
2005
IEEE
13 years 12 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
INFOCOM
2012
IEEE
11 years 8 months ago
Harnessing Internet topological stability in Thorup-Zwick compact routing
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
Stephen D. Strowes, Colin Perkins
INFOCOM
2007
IEEE
14 years 19 days ago
Tree, Segment Table, and Route Bucket: A Multi-Stage Algorithm for IPv6 Routing Table Lookup
—Next generation internet protocol, IPv6, has attracted growing attention and has been deploying worldwide. With 128-bit address, IPv6 provides an extremely large address space a...
Zhenqiang Li, Dongqu Zheng, Yan Ma