— 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...
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...
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...
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...
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,...