Sciweavers

108 search results - page 14 / 22
» ELASTICITY: Topological Characterization of Robustness in Co...
Sort
View
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
TON
2010
126views more  TON 2010»
13 years 2 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
MIDDLEWARE
2010
Springer
13 years 5 months ago
Adapting Distributed Real-Time and Embedded Pub/Sub Middleware for Cloud Computing Environments
Enterprise distributed real-time and embedded (DRE) publish/subscribe (pub/sub) systems manage resources and data that are vital to users. Cloud computing—where computing resourc...
Joe Hoffert, Douglas C. Schmidt, Aniruddha S. Gokh...
CAL
2002
13 years 7 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
TMC
2012
11 years 9 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi