Sciweavers

214 search results - page 34 / 43
» A Fault-tolerant Multicast Routing Algorithm in ATM Networks
Sort
View
SIGCOMM
2006
ACM
15 years 3 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
14 years 8 days ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang
MOBICOM
2005
ACM
15 years 3 months ago
Effects of routing computations in content-based routing networks with mobile data sources
This paper presents the first quantitative evaluation of the role of routing computations on performance when mobility is introduced to a content-based routing network. Additiona...
Vinod Muthusamy, Milenko Petrovic, Hans-Arno Jacob...
PODC
2009
ACM
15 years 4 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
PDPTA
2007
14 years 11 months ago
Scalable Overlay Multicast Tree Construction for Media Streaming
Overlay networks have become popular in recent times for content distribution and end-system multicasting of media streams. In the latter case, the motivation is based on the lack...
Gabriel Parmer, Richard West, Gerald Fry