Sciweavers

824 search results - page 79 / 165
» Robust Distributed Routing in Dynamical Flow Networks
Sort
View
PODC
1990
ACM
15 years 2 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
SIGCOMM
2004
ACM
15 years 3 months ago
Building a better NetFlow
Network operators need to determine the composition of the traffic mix on links when looking for dominant applications, users, or estimating traffic matrices. Cisco’s NetFlow ha...
Cristian Estan, Ken Keys, David Moore, George Varg...
ICDCS
2003
IEEE
15 years 3 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam
INFOCOM
1999
IEEE
15 years 2 months ago
Distributed Wireless Channel Allocation in Networks with Mobile Base Stations
Abstract-In traditional cellular systems with fixed base stations the channel reuse pattern is static and deterministic. When the cell layout is dynamic, due to the mobility of bas...
Sanket Nesargi, Ravi Prakash
CORR
2008
Springer
90views Education» more  CORR 2008»
14 years 10 months ago
Dynamic Connectivity in ALOHA Ad Hoc Networks
We consider an ad hoc network which uses multihop routing and slotted ALOHA for its MAC contention. We show that the minimum time required for a packet to reach the destination fr...
Radha Krishna Ganti, Martin Haenggi