research-article

Free access

Exploiting locality in distributed SDN control

Authors:

Jukka SuomelaAuthors Info & Claims

HotSDN '13: Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking

Pages 121 - 126

https://doi.org/10.1145/2491185.2491198

Published: 16 August 2013 Publication History

Abstract

Large SDN networks will be partitioned in multiple controller domains; each controller is responsible for one domain, and the controllers of adjacent domains may need to communicate to enforce global policies. This paper studies the implications of the local network view of the controllers. In particular, we establish a connection to the field of local algorithms and distributed computing, and discuss lessons for the design of a distributed control plane. We show that existing local algorithms can be used to develop efficient coordination protocols in which each controller only needs to respond to events that take place in its local neighborhood. However, while existing algorithms can be used, SDN networks also suggest a new approach to the study of locality in distributed computing. We introduce the so-called supported locality model of distributed computing. The new model is more expressive than the classical models that are commonly used in the design and analysis of distributed algorithms, and it is a better match with the features of SDN networks.

References

[1]

Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, and Jara Uitto. Local algorithms in (weakly) coloured graphs, 2010. Manuscript, arXiv:1002.0125 {cs.DC}.

[2]

Andrzej Czygrinow, Micha l Hańćkowiak, Edyta Szymańska, and Wojciech Wawrzyniak. Distributed 2-approximation algorithm for the semi-matching problem. In Proc. 26th Symposium on Distributed Computing (DISC 2012), volume 7611 of LNCS, pages 210--222, Berlin, 2012. Springer.

Digital Library

[3]

Patrik Floréen, Petteri Kaski, Valentin Polishchuk, and Jukka Suomela. Almost stable matchings by truncating the Gale{Shapley algorithm. Algorithmica, 58(1):102--118, 2010.

Digital Library

[4]

Nate Foster, Rob Harrison, Michael J. Freedman, Christopher Monsanto, Jennifer Rexford, Alec Story, and David Walker. Frenetic: a network programming language. In Proc. 16th International Conference on Functional Programming (ICFP 2011), pages 279--291, New York, 2011. ACM Press.

Digital Library

[5]

{5} Roy Friedman and Alex Kogan. Deterministic dominating set construction in networks with bounded degree. In Proc. 8th International Conference on Distributed Computing and Networking (ICDCN 2011), volume 6522 of LNCS, pages 65--76, Berlin, 2011. Springer.

Digital Library

[6]

Mika Göös and Jukka Suomela. Locally checkable proofs. In Proc. 30th Symposium on Principles of Distributed Computing (PODC 2011), pages 159--168, New York, 2011. ACM Press.

Digital Library

[7]

Micha l Hańćkowiak, Michał Karoński, and Alessandro Panconesi. On the distributed complexity of computing maximal matchings. In Proc. 9th Symposium on Discrete Algorithms (SODA 1998), pages 219--225, Philadelphia, 1998. SIAM.

Digital Library

[8]

Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, and Tami Tamir. Semi-matchings for bipartite graphs and load balancing. Journal of Algorithms, 59(1):53--78, 2006.

Digital Library

[9]

Soheil Hassas Yeganeh and Yashar Ganjali. Kandoo: a framework for efficient and scalable offloading of control applications. In Proc. 1st Workshop on Hot Topics in Software Defined Networking (HotSDN 2012), pages 19--24, New York, 2012. ACM Press.

Digital Library

[10]

Brandon Heller, Rob Sherwood, and Nick McKeown. The controller placement problem. In Proc. 1st Workshop on Hot Topics in Software Defined Networking (HotSDN 2012), pages 7--12, New York, 2012. ACM Press.

Digital Library

[11]

Teemu Koponen, Martin Casado, Natasha Gude, Jeremy Stribling, Leon Poutievski, Min Zhu, Rajiv Ramanathan, Yuichiro Iwata, Hiroaki Inoue, Takayuki Hama, and Scott Shenker. Onix: a distributed control platform for large-scale production networks. In Proc. 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2010), pages 351--364, Berkeley, 2010. USENIX Association.

Digital Library

[12]

Amos Korman and Shay Kutten. Distributed verification of minimum spanning trees. Distributed Computing, 20(4):253--266, 2007.

Digital Library

[13]

Amos Korman, Shay Kutten, and David Peleg. Proof labeling schemes. Distributed Computing, 22(4):215--233, 2010.

Digital Library

[14]

Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. The price of being near-sighted. In Proc. 17th Symposium on Discrete Algorithms (SODA 2006), pages 980--989, New York, 2006. ACM Press.

Digital Library

[15]

Paul Lappas. SDN use case: Multipath TCP at Caltech and CERN. Project Floodlight Blog, December 2012.

[16]

Nathan Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193--201, 1992.

Digital Library

[17]

Moni Naor and Larry Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24(6):1259--1277, 1995.

Digital Library

[18]

David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 2000.

Digital Library

[19]

Jukka Suomela. Survey of local algorithms. ACM Computing Surveys, 45(2):24:1--40, 2013.

Digital Library

Cited By

Balliu ABoudier TBrandt SOlivetti DKuznetsov PGelles ROlivetti D(2024)Tight Lower Bounds in the Supported LOCAL ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662798(95-105)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662798
Gupta CKorhonen JStudený JSuomela JVahidi HAgrawal KPetrank E(2024)Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of SparsityProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3660270(305-307)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3660270
Haeupler BPatel SRoeyskoe AStein CZuzic GMohar BShinkar IO'Donnell R(2024)Polylog-Competitive Deterministic Local Routing and SchedulingProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649678(812-822)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649678
Show More Cited By

Index Terms

Exploiting locality in distributed SDN control
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications
2. Theory of computation
  1. Logic
  2. Models of computation

Recommendations

The road to SDN: an intellectual history of programmable networks

Software Defined Networking (SDN) is an exciting technology that enables innovation in how we design and manage networks. Although this technology seems to have appeared suddenly, SDN is part of a long history of efforts to make computer networks more ...
Node to Node Performance Evaluation through RYU SDN Controller
Abstract
Over the last few years, networks became more innovative for constructing and managing with the support of Software Defined Networking (SDN). The inflexibility of typical network architecture gives a great challenge to researchers. SDN is ...
The role of the inter-controller consensus in the placement of distributed SDN controllers

We consider a distributed Software Defined Networking (SDN) architecture adopting a cluster of controllers to improve network scalability and reliability. Different from previous works that focused solely on the control traffic exchanged between ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

HotSDN '13: Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking

August 2013

182 pages

ISBN:9781450321785

DOI:10.1145/2491185

Program Chairs:
Nate Foster
Cornell University
,
Rob Sherwood
Big Switch Networks

Copyright © 2013 ACM.

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 the author(s) 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

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 August 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGCOMM'13

Sponsor:

SIGCOMM

SIGCOMM'13: ACM SIGCOMM 2013 Conference

August 16, 2013

Hong Kong, China

Acceptance Rates

HotSDN '13 Paper Acceptance Rate 38 of 84 submissions, 45%;

Overall Acceptance Rate 88 of 198 submissions, 44%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

142
Total Citations
View Citations
1,870
Total Downloads

Downloads (Last 12 months)108
Downloads (Last 6 weeks)16

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Balliu ABoudier TBrandt SOlivetti DKuznetsov PGelles ROlivetti D(2024)Tight Lower Bounds in the Supported LOCAL ModelProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662798(95-105)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3662158.3662798
Gupta CKorhonen JStudený JSuomela JVahidi HAgrawal KPetrank E(2024)Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of SparsityProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3660270(305-307)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3660270
Haeupler BPatel SRoeyskoe AStein CZuzic GMohar BShinkar IO'Donnell R(2024)Polylog-Competitive Deterministic Local Routing and SchedulingProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649678(812-822)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649678
Suvorova E(2024)Algorithms for Static and Dynamic Placement of Network Administrators in SpaceFibre Networks with Dynamic Reconfiguration2024 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)10.1109/WECONF61770.2024.10564635(1-9)Online publication date: 3-Jun-2024
https://doi.org/10.1109/WECONF61770.2024.10564635
Xu HChai XLiu H(2023)A Multi-Controller Placement Strategy for Hierarchical Management of Software-Defined NetworkingSymmetry10.3390/sym1508152015:8(1520)Online publication date: 1-Aug-2023
https://doi.org/10.3390/sym15081520
Agrawal AAugustine JPeleg DRamachandran SOshman RNolin AHalldorsson MBalliu A(2023)Brief Announcement: Local Problems in the SUPPORTED ModelProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594583(172-175)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594583
Hassan MGregory MLi S(2023)Multi-Domain Federation Utilizing Software Defined Networking—A ReviewIEEE Access10.1109/ACCESS.2023.324268711(19202-19227)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3242687
Salam RRoy PBhattacharya A(2023)DC-IIoT: A Secure and Efficient Authentication Protocol for Industrial Internet-of-Things Based on Distributed Control PlaneInternet of Things10.1016/j.iot.2023.10078222(100782)Online publication date: Jul-2023
https://doi.org/10.1016/j.iot.2023.100782
Anagnostides ILenzen CHaeupler BZuzic GGouleakis T(2023)Almost universally optimal distributed Laplacian solvers via low-congestion shortcutsDistributed Computing10.1007/s00446-023-00454-036:4(475-499)Online publication date: 31-Jul-2023
https://doi.org/10.1007/s00446-023-00454-0
Sapkota BDawadi BJoshi S(2023)Controller placement problem during SDN deployment in the ISP/Telco networks: A surveyEngineering Reports10.1002/eng2.128016:2Online publication date: 3-Nov-2023
https://doi.org/10.1002/eng2.12801
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents