Laurel: A Hybrid Overlay Network for Data Distribution
Author:
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [26]
  • |
  • Related [20]
  • |
  • Cited by [1]
  • | |
  • Comments
    Abstract:

    As an infrastructure for data distribution, overlay networks must incorporate efficient routing and adequate robustness in order to achieve fast and accurate data distribution in an environment with a high node churn. Considering that the existing overlay networks mostly focus on a single optimization objective and fail to ensure routing efficiency and robustness. Simultaneously, a hybrid overlay network for data distribution, Laurel, is proposed in this paper. Laurel achieves a better trade-off between routing efficiency and robustness by combining the inter-cluster multiple structured topologies with the intra-cluster unstructured topologies. Laurel also provides mechanisms for a dynamic, concurrent cluster creation, cluster departure, and load balance to make data distribution more adaptive to the dynamic network environment. Experimental results show that compared with existing overlay networks, Laurel can support faster and more accurate data distribution, even when a large amount of nodes fail in the system and balance the load within clusters.

    Reference
    [1] Zhang M, Xu M, Wu J. Survey on application layer multicast. Acta Electronica Sinica, 2004,32(12A):22?25 (in Chinese with English abstract).
    [2] Ma J, Huang T, Wang J, Xu G, Ye D. Underlying techniques for large-scale distributed computing oriented publish/subscribe system. Journal of Software, 2006,17(1):134?147 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/17/134.htm [doi: 10.1360/jos170134]
    [3] National incident management system. 2011. http://www.fema.gov/emergency/nims/
    [4] Network centric warfare. 2011. http://www.dodccrp.org/html4/research_ncw.html
    [5] Eugster PT, Guerraoui R, Kermarrec AM, Massoulie L. Epidemic information dissemination in distributed systems. IEEE Computer, 2004,37(5):60?67. [doi: 10.1109/MC.2004.1297243]
    [6] Gnutella. 2011. http://wiki.limewire.org/index.php?title=GDF
    [7] Clarke I, Sandberg O, Wiley B, Hong T. Freenet: A distributed anonymous information storage and retrieval system. In: Federrath H , ed. Proc. of the Int’l Workshop on Design Privacy Enhancing Technologies. New York: Springer-Verlag, 2001. 46?66.
    [8] Stoica I, Morris R, Liben-Nowell D, Karger DR, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Trans. on Networking, 2003,11(1):17?32. [doi: 10.1109/TNET.2002.808407]
    [9] Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Cruz P, Varghese P, eds. Proc. of the 2001 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2001). New York: ACM, 2001. 161?172. [doi: 10.1145/383059.383072]
    [10] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui R, ed. Proc. of the IFIP/ACM Int’l Conf. on Distributed Systems Platforms (Middleware 2001). London: Springer-Verlag, 2001. 329?350.
    [11] Zhao BY, Huang L, Stribling J, Rhea SC, Joseph AD, Kubiatowicz JD. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 2004,22(1):41?53. [doi: 10.1109/JSAC.2003.818784]
    [12] KaZaA. http://www.kazaa.com/
    [13] eMule. http://www.emule.org/
    [14] Qiao B, Wang G, Ding L. TBSN: A taxonomy hierarchy based P2P network. Journal of Computer Research and Development, 2008,45(5):803?909 (in Chinese with English abstract).
    [15] Shin K, Lee S, Lim G, Yoon H, Ma JS. Grapes: Topology-Based hierarchical virtual network for peer-to-peer lookup services. In: Olariu S, ed. Proc. of the 2002 Int’l Conf. on Parallel Processing Workshops (ICPPW 2002). Washington: IEEE Computer Society, 2002. 159?164. [doi: 10.1109/ICPPW.2002.1039726]
    [16] Hsiao R, Wang S. Jelly: A dynamic hierarchical P2P overlay network with load balance and locality. In: Tzeng NF, Takizawa M, eds. Proc. of the 24th Int’l Conf. on Distributed Computing Systems Workshops (ICDCSW 2004). Washington: IEEE Computer Society, 2004. 534?540. [doi: 10.1109/ICDCSW.2004.1284084]
    [17] Chen Y, Deng B, Li X. Canicula: An improved hybrid overlay networks. In: Wong LWC, Lau LY, eds. Proc. of the 14th IEEE Int’l Conf. on Networks (ICON 2006). Washington: IEEE Computer Society, 2006. 1?6. [doi: 10.1109/ICON.2006.302672]
    [18] Darlagiannis V, Mauthe A, Steinmetz R. Overlay design mechanisms for heterogeneous, large scale, dynamic P2P systems. Journal of Networks and System Management, 2004,12(3):371?395. [doi: 10.1023/B:JONS.0000043686.04679.03]
    [19] Garcés-Erice L, Biersack EW, Felber PA, Ross KW, Urvoy-Keller G. Hierarchical peer-to-peer systems. In: Kosch H, Boszormenyi L, Hellwagner H, eds. Proc. of the 2003 Int’l Conf. on Parallel Processing (Euro-Par 2003). Berlin: Springer-Verlag, 2003. 1230?1239. [doi: 10.1142/S0129626403001574]
    [20] Yang M, Yang Y. An efficient hybrid peer-to-peer system for distributed data sharing. In: Wu J, ed. Proc. of the 22nd IEEE Int’l Symp. on Parallel and Distributed Processing (IPDPS 2008). Washington: IEEE Computer Society, 2008. 1?10. [doi: 10.1109/ IPDPS.2008.4536271]
    [21] Peng Z, Duan Z, Qi J, Cao Y, Lv E. HP2P: A hybrid hierarchical P2P network. In: Dini P, ed. Proc. of the 1st Int’l Conf. on the Digital Society (ICDS 2007). Washington: IEEE Computer Society, 2007. http://ieeexplore.ieee.org/search/freesrchabstract.jsp?tp=&arnumber=4063779&queryText%3DHP2P:+A+Hybrid+Hierarchical+P2P+Network%26openedRefinements%3D*%26searchField%3DSearch+All [doi: 10.1109/ICDS.2007.20]
    [22] Baldoni R, Beraldi R, Quema V, Querzoni L, Tucci-Piergiovanni S. TERA: Topic-Based event routing for peer-to-peer architectures. In: Jacobsen P, ed. Proc. of the 2007 Inaugural Int’l Conf. on Distributed Event-Based Systems (DEBS 2007). New York: ACM, 2007. 2?13. [doi: 10.1145/1266894.1266898]
    [23] Voulgaris S, Gavidia D, van Steen M. CYCLON: Inexpensive membership management for unstructured P2P overlays. Journal of Network and Systems Management, 2005,13(2):197?217. [doi: 10.1007/s10922-005-4441-x]
    [24] Gkantsidis C, Mihail M, Saberi A. Random walks in peer-to-peer networks. In: Li VOK, ed. Proc. of the 23rd Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM 2004). Washington: IEEE Computer Society, 2004. 120?130. [doi: 10.1109/INFCOM.2004.1354487]
    [25] Deshpande M, Xing B, Lazardis I, Hore B, Venkatasubramanian N, Mehrotra S. CREW: A gossip-based flash-dissemination system. In: Raynal M, Ichikawa H, eds. Proc. of the 26th IEEE Int’l Conf. on Distributed Computing Systems (ICDCS 2006). Washington: IEEE Computer Society, 2006. http://ieeexplore.ieee.org/search/freesrchabstract.jsp?tp=&arnumber=1648832&queryText%3DCREW:+A+Gossip-based+Flash-Dissemination+System%26openedRefinements%3D*%26searchField%3DSearch+All [doi: 10.1109/ICDCS.2006.24]
    [26] PeerSim. 2011. http://peersim.sourceforge.net/
    Comments
    Comments
    分享到微博
    Submit
Get Citation

郑重,王意洁,马行空. Laurel:一种混合式数据分发覆盖网.软件学报,2011,22(4):722-735

Copy
Share
Article Metrics
  • Abstract:5413
  • PDF: 6897
  • HTML: 0
  • Cited by: 0
History
  • Received:May 04,2009
  • Revised:October 23,2009
You are the first2043735Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063