Article

Forwarding deflection in multi-area OSPF

Authors:

Stefano Iasi,

Pierre François,

Steve UhligAuthors Info & Claims

CoNEXT '05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology

Pages 254 - 255

https://doi.org/10.1145/1095921.1095967

Published: 24 October 2005 Publication History

Get Access

Abstract

Multiple areas in OSPF have been introduced to improve the scalability of IGP routing in large networks. The principle is to partition the links of the network into areas, each link belonging to a single area. In this paper, we show that the way OSPF routers compute their routes makes it possible for deflection to arise, i.e. the forwarding path followed by IP packets differs from the routing path computed by the routing protocol. We give a necessary and sufficient condition for deflection to arise in a domain, and describe how to detect it. The goal is to provide a tool to decide where to establish OSPF virtual links to remove the deflection. The detection of deflection will be implemented in C-BGP [1], an open-source routing solver.

References

[1]

B. Quoitin, "C-BGP, an efficient BGP simulator," http://cbgp.info.ucl.ac.be/, September 2003.

Google Scholar

[2]

J. Moy, "OSPF Version 2," Internet Engineering Task Force, RFC2328, April 1998.

Google Scholar

[3]

P. Francois and O. Bonaventure, "Avoiding transient loops during IGP Convergence in IP Networks," in Proc. of IEEE INFOCOM, March 2005.

Google Scholar

Cited By

View all

Vanbever LVissicchio SPelsser CFrancois PBonaventure O(2012)Lossless migrations of link-state IGPsIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2012.219076720:6(1842-1855)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1109/TNET.2012.2190767
Vanbever LVissicchio SPelsser CFrancois PBonaventure O(2011)Seamless network-wide IGP migrationsACM SIGCOMM Computer Communication Review10.1145/2043164.201847341:4(314-325)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.1145/2043164.2018473
Vanbever LVissicchio SPelsser CFrancois PBonaventure OKeshav SLiebeherr JByers JMogul J(2011)Seamless network-wide IGP migrationsProceedings of the ACM SIGCOMM 2011 conference10.1145/2018436.2018473(314-325)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.1145/2018436.2018473

Index Terms

Forwarding deflection in multi-area OSPF
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

Avoiding instability during graceful shutdown of multiple OSPF routers

Many recent router architectures decouple the routing engine from the forwarding engine, allowing packet forwarding to continue even when the routing process is not active. This opens up the possibility of using the forwarding capability of a router ...
Dynamics of hot-potato routing in IP networks

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, ...
Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks

The routing is one of the key problems in delay tolerant networks (DTNs) because the source and destination often could not find a contemporaneous end-to-end path. In this paper, with the objective of reducing the number of copies, we propose two ...

Comments

Information & Contributors

Information

Published In

CoNEXT '05: Proceedings of the 2005 ACM conference on Emerging network experiment and technology

October 2005

318 pages

ISBN:159593197X

DOI:10.1145/1095921

General Chairs:
Michel Diaz
LAAS-CNRS, France
,
Arturo Azcorra
University Carlos III de Madrid, Spain
,
Program Chairs:
Philippe Owezarski
LAAS-CNRS, France
,
Serge Fdida
Universitè P&M Curie (Paris 6), France

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
272
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vanbever LVissicchio SPelsser CFrancois PBonaventure O(2012)Lossless migrations of link-state IGPsIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2012.219076720:6(1842-1855)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1109/TNET.2012.2190767
Vanbever LVissicchio SPelsser CFrancois PBonaventure O(2011)Seamless network-wide IGP migrationsACM SIGCOMM Computer Communication Review10.1145/2043164.201847341:4(314-325)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.1145/2043164.2018473
Vanbever LVissicchio SPelsser CFrancois PBonaventure OKeshav SLiebeherr JByers JMogul J(2011)Seamless network-wide IGP migrationsProceedings of the ACM SIGCOMM 2011 conference10.1145/2018436.2018473(314-325)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.1145/2018436.2018473

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Avoiding instability during graceful shutdown of multiple OSPF routers

Dynamics of hot-potato routing in IP networks

Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Avoiding instability during graceful shutdown of multiple OSPF routers

Dynamics of hot-potato routing in IP networks

Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations