Sciweavers

482 search results - page 6 / 97
» On routing table growth
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Scalability of Routing Tables in Wireless Networks
— Consider a large wireless ad hoc network that facilitates communication between random pairs of network nodes. The paper investigates the size of routing tables as the number o...
Petar Momcilovic
CN
1998
118views more  CN 1998»
13 years 7 months ago
Adaptive web caching: towards a new global caching architecture
An adaptive, highly scalable, and robust web caching system is needed to effectively handle the exponential growth and extreme dynamic environment of the World Wide Web. Our work ...
B. Scott Michel, Khoi Nguyen, Adam Rosenstein, Lix...
PAM
2009
Springer
14 years 2 months ago
Quantifying the Extent of IPv6 Deployment
Our understanding of IPv6 deployment is surprisingly limited. In fact, it is not even clear how we should quantify IPv6 deployment. In this paper, we collect and analyze a variety ...
Elliott Karpilovsky, Alexandre Gerber, Dan Pei, Je...
SIROCCO
2003
13 years 9 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
SIGCOMM
1997
ACM
13 years 12 months ago
Small Forwarding Tables for Fast Routing Lookups
For some time, the networking communityhas assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must nd th...
Mikael Degermark, Andrej Brodnik, Svante Carlsson,...