[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2670518.2673868acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
tutorial

Sweet Little Lies: Fake Topologies for Flexible Routing

Published: 27 October 2014 Publication History

Abstract

Link-state routing protocols (e.g., OSPF and IS-IS) are widely used because they are scalable, robust, and based on simple abstractions. Unfortunately, these protocols are also relatively inflexible, since they direct all traffic over shortest paths. In contrast, Software Defined Networking (SDN) offers fine-grained control over routing, at the expense of controller overhead, failover latency, and deployment challenges.
We argue that future networks can achieve the benefits of both approaches through central control over the distributed route computation. The key idea, which we call Fibbing, is to have the controller trick the routers into seeing a fake topology that is carefully constructed to achieve the desired Forwarding Information Base (FIB). Given an acyclic forwarding graph for each destination, the controller computes an augmented topology with fake nodes (and destinations to announce there) and fake links (and link weights). The controller injects these "lies" into the link-state routing protocol, and the routers simply compute the paths accordingly. The controller can also select an augmented topology that triggers the use of specific backup paths when real links and routers fail. To reduce router load, our Fibbing algorithms compute augmented topologies of minimal size. Our preliminary evaluation on realistic ISP topologies shows that Fibbing works well in practice.

References

[1]
D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP Tunnels," RFC 3209, 2001.
[2]
A. Farrel, J.-P. Vasseur, and J. Ash, "A Path Computation Element (PCE)-Based Architecture," RFC 4655, 2006.
[3]
A. Pathak, M. Zhang, Y. C. Hu, R. Mahajan, and D. A. Maltz, "Latency inflation with MPLS-based traffic engineering," in Internet Measurement Conference, 2011, pp. 463--472.
[4]
S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski, A. Singh, S. Venkata, J. Wanderer, J. Zhou, M. Zhu, J. Zolla, U. Hölzle, S. Stuart, and A. Vahdat, "B4: Experience with a Globally-Deployed Software Defined WAN," in ACM SIGCOMM, 2013.
[5]
C. Hong, S. Kandula, R. Mahajan, M. Zhang, V. Gill, M. Nanduri, and R. Wattenhofer, "Achieving High Utilization with Software-Driven WAN," in ACM SIGCOMM, 2013.
[6]
S. Vissicchio, L. Vanbever, and O. Bonaventure, "Opportunities and research challenges of hybrid software defined networks," ACM SIGCOMM Computer Communication Review, vol. 44, no. 2, Apr. 2014.
[7]
N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, "OpenFlow: Enabling innovation in campus networks," ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, pp. 69--74, 2008.
[8]
M. Caesar, D. Caldwell, N. Feamster, J. Rexford, A. Shaikh, and J. van der Merwe, "Design and implementation of a routing control platform," in NSDI, 2005.
[9]
J. van der Merwe, A. Cepleanu, K. D'Souza, B. Freeman, A. Greenberg et al., "Dynamic connectivity management with an intelligent route service control point," in INM, 2006.
[10]
B. Fortz and M. Thorup, "Internet traffic engineering by optimizing ospf weights," in INFOCOM, 2000.
[11]
G. Nakibly, E. Menahem, A. Waizel, and Y. Elovici, "Owning the Routing Table. Part II," Black Hat, 2013.
[12]
J. Moy, "OSPF Version 2," RFC 2328, 1998.
[13]
Z. A. Qazi, C.-C. Tu, L. Chiang, R. Miao, V. Sekar, and M. Yu, "SIMPLE-fying Middlebox Policy Enforcement Using SDN," in ACM SIGCOMM, 2013.
[14]
A. Shaikh and A. Greenberg, "OSPF Monitoring: Architecture, Design and Deployment Experience," in NSDI, 2004.
[15]
P. Francois, C. Filsfils, J. Evans, and O. Bonaventure, "Achieving sub-second IGP convergence in large IP networks," ACM SIGCOMM Computer Communication Review, vol. 35, no. 3, pp. 33--44, 2005.
[16]
C. Filsfils, P. Francois, M. Shand, B. Decraene, J. Uttaro, N. Leymann, and M. Horneffer, "LFA applicability in SP networks," RFC 6571, 2012.
[17]
"Gurobi Solver," http://www.gurobi.com/.
[18]
N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with Rocketfuel," in ACM SIGCOMM, 2002.
[19]
D. Levin, M. Canini, S. Schmid, F. Schaffert, and A. Feldmann, "Panopticon: Reaping the Benefits of Incremental SDN Deployment in Enterprise Networks," in USENIX ATC, 2014.
[20]
T. Koponen, K. Amidon, P. Balland, M. Casado, et al., "Network virtualization in multi-tenant datacenters," in NSDI, 2014.

Cited By

View all
  • (2023)A Comprehensive Survey on Knowledge-Defined NetworkingTelecom10.3390/telecom40300254:3(477-596)Online publication date: 2-Aug-2023
  • (2023)A Review of Blockchain Technology in Knowledge-Defined Networking, Its Application, Benefits, and ChallengesNetwork10.3390/network30300173:3(343-421)Online publication date: 30-Aug-2023
  • (2023)Performance Optimization Strategies for Big Data Applications in Distributed FrameworkIntelligent Technologies: Concepts, Applications, and Future Directions, Volume 210.1007/978-981-99-1482-1_10(221-252)Online publication date: 2-Jun-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
HotNets-XIII: Proceedings of the 13th ACM Workshop on Hot Topics in Networks
October 2014
189 pages
ISBN:9781450332569
DOI:10.1145/2670518
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]

Sponsors

In-Cooperation

  • CISCO

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 October 2014

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Fibbing
  2. hybrid SDN
  3. link-state routing

Qualifiers

  • Tutorial
  • Research
  • Refereed limited

Conference

HotNets-XIII
Sponsor:
HotNets-XIII: The 13th ACM Workshop on Hot Topics in Networks
October 27 - 28, 2014
CA, Los Angeles, USA

Acceptance Rates

HotNets-XIII Paper Acceptance Rate 26 of 118 submissions, 22%;
Overall Acceptance Rate 110 of 460 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)14
  • Downloads (Last 6 weeks)2
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2023)A Comprehensive Survey on Knowledge-Defined NetworkingTelecom10.3390/telecom40300254:3(477-596)Online publication date: 2-Aug-2023
  • (2023)A Review of Blockchain Technology in Knowledge-Defined Networking, Its Application, Benefits, and ChallengesNetwork10.3390/network30300173:3(343-421)Online publication date: 30-Aug-2023
  • (2023)Performance Optimization Strategies for Big Data Applications in Distributed FrameworkIntelligent Technologies: Concepts, Applications, and Future Directions, Volume 210.1007/978-981-99-1482-1_10(221-252)Online publication date: 2-Jun-2023
  • (2022)A Routing Strategy with Optimizing Linear Programming in Hybrid SDNIEICE Transactions on Communications10.1587/transcom.2021EBP3126E105.B:5(569-579)Online publication date: 1-May-2022
  • (2022)A novel method to find the best path in SDN using firefly algorithmJournal of Intelligent Systems10.1515/jisys-2022-006331:1(902-914)Online publication date: 21-Jul-2022
  • (2022)Topology Poisoning Attacks and Prevention in Hybrid Software-Defined NetworksIEEE Transactions on Network and Service Management10.1109/TNSM.2021.310909919:1(510-523)Online publication date: Mar-2022
  • (2021)Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP NetworkApplied Sciences10.3390/app11211050411:21(10504)Online publication date: 8-Nov-2021
  • (2021)On the Complexity of Weight-Dynamic Network Algorithms2021 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking52078.2021.9472803(1-9)Online publication date: 21-Jun-2021
  • (2020)A Fast Failure Recovery Scheme for Fibbing NetworksIEEE Open Journal of the Communications Society10.1109/OJCOMS.2020.30181971(1196-1212)Online publication date: 2020
  • (2020)Evaluating the Performance of Fibbing Architecture in the Hybrid Software Defined Network2020 International Conference on Radar, Antenna, Microwave, Electronics, and Telecommunications (ICRAMET)10.1109/ICRAMET51080.2020.9298615(141-145)Online publication date: 18-Nov-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media