Sciweavers

133 search results - page 23 / 27
» Connectivity and fault-tolerance of hyperdigraphs
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
SPAA
2003
ACM
14 years 18 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
SIGCOMM
2004
ACM
14 years 24 days ago
A comparison of overlay routing and multihoming route control
The limitations of BGP routing in the Internet are often blamed for poor end-to-end performance and prolonged connectivity interruptions. Recent work advocates using overlays to e...
Aditya Akella, Jeffrey Pang, Bruce M. Maggs, Srini...
MOBICOM
1996
ACM
13 years 11 months ago
Building Reliable Mobile-Aware Applications Using the Rover Toolkit
This paper discusses extensions to the Rover toolkit for constructing reliable mobile-aware applications. The extensions improve upon the existing failure model, which only addres...
Anthony D. Joseph, M. Frans Kaashoek
CNSR
2010
IEEE
164views Communications» more  CNSR 2010»
13 years 10 months ago
Buffered Crossbar Fabrics Based on Networks on Chip
— Buffered crossbar (CICQ) switches have shown a high potential in scaling Internet routers capacity. However, they require expensive on-chip buffers whose cost grows quadratical...
Lotfi Mhamdi, Kees Goossens, Iria Varela Senin