ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Future Generation Computer Systems
Volume 21, Issue 3, 1 March 2005, Pages 361-375
P2P computing and interaction with grids
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (526 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.future.2004.04.015    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

DINCast: a hop efficient dynamic multicast infrastructure for P2P computing

H. Q. GuoCorresponding Author Contact Information, E-mail The Corresponding Author, a, L. H. NgohE-mail The Corresponding Author, b, W. C. WongE-mail The Corresponding Author, a, b and J. G. TanE-mail The Corresponding Author, b

a Department of Electrical and Computer Engineering, The National University of Singapore, 2 Engineering Drive 4, Singapore 117584, Singapore b Institute for Infocomm Research, A*STAR, 21 Heng Mui Keng Terrace, Singapore 119613, Singapore

Available online 19 May 2004.

Purchase the full-text article



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
2.1. Overview
2.2. Advantages 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
4.1. DINCast reducing delay
4.1.1. Number of DIN-Nodes
4.1.2. Total node number
4.1.3. Probability of direct link
4.2. Decision table
4.3. Retrieving messages from DIN-Loop
5. Conclusion
References
Vitae













Future Generation Computer Systems
Volume 21, Issue 3, 1 March 2005, Pages 361-375
P2P computing and interaction with grids
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.