A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids

Chan, Philip Wing Keung; Abramson, David

doi:10.1109/e-science.2007.6

Cited by 7 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Distributed Lexicographic Placement Table (DLPT) [4,6] is based on a distributed prefix tree dynamically growing as services are declared by servers, as illustrated by Figure 1 giving an example of a tree growing with three services being sequentially declared: DGEMM, DTRSM and DTRMM from the BLAS library. The structure used is a particular prefix tree called Proper Greatest Common Prefix (PGCP) tree, defined as follows:…”

Section: P2p Service Discoverymentioning

confidence: 99%

“…The Distributed Lexicographic Placement Table (DLPT) approach [4,6] is one of them, providing dynamic load balancing [5] and formal guarantees for fault tolerance [3], while most fault-tolerance for structured peer-to-peer networks rely on replication mechanisms, like [11]. Replication can be very costly in terms of computing and storage resources and does not ensure the recovery of the system after arbitrary transient failures (memory corruption, network disconnection, etc.).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A practical study of self-stabilization for prefix-tree based overlay networks

Acretoaie

Caron

Tedeschi

2010

2010 International Conference on High Performance Computing &Amp; Simulation

View full text Add to dashboard Cite

As part of The International Conference on High Performance Computing and Simulation (HPCS 2010)International audienceService discovery is crucial in the development of fully decentralized computational grids. Among the significant amount of work produced by the convergence of peer-to-peer (P2P) systems and grids, a new kind of overlay networks, based on prefix trees (a.k.a., tries), has emerged. In particular, the Distributed Lexicographic Placement Table (DLPT) approach is a decentralized and dynamic service discovery service. Fault-tolerance within the DLPT approach is achieved through best-effort policies relying on formal self-stabilization results. Self-stabilization means that the tree can become transiently inconsistent, but is guaranteed to autonomously converge to a correct topology after arbitrary crashes, in a finite time. However, during convergence, the tree may not be able to process queries correctly. In this paper, we present some simulation results having several objectives. First, we investigate the interest of self-stabilization for such architectures. Second, we explore, still based on simulation, a simple Time-To-Live policy to avoid useless processing during convergence time

show abstract

Section: P2p Service Discoverymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A practical study of self-stabilization for prefix-tree based overlay networks

Acretoaie

Caron

Tedeschi

2010

2010 International Conference on High Performance Computing &Amp; Simulation

View full text Add to dashboard Cite

show abstract

“…The first contribution of this paper is the avoidance of the DHT: we developed a self-contained tree overlay able to both maintain the tree and map it onto the network. The load balancing issue has been mostly ignore by previous work on this architecture [5,6]. The second contribution is the design of a new load balancing heuristic based on the local maximization of the throughput.…”

Section: Introductionmentioning

confidence: 99%

Efficiency of tree-structured peer-to-peer service discovery systems

Caron

Desprez

Tedesch

2008

2008 IEEE International Symposium on Parallel and Distributed Processing

View full text Add to dashboard Cite

The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design of many peer-to-peer fashioned approaches. More specifically, the need for flexibility and complexity in the service discovery has seen the emergence of a new kind of overlays, based on tries, also known as lexicographic trees.Although these overlays are efficient and well designed, they require a costly maintenance and do not accurately take into account the heterogeneity of nodes and the changing popularity of the services requested by users.In this paper, we focus on reducing the cost of the maintenance of a particular architecture, based on a dynamic prefix tree, while enhancing it with some load balancing techniques that dynamically adapt the load of the nodes in order to maximize the throughput of the system. The algorithms developed couple a self-organizing prefix tree overlay with load balancing techniques inspired by similar previous works undertaken for distributed hash tables.After some simulation results showing how our load balancing heuristics perform in such an overlay and compare to other heuristics, we provide a fair comparison of this architecture and similar overlays recently proposed.

show abstract

“…The core element of this architecture, indexing the services, is a distributed trie. It was called DLPT, for Distributed Lexicographic Placement Table or DPT for Dynamic Prefix Tree as referred to as in several papers [59] for instance. The DLPT is a stand alone system.…”

mentioning

confidence: 99%