1250 search results - page 164 / 250 » Membership-concealing overlay networks |
INFOCOM
2008
IEEE
14 years 4 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 ...
COLCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—Recently, unstructured peer-to-peer (P2P) applications have become extremely popular. Searching in these networks has been a hot research topic. Flooding-based searching, which ...
GLOBECOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper, we study the design of future wireless ad hoc networks. Particularly, we consider that the future wireless ad hoc networks shall be able to efficiently provide ...
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
OPODIS
2007
13 years 11 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....