Pastry

swMATH11775MaRDI QIDQ23714FDOQ23714

Author name not available (Why is that?)

Cited In (64)

• Corona: a stabilizing deterministic message-passing skip list
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Leader election in well-connected graphs
• Network-conscious \(\pi\)-calculus -- a model of Pastry
• Degree-optimal routing for P2P systems
• D2B: A de Bruijn based content-addressable network
• Uniformity of direct unions of Chord
• A deterministic worst-case message complexity optimal solution for resource discovery
• A novel approach to adaptive content-based subscription management in DHT-based overlay networks
• Title not available (Why is that?)
• Choosing a random peer in Chord
• Multidimensional range queries on hierarchical Voronoi overlays
• Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
• Araneola: a scalable reliable multicast system for dynamic environments
• Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
• Resource Burning for Permissionless Systems (Invited Paper)
• On character-based index schemes for complex wildcard search in peer-to-peer networks
• Reliable Distributed Systems
• Title not available (Why is that?)
• HyperTree for self-stabilizing peer-to-peer systems
• Towards worst-case churn resistant peer-to-peer systems
• A self-stabilizing Hashed Patricia Trie
• Load balanced distributed directories
• A peer-to-peer expressway over Chord
• Simple efficient load-balancing algorithms for peer-to-peer systems
• Title not available (Why is that?)
• A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
• Concurrent maintenance of rings
• Investigating the existence and the regularity of logarithmic Harary graphs
• The price of validity in dynamic networks
• SKY: efficient peer-to-peer networks based on distributed Kautz graphs
• Title not available (Why is that?)
• Free-riders impact on throughputs of peer-to-peer file-sharing systems
• Distributed transactional memory for metric-space networks
• GMAC: an overlay multicast network for mobile agent platforms
• Minha: Large-scale distributed systems testing made practical
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Service provisioning for a next-generation adaptive grid
• Top-\(k\) vectorial aggregation queries in a distributed environment
• Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
• Survey of DHT topology construction techniques in virtual computing environments
• \(D^2\)-tree: a new overlay with deterministic bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sublinear bounds for randomized leader election
• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
• Title not available (Why is that?)
• Echo: a peer-to-peer clustering framework for improving communication in DHTs
• Application execution management on the integrade opportunistic grid middleware
• Enabling dynamic querying over distributed hash tables
• Maintaining the Ranch topology
• Randomized leader election
• Novel architectures for P2P applications: the continuous-discrete approach
• MAAN: A multi-attribute addressable network for grid information services
• A routing algorithm for risk-scanning agents using ant colony algorithm in P2P network
• Title not available (Why is that?)
• Byzantine agreement with homonyms
• The Analysis of Kademlia for Random IDs
• Title not available (Why is that?)
• A Disconnection-Aware Mechanism to Provide Anonymity in Two-Level P2P Systems

This page was built for software: Pastry