Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

An Impact of Addressing Schemes on Routing Scalability

  • Ma, Huaiyuan (Centre for Quantifiable Quality of Service in Communication Systems. Norwegian University of Science and Technology) ;
  • Helvik, Bjarne E. (Centre for Quantifiable Quality of Service in Communication Systems. Norwegian University of Science and Technology) ;
  • Wittner, Otto J. (IoU Department, UNINETT)
  • Received : 2011.05.08
  • Published : 2011.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.

Keywords

References

  1. D. Meyer, L. Zhang, and K. Fall, Report from the lAB workshop on routing and addressing, Internet Engineering Task Force, 2007.
  2. D. Farinacci, V. Fuller, D. Oran, D. Meyer, and S. Brin, "Locator/ID separation protocol", IETF Trust, Oct. 10, 2008.
  3. C. Vogt, "Six/one router: A scalable and backwards compatible solution for provider-independent addressing," in Proc. MobiArch, New York, NY, USA, 2008, pp. 13-18.
  4. L. Zhang, "An overview of multihoming and open issues in gse," IETF Journal, Dec. 11, 2006.
  5. X. Zhang, P. Francis, J. Wang, and K. Yoshida, "Scaling ip routing with the core router-integrated overlay," in Proc. IEEE ICNP, Washington, DC, USA, 2006, pp. 147-156.
  6. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology;' in Proc. SIGCOMM, New York, NY, USA, 1999, pp.251-262.
  7. D. Krioukov, K. Claffy, K. Fall, and A. Brady, "On compact routing for the internet," in Proc. ACM SIGCOMM Comput. Commun, Rev., vol. 37, no. 3, 2007, pp. 41-52. https://doi.org/10.1145/1273445.1273450
  8. A. Brady and L. Cowen, "Compact routing on power law graphs with additive stretch," in Proc. ALENEX, 2006.
  9. I. Norros, "Powemet: Compact routing on internet-like random networks," in Proc. NGI, July 2009, pp. 1-8.
  10. H. Ma, B. E. Helvik, and O. J. Wittner, "A compact routing scheme with lower stretch," in Proc. NTMS, Dec. 2009, pp. 1-5.
  11. I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup, "Compact name-independent routing with minimum stretch," in Proc. SPAA, New York, NY, USA, 2004, pp. 20-24.
  12. H. Ma, O. J Wittner, and B. E Helvik, "A stochastic clustering algorithm for swarm compact routing," in Proc. NGI, Aveiro, Portugal, July 2009.
  13. L. J. Cowen. "Compact routing with minimum stretch," in Proc. SODA, Philadelphia, PA, USA, 1999, pp. 255-260.
  14. M. Thorup and U. Zwick, Compact Routing Schemes. ACM Press, pp. 1-10, 2001.
  15. R. Winter. "Two steps towards practical compact routing," in Proc. lTC, Paris, France, Sept. 2009, pp. 1-8.
  16. H. Ma, B. E. Helvik, and O. J. Wittner, "The stability of compact routing in dynamic inter-domain networks," in Proc. CTRQ, June 2010, pp. 1-5.
  17. X. Dimitropoulos and G. Riley, "Modeling autonomous-system relationships," in Proc. PADS, Washington, DC, USA, 2006, pp. 143-149.
  18. C. Jin, Q. Chen, and S. Jamin, "Inet: Internet topology generator," University of Michigan at Ann Arbor, Tech. Rep. CSE-TR-433--00, 2000.
  19. X. Dimitropoulos, D. Krioukov, A. Vahdat, and G. Riley, "Graph annotations in modeling complex network topologies," ACM Trans. Model, Comput. Simul. (TOMACS), vol. 19, no. 4, 2009.
  20. X. Dimitropoulos, D. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, K. claffy, and G. Riley, "AS relationships: Inference and validation," SIGCOMM Comput. Commun. Rev., vol. 37, no. 1, pp. 29-40, 2007. https://doi.org/10.1145/1198255.1198259
  21. X. Dimitropoulos, D. Krioukov, B. Huffaker, K. Claffy, and G. Riley. "Inferring AS relationships: Dead end or lively beginning?" in Proc. 4th Workshop on Efficient and Experimental Algorithms, Santorini,Greece, Jan. 2005, pp. 113-125.
  22. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan "Chord: A scalable peer-to-peer lookup service for Internet applications," in Proc. ACM SIGCOMM, San Diego, CA, USA, Aug. 2001.