메뉴 건너뛰기




Volumn , Issue , 2014, Pages 141-146

The joint optimization of rules allocation and traffic engineering in software defined network

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; LOGIC GATES; SOFTWARE DEFINED NETWORKING; TERNARY CONTENT ADRESSABLE MEMORY;

EID: 84907897364     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQoS.2014.6914313     Document Type: Conference Paper
Times cited : (21)

References (20)
  • 1
    • 84907896648 scopus 로고    scopus 로고
    • Technical Report 2012/04, Institute of Parallel and Distributed Systems, Universität Stuttgart, Tech. Rep.
    • F. Dürr, "Towards cloud-assisted software-defined networking," Technical Report 2012/04, Institute of Parallel and Distributed Systems, Universität Stuttgart, Tech. Rep., 2012.
    • (2012) Towards Cloud-assisted Software-defined Networking
    • Dürr, F.1
  • 3
    • 33644661238 scopus 로고    scopus 로고
    • Content-addressable memory (cam) circuits and architectures: A tutorial and survey
    • K. Pagiamtzis and A. Sheikholeslami, "Content-addressable memory (cam) circuits and architectures: A tutorial and survey," IEEE Journal of Solid-State Circuits, vol. 41, no. 3, pp. 712-727, 2006.
    • (2006) IEEE Journal of Solid-State Circuits , vol.41 , Issue.3 , pp. 712-727
    • Pagiamtzis, K.1    Sheikholeslami, A.2
  • 8
    • 84883099537 scopus 로고    scopus 로고
    • Palette: Distributing tables in software-defined networks
    • Y. Kanizo, D. Hay, and I. Keslassy, "Palette: Distributing tables in software-defined networks," in IEEE INFOCOM, 2013, pp. 545-549.
    • (2013) IEEE Infocom , pp. 545-549
    • Kanizo, Y.1    Hay, D.2    Keslassy, I.3
  • 9
    • 84893398564 scopus 로고    scopus 로고
    • Optimizing the one big switch abstraction in software-defined networks
    • N. Kang, Z. Liu, J. Rexford, and D. Walker, "Optimizing the one big switch abstraction in software-defined networks," Proc. ACM CoNEXT, 2013.
    • (2013) Proc ACM CoNEXT
    • Kang, N.1    Liu, Z.2    Rexford, J.3    Walker, D.4
  • 11
    • 84907899793 scopus 로고    scopus 로고
    • "Google g-sacle network," https://www.eetimes.com/electronicsnews/4371179/Google-describesits-OpenFlow-network.
    • Google G-sacle Network
  • 13
  • 14
    • 0025415365 scopus 로고
    • The maximum concurrent flow problem
    • F. Shahrokhi and D. W. Matula, "The maximum concurrent flow problem," Journal of the ACM (JACM), vol. 37, no. 2, pp. 318-334, 1990.
    • (1990) Journal of the ACM (JACM) , vol.37 , Issue.2 , pp. 318-334
    • Shahrokhi, F.1    Matula, D.W.2
  • 15
    • 84879704215 scopus 로고    scopus 로고
    • A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow
    • P.-O. Bauguion, W. Ben-Ameur, and E. Gourdin, "A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow," Electronic Notes in Discrete Mathematics, vol. 41, pp. 311-318, 2013.
    • (2013) Electronic Notes in Discrete Mathematics , vol.41 , pp. 311-318
    • Bauguion, P.-O.1    Ben-Ameur, W.2    Gourdin, E.3


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