Application-level multicast using content-addressable networks
From MaRDI portal
Recommendations
Cited in
(50)- A note on models for graph representations
- Flood search under the California split rule.
- Scalable multicasting: The core-assisted mesh protocol
- Concurrent maintenance of rings
- Randomized leader election
- A case for passive application layer multicast
- Practical load balancing for content requests in peer-to-peer networks
- Optimal inter-object correlation when replicating for availability
- Analysis of randomized protocols for conflict-free distributed access
- Choosing a random peer in Chord
- A flexible concast-based grouping service
- Using bidirectional links to improve peer-to-peer lookup performance
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
- A clustering scheme in application layer multicast
- A new delivery scheme for 1-to-N multicast applications
- Scalable adaptive hierarchical clustering
- A method for any-source capacity-constrained overlay multicast
- Markov chains competing for transitions: application to large-scale distributed systems
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
- PercolationNET: A multi-tree P2P overlay network supporting high coverage search
- Reliable resource searching in P2P networks
- A statistical construction of power-law networks
- Percolation-based replica discovery in peer-to-peer grid infrastructures
- A Disconnection-Aware Mechanism to Provide Anonymity in Two-Level P2P Systems
- A New Class of Data Dissemination Algorithms for Multicast Protocols
- Semantic indexing in structured peer-to-peer networks
- Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks
- Araneola: a scalable reliable multicast system for dynamic environments
- Beacon: A hierarchical network topology monitoring system based on IP multicast
- Bandwidth measurements of ALM trees for content distribution
- SCAN: A dynamic, scalable, and efficient content distribution network
- Internet indirection infrastructure
- \(D^2\)-tree: a new overlay with deterministic bounds
- Tight bounds on the upload capacity to enable two-hop delivery in peer-to-peer video streaming systems
- The analysis of Kademlia for random IDs
- Principles of Distributed Systems
- Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance
- Scalable and dynamic quorum systems
- A decentralized algorithm for spectral analysis
- Fault-tolerant graph realizations in the congested clique
- Maintaining the Ranch topology
- Towards a scalable and robust DHT
- Degree-optimal routing for P2P systems
- The Web services resource framework in a peer-to-peer context
- Parallel overlays for high data-rate multicast data transfer
- Adaptive peer-to-peer streaming with MutualCast
- BulkTree: an overlay network architecture for live media streaming
- Balls into non-uniform bins
- Content subscribing mechanism in P2P streaming based on gamma distribution prediction
- Reducing communication costs in robust peer-to-peer networks
This page was built for publication: Application-level multicast using content-addressable networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473321)
