580 search results - page 4 / 116 » Choosing a random peer |
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...
ICA3PP
2007
Springer
14 years 1 months ago
2007
Springer
We propose a source peer selection algorithm which efficiently chooses peers as sources from a set of peers having the requested file in a hybrid P2P file sharing system. Our propo...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
Sets of named entities are used heavily at commercial search engines such as Google, Yahoo and Bing. Acquiring sets of entities typically consists of combining semi-supervised exp...
CPE
1998
Springer
13 years 11 months ago
1998
Springer
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve ord...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—Recent studies show that network coding improves multicast session throughput. In this paper, we demonstrate how random linear network coding can be incorporated to provide netw...