The following pages link to (Q4473321):
Displayed 37 items.
- Markov chains competing for transitions: application to large-scale distributed systems (Q352904) (← links)
- Semantic indexing in structured peer-to-peer networks (Q436647) (← links)
- Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks (Q436777) (← links)
- Araneola: a scalable reliable multicast system for dynamic environments (Q436913) (← links)
- \(D^2\)-tree: a new overlay with deterministic bounds (Q494810) (← links)
- Maintaining the Ranch topology (Q666250) (← links)
- Towards a scalable and robust DHT (Q733718) (← links)
- Degree-optimal routing for P2P systems (Q841622) (← links)
- The Web services resource framework in a peer-to-peer context (Q851191) (← links)
- Adaptive peer-to-peer streaming with MutualCast (Q859016) (← links)
- BulkTree: an overlay network architecture for live media streaming (Q859436) (← links)
- Balls into non-uniform bins (Q897392) (← links)
- Content subscribing mechanism in P2P streaming based on gamma distribution prediction (Q926060) (← links)
- Reducing communication costs in robust peer-to-peer networks (Q963355) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Flood search under the California split rule. (Q1426720) (← links)
- Concurrent maintenance of rings (Q1954197) (← links)
- Randomized leader election (Q1954216) (← links)
- Practical load balancing for content requests in peer-to-peer networks (Q2375306) (← links)
- Optimal inter-object correlation when replicating for availability (Q2377265) (← links)
- Analysis of randomized protocols for conflict-free distributed access (Q2461541) (← links)
- Choosing a random peer in Chord (Q2461543) (← links)
- Using bidirectional links to improve peer-to-peer lookup performance (Q2508221) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension (Q3540244) (← links)
- PercolationNET: A multi-tree P2P overlay network supporting high coverage search (Q3550911) (← links)
- Reliable Resource Searching in P2P Networks (Q3556635) (← links)
- A statistical construction of power-law networks (Q3563372) (← links)
- Percolation-Based Replica Discovery in Peer-to-Peer Grid Infrastructures (Q3568534) (← links)
- A Disconnection-Aware Mechanism to Provide Anonymity in Two-Level P2P Systems (Q3612884) (← links)
- A New Class of Data Dissemination Algorithms for Multicast Protocols (Q3628548) (← links)
- Tight Bounds on the Upload Capacity to Enable Two-Hop Delivery in Peer-to-Peer Video Streaming Systems (Q4983544) (← links)
- The Analysis of Kademlia for Random IDs (Q4985806) (← links)
- Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance (Q5490032) (← links)
- Scalable and dynamic quorum systems (Q5917934) (← links)
- A decentralized algorithm for spectral analysis (Q5920385) (← links)
- Fault-tolerant graph realizations in the congested clique (Q6112001) (← links)