Sciweavers

1503 search results - page 79 / 301
» Self-optimizing distributed trees
Sort
View
COMCOM
2006
110views more  COMCOM 2006»
13 years 10 months ago
MULTI+: A robust and topology-aware peer-to-peer multicast service
TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper we present MULT...
Luis Garcés-Erice, Ernst W. Biersack
IPPS
2003
IEEE
14 years 3 months ago
The Reconstruction of a Mobile Agent Computation and Its Validation
We propose a new representation to describe mobile agents computations, where the underlying control structures are diffusing computations. Usually, distributed coms are abstracte...
Mamoun Filali, Philippe Mauran, Gérard Padi...
PDCAT
2007
Springer
14 years 4 months ago
Two Tree-Based Algorithms for Network Spare Capacity Design
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan...
ICNP
2006
IEEE
14 years 4 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
VECPAR
2004
Springer
14 years 3 months ago
Dynamically Adaptive Binomial Trees for Broadcasting in Heterogeneous Networks of Workstations
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...
Silvia M. Figueira, Christine Mendes