Sciweavers

482 search results - page 54 / 97
» On routing table growth
Sort
View
TPDS
2010
126views more  TPDS 2010»
13 years 2 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
PADS
2005
ACM
14 years 1 months ago
Routing Worm: A Fast, Selective Attack Worm Based on IP Address Information
Most well-known Internet worms, such as Code Red, Slammer, and Blaster, infected vulnerable computers by scanning the entire Internet IPv4 space. In this paper, we present a new s...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong...
IJAHUC
2010
145views more  IJAHUC 2010»
13 years 2 months ago
Towards a routing framework in ad hoc space networks
Abstract: The unique characteristics of space networks lead to different research approaches from those in terrestrial networks. In this paper, a routing framework called Space Gat...
Chao Chen, Zesheng Chen
FPGA
2007
ACM
153views FPGA» more  FPGA 2007»
14 years 1 months ago
GlitchLess: an active glitch minimization technique for FPGAs
This paper describes a technique that reduces dynamic power in FPGAs by reducing the number of glitches in the global routing resources. The technique involves adding programmable...
Julien Lamoureux, Guy G. Lemieux, Steven J. E. Wil...
ISPAN
2005
IEEE
14 years 1 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...