research-article

Managing the network with Merlin

Authors:

Shrutarshi Basu,

Robert Kleinberg,

Emin Gün Sirer,

Nate FosterAuthors Info & Claims

HotNets-XII: Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks

Article No.: 24, Pages 1 - 7

https://doi.org/10.1145/2535771.2535792

Published: 21 November 2013 Publication History

Abstract

This paper presents the Merlin network management framework. With Merlin, administrators express network policy using programs in a declarative language based on logical predicates and regular expressions. The Merlin compiler automatically partitions these programs into components that can be placed on a variety of devices including switches, middleboxes, and end hosts. It uses a constraint solver and parameterizable heuristics to allocate resources such as paths and bandwidth. To ease the administration of federated networks, Merlin provides mechanisms for delegating management of sub-policies to tenants, along with tools for verifying that delegated sub-policies do not violate global constraints. Overall, Merlin simplifies the task of network administration by providing high-level abstractions for directly specifying network policy.

References

[1]

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., 1993.

Digital Library

[2]

C. J. Anderson, N. Foster, A. Guha, J.-B. Jeannin, D. Kozen, C. Schlesinger, and D. Walker. NetKAT: Semantic foundations for networks. In POPL, 2014. To appear.

Digital Library

[3]

H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron. Towards Predictable Datacenter Networks. In SIGCOMM, pages 242--253, Aug. 2011.

Digital Library

[4]

C. Barnhart, C. A. Hane, and P. H. Vance. Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems. Operations Research, 48(2): 318--326, Mar. 2000.

Digital Library

[5]

D. Bonfiglio, M. Mellia, M. Meo, and D. Rossi. Detailed Analysis of Skype Traffic. TOMM, 11(1): 117--127, Jan. 2009.

Digital Library

[6]

M. Casado, M. J. Freedman, J. Pettit, J. Luo, N. McKeown, and S. Shenker. Ethane: Taking Control of the Enterprise. In SIGCOMM, pages 1--12, Aug. 2007.

Digital Library

[7]

M. Casado, T. Koponen, S. Shenker, and A. Tootoonchian. Fabric: A Retrospective on Evolving SDN. In HotSDN, pages 85--90, Aug. 2012.

Digital Library

[8]

A. Chakrabarti, C. Chekuri, A. Gupta, and A. Kumar. Approximation Algorithms for the Unsplittable Flow Problem. In APPROX, pages 51--66, Sept. 2002.

Digital Library

[9]

S. Chong, J. Liu, A. C. Myers, X. Qi, K. Vikram, L. Zheng, and X. Zheng. Secure Web Applications via Automatic Partitioning. In SOSP, pages 31--44, Oct. 2007.

Digital Library

[10]

J. Chuzhoy and S. Li. A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. In FOCS, pages 233--242, Oct. 2012.

Digital Library

[11]

J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI, pages 137--150, Dec. 2004.

Digital Library

[12]

Y. Dinitz, N. Garg, and M. X. Goemans. On the Single-Source Unsplittable Flow Problem. Combinatorica, 19(1): 17--41, Jan. 1999.

[13]

C. Dixon, H. Uppal, V. Brajkovic, D. Brandon, T. Anderson, and A. Krishnamurthy. ETTM: A Scalable Fault Tolerant Network Manager. In NSDI, pages 7--21, Mar. 2011.

Digital Library

[14]

M. Dobrescu, N. Egi, K. Argyraki, B.-G. Chun, K. Fall, G. Iannaccone, A. Knies, M. Manesh, and S. Ratnasamy. RouteBricks: Exploiting Parallelism to Scale Software Routers. In SOSP, pages 15--28, Oct. 2009.

Digital Library

[15]

A. Ferguson, A. Guha, C. Liang, R. Fonseca, and S. Krishnamurthi. Participatory Networking: An API for Application Control of SDNs. In SIGCOMM, pages 327--338, Aug. 2013.

Digital Library

[16]

N. Foster, A. Guha, et al. The Frenetic Network Controller. In The OCaml Users and Developers Workshop, Sept. 2013.

[17]

N. Foster, R. Harrison, M. J. Freedman, C. Monsanto, J. Rexford, A. Story, and D. Walker. Frenetic: A Network Programming Language. In ICFP, pages 279--291, Sept. 2011.

Digital Library

[18]

A. Gember, P. Prabhu, Z. Ghadiyali, and A. Akella. Toward Software-Defined Middlebox Networking. In HotNets, pages 7--12, Oct. 2012.

Digital Library

[19]

P. B. Godfrey, I. Ganichev, S. Shenker, and I. Stoica. Pathlet Routing. SIGCOMM CCR, 39(4): 111--122, Aug. 2009.

Digital Library

[20]

T. Hinrichs, N. Gude, M. Casado, J. Mitchell, and S. Shenker. Practical Declarative Network Management. In WREN, pages 1--10, 2009.

Digital Library

[21]

J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

Digital Library

[22]

S. Ioannidis, A. D. Keromytis, S. M. Bellovin, and J. M. Smith. Implementing a Distributed Firewall. In CCS, pages 190--199, Nov. 2000.

Digital Library

[23]

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 SIGCOMM, pages 3--14, Aug. 2013.

Digital Library

[24]

V. Jeyakumar, M. Alizadeh, D. Mazières, B. Prabhakar, A. Greenberg, and C. Kim. EyeQ: Practical Network Performance Isolation at the Edge. In NSDI, pages 297--312, Apr. 2013.

Digital Library

[25]

J. M. Kleinberg. Single-Source Unsplittable Flow. In FOCS, pages 68--77, Oct. 1996.

Digital Library

[26]

E. Kohler, R. Morris, B. Chen, J. Jannotti, and M. F. Kaashoek. The Click Modular Router. TOCS, 18(3): 263--297, Aug. 2000.

Digital Library

[27]

S. G. Kolliopoulos and C. Stein. Approximation Algorithms for Single-Source Unsplittable Flow. SIAM J. Comput., 31(3): 919--946, June 2001.

Digital Library

[28]

J. Liu, M. D. George, K. Vikram, X. Qi, L. Waye, and A. C. Myers. Fabric: A Platform for Secure Sistributed Computation and Storage. In SIGOPS EW, pages 321--334, Oct. 2009.

Digital Library

[29]

N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. OpenFlow: Enabling Innovation in Campus Networks. SIGCOMM CCR, 38(2): 69--74, Mar. 2008.

Digital Library

[30]

C. Monsanto, N. Foster, R. Harrison, and D. Walker. A Compiler and Run-time System for Network Programming Languages. In POPL, pages 217--230, Jan. 2012.

Digital Library

[31]

C. Monsanto, J. Reich, N. Foster, J. Rexford, and D. Walker. Composing Software-Defined Networks. In NSDI, pages 1--13, Apr. 2013.

Digital Library

[32]

L. Popa, G. Kumar, M. Chowdhury, A. Krishnamurthy, S. Ratnasamy, and I. Stoica. FairCloud: Sharing the Network in Cloud Computing. In SIGCOMM, pages 187--198, Aug. 2012.

Digital Library

[33]

Z. A. Qazi, C.-C. Tu, L. Chiang, R. Miao, V. Sekar, and M. Yu. SIMPLE-fying Middlebox Policy Enforcement Using SDN. In SIGCOMM, pages 27--38, Aug. 2013.

Digital Library

[34]

M. Roesch. Snort---Lightweight Intrusion Detection for Networks. In LISA, pages 229--238, Nov. 1999.

Digital Library

[35]

V. Sekar, N. Egi, S. Ratnasamy, M. K. Reiter, and G. Shi. Design and Implementation of a Consolidated Middlebox Architecture. In NSDI, pages 24--38, Apr. 2012.

Digital Library

[36]

J. Sherry, S. Hasan, C. Scott, A. Krishnamurthy, S. Ratnasamy, and V. Sekar. Making Middleboxes Someone Else's Problem: Network Processing as a Cloud Service. In SIGCOMM, pages 13--24, Aug. 2012.

Digital Library

[37]

A. Shieh, S. Kandula, A. Greenberg, and C. Kim. Seawall: Performance Isolation for Cloud Datacenter Networks. In HotCloud, pages 1--8, June 2010.

Digital Library

[38]

A. Shieh, S. Kandula, and E. G. Sirer. SideCar: Building Programmable Datacenter Networks Without Programmable Switches. In HotNets, pages 21--27, Oct. 2010.

Digital Library

[39]

Y. Vigfusson, H. Abu-Libdeh, M. Balakrishnan, K. Birman, R. Burgess, G. Chockler, H. Li, and Y. Tock. Dr. Multicast: Rx for Data Center Communication Scalability. In EuroSys, pages 349--362, Apr. 2010.

Digital Library

[40]

A. Voellmy, J. Wang, Y. R. Yang, B. Ford, and P. Hudak. Maple: Simplifying SDN Programming Using Algorithmic Policies. In SIGCOMM, pages 87--98, Aug. 2013.

Digital Library

Cited By

Angi ASacco AEsposito FMarchetto GClemm A(2022)NLP4: An Architecture for Intent-Driven Data Plane Programmability2022 IEEE 8th International Conference on Network Softwarization (NetSoft)10.1109/NetSoft54395.2022.9844035(25-30)Online publication date: 27-Jun-2022
https://doi.org/10.1109/NetSoft54395.2022.9844035
Onoja DHitchens MShankaran R(2022)Security Policy to Manage Responses to DDoS Attacks on 5G IoT Enabled Devices2022 13th International Conference on Information and Communication Systems (ICICS)10.1109/ICICS55353.2022.9811193(30-35)Online publication date: 21-Jun-2022
https://doi.org/10.1109/ICICS55353.2022.9811193
Cai ZXiong ZXu HWang PLi WPan Y(2021)Generative Adversarial NetworksACM Computing Surveys10.1145/345999254:6(1-38)Online publication date: 13-Jul-2021
https://dl.acm.org/doi/10.1145/3459992
Show More Cited By

Index Terms

Managing the network with Merlin
1. Software and its engineering
  1. Software notations and tools
    1. Context specific languages
      1. Specialized application languages
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems

Recommendations

Merlin: A Language for Provisioning Network Resources
CoNEXT '14: Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies

This paper presents Merlin, a new framework for managing resources in software-defined networks. With Merlin, administrators express high-level policies using programs in a declarative language. The language includes logical predicates to identify sets ...
Quadratic Simulations of Merlin–Arthur Games

The known proofs of MA ⊆ PP incur a quadratic overhead in the running time. We prove that this quadratic overhead is necessary for black-box simulations; in particular, we obtain an oracle relative to which MA-TIME (t) ⊈ P-TIME (o(t²)). We also show ...
Merlin: A Language for Managing Network Resources

This paper presents Merlin, a framework for managing resources in software-defined networks. With Merlin, administrators express high-level policies using programs in a declarative language. The language includes logical predicates to identify sets of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

HotNets-XII: Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks

November 2013

188 pages

ISBN:9781450325967

DOI:10.1145/2535771

General Chair:
Dave Levine
UMD
,
Program Chairs:
Sachin Katti
Stanford University
,
Dave Oran
Cisco

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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 November 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

HotNets-XII

Sponsor:

SIGCOMM

HotNets-XII: Twelfth ACM Workshop on Hot Topics in Networks

November 21 - 22, 2013

Maryland, College Park

Acceptance Rates

HotNets-XII Paper Acceptance Rate 26 of 110 submissions, 24%;

Overall Acceptance Rate 110 of 460 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
347
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)4

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Angi ASacco AEsposito FMarchetto GClemm A(2022)NLP4: An Architecture for Intent-Driven Data Plane Programmability2022 IEEE 8th International Conference on Network Softwarization (NetSoft)10.1109/NetSoft54395.2022.9844035(25-30)Online publication date: 27-Jun-2022
https://doi.org/10.1109/NetSoft54395.2022.9844035
Onoja DHitchens MShankaran R(2022)Security Policy to Manage Responses to DDoS Attacks on 5G IoT Enabled Devices2022 13th International Conference on Information and Communication Systems (ICICS)10.1109/ICICS55353.2022.9811193(30-35)Online publication date: 21-Jun-2022
https://doi.org/10.1109/ICICS55353.2022.9811193
Cai ZXiong ZXu HWang PLi WPan Y(2021)Generative Adversarial NetworksACM Computing Surveys10.1145/345999254:6(1-38)Online publication date: 13-Jul-2021
https://dl.acm.org/doi/10.1145/3459992
Padakandla S(2021)A Survey of Reinforcement Learning Algorithms for Dynamically Varying EnvironmentsACM Computing Surveys10.1145/345999154:6(1-25)Online publication date: 13-Jul-2021
https://dl.acm.org/doi/10.1145/3459991
Pal RSekh ADogra DKar SRoy PPrasad D(2021)Topic-based Video AnalysisACM Computing Surveys10.1145/345908954:6(1-34)Online publication date: 13-Jul-2021
https://dl.acm.org/doi/10.1145/3459089
Vera-Olivera HGuo RHuacarpuma RDa Silva AMariano AHolanda M(2021)Data Modeling and NoSQL Databases - A Systematic Mapping ReviewACM Computing Surveys10.1145/345760854:6(1-26)Online publication date: 13-Jul-2021
https://dl.acm.org/doi/10.1145/3457608
Lou XZhang TJiang JZhang Y(2021)A Survey of Microarchitectural Side-channel Vulnerabilities, Attacks, and Defenses in CryptographyACM Computing Surveys10.1145/345662954:6(1-37)Online publication date: 13-Jul-2021
https://dl.acm.org/doi/10.1145/3456629
Rauf BAbbas HUsman MZia TIqbal WAbbas YAfzal H(2021)Application Threats to Exploit Northbound Interface Vulnerabilities in Software Defined NetworksACM Computing Surveys10.1145/345364854:6(1-36)Online publication date: 13-Jul-2021
https://dl.acm.org/doi/10.1145/3453648
Pignolet YSchmid STredan G(2021)On the Implications of Routing Models on Network OptimizationIEEE Transactions on Network and Service Management10.1109/TNSM.2021.309031218:4(4756-4769)Online publication date: Dec-2021
https://doi.org/10.1109/TNSM.2021.3090312
Lin IYeh YLin K(2021)Toward Optimal Partial Parallelization for Service Function ChainingIEEE/ACM Transactions on Networking10.1109/TNET.2021.307570929:5(2033-2044)Online publication date: Oct-2021
https://doi.org/10.1109/TNET.2021.3075709
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents