scientific article; zbMATH DE number 2080852
From MaRDI portal
Publication:4473888
zbMath1051.68788MaRDI QIDQ4473888
Antony I. T. Rowstron, Peter Druschel
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2218/22180329.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (84)
Scalable percolation search on complex networks ⋮ D2B: A de Bruijn based content-addressable network ⋮ A routing algorithm for risk-scanning agents using ant colony algorithm in P2P network ⋮ Multidimensional range queries on hierarchical Voronoi overlays ⋮ A self-stabilizing Hashed Patricia Trie ⋮ Load balanced distributed directories ⋮ Practical load balancing for content requests in peer-to-peer networks ⋮ Degree-optimal routing for P2P systems ⋮ Towards worst-case churn resistant peer-to-peer systems ⋮ Optimal inter-object correlation when replicating for availability ⋮ Kosha: A peer-to-peer enhancement for the network file system ⋮ A novel approach to adaptive content-based subscription management in DHT-based overlay networks ⋮ Data distribution in a peer to peer storage system ⋮ A fair, secure and trustworthy peer-to-Peer based cycle-sharing system ⋮ A large scale analysis of unreliable stochastic networks ⋮ Maximizing data locality in distributed systems ⋮ Deterministic SkipNet ⋮ BulkTree: an overlay network architecture for live media streaming ⋮ Survey of DHT topology construction techniques in virtual computing environments ⋮ Markov chains competing for transitions: application to large-scale distributed systems ⋮ The price of validity in dynamic networks ⋮ Linear programming bounds for distributed storage codes ⋮ Corona: a stabilizing deterministic message-passing skip list ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Time-optimal construction of overlay networks ⋮ PEACHES and Peers ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Top-\(k\) vectorial aggregation queries in a distributed environment ⋮ HD tree: A novel data structure to support multi-dimensional range query for P2P networks ⋮ DSI: Distributed service integration for service grid ⋮ Semantic indexing in structured peer-to-peer networks ⋮ Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks ⋮ Squid: enabling search in DHT-based systems ⋮ GMAC: an overlay multicast network for mobile agent platforms ⋮ Leader election in well-connected graphs ⋮ Araneola: a scalable reliable multicast system for dynamic environments ⋮ Topological implications of selfish neighbor selection in unstructured peer-to-peer networks ⋮ Probabilistic quorums for dynamic systems ⋮ Concurrent maintenance of rings ⋮ Randomized leader election ⋮ The design of novel distributed protocols from differential equations ⋮ Distributed transactional memory for metric-space networks ⋮ HyperTree for self-stabilizing peer-to-peer systems ⋮ A novel robust on-line protocol for load-balancing in structured peer-to-peer systems ⋮ Merging ring-structured overlay indices: toward network-data transparency ⋮ Dynamic Routing and Location Services in Metrics of Low Doubling Dimension ⋮ Compact samples for data dissemination ⋮ Sublinear bounds for randomized leader election ⋮ Service provisioning for a next-generation adaptive grid ⋮ F-Chord: Improved uniform routing on Chord ⋮ Re-Chord: a self-stabilizing chord overlay network ⋮ Echo: a peer-to-peer clustering framework for improving communication in DHTs ⋮ Application execution management on the integrade opportunistic grid middleware ⋮ SCDN: stable content distribution network based on demands ⋮ Maintaining the Ranch topology ⋮ Enabling dynamic querying over distributed hash tables ⋮ Perfect simulation of a class of stochastic hybrid systems with an application to peer to peer systems ⋮ Choosing a random peer in Chord ⋮ \(D^2\)-tree: a new overlay with deterministic bounds ⋮ Compact roundtrip routing with topology-independent node names ⋮ A peer-to-peer expressway over Chord ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ A Scaling Analysis of a Transient Stochastic Network ⋮ MAAN: A multi-attribute addressable network for grid information services ⋮ SKY: efficient peer-to-peer networks based on distributed Kautz graphs ⋮ Algorithms and time complexity of the request-service problem ⋮ On character-based index schemes for complex wildcard search in peer-to-peer networks ⋮ A Disconnection-Aware Mechanism to Provide Anonymity in Two-Level P2P Systems ⋮ Towards a scalable and robust DHT ⋮ Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks ⋮ Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems ⋮ Cache me if you can: capacitated selfish replication games in networks ⋮ Investigating the existence and the regularity of logarithmic Harary graphs ⋮ Byzantine agreement with homonyms ⋮ A decentralized algorithm for spectral analysis ⋮ Free-riders impact on throughputs of peer-to-peer file-sharing systems ⋮ Estimating network size from local information ⋮ The Analysis of Kademlia for Random IDs ⋮ Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance ⋮ SKIP + ⋮ Uniformity of direct unions of Chord ⋮ A deterministic worst-case message complexity optimal solution for resource discovery ⋮ A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery ⋮ Analysis of the Blockchain Protocol in Asynchronous Networks
Uses Software
This page was built for publication:
