Pastry

swMATH11775MaRDI QIDQ23714

No author found.

Related Items (64)

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 ⋮ Degree-optimal routing for P2P systems ⋮ Towards worst-case churn resistant peer-to-peer systems ⋮ A novel approach to adaptive content-based subscription management in DHT-based overlay networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simple efficient load-balancing algorithms for peer-to-peer systems ⋮ Survey of DHT topology construction techniques in virtual computing environments ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The price of validity in dynamic networks ⋮ Corona: a stabilizing deterministic message-passing skip list ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Top-\(k\) vectorial aggregation queries in a distributed environment ⋮ Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks ⋮ 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 ⋮ Concurrent maintenance of rings ⋮ Randomized leader election ⋮ 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 ⋮ Sublinear bounds for randomized leader election ⋮ Service provisioning for a next-generation adaptive grid ⋮ Echo: a peer-to-peer clustering framework for improving communication in DHTs ⋮ Application execution management on the integrade opportunistic grid middleware ⋮ Maintaining the Ranch topology ⋮ Enabling dynamic querying over distributed hash tables ⋮ Minha: Large-scale distributed systems testing made practical ⋮ Choosing a random peer in Chord ⋮ \(D^2\)-tree: a new overlay with deterministic bounds ⋮ A peer-to-peer expressway over Chord ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ Novel architectures for P2P applications ⋮ MAAN: A multi-attribute addressable network for grid information services ⋮ SKY: efficient peer-to-peer networks based on distributed Kautz graphs ⋮ Reliable Distributed Systems ⋮ 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 ⋮ Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems ⋮ Investigating the existence and the regularity of logarithmic Harary graphs ⋮ Byzantine agreement with homonyms ⋮ Free-riders impact on throughputs of peer-to-peer file-sharing systems ⋮ The Analysis of Kademlia for Random IDs ⋮ 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

This page was built for software: Pastry