Copyright © 2004 Elsevier B.V. All rights reserved.
DINCast: a hop efficient dynamic multicast infrastructure for P2P computing
Available online 19 May 2004.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Efficient communications among computers participating in peer-to-peer (P2P) computing remains a problem when they are geographically distributed across multiple network domains. In this paper, we propose DINCast to support group communications required in P2P computing. DINCast is built on top of an existing P2P multicast tree and results in a hop efficient dynamic multicast infrastructure. We show that DINCast is able to reduce communications delay compared with the original tree-based multicast. DINCast is also advantageous since it can achieve load balance and data persistency.
Author Keywords: DINCast; Tree-based multicast; DIN-Loop; Hop count; Peer-to-peer computing
Article Outline
- 1. Introduction
- 2. Overview of DINCast
- 3. Details of DINCast
- 3.1. Hop depth
- 3.2. Discovery of DIN-Nodes
- 3.3. Automatic formation of loop
- 3.4. Optimization of loop
- 3.5. DIN-Node state
- 3.6. Leaving the DIN-Loop
- 3.7. Fault detection
- 4. Experimental results
- 5. Conclusion
- References
- Vitae







E-mail Article
Add to my Quick Links

Cited By in Scopus (2)






