Skip to main content
SpringerLink
Log in

An Approach to Seeking Policy Disputes Based on Dispute Cycle Avoidance and Configuration Guideline

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

The Border Gateway Protocol (BGP) is the de facto interdomain routing protocol used to exchange network reachability information between ASes in the global Internet. However, Varadhan et al. [19] has shown that the conflict of BGP routing policies can cause BGP to diverge. This paper presents an approach to seek the set of conflict routing policies based on dispute cycle avoidance. The stable paths problem, a static formalism that captures the semantics of interdomain routing protocol, provides the theoretical foundation for this approach. And this approach draws on the simple path vector protocol to identify the dispute cycles that cause routing oscillation first, and then queries which routing policies lead to these cycles in a distributed manner. Finally, it determines conflict routing policies based on dispute cycle avoidance. Moreover, we present a method to determine the severity level of dispute routing policies based on AS relationships and configuration guidelines of routing policy presented by Gao and Rexford [4]. And this method can help Network administrators determine the top-priority routing policies to be fixed and improve the efficiency of debugging routing policies. In addition, a simulation instance is given in order to explain results of this method.

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

Similar content being viewed by others

References

  1. C. Aleattinoglu, Scalable router configuration for the Internet, in: Proc. of IEEE IC3N'96, 1996.

  2. C. Aleattinoglu, C. Villamizar and E. Gerich, Routing policy specification language (RPSL), RFC 2622 (1999).

  3. K. Bhargavan, D. Obradovic and C. Gunter, Formal verification of standards for distance vector routing protocols, Journal of the ACM 49(4) (2002) 538–576.

    Google Scholar 

  4. L. Gao and J. Rexford, Stable Internet routing without global coordination, IEEE/ACM Transactions on Networking 9(6) (2001) 681–692.

    Google Scholar 

  5. R. Govindan, C. Alaettinoglu, G. Eddy, D. Kessens, S. Kumar and W.S. Lee, An architecture for stable, analyzable Internet routing, IEEE Network 13(1) (1999) 29–35.

    Google Scholar 

  6. T. Griffin, F.B. Shepherd and G. Wilfong, Policy disputes in path vector protocols, in: Proc. of ICNP'99, 1999.

  7. T. Griffin and G. Wilfong, An analysis of BGP convergent properties, in: Proc. of ACM SIGCOMM'99, 1999.

  8. T. Griffin and G. Wilfong, A safe path vector protocol, in: Proc. of IEEE INFOCOM 2000, Vol. 2, 2000, pp. 490–499.

    Google Scholar 

  9. S. Halabi and D. McPherson, Internet Routing Architectures, 2nd ed. (Cisco Press, Indianapolis, 2001).

    Google Scholar 

  10. C. Hendrick, Routing information protocol, RFC 1058 (1988).

  11. G. Huston, Interconnection, peering and settlements-part I, Internet Protocol Journal (1999).

  12. C. Labovitz, G.R. Malan and F. Jahanian, Internet routing instability, ACM SIGCOMM Computer Communication Review 27(4) (1997) 115–126.

    Google Scholar 

  13. C. Labovitz, G.R. Malan and F. Jahanian, Origins of Internet routing instability, in: Proc. of IEEE INFOCOM'99, 1999, pp. 218–226.

  14. C. Labovitz, R. Wattenhofer, S. Venkatachary and A. Ahuja, The impact of Internet policy and topology on delay routing convergence, in: Proc. of IEEE INFOCOM 2001, 2001.

  15. V. Paxson, End-to-end routing behavior in the Internet, IEEE/ACM Transactions on Networking 5(5) (1997) 601–615.

    Google Scholar 

  16. Y. Rekhter and T. Li, A border gateway protocol, RFC 1771 (BGP version 4) (1995).

  17. J.W. Stewart, BGP4, Interdomain Routing in the Internet (Addison-Wesley, Reading, MA, 1998).

    Google Scholar 

  18. K. Varadhan, R. Govindan and D. Estrin, Persistent route oscillations in interdomain routing, USC/ISI Technical Report 96-631 (1996).

  19. C. Villamizar, R. Chandra and R. Govindan, BGP route flap damping, RFC 2439 (1998).

  20. C. Zhang, R. Qu and Y. Gao, Visualized interdomain routing modeling language, Journal of Northeastern University Natural Science (2003) to appear.

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, Northeastern University, 143 Taishan Rd., Economic and Technical Development Zone, Qinhuangdao, Hebei, China, 066004

    Chunhong Zhang & Yuan Gao

  2. Electrical and Computer Engineering, University of Massachusetts, 207 Knowles Engineering Building, Amherst, MA, 01002, USA

    Lixin Gao

Authors
  1. Chunhong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuan Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lixin Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, C., Gao, Y. & Gao, L. An Approach to Seeking Policy Disputes Based on Dispute Cycle Avoidance and Configuration Guideline. Telecommunication Systems 24, 293–322 (2003). https://doi.org/10.1023/A:1026179216383

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026179216383

Search

Navigation