Evaluation of path stretch in scalable routing system

Original Article
First Online:
Received:
Accepted:

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.

Keywords

Routing Path stretch Evaluation 
This is a preview of subscription content, log in to check access.

Notes

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.

References

  1. 1.
    APNIC website. https://www.apnic.net/
  2. 2.
    Xu J (2000) Scalable routing design principles. IETF RFC 2791Google Scholar
  3. 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, 2007Google Scholar
  4. 4.
    Francis P, Ballani H, Cao T (2008) Virtual aggregation: a configuration-only approach to reducing FIB size. Cornell technical reportGoogle Scholar
  5. 5.
    Zhang B, Zhang L (2009) Evolution towards global routing scalability. Internet draft draft-zhang-evolution-00.txt, March 4, 2009Google Scholar
  6. 6.
    Ballani H, Francis P, Cao T, Wang J (2008) ViAggre: making routers last longer! In: Proc. ACM HotNets VII, 2008Google Scholar
  7. 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, 2008Google Scholar
  8. 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 2007Google Scholar
  9. 9.
    Massey D, Wang L, Zhang B, Zhang L (2007) A scalable routing system design for future internet. In: Proc. ACM SIGCOMMGoogle Scholar
  10. 10.
    Davies E, Doria A (2008) Analysis of inter-domain routing requirements and history. Internet Draft draft-irtf-routing-history-07.txt, Jan 2008Google Scholar
  11. 11.
    Farinacci D, Fuller V, Oran D (2007) Locator/ID separation protocol (LISP). Internet DraftGoogle Scholar
  12. 12.
    Vogt C (2008) Desihn taxonomy and analysis for address-indirection-based routing scalability improvementsGoogle Scholar
  13. 13.
    Medina A, Matta I, Byers J (2000) Brite: a flexible generator of internet topologiesGoogle Scholar
  14. 14.
    BGP routing table analysis reports. http://bgp.potaroo.net/
  15. 15.
    Francis P, Xu X, Ballani H (2009) FIB suppression with virtual aggregation. IETF Internet Draft. draft-francis-intra-va-00.txt, February 2009Google Scholar
  16. 16.
    Francis P, Ballani H, Cao T (2008) Virtual aggregation: a configuration-only approach to reducing FIB size. Technical reportGoogle Scholar
  17. 17.
    Farinacci D, Fuller V, Meyer D, Lewis D (2011) LISP alternative topology (LISP+ALT). draft-itef-lisp-alt-10, December 2011Google Scholar
  18. 18.
    Lewis D, Meyer D, Farinacci D (2013) Interworking between Locator/ID Separation Protocol (LISP) and Non-LISP Sites. RFC 6832, January 2013Google Scholar
  19. 19.
    Schulzrinne H, Wedlund E (2000) Application-layer mobility using SIP. SIGMOBILE Mob. Comput. Commun. Rev., vol 4, no 3, pp 47–57, July, 2000Google Scholar
  20. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Zhongxing Ming
    • 1
  • Huibin Wang
    • 2
  • Mingwei Xu
    • 1
  • Dai Pan
    • 3
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina
  2. 2.College of Mathematics and Information TechnologyXingtai UniversityXingtaiChina
  3. 3.Oudmon TechnologyShenzhenChina

Personalised recommendations