Skip to main content
Log in

Analysis and case study on multi-dimensional scalability of the Internet architecture

  • Published:
Science in China Series F: Information Sciences Aims and scope Submit manuscript

Abstract

This paper presents the definition of multi-dimensional scalability of the Internet architecture, and puts forward a mathematical method to evaluate Internet scalability based on a variety of constraints. Then, the method is employed to study the Internet scalability problem in performance, scale and service scalability. Based on the examples, theoretical analysis and experimental simulation are conducted to address the scalability issue. The results show that the proposed definition and evaluation method of multi-dimensional Internet scalability can effectively evaluate the scalability of the Internet in every aspect, thus providing rational suggestions and methods for evaluation of the next generation Internet architecture.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Neuman B C. Scale in Distributed systems. In: Casavant T, Singhal M, eds. Readings in Distributed Computing System. Los Alamitos, CA: IEEE Computer Society Press, 1994. 463–489

    Google Scholar 

  2. Lv Q, Ratnasamy S, Shenker S. Can Heterogeneity Make Gnutella Scalable? IPTPS 2002

  3. Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network. In: Proceedings of SIGCOMM, 2001

  4. Rowstron A, Druschel P. Storage management and caching in PAST, a largescale, persistent peer-to-peer storage utility. In: Proceedings of the Eighteenth SOSP, ACM. 2001

  5. Stoica I, Morris R, Karger D, et al. Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of SIGCOMM, 2001

  6. Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. UCB Technical Report, 2001

  7. Grossglauser M, Tse D. Mobility increases the capacity of ad-hoc wireless networks. In: Proceedings of IEEE Infocom’2001, Anchorage, Alaska, April 2001

  8. Broch J, Maltz D, Johnson D, et al. A performance comparison of multihop wireless ad hoc network routing protocols. In: Proceedings of MOBICOM’98, Dallas, TX, October 1998

  9. Park V D, Corson S. A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing. In: Proceedings of IEEE Symposium on Computers and Communications ISCC’98, Athens, Greece, June 1998

  10. Perkins C E, Royer E M, Das S R, et al. Marina. Performance comparison of two on-demand routing protocols for ad hoc networks. IEEE Person Commun Mag, 2001, 8(1): 16–28

    Article  Google Scholar 

  11. Santivanez C A, McDonald B, Stavrakakis I, et al. On the scalability of ad hoc routing protocols. IEEE INFOCOM’02, New York, June 2002

  12. Arpacioglu O, Small T, Haas Z J. Notes on scalability of wireless ad hoc networks. Internet draft, work in progress, 2003

  13. Yang L, Conner S, Guo X, et al. Common wireless ad hoc network usage scenarios. Internet draft, work in progress, 2003

  14. Billhartz T, Cain J, Farrey-Goudreau E, et al. Performance and resource cost comparisons for the CBT and PIM multicast routing protocols. IEEE J Select Areas Commun, 1997, 15(3): 304–315

    Article  Google Scholar 

  15. Chuang J, Sirbu M. Pricing multicast communication: A cost-based approach. Telecommun Syst, 2001, 17(3): 281–297

    Article  MATH  Google Scholar 

  16. Chalmers R, Almeroth K. Modeling the branching characteristics and efficiency gains in global multicast trees. In: IEEE INFOCOM, 2001. 449–458

  17. He L, Walrand J. Pricing differentiated internet services. IEEE INFOCOM, 2005. 195–204.

  18. Lee S, Jiang J, Chiu D, et al. Interaction of isps: Distributed resource allocation and revenue maximization. IEEE Trans Parallel Distrib Syst, to appear.

  19. Shakkottai S, Srikant R. Economics of network pricing with multiple ISPs. In: IEEE INFOCOM, 2005. 184–194

  20. He L, Walrand J. Pricing and revenue sharing strategies for internet service providers. IEEE INFOCOM, 2005. 942–951

  21. Tang H W, He M F. An Introduction to Mathematic Models (in Chinese). Beijing: Higher Education Press, 2001. 84–86

    Google Scholar 

  22. Caesar M, Condie T, Kannan J, et al. ROFL: Routing on flat labels. SIGCOMM, 2006

  23. Adler M, Rubenstein D. Pricing multicasting in more flexible network models. ACM Trans Algorithms, 2005, 1(1): 48–73

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ke Xu.

Additional information

Supported by the National Basic Research Program of China (973 Program) (Grant No. 2003CB314801), the National High-Tech Research & Development Program of China (863 Program) (Grant Nos. 2008AA01A326, 2006AA01Z205, 2006AA01Z209), and the National Natural Science Foundation of China (Grant No. 90704001)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, K., Xu, M., Li, Q. et al. Analysis and case study on multi-dimensional scalability of the Internet architecture. Sci. China Ser. F-Inf. Sci. 51, 1661–1680 (2008). https://doi.org/10.1007/s11432-008-0151-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-008-0151-9

Keywords

Navigation