메뉴 건너뛰기




Volumn , Issue , 2017, Pages

Service chain embedding with maximum flow in software defined network and application to the next-generation cellular network architecture

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; APPROXIMATION ALGORITHMS; CHAINS; NETWORK ARCHITECTURE; NEXT GENERATION NETWORKS; SOFTWARE DEFINED NETWORKING; TRANSFER FUNCTIONS;

EID: 85034098831     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2017.8057229     Document Type: Conference Paper
Times cited : (52)

References (24)
  • 1
    • 84915748930 scopus 로고    scopus 로고
    • Terminal-centric distribution and orchestration of IP mobility for 5G networks
    • A. Yegin, J. Park, K. Kweon, and J. Lee, "Terminal-centric distribution and orchestration of IP mobility for 5G networks," Communications Magazine, IEEE, vol. 52, pp. 86-92, 2014.
    • (2014) Communications Magazine, IEEE , vol.52 , pp. 86-92
    • Yegin, A.1    Park, J.2    Kweon, K.3    Lee, J.4
  • 3
    • 84915751455 scopus 로고    scopus 로고
    • A new control plane for 5G network architecture with a case study on unified handoff, mobility, and routing management
    • V. Yazc, U. Kozat, and M. Oguz Sunay, "A new control plane for 5G network architecture with a case study on unified handoff, mobility, and routing management," Communications Magazine, IEEE, vol. 52, pp. 76-85, 2014.
    • (2014) Communications Magazine, IEEE , vol.52 , pp. 76-85
    • Yazc, V.1    Kozat, U.2    Oguz Sunay, M.3
  • 7
    • 84978780567 scopus 로고    scopus 로고
    • Online admission control and embedding of service chains
    • T. Lukovszki and S. Schmid, "Online admission control and embedding of service chains," in SIROCCO, 2015.
    • (2015) SIROCCO
    • Lukovszki, T.1    Schmid, S.2
  • 9
    • 85034107128 scopus 로고    scopus 로고
    • Service chain load balancing with opencontrail. [Online]. Available:
    • Service chain load balancing with opencontrail. [Online]. Available: http: //www.opencontrail.org/service-chain-load-balancing-with-opencontrail/
  • 10
    • 85034035877 scopus 로고    scopus 로고
    • Tech. Rep
    • Tech. Rep. [Online]. Available: http://dclab.cs.nthu.edu.tw/-mjtsai/files/ paper/INFOCOM 2017 TR.pdf
  • 12
    • 42549097902 scopus 로고    scopus 로고
    • Faster and simpler algorithms for multicommodity flow and other fractional packing problems
    • N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," SIAM J. Comput., vol. 37, pp. 630-652, 2007.
    • (2007) SIAM J. Comput. , vol.37 , pp. 630-652
    • Garg, N.1    Könemann, J.2
  • 13
    • 0021441708 scopus 로고
    • A quick method for finding shortest pairs of disjoint paths
    • J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, 1984.
    • (1984) Networks , vol.14
    • Suurballe, J.W.1    Tarjan, R.E.2
  • 17
    • 84954233339 scopus 로고    scopus 로고
    • Low-complexity multi-resource packet scheduling for network functions virtualization
    • X. Li and C. Qian, "Low-complexity multi-resource packet scheduling for network functions virtualization," in IEEE INFOCOM, 2015.
    • (2015) IEEE INFOCOM
    • Li, X.1    Qian, C.2
  • 18
    • 84922818792 scopus 로고    scopus 로고
    • VNF-P: A model for efficient placement of virtualized network functions
    • H. Moens and F. De Turck, "VNF-P: A model for efficient placement of virtualized network functions," in CNSM, 2014.
    • (2014) CNSM
    • Moens, H.1    De Turck, F.2
  • 20
    • 84983247607 scopus 로고    scopus 로고
    • Deploying chains of virtual network functions: On the relation between link and server usage
    • T.-W. Kuo, B.-H. Liou, K. C.-J. Lin, and M.-J. Tsai, "Deploying chains of virtual network functions: On the relation between link and server usage," in IEEE INFOCOM, 2016.
    • (2016) IEEE INFOCOM
    • Kuo, T.-W.1    Liou, B.-H.2    Lin, K.C.-J.3    Tsai, M.-J.4
  • 21
    • 84983353082 scopus 로고    scopus 로고
    • An efficient auction mechanism for service chains in the NFV market
    • S. Gu, Z. Li, C. Wu, , and C. Huang, "An efficient auction mechanism for service chains in the NFV market," in IEEE INFOCOM, 2016.
    • (2016) IEEE INFOCOM
    • Gu, S.1    Li, Z.2    Wu, C.3    Huang, C.4
  • 22
    • 85034062356 scopus 로고    scopus 로고
    • Approximating fractional multicommodity flow independent of the number of commodities
    • L. Fleischer, "Approximating fractional multicommodity flow independent of the number of commodities," in IEEE FOCS, 1999.
    • (1999) IEEE FOCS
    • Fleischer, L.1
  • 23
    • 84904430594 scopus 로고    scopus 로고
    • On the effect of forwarding table size on SDN network utilization
    • R. Cohen, L. Lewin-Eytan, J. S. Naor, and D. Raz, "On the effect of forwarding table size on SDN network utilization," in IEEE INFOCOM, 2014.
    • (2014) IEEE INFOCOM
    • Cohen, R.1    Lewin-Eytan, L.2    Naor, J.S.3    Raz, D.4
  • 24
    • 84954202867 scopus 로고    scopus 로고
    • OFFICER: A general optimization framework for openflow rule allocation and endpoint policy enforcement
    • X.-N. Nguyen, D. Saucez, C. Barakat, and T. Turletti, "OFFICER: A general optimization framework for openflow rule allocation and endpoint policy enforcement," in IEEE INFOCOM, 2015.
    • (2015) IEEE INFOCOM
    • Nguyen, X.-N.1    Saucez, D.2    Barakat, C.3    Turletti, T.4


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