Advertisement

SmartBoa: Constructing p2p Overlay Network in the Heterogeneous Internet Using Irregular Routing Tables

  • Jingfeng Hu
  • Ming Li
  • Weimin Zheng
  • Dongsheng Wang
  • Ning Ning
  • Haitao Dong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3279)

Abstract

The high heterogeneity of large-scale p2p system leads us to the philosophy that the size of a node’s routing table and its updating cost should correspond to the node’s capacity. With this philosophy, we design a novel structured overlay: SmartBoa. SmartBoa categorizes nodes into different levels according to their capacities. A node at level k has a routing table with N/2 k entries (N is the system scale). An efficient non-redundant multicast algorithm is introduced to distribute nodes’ changing reports. With the multicast the routing table’s updating cost is in proportion to its size. Node can change its level freely so as to adapt to fluctuation of the system. At the same cost as the O(log N) overlay, SmartBoa maintains with much larger routing tables and has much higher routing efficiency. A low-bandwidth (64 kbps) node can maintain 10,000 routing entries at the cost of only 10 percent of its bandwidth. Without the high bandwidth requirement of an one-hop overlay, SmartBoa is much more scalable.

Keywords

Target Group Multicast Tree Level Node Super Node Structure Overlay 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gupta, A., Liskov, B., Rodrigues, R.: One Hop Lookups for Peer-to-Peer Overlays. HOTOS IX (May 2003)Google Scholar
  2. 2.
    Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: USITS 2003 (March 2003)Google Scholar
  3. 3.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM (August 2001)Google Scholar
  4. 4.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Saroiu, S., Gummadi, P.K., And Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Proceedings of MMCN 2002, San Jose, CA (January 2002)Google Scholar
  6. 6.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM 2001 Conference, San Diego, California (August 2001)Google Scholar
  7. 7.
    Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley (April 2001)Google Scholar
  8. 8.
    Xu, Z., Mahalingam, M., Karlsson, M.: Turning Heterogeneity into an Advantage in Overlay Routing. In: The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003) (April 2003)Google Scholar
  9. 9.
    Zhao, B.Y., Duan, Y., Huang, L., Joseph, A., Kubiatowicz, J.: Brocade: Landmark Routing on Overlay Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 34. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jingfeng Hu
    • 1
  • Ming Li
    • 1
  • Weimin Zheng
    • 1
  • Dongsheng Wang
    • 1
  • Ning Ning
    • 1
  • Haitao Dong
    • 1
  1. 1.Computer Science and Technology DepartmentTsinghua UniversityBeijingChina

Personalised recommendations