Sciweavers

2861 search results - page 133 / 573
» The multi-layered network design problem
Sort
View
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 5 months ago
Substring Matching in P2P Publish/Subscribe Data Management Networks
The content-based publish/subscribe (pub/sub) paradigm for system design is becoming increasingly popular, offering unique benefits for a large number of data-intensive applicatio...
Ioannis Aekaterinidis, Peter Triantafillou
PODC
2003
ACM
15 years 9 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
15 years 2 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
SPAA
2005
ACM
15 years 10 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
DSOM
2006
Springer
15 years 8 months ago
Towards Distributed Hash Tables (De)Composition in Ambient Networks
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambie...
Lawrence Cheng, Roel Ocampo, Kerry Jean, Alex Gali...