Results 1  10
of
18
Fast construction of overlay networks
 SPAA
"... An asynchronous algorithm is described for rapidly constructing an overlay network in a peertopeer system where all nodes can in principle communicate with each other directly through an underlying network, but each participating node initially has pointers to only a handful of other participants. ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
(Show Context)
An asynchronous algorithm is described for rapidly constructing an overlay network in a peertopeer system where all nodes can in principle communicate with each other directly through an underlying network, but each participating node initially has pointers to only a handful of other participants. The output of the mechanism is a linked list of all participants sorted by their identifiers, which can be used as a foundation for building various linear overlay networks such as Chord or skip graphs. Assuming the initial pointer graph is weaklyconnected with maximum degree d and the length of a node identifier is W, the mechanism constructs a binary search tree of nodes of depth O(W) in expected O(W log n) time using expected O((d+W)nlog n) messages of size O(W) each. Furthermore, the algorithm has low contention: at any time there are only O(d) undelivered messages for any given recipient. A lower bound of Ω(d + log n) is given for the running time of any procedure in a related synchronous model that yields a sorted list from a degreed weaklyconnected graph of n nodes. We conjecture that this lower bound is tight and could be attained by further improvements to our algorithms.
On the performance of floodingbased resource discovery
 Parallel and Distributed Systems, IEEE Transactions on
, 2006
"... ..."
(Show Context)
O(log n)time overlay network construction from graphs with outdegree 1
 IN PRINCIPLES OF DISTRIBUTED SYSTEMS; 11TH INTERNATIONAL CONFERENCE, OPODIS 2007, GAUDALOUPE, FRENCH WEST INDIES, DECEMBER 17–20, 2007, PROCEEDINGS
, 2007
"... A fast selfstabilizing algorithm is described to rapidly construct a balanced overlay network from a directed graph initially with outdegree 1, a natural starting case that arises in peertopeer systems where each node attempts to join by contacting some single other node. This algorithm constru ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
A fast selfstabilizing algorithm is described to rapidly construct a balanced overlay network from a directed graph initially with outdegree 1, a natural starting case that arises in peertopeer systems where each node attempts to join by contacting some single other node. This algorithm constructs a balanced search tree in time O(W + log n), where W is the key length and n is the number of nodes, improving by a factor of log n on the previous bound starting from a general graph, while retaining the properties of low contention and short messages. Our construction includes an improved version of the distributed Patricia tree structure of Angluin et al. [1], which we call a doubleheaded radix tree. This data structure responds gracefully to node failures and supports search, predecessor, and successor operations in O(W) time with smoothly distributed load for predecessor and successor operations. Though the resulting tree data structure is highly vulnerable to disconnection due to failures, the fast predecessor and successor operations (as shown in previous work) can be used to quickly construct standard overlay networks with more redundancy.
A SelfOrganized Grouping (SOG) Method for Efficient Grid Resource Discovery
 In GRID 2005
, 2005
"... Abstract — This paper presents a selforganized grouping (SOG) method that achieves efficient Grid resource discovery by forming and maintaining autonomous resource groups. Each group dynamically aggregates a set of resources that are similar to each other in some prespecified resource characterist ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract — This paper presents a selforganized grouping (SOG) method that achieves efficient Grid resource discovery by forming and maintaining autonomous resource groups. Each group dynamically aggregates a set of resources that are similar to each other in some prespecified resource characteristic. The SOG method takes advantage of the strengths of both centralized and decentralized approaches that were previously developed for Grid/P2P resource discovery. The design of the SOG method minimizes the overhead incurred in forming and maintaining groups and maximizes resource discovery performance. The way SOG method handles resource discovery queries is metaphorically similar to searching for a word in an English dictionary by identifying its alphabetical groups at the first place. It is shown from a series of computational experiments that SOG method achieves more stable (i.e., independent of the factors such as resource densities, and Grid sizes) and efficient lookup performance than other existing approaches.
Routing and Resource Discovery in Phoenix GridEnabled Message Passing Library
 IEEE International Symposium on Cluster Computing and the Grid
, 2004
"... We describe design and implementation of a “Gridenabled” message passing library, in the context of Phoenix message passing model. It supports (1) message routing between nodes not directly reachable due to firewalls and/or NAT, (2) resource discovery facilitating ease of configuration that allows n ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
We describe design and implementation of a “Gridenabled” message passing library, in the context of Phoenix message passing model. It supports (1) message routing between nodes not directly reachable due to firewalls and/or NAT, (2) resource discovery facilitating ease of configuration that allows nodes without static names (e.g., DHCP nodes) to participate in computation without specific efforts, and (3) nodes dynamically joining/leaving computation at runtime. We argue that, in future Grid environments, all of the above functions, not just routing across firewalls, will become important issues of Gridenabled message passing systems including MPI. Unlike solutions commonly proposed by previous work on a Gridenabled MPI, our system runs a distributed resource discovery and routing table construction algorithm, rather than assuming all such pieces of information are available in a static configuration file or alike. Experimental results using 400 nodes in three LANs indicate that our algorithm is able to dynamically discover participating peers, connect them each other, and calculate a routing table. The elapsed time of our algorithm is only approximately twice as long as that of offline route calculation that just connects nodes based on a fully given configuration. 1.
Discovery through gossip
 In Proc. of 24th ACM SPAA. ACM
, 2012
"... Abstract We study stochastic processes in dynamic networks that are motivated by information discovery in largescale distributed networks such as peertopeer and social networks. A wellstudied problem in peertopeer networks is resource discovery, where the goal for nodes (hosts with IP address ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract We study stochastic processes in dynamic networks that are motivated by information discovery in largescale distributed networks such as peertopeer and social networks. A wellstudied problem in peertopeer networks is resource discovery, where the goal for nodes (hosts with IP addresses) is to discover the IP addresses of all other hosts. In social networks, nodes (people) discover new nodes through exchanging contacts with their neighbors (friends). In both cases the discovery of new nodes changes the underlying network new edges are added to the network and the process continues in the changed network. This paper studies and analyzes two natural gossipbased discovery processes. In the push discovery or triangulation process, each node repeatedly chooses two random neighbors and connects them (i.e., "pushes" their mutual information to each other). In the pull discovery process or the twohop walk, each node repeatedly requests or "pulls" a random contact from a random neighbor and connects itself to this twohop neighbor. Both processes are lightweight in the sense that the amortized work done per node is constant per round, local, and naturally robust due to the inherent randomized nature of gossip. Our main result is an almosttight analysis of the time taken for these two randomized processes to converge. We show that in any undirected nnode graph both processes take O(n log 2 n) rounds to connect every node to all other nodes with high probability, whereas Ω(n log n) is a lower bound. We also study the twohop walk in directed graphs, and show that it takes O(n 2 log n) time with high probability, and that the worstcase bound is tight for arbitrary directed graphs, whereas Ω(n 2 ) is a lower bound for strongly connected directed graphs. A key technical challenge that we overcome in our work is the analysis of a randomized process that itself results in a constantly changing network leading to complicated dependencies in every round.
SOG: A SELFORGANIZED GROUPING INFRASTRUCTURE FOR GRID RESOURCE DISCOVERY
, 2006
"... Dynamic and heterogeneous characteristics of largescale Grids make the fundamental problem of resource discovery a great challenge. This thesis presents a selforganized grouping (SOG) infrastructure that achieves efficient Grid resource discovery by forming and maintaining autonomous resource gro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Dynamic and heterogeneous characteristics of largescale Grids make the fundamental problem of resource discovery a great challenge. This thesis presents a selforganized grouping (SOG) infrastructure that achieves efficient Grid resource discovery by forming and maintaining autonomous resource groups. Each group dynamically aggregates a set of resources that are similar to each other in some prespecified resource characteristic. The SOG method takes advantage of the strengths of both centralized and decentralized approaches that were previously developed for Grid/P2P resource discovery. The design of the SOG method minimizes the overhead incurred in forming and maintaining groups and maximizes resource discovery performance. The way SOG method handles resource discovery queries is metaphorically similar to searching for a word in an English dictionary by identifying its alphabetical groups at the first place and then performing a lexical search within the group. The algorithms implemented in SOG method are illustrated with details. This thesis also illustrates a generalized approach using a spacefilling curve
Probabilistic Quorums for Dynamic Systems (Extended Abstract)
 In DISC
, 2003
"... Ittai Abraham and Dahlia Malkhi School of Engineering and Computer Science, The Hebrew University of Jerusalem, Israel. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Ittai Abraham and Dahlia Malkhi School of Engineering and Computer Science, The Hebrew University of Jerusalem, Israel.
ABSTRACT Fast Construction of Overlay Networks
"... An asynchronous algorithm is described for rapidly constructing an overlay network in a peertopeer system where all nodes can in principle communicate with each other directly through an underlying network, but each participating node initially has pointers to only a handful of other participants. ..."
Abstract
 Add to MetaCart
(Show Context)
An asynchronous algorithm is described for rapidly constructing an overlay network in a peertopeer system where all nodes can in principle communicate with each other directly through an underlying network, but each participating node initially has pointers to only a handful of other participants. The output of the mechanism is a linked list of all participants sorted by their identifiers, which can be used as a foundation for building various linear overlay networks such as Chord or skip graphs. Assuming the initial pointer graph is weaklyconnected with maximum degree d and the length of a node identifier is W, the mechanism constructs a binary search tree of nodes of depth O(W) in expected O(W log n) time using expected O((d+W)nlog n) messages of size O(W) each. Furthermore, the algorithm has low contention: at any time there are only O(d) undelivered messages for any given recipient. A lower bound of Ω(d + log n) is given for the running time of any procedure in a related synchronous model that yields a sorted list from a degreed weaklyconnected graph of n nodes. We conjecture that this lower bound is tight and could be attained by further improvements to our algorithms. Categories and Subject Descriptors