Journal of Communications and Networks

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

Shedding Light on the Use of AS Relationships for Path Inference

  • Deng, Wenping (Information Center, National University of Defense Technology) ;
  • Muhlbauer, Wolfgang (Computer Engineering and Networks Laboratory) ;
  • Yang, Yuexiang (Information Center, National University of Defense Technology) ;
  • Zhu, Peidong (School of Computer, National University of Defense Technology) ;
  • Lu, Xicheng (School of Computer, National University of Defense Technology) ;
  • Plattner, Bernhard (Computer Engineering and Networks Laboratory)
  • Received : 2011.07.14
  • Accepted : 2012.04.02
  • Published : 2012.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Autonomous system (AS) business relationships and their inference have been widely studied by network researchers in the past. An important application of inferred AS relationships can be the prediction of AS paths between a source and destination AS within a model. However, besides knowing the topology and inferred AS relationships, AS path prediction within a model needs to be understood in order for us to know how we can derive border gateway protocol (BGP) policies from AS relationships. In this paper, we shed light onto the predictive capabilities of AS relationships by investigating whether they can be translated into BGP policies such that inferred AS paths are consistent with real AS paths, e.g., paths observed from BGP routing tables. Our findings indicate that enforcing constraints such as the well-known valley-free property and the widely assumed preference of customer routes always results in a very low consistency for AS path inference. In addition, this is true irrespective of whether customer, peer, or provider routes are preferred. Apparently, applying such constraints eliminates many "correct" paths that are observed in BGP routing tables and that are propagated in a simple shortest path model where AS relationships are ignored. According to our findings, deriving BGP routing policies for predicting with high accuracy AS paths in a model directly from AS relationships is still difficult.

Keywords

References

  1. Y. Rekhter, T. Li, and S. Hares, "A border gateway protocol 4 (BGP-4)," IETF RFC4271, Jan. 2006.
  2. T. Griffin, F. B. Shepherd, and G. Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 232-243, Apr. 2002. https://doi.org/10.1109/90.993304
  3. "NANOG mailing list," [Online]. Available: http://www.nanog.org/mailinglist.html.
  4. Z. M. Mao, D. Johnson, J. Rexford, J. Wang, and R. Katz, "Scalable and accurate identification of AS-level forwarding paths," in Proc. IEEE INFOCOM, vol. 3, no. 1, Mar. 2004, pp. 1605-1615.
  5. Z. M. Mao, J. Rexford, J. Wang, and R. Katz, "Towards an accurate ASlevel traceroute tool," in Proc. ACM SIGCOMM, Aug. 2003, pp. 365-378.
  6. R. Oliveira, D. Pei, W. Willinger, B. Zhang, and L. Zhang, "The (in)completeness of the observed Internet AS-level structure," IEEE/ACM Trans. Netw., vol. 18, no. 1, pp. 109-122, Feb. 2010. https://doi.org/10.1109/TNET.2009.2020798
  7. R. Bush, O. Maennel, M. Roughan, and S. Uhlig, "Internet optometry: Assessing the broken glasses in Internet reachability," Proc. ACM IMC, pp. 242-253, Nov. 2009.
  8. L. Gao, "On inferring autonomous system relationships in the Internet," IEEE/ACM Trans. Netw., vol. 9, no. 6, pp. 733-745, Dec. 2001. https://doi.org/10.1109/90.974527
  9. X. Dimitropoulos, D. V. Krioukov, M. Fomenkov, B. Huffaker, Y. Hyun, K. C. Claffy, and G. F. Riley, "AS relationships: Inference and validation," ACM SIGCOMM CCR, vol. 37, no. 1, pp. 29-40, Jan. 2007. https://doi.org/10.1145/1198255.1198259
  10. G. D. Battista, T. Erlebach, A. Hall, M. Patrignani, M. Pizzonia, and T. Schank, "Computing the types of the relationships between autonomous systems," IEEE/ACMTrans. Netw., vol. 15, no. 2, pp. 267-280, Apr. 2007.
  11. B. Hummel and S. Kosub, "Acyclic type-of-relationship problems on the Internet: An experimental analysis," in Proc. ACM IMC, Oct. 2007, pp. 221-226.
  12. D. Dolev, S. Jamin, O. O. Mokryn, and Y. Shavitt, "Internet resiliency to attacks and failures under bgp policy routing," Computer Netw., vol. 50, no. 16, pp. 3183-3196, Nov. 2006. https://doi.org/10.1016/j.comnet.2005.11.010
  13. J. Wu, Y. Zhang, Z. M. Mao, and K. Shin, "Internet routing resilience to failures: Analysis and implications," in Proc. ACM CoNEXT, no. 25, Dec. 2007, pp. 1-12.
  14. B. Quoitin and S. Uhlig, "Modeling the routing of an autonomous system with C-BGP," IEEE Netw., vol. 19, no. 6, pp. 12-19, Dec. 2005. https://doi.org/10.1109/MNET.2005.1541716
  15. F. Wang and L. Gao, "On inferring and characterizing Internet routing policies," in Proc. ACM IMC, Oct. 2003, pp. 15-26.
  16. L. Gao and J. Rexford, "Stable Internet routing without global coordination," IEEE/ACM Trans. Netw., vol. 9, no. 6, pp. 681-692, Dec. 2001. https://doi.org/10.1109/90.974523
  17. A. Kind, D. Bauer, D. Dechouniotis, and X. Dimitropoulos, "Valley-free shortest path method," U.S. Patent 7907596, Mar. 15, 2011.
  18. Z. M. Mao, L. Qiu, J. Wang, and Y. Zhang, "On AS-level path inference," in Proc. ACM SIGMETRICS, June 2005, pp. 339-349.
  19. W. Mühlbauer, S. Uhlig, B. Fu, M. Meulle, and O. Maennel, "In search for an appropriate granularity to model routing policies," in Proc. ACM SIGCOMM, Aug. 2007, pp. 145-156.
  20. W. Mühlbauer, A. Feldmann, O. Maennel, M. Roughan, M., and S. Uhlig, "Building an AS-topology model that captures route diversity," in Proc. ACM SIGCOMM, Sept. 2006, pp. 195-206.
  21. "RouteViews," [Online]. Available: http://www.routeviews.org.
  22. M. Caesar and J. Rexford, "BGP routing policies in ISP networks," IEEE Netw., vol. 19, no. 6, pp. 5-11, Nov. 2005. https://doi.org/10.1109/MNET.2005.1541715
  23. H. Chang, R. Govindan, S. Jamin, S. Shenker, and W.Willinger, "Towards capturing representative AS-level Internet topologies," Computer Netw., vol. 44, no. 6, pp. 737-755, Apr. 2004. https://doi.org/10.1016/j.comnet.2003.03.001
  24. T. Griffin, F. Shepherd, and G. Wilfong, "Policy disputes in path-vector protocols," in Proc. ICNP, Oct. 1999, pp. 21-30.
  25. "RIS Raw Data," [Online]. Available: http://www.ripe.net/projects/ris/rawdata.html.
  26. "AS commercial relationship data," [Online]. Available: http://as-rank.caida.org/data/.
  27. J. Doyle, D. Alderson, L. Li, S. Low,M. Roughan,S. Shalunov, R. Tanaka, and W. Willinger, "The "robust yet fragile" nature of the Internet," in Proc. the National Academy of Sciences of the United States of America, vol. 102, no. 41, Oct. 2005, pp. 14497-14502.
  28. R. Teixeira, K. Marzullo, S. Savage, and G. M. Voelker, "Characterizing and measuring path diversity of Internet topologies," in Proc. ACM SIGMETRICS, June 2004, pp. 304-305.
  29. X. Dimitropoulos, D. Krioukov, B. Huffaker, and G. Riley, "Inferring AS relationships: Dead end or lively beginning," in Proc. WEA'05,May 2005, pp. 113-125.
  30. G. Huston, "Interconnection, peering, and settlements," in Proc. INET, June 1999.
  31. L. Gao and F.Wang, "The extent of AS path inflation by routing policies," in Proc. IEEE GLOBECOM, vol. 3, Nov. 2002, pp. 2180-2184.
  32. N. Spring, R. Mahajan, and T. Anderson, "The causes of path inflation," in Proc. ACM SIGCOMM, Aug. 2003, pp. 113-124.
  33. K. Varadhan, R. Govindan, and D. Estrin, "Persistent route oscillations in inter-domain routing," Computer Netw., vol. 32, no. 1, pp. 1-16, Jan. 2000. https://doi.org/10.1016/S1389-1286(99)00108-5
  34. C. T. Ee, V. Ramachandran, B. G. Chun, K. Lakshminarayanan, and S. Shenker, "Resolving inter-domain policy disputes," in Proc. ACM SIGCOMM, Aug. 2007, pp. 157-168.
  35. C. Labovitz, S. Iekel-Johnson, D. McPherson, J. Oberheide, F. Jahanian, and M. Karir, "Internet observatory report," NANOG47, Oct. 2009.
  36. C. Labovitz, S. Iekel-Johnson, D. McPherson, J. Oberheide, and F. Jahanian, "Internet inter-domain traffic," in Proc. ACM SIGCOMM, Aug. 2010, pp. 75-86.
  37. Y. Liao, L. Gao, R. Guerin, and Z. Zhang, "Safe inter-domain routing under diverse commercial aggreements," IEEE/ACMTrans. Netw., vol. 18, no. 6, pp. 1829-1840, Dec. 2011.
  38. J. Qiu and L. Gao, "AS path inference by exploiting known AS paths," in Proc. IEEE GLOBECOM, Nov. 2006, pp. 1-5.
  39. J. Moy, "OSPF Version 2," IETF RFC2328, Apr. 1998.
  40. R. Callon, "Use of OSI IS-IS for routing in TCP/IP and dual environments," IETF RFC1195, Dec. 1990.