417 search results - page 4 / 84 » A randomized algorithm for the joining protocol in dynamic d... |
SIGMETRICS
2010
ACM
13 years 7 months ago
2010
ACM
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
JSAC
2007
13 years 7 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
PCI
2005
Springer
14 years 1 months ago
2005
Springer
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
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...