메뉴 건너뛰기




Volumn , Issue , 2013, Pages

Managing the network with Merlin

Author keywords

Delegation; Merlin; Program partitioning; Software defined networking; Verification

Indexed keywords

DECLARATIVE LANGUAGES; DELEGATION; HIGH-LEVEL ABSTRACTION; MERLIN; NETWORK ADMINISTRATION; NETWORK MANAGEMENT FRAMEWORKS; PROGRAM PARTITIONING; SOFTWARE-DEFINED NETWORKINGS;

EID: 84893319807     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2535771.2535792     Document Type: Conference Paper
Times cited : (59)

References (40)
  • 4
    • 0034156185 scopus 로고    scopus 로고
    • Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems
    • Mar.
    • 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.
    • (2000) Operations Research , vol.48 , Issue.2 , pp. 318-326
    • Barnhart, C.1    Hane, C.A.2    Vance, P.H.3
  • 5
    • 84879202939 scopus 로고    scopus 로고
    • Detailed analysis of skype traffic
    • Jan.
    • D. Bonfiglio, M. Mellia, M. Meo, and D. Rossi. Detailed Analysis of Skype Traffic. TOMM, 11(1): 117-127, Jan. 2009.
    • (2009) TOMM , vol.11 , Issue.1 , pp. 117-127
    • Bonfiglio, D.1    Mellia, M.2    Meo, M.3    Rossi, D.4
  • 8
    • 84957021733 scopus 로고    scopus 로고
    • Approximation algorithms for the unsplittable flow problem
    • Sept.
    • A. Chakrabarti, C. Chekuri, A. Gupta, and A. Kumar. Approximation Algorithms for the Unsplittable Flow Problem. In APPROX, pages 51-66, Sept. 2002.
    • (2002) APPROX , pp. 51-66
    • Chakrabarti, A.1    Chekuri, C.2    Gupta, A.3    Kumar, A.4
  • 10
    • 84871970528 scopus 로고    scopus 로고
    • A polylogarithmic approximation algorithm for edge-disjoint paths with congestion 2
    • Oct.
    • J. Chuzhoy and S. Li. A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. In FOCS, pages 233-242, Oct. 2012.
    • (2012) FOCS , pp. 233-242
    • Chuzhoy, J.1    Li, S.2
  • 11
    • 85030321143 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • Dec.
    • J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI, pages 137-150, Dec. 2004.
    • (2004) OSDI , pp. 137-150
    • Dean, J.1    Ghemawat, S.2
  • 12
    • 0009679463 scopus 로고    scopus 로고
    • On the single-source unsplittable flow problem
    • Jan.
    • Y. Dinitz, N. Garg, and M. X. Goemans. On the Single-Source Unsplittable Flow Problem. Combinatorica, 19(1): 17-41, Jan. 1999.
    • (1999) Combinatorica , vol.19 , Issue.1 , pp. 17-41
    • Dinitz, Y.1    Garg, N.2    Goemans, M.X.3
  • 15
    • 84883299005 scopus 로고    scopus 로고
    • Participatory networking: An API for application control of SDNs
    • Aug.
    • 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.
    • (2013) SIGCOMM , pp. 327-338
    • Ferguson, A.1    Guha, A.2    Liang, C.3    Fonseca, R.4    Krishnamurthi, S.5
  • 18
    • 84870344450 scopus 로고    scopus 로고
    • Toward software-defined middlebox networking
    • Oct.
    • A. Gember, P. Prabhu, Z. Ghadiyali, and A. Akella. Toward Software-Defined Middlebox Networking. In HotNets, pages 7-12, Oct. 2012.
    • (2012) HotNets , pp. 7-12
    • Gember, A.1    Prabhu, P.2    Ghadiyali, Z.3    Akella, A.4
  • 25
    • 0030389354 scopus 로고    scopus 로고
    • Single-source unsplittable flow
    • Oct.
    • J. M. Kleinberg. Single-Source Unsplittable Flow. In FOCS, pages 68-77, Oct. 1996.
    • (1996) FOCS , pp. 68-77
    • Kleinberg, J.M.1
  • 27
    • 0036305457 scopus 로고    scopus 로고
    • Approximation algorithms for single-source unsplittable flow
    • June
    • S. G. Kolliopoulos and C. Stein. Approximation Algorithms for Single-Source Unsplittable Flow. SIAM J. Comput., 31(3): 919-946, June 2001.
    • (2001) SIAM J. Comput. , vol.31 , Issue.3 , pp. 919-946
    • Kolliopoulos, S.G.1    Stein, C.2
  • 28
    • 72549083642 scopus 로고    scopus 로고
    • Fabric: A platform for secure sistributed computation and storage
    • Oct.
    • 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.
    • (2009) SIGOPS EW , pp. 321-334
    • Liu, J.1    George, M.D.2    Vikram, K.3    Qi, X.4    Waye, L.5    Myers, A.C.6
  • 30
    • 84857169654 scopus 로고    scopus 로고
    • A compiler and run-time system for network programming languages
    • Jan.
    • 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.
    • (2012) POPL , pp. 217-230
    • Monsanto, C.1    Foster, N.2    Harrison, R.3    Walker, D.4
  • 33
    • 84883284152 scopus 로고    scopus 로고
    • SIMPLE-fying middlebox policy enforcement using SDN
    • Aug.
    • 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.
    • (2013) SIGCOMM , pp. 27-38
    • Qazi, Z.A.1    Tu, C.-C.2    Chiang, L.3    Miao, R.4    Sekar, V.5    Yu, M.6
  • 34
    • 85090433665 scopus 로고    scopus 로고
    • Snort-lightweight intrusion detection for networks
    • Nov.
    • M. Roesch. Snort-Lightweight Intrusion Detection for Networks. In LISA, pages 229-238, Nov. 1999.
    • (1999) LISA , pp. 229-238
    • Roesch, M.1
  • 35
    • 84866514819 scopus 로고    scopus 로고
    • Design and implementation of a consolidated middlebox architecture
    • Apr.
    • 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.
    • (2012) NSDI , pp. 24-38
    • Sekar, V.1    Egi, N.2    Ratnasamy, S.3    Reiter, M.K.4    Shi, G.5
  • 36
    • 84866513406 scopus 로고    scopus 로고
    • Making middleboxes someone else's problem: Network processing as a cloud service
    • Aug.
    • 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.
    • (2012) SIGCOMM , pp. 13-24
    • Sherry, J.1    Hasan, S.2    Scott, C.3    Krishnamurthy, A.4    Ratnasamy, S.5    Sekar, V.6
  • 37
    • 84865138707 scopus 로고    scopus 로고
    • Seawall: Performance isolation for cloud datacenter networks
    • June
    • A. Shieh, S. Kandula, A. Greenberg, and C. Kim. Seawall: Performance Isolation for Cloud Datacenter Networks. In HotCloud, pages 1-8, June 2010.
    • (2010) HotCloud , pp. 1-8
    • Shieh, A.1    Kandula, S.2    Greenberg, A.3    Kim, C.4
  • 38
    • 84865573806 scopus 로고    scopus 로고
    • SideCar: Building programmable datacenter networks without programmable switches
    • Oct.
    • A. Shieh, S. Kandula, and E. G. Sirer. SideCar: Building Programmable Datacenter Networks Without Programmable Switches. In HotNets, pages 21-27, Oct. 2010.
    • (2010) HotNets , pp. 21-27
    • Shieh, A.1    Kandula, S.2    Sirer, E.G.3
  • 40
    • 84891609700 scopus 로고    scopus 로고
    • Maple: Simplifying SDN programming using algorithmic policies
    • Aug.
    • 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.
    • (2013) SIGCOMM , pp. 87-98
    • Voellmy, A.1    Wang, J.2    Yang, Y.R.3    Ford, B.4    Hudak, P.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.