Sciweavers

265 search results - page 50 / 53
» Faster communication in known topology radio networks
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
PODC
2009
ACM
14 years 4 months ago
The wireless synchronization problem
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Fabi...
CN
2004
99views more  CN 2004»
13 years 7 months ago
Efficient peer location on the Internet
We consider the problem of locating nearby application peers over the Internet. We define a new peer-location scheme (called Tiers), that scales to large application peer groups. ...
Suman Banerjee, Christopher Kommareddy, Bobby Bhat...
WETICE
2006
IEEE
14 years 1 months ago
A Hybrid P2P Protocol for Real-Time Collaboration
Peer-to-Peer architecture is currently an attractive solution for facilitating the use of collaboration software without any server. Multicasting is usually proposed for group com...
Dewan Tanvir Ahmed, Shervin Shirmohammadi
SPAA
2009
ACM
14 years 2 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski