A TOKEN-BASED BROADCAST ALGORITHM OVER DHT FOR LARGE-SCALE COMPUTING INFRASTRUCTURES

Kun Huang, Dafang Zhang

Abstract

Scalable and efficient broadcast is essential to the large-scale computing infrastructures such as PlanetLab and Grids. By exploiting the greedy routing mechanisms of Distributed Hash Table (DHT), existing DHT-based broadcast algorithms suffer from the limitations of scalability and load balancing, incurring high construction and maintenance overhead for a distributed broadcast tree (DBT). This paper presents a token-based broadcast algorithm over DHT for the large-scale computing infrastructures, where each node selects the finger nodes as its children by a token value in a top-down approach. Theoretical analysis and experimental results show that the token-based broadcast algorithm can construct and maintain a balanced DBT with low overhead, where the branching factors of each node are at most two, and the tree height is in a Chord of nodes, without any extra storage space and explicit maintenance overhead.

References

  1. Bavier, A., et al., 2004. Operating system support for planetary-scale network services. In: 1st Symposium on Networked Systems Design and Implementation, pp. 253-266.
  2. Foster, I., Kesselman, C., Tuecke, S., 2001. The anatomy of the grid: enabling scalable virtual organizations. International Journal of Supercomputer Applications, 15(3), pp. 200-222.
  3. PlanetLab, 2008. Availabe at: http://www.planet-lab.org.
  4. Renesse, R. V., Birman, K. P., Vogels, W., 2003. Astrolabe: a robust and scalable technology for distributed system monitoring, management, and data mining. ACM Transaction on Computer Systems, 21(2), pp. 164-206.
  5. Yalagandula, P., Dahlin, M., 2004. A scalable distributed information management system. In: ACM SIGCOMM, pp. 379-390.
  6. Oppenheimer, D., Albrecht, J., Patterson, D., Vahdat, A., 2008. Design and implementation tradeoffs for widearea resource discovery. ACM Transactions on Internet Technology, 8(2), pp.1-40.
  7. Jain, N., et al., 2007. STAR: self-tuning aggregation for scalable monitoring. In: Proc. of VLDB, pp. 962-973.
  8. Cai, M, Hwang, K., 2007. Distributed aggregation algorithms with load-balancing for scalable grid resource monitoring. In: 21st International Parallel and Distributed Processing Symposium, Long Beach, California, USA.
  9. Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A., 2002. SCRIBE: a large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communication, 20(8), pp. 1489-1499.
  10. Castro M., et al., 2003. Splitstream: high-bandwidth multicast in cooperative environments. In: 19th ACM Symposium on Operating Systems Principles, pp. 298- 313.
  11. Padmanbhan, V. N., Wang, H. J., Chou, P. A., SripanidKuchai, K., 2002. Distributed streaming media content using cooperative networking. In: ACM NOSSDAV, pp. 177-186.
  12. Kostic, D., Rodriguez, A., Albrecht, J., Vahdat, A., 2003. Bullet: high bandwidth data dissemination using an overlay mesh. In: 19th ACM Symposium on Operating Systems Principles, pp. 282-297.
  13. Cherkasova, L. Lee J., 2003. FastReplica: efficient large file distribution within content delivery networks. In: USENIX Symposium on Internet Technologies and Systems, Seattle, Washington, USA.
  14. Kostic, D., et al., 2005. Maintaining high bandwidth under dynamic network conditions. In: USENIX Annual Technical Conference, pp. 193-208.
  15. Ganguly, S, Saxena, A, Bhatnagar, S, Banerjee, S., 2005. Fast replication in content distribution overlays. In: IEEE INFOCOM, pp. 2246-2256.
  16. Park, K., Pai, V. S., 2006. Scale and performance in the CoBlitz large-file distribution service. In: 3rd Symposium on Networked Systems Design and Implementation, pp. 29-44.
  17. Chu, Y., Rao, S. G., Seshan, S., Zhang, H., 2002. A case for end system multicast. IEEE Journal on Selected Areas in Communication, Special Issue on Networking Support for Multicast, 20(8), pp. 1456- 1471.
  18. Baerjee, S., Bhattacharjee, B., Kommareddy, C., 2002. Scalable application layer multicast. In: ACM SIGCOMM, pp. 205-217.
  19. Zhuang, S., et al., 2001. Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination. In: ACM NOSSDAV, pp. 11-20.
  20. Cohen, B., 2003. Incentives build robustness in BitTorrent. In: Workshop on Economics of Peer-toPeer Systems, Berkeley, California, USA.
  21. Venkataraman, V., Yoshida, K., Fancis, P., 2006. Chunkspread: heterogeneous unstructured end system multicast. In: IEEE ICNP, pp. 2-11.
  22. Wang, F., Xiong, Y., Liu, J., 2007. mTreebone: a hybrid tree/mesh overlay for application-layer live video multicast. In: IEEE ICDCS, Toronto, Ontario, Canada.
  23. Stoica, I., et al., 2001. Chord: a scalable peer-to-peer lookup service for Internet applications. In: ACM SIGCOMM, pp. 149-160.
  24. Ratnasamy, S., et al., 2001. A scalable content addressable network. In: ACM SIGCOMM, pp. 161-172.
  25. Rowstron, A. Druschel, P., 2001. Pastry: scalable, decentralized object location, and routing for largescale peer-to-peer systems. Lecture Notes in Computer Science, 2218, pp. 329-351.
  26. Zhao, B., Kubiatowicz, J., Joseph, A., 2002. Tapestry: a fault-tolerant wide-area application infrastructure. ACM Computer Communication Review, 32(1), pp. 81-81.
  27. Zhang, Z., Shi, S.-M., Zhu, J., 2003. SOMO: selforganized metadata overlay for resource management in P2P DHT. In: International Workshop on Peer-toPeer Systems.
  28. Renesse, R. V., Bozdog, A., 2004. Willow: DHT, aggregation, and publish/subscribe in one protocol. In: International Workshop on Peer-to-Peer Systems.
  29. El-Ansary, S., Alima, L.O., Brand, P., Haridi, S., 2003. Efficient broadcast in structured P2P networks. In: International Workshop on Peer-to-Peer Systems.
  30. Ratnasamy, S., Handley, M., Karp, R., Shenker, S., 2001. Application-level multicast using content-addressable networks. In: International Workshop on Networked Group Communicaion, pp. 14-29.
  31. Bharambe, A. R., et al., 2005. The impact of heterogeneous bandwidth constraints on DHT-based multicast protocols. In: International Workshop on Peer-to-Peer Systems, 2005.
  32. Huang, K., Wang, L., Zhang, D., Liu, Y., 2008. Optimizing the BitTorrent performance using adaptive peer selection strategy. Future Generation Computer Systems, 24(7), pp. 621-630.
Download


Paper Citation


in Harvard Style

Huang K. and Zhang D. (2009). A TOKEN-BASED BROADCAST ALGORITHM OVER DHT FOR LARGE-SCALE COMPUTING INFRASTRUCTURES . In Proceedings of the International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2009) ISBN 978-989-674-008-5, pages 123-130. DOI: 10.5220/0002200101230130


in Bibtex Style

@conference{winsys09,
author={Kun Huang and Dafang Zhang},
title={A TOKEN-BASED BROADCAST ALGORITHM OVER DHT FOR LARGE-SCALE COMPUTING INFRASTRUCTURES},
booktitle={Proceedings of the International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2009)},
year={2009},
pages={123-130},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002200101230130},
isbn={978-989-674-008-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Wireless Information Networks and Systems - Volume 1: WINSYS, (ICETE 2009)
TI - A TOKEN-BASED BROADCAST ALGORITHM OVER DHT FOR LARGE-SCALE COMPUTING INFRASTRUCTURES
SN - 978-989-674-008-5
AU - Huang K.
AU - Zhang D.
PY - 2009
SP - 123
EP - 130
DO - 10.5220/0002200101230130