Sciweavers

6506 search results - page 762 / 1302
» Algorithmic models for sensor networks
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
IJMMS
2007
166views more  IJMMS 2007»
15 years 7 months ago
Visualization of large networks with min-cut plots, A-plots and R-MAT
What does a ‘normal’ computer (or social) network look like? How can we spot ‘abnormal’ sub-networks in the Internet, or web graph? The answer to such questions is vital f...
Deepayan Chakrabarti, Christos Faloutsos, Yiping Z...
INFOCOM
2009
IEEE
16 years 1 months ago
The Capacity Allocation Paradox
— The Capacity Allocation Paradox (CAP) destabilizes a stable small-buffer network when a link capacity is increased. CAP is demonstrated in a basic 2x1 network topology. We show...
Asaf Baron, Ran Ginosar, Isaac Keslassy
SIGMETRICS
2004
ACM
16 years 19 days ago
Insensitive load balancing
A large variety of communication systems, including telephone and data networks, can be represented by so-called Whittle networks. The stationary distribution of these networks is...
Thomas Bonald, Matthieu Jonckheere, Alexandre Prou...
DSN
2007
IEEE
16 years 1 months ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer