The following pages link to Pastry (Q23714):
Displaying 50 items.
- Survey of DHT topology construction techniques in virtual computing environments (Q350981) (← links)
- Corona: a stabilizing deterministic message-passing skip list (Q392011) (← links)
- Tiara: a self-stabilizing deterministic skip list and skip graph (Q418743) (← links)
- Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks (Q436777) (← links)
- GMAC: an overlay multicast network for mobile agent platforms (Q436854) (← links)
- Araneola: a scalable reliable multicast system for dynamic environments (Q436913) (← links)
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems (Q455942) (← links)
- Sublinear bounds for randomized leader election (Q477103) (← links)
- \(D^2\)-tree: a new overlay with deterministic bounds (Q494810) (← links)
- Network-conscious \(\pi\)-calculus -- a model of Pastry (Q530841) (← links)
- Top-\(k\) vectorial aggregation queries in a distributed environment (Q635316) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- Echo: a peer-to-peer clustering framework for improving communication in DHTs (Q666026) (← links)
- Application execution management on the integrade opportunistic grid middleware (Q666132) (← links)
- Maintaining the Ranch topology (Q666250) (← links)
- Enabling dynamic querying over distributed hash tables (Q666264) (← links)
- On character-based index schemes for complex wildcard search in peer-to-peer networks (Q726364) (← links)
- Degree-optimal routing for P2P systems (Q841622) (← links)
- A novel approach to adaptive content-based subscription management in DHT-based overlay networks (Q851159) (← links)
- Simple efficient load-balancing algorithms for peer-to-peer systems (Q863188) (← links)
- The price of validity in dynamic networks (Q878747) (← links)
- Investigating the existence and the regularity of logarithmic Harary graphs (Q1019190) (← links)
- Free-riders impact on throughputs of peer-to-peer file-sharing systems (Q1028376) (← links)
- MAAN: A multi-attribute addressable network for grid information services (Q1771260) (← links)
- Concurrent maintenance of rings (Q1954197) (← links)
- Randomized leader election (Q1954216) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- HyperTree for self-stabilizing peer-to-peer systems (Q1954258) (← links)
- A self-stabilizing Hashed Patricia Trie (Q2139093) (← links)
- Load balanced distributed directories (Q2139097) (← links)
- SKY: efficient peer-to-peer networks based on distributed Kautz graphs (Q2267089) (← links)
- Uniformity of direct unions of Chord (Q2343580) (← links)
- A deterministic worst-case message complexity optimal solution for resource discovery (Q2345458) (← links)
- D2B: A de Bruijn based content-addressable network (Q2368967) (← links)
- Towards worst-case churn resistant peer-to-peer systems (Q2377141) (← links)
- Choosing a random peer in Chord (Q2461543) (← links)
- A peer-to-peer expressway over Chord (Q2476119) (← links)
- Multidimensional range queries on hierarchical Voronoi overlays (Q2628794) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- Service provisioning for a next-generation adaptive grid (Q2997897) (← links)
- (Q3046663) (← links)
- Text-based content search and retrieval in ad-hoc P2P communities (Q3046668) (← links)
- Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems (Q3078395) (← links)
- A routing algorithm for risk-scanning agents using ant colony algorithm in P2P network (Q3445981) (← links)
- Novel architectures for P2P applications (Q3580946) (← links)
- A Disconnection-Aware Mechanism to Provide Anonymity in Two-Level P2P Systems (Q3612884) (← links)
- (Q4413413) (← links)
- (Q4414405) (← links)
- (Q4414521) (← links)
