Skip to main content
SpringerLink
Log in

Evaluation of path stretch in scalable routing system

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

Path stretch may happen in scalable routing system, which increases delay to packet transmission and decreases network performance. Inter-AS collaboration may minimize the path stretch, while on the other hand brings in extra collaboration cost. At present, there is no systematic research on path stretch. This paper analyzes the cause of path stretch in scalable routing system, quantitatively studies the relationship between path stretches, scalable routing evolution and inter-AS collaboration, as well as the collaboration cost under different collaboration strategies. We conclude that path stretch is greatly affected by collaboration strategy and the tradeoff between the path stretch and collaboration cost is worth considering.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. APNIC website. https://www.apnic.net/

  2. Xu J (2000) Scalable routing design principles. IETF RFC 2791

  3. Massey D, Wang L, Zhang B, Zhang L (2007) A scalable routing system design for future internet. In: Proc. ACM SIGCOMM workshop IPv6, Aug, 2007

  4. Francis P, Ballani H, Cao T (2008) Virtual aggregation: a configuration-only approach to reducing FIB size. Cornell technical report

  5. Zhang B, Zhang L (2009) Evolution towards global routing scalability. Internet draft draft-zhang-evolution-00.txt, March 4, 2009

  6. Ballani H, Francis P, Cao T, Wang J (2008) ViAggre: making routers last longer! In: Proc. ACM HotNets VII, 2008

  7. Jen D, Zhang L, Wang L, Zhang B (2008) Towards a future internet architecture: arguments for separating edges from transit core. In: Proc. ACM HotNets VII, 2008

  8. Dicheva D, Dichev C, Massey D, Wang L, Zhang B, Zhang L (2007) A proposal for scalable internet routing & addressing. Internet Draft draft-wang-ietf-et-00, Feb 2007

  9. Massey D, Wang L, Zhang B, Zhang L (2007) A scalable routing system design for future internet. In: Proc. ACM SIGCOMM

  10. Davies E, Doria A (2008) Analysis of inter-domain routing requirements and history. Internet Draft draft-irtf-routing-history-07.txt, Jan 2008

  11. Farinacci D, Fuller V, Oran D (2007) Locator/ID separation protocol (LISP). Internet Draft

  12. Vogt C (2008) Desihn taxonomy and analysis for address-indirection-based routing scalability improvements

  13. Medina A, Matta I, Byers J (2000) Brite: a flexible generator of internet topologies

  14. BGP routing table analysis reports. http://bgp.potaroo.net/

  15. Francis P, Xu X, Ballani H (2009) FIB suppression with virtual aggregation. IETF Internet Draft. draft-francis-intra-va-00.txt, February 2009

  16. Francis P, Ballani H, Cao T (2008) Virtual aggregation: a configuration-only approach to reducing FIB size. Technical report

  17. Farinacci D, Fuller V, Meyer D, Lewis D (2011) LISP alternative topology (LISP+ALT). draft-itef-lisp-alt-10, December 2011

  18. Lewis D, Meyer D, Farinacci D (2013) Interworking between Locator/ID Separation Protocol (LISP) and Non-LISP Sites. RFC 6832, January 2013

  19. Schulzrinne H, Wedlund E (2000) Application-layer mobility using SIP. SIGMOBILE Mob. Comput. Commun. Rev., vol 4, no 3, pp 47–57, July, 2000

  20. Han D, Liang H, Shen X, Yang L (2014) Subscriber dynamic characteristics-based wireless network accessing bandwidth prediction. Int J Mach Learn Cybern. doi:10.1007/s13042-014-0229-1

  21. Chang W, Zeng D, Chen R, Guo S (2013) An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks. Int J Mach Learn Cybern. doi:10.1007/s13042-013-0195-z

Download references

Acknowledgments

We would like to thank Shu Yang (from Tsinghua University) for helps with the data for evaluation. Besides, before we constructed our new design, communications with Dai Pan (from Peking University) were really helpful for us to understand key factors of scaling problem. Later discussion with Yidong Wang gave us a clearer understanding of his idea when he visited Tsinghua. All people we mentioned above deserve our sincere compliments for their kind contributions to this paper.

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, Beijing, 10084, China

    Zhongxing Ming & Mingwei Xu

  2. College of Mathematics and Information Technology, Xingtai University, Xingtai, 054001, China

    Huibin Wang

  3. Oudmon Technology, Shenzhen, 518100, China

    Dai Pan

Authors
  1. Zhongxing Ming
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huibin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mingwei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dai Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhongxing Ming.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ming, Z., Wang, H., Xu, M. et al. Evaluation of path stretch in scalable routing system. Int. J. Mach. Learn. & Cyber. 6, 339–345 (2015). https://doi.org/10.1007/s13042-014-0285-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-014-0285-6

Keywords

Search

Navigation