Journal of Electronics (China)

, Volume 27, Issue 3, pp 363–370 | Cite as

Reducing burst packet loss through route-free forwarding

  • Hailong Ma
  • Yunfei Guo
  • Dongnian Cheng
  • Jianwei Zhang


It is well known that today’s inter-domain routing protocol, Border Gateway Protocol (BGP), converges slowly during network failures. Due to the distribution nature of Internet routing decisions and the rate-limiting timer Minimum Route Advertisement Interval (MRAI) of BGP, unavoidable convergence latency is introduced in reaction to network changes. During the period of convergence temporarily routing table inconsistencies cause short-term routing blackholes and loops which result in widespread temporary burst packet loss. In this paper, we present ROute-Free Forwarding (ROFF) — a novel technique for packet delivering continuously during periods of convergence. With slightly modifications on IP packet header and BGP, route loops and blackholes can be avoided. Our preliminary evaluation demonstrates that ROFF succeeds in reducing the number of Autonomous Systems (ASes) which experience burst packet loss and the duration of packet loss.

Key words

Border Gateway Protocol (BGP) Loop-free Blackhole Forwarding 

CLC index



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C. Labovitz, A. Ahuja, A. Bose, et al.. Delayed Internet routing convergence. IEEE/ACM Transactions on Networking, 9(2001)3, 293–306.CrossRefGoogle Scholar
  2. [2]
    F. Wang, Z. M. Mao, J. Wang, et al.. A measurement study on the impact of routing events on end-to-end Internet path performance. ACM Special Interest Group on Data Communication, Pisa, Italy, 2006, 375–386.Google Scholar
  3. [3]
    D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, et al.. Resilient overlay networks. ACM SIGOPS Operating Systems Review, 35(2001)5, 131–145.MATHCrossRefGoogle Scholar
  4. [4]
    Y. Rekhter and T. Li. A Border Gateway Protocol 4 (BGP-4). RFC 4271, IETF, 2006.Google Scholar
  5. [5]
    U. Hengartner, S. Moon, R. Mortier, et al.. Detection and analysis of routing loops in packet traces. Internet Measurement Conference, Marseille, France, 2002, 107–112.Google Scholar
  6. [6]
    D. Pei, X. Zhao, D. Massey, et al.. A study of BGP path vector route looping behavior. The 24th International Conference on Distributed Computing Systems, Tokyo, Japan, 2004, 720–729.Google Scholar
  7. [7]
    D. Pei, M. Azuma, D. Massey, et al.. BGP-RCN: Improving BGP convergence through root cause notification. Computer Networks, 48(2005)2, 175–194.MATHCrossRefGoogle Scholar
  8. [8]
    J. Lou, J. Xie, R. Hao, et al.. An approach to accelerate convergence for path vector protocol. IEEE Global Telecommunication Conference, Taipei, 2002, Vol. 3, 2390–2394.Google Scholar
  9. [9]
    J. Chandrashekar, Z. Duan, and Z.-L. Zhang. Limiting path exploration in BGP. The 24th IEEE Conference on Computer Communications, Miami, USA, 2005, Vol. 4, 2337–2348.Google Scholar
  10. [10]
    A. Bremler-Barr, Y. Afek, and S. Schwarz. Improved BGP convergence via ghost flushing. IEEE Journal on Selected Areas in Communications, 22(2004)10, 1933–1948.CrossRefGoogle Scholar
  11. [11]
    D. Pei, X. L. Zhao, L. Wang, et al.. Improving BGP convergence through consistency assertions. The 21th IEEE Conference on Computer Communications, New York, USA, 2002, Vol. 2, 902–911.Google Scholar
  12. [12]
    N. Kushman, S. Kandula, D. Katabi, et al.. R-BGP: Staying connected in a connected world. the 4th USENIX Symposium on Networked System Design & Implementation, Cambridge, MA, USA, 2007, 341–354.Google Scholar
  13. [13]
    F. Wang and L. Gao. A backup route aware routing protocol-Fast recovery from transient routing failures. the 27th IEEE Conference on Computer Communications, Phoenix, AZ, USA, 2008, 2333–2341.Google Scholar
  14. [14]
    Y. Liao, L. Gao, R. Guerin, et al.. Reliable interdomain routing through multiple complementary routing process. International Conference on Emerging Networking Experiments and Technologies, Madrid, Spain, 2008, 49–54.Google Scholar
  15. [15]
    A. Ermolinskiy and S. Shenker. Reducing transient disconnectivity using anomaly-cognizant forwarding. The 7th ACM Workshop on Hot Topics in Networks, Calgary, Canada, 2008, 91–96.Google Scholar
  16. [16]
    Simple BGP Simulator. March 22, 2009.
  17. [17]
    Y. He, M. Faloutsos, S. V. Krishnamurthy, et al.. Policy-aware topologies for efficient inter-domain routing evaluations. The 27th IEEE Conference on Computer Communications, 2008, Phoenix, AZ, USA, 2342–2350.Google Scholar
  18. [18]
    J. Qiu, F. Wang, and L. Gao. BGP rerouting solutions for transient routing failures and loops. Military Communications Conference, 2006, Washington, USA, 1–7.Google Scholar
  19. [19]
    W. Xu and J. Rexford. MIRO: Multi-path interdomain rouing. ACM Special Interest Group on Data Communication, 2006, New York, USA, 171–182.Google Scholar
  20. [20]
    F. Wang and L. Gao. Path diversity aware interdomain routing. The 28th IEEE Conference on Computer Communications, 2009, Rio de Janeiro, Brazil, 307–315.Google Scholar
  21. [21]
    J. P. John, E. Katz-Bassett, A. Krishnamurthy, et al.. Consensus routing: the Internet as a distributed system. the 5th USENIX Symposium on Networked System Design & Implementation, 2008, San Francisco, CA, USA, 351–364.Google Scholar
  22. [22]
    K. Lakshminarayanan, M. Caesar, M. Rangan, et al.. Achieving convergence-free routing using failure-carrying packets. ACM Special Interest Group on Data Communication, 2007, Kyoto, Japan, 241–252.Google Scholar

Copyright information

© Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Hailong Ma
    • 1
    • 3
  • Yunfei Guo
    • 1
  • Dongnian Cheng
    • 1
  • Jianwei Zhang
    • 2
  1. 1.National Digital Switching System Engineering and Technology Research CenterZhengzhouChina
  2. 2.School of Computer Science and Communication EngineeringZhengzhou University of Light IndustryZhengzhouChina
  3. 3.ZhengzhouChina

Personalised recommendations