Sciweavers

266 search results - page 53 / 54
» Distributed Routing in Tree Networks with Few Landmarks
Sort
View
NSDI
2008
13 years 9 months ago
Phalanx: Withstanding Multimillion-Node Botnets
Large-scale distributed denial of service (DoS) attacks are an unfortunate everyday reality on the Internet. They are simple to execute and with the growing prevalence and size of...
Colin Dixon, Thomas E. Anderson, Arvind Krishnamur...
IMC
2003
ACM
14 years 21 days ago
A measurement study of available bandwidth estimation tools
Available bandwidth estimation is useful for route selection in overlay networks, QoS verification, and traffic engineering. Recent years have seen a surge in interest in availab...
Jacob Strauss, Dina Katabi, M. Frans Kaashoek
SENSYS
2009
ACM
14 years 2 months ago
Darjeeling, a feature-rich VM for the resource poor
The programming and retasking of sensor nodes could benefit greatly from the use of a virtual machine (VM) since byte code is compact, can be loaded on demand, and interpreted on...
Niels Brouwers, Koen Langendoen, Peter Corke
PAM
2007
Springer
14 years 1 months ago
Two Days in the Life of the DNS Anycast Root Servers
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
Ziqian Liu, Bradley Huffaker, Marina Fomenkov, Nev...
ICDCS
2012
IEEE
11 years 9 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...