Sciweavers

417 search results - page 19 / 84
» A randomized algorithm for the joining protocol in dynamic d...
Sort
View
ICDCS
2007
IEEE
14 years 1 months ago
Differentiated Data Persistence with Priority Random Linear Codes
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...
Yunfeng Lin, Baochun Li, Ben Liang
SIGCOMM
2010
ACM
13 years 6 months ago
Backpressure-based routing protocol for DTNs
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...
Amit Dvir, Athanasios V. Vasilakos
HCW
1998
IEEE
13 years 12 months ago
Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous Environment
With the advent of large scale heterogeneous environments, there is a need for matching and scheduling algorithms which can allow multiple DAG-structured applications to share the...
Michael A. Iverson, Füsun Özgüner
QEST
2009
IEEE
14 years 2 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
ICC
2008
IEEE
168views Communications» more  ICC 2008»
14 years 2 months ago
A Balanced Tree-Based Strategy for Unstructured Media Distribution in P2P Networks
—Most research on P2P multimedia streaming assumes that users access video content sequentially and passively. Unlike P2P live streaming in which the peers start playback from th...
Changqiao Xu, Gabriel-Miro Muntean, Enda Fallon, A...