An efficient synchronization mechanism for mirrored game architectures
NetGames '02 Proceedings of the 1st workshop on Network and system support for games
Pixie: a jukebox architecture to support efficient peer content exchange
Proceedings of the tenth ACM international conference on Multimedia
Priority-based distribution trees for application-level multicast
NetGames '03 Proceedings of the 2nd workshop on Network and system support for games
An Efficient Synchronization Mechanism for Mirrored Game Architectures
Multimedia Tools and Applications
Universal IP multicast delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
OMNI: an efficient overlay multicast infrastructure for real-time applications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Maximizing total upload in latency-sensitive P2P applications
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Using random subsets to build scalable network services
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Improving the Fault Resilience of Overlay Multicast for Media Streaming
IEEE Transactions on Parallel and Distributed Systems
International Journal of Ad Hoc and Ubiquitous Computing
Araneola: A scalable reliable multicast system for dynamic environments
Journal of Parallel and Distributed Computing
TKS: a transition key management scheme for secure application level multicast
International Journal of Security and Networks
Universal IP multicast delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
OMNI: An efficient overlay multicast infrastructure for real-time applications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
The algorithm for constructing an efficient data delivery tree in host-based multicast scheme
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Localising multicast using application predicates
IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems
Hi-index | 0.00 |
Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency.A node switches parents by disconnecting from its parent and reconnecting to a new parent.If the new parent is well chosen, the performance of the tree is improved overall.We look at the performance of switch-trees using the following metrics: cost, latency, link stress and number of switches.Simulations show switch-tree algorithms can build trees of hundreds of nodes at lessthan twice the optimal cost. In addition, we describe our implementation of a switch-tree protocol.Experiments show that our protocol builds low-cost trees in practice.