365 search results - page 35 / 73 » Fast construction of overlay networks |
JACM
2000
14 years 11 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
128
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
104
click to vote
ICPP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we consider gossip-based Peer-to-Peer streaming applications where multiple sources exist and they work serially. More specifically, we tackle the problem of fast s...
FC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Distributed anonymous communication networks like Tor depend on volunteers to donate their resources. However, the efforts of Tor volunteers have not grown as fast as th...
IWQOS
2004
Springer
15 years 5 months ago
2004
Springer
— Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads ...