메뉴 건너뛰기




Volumn 2016-July, Issue , 2016, Pages

Deploying chains of virtual network functions: On the relation between link and server usage

Author keywords

[No Author keywords available]

Indexed keywords

TRANSFER FUNCTIONS;

EID: 84983247607     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2016.7524565     Document Type: Conference Paper
Times cited : (178)

References (17)
  • 6
    • 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
  • 8
    • 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 IEEE CNSM, 2014.
    • (2014) IEEE CNSM
    • Moens, H.1    De Turck, F.2
  • 9
    • 84925840642 scopus 로고    scopus 로고
    • Specifying and placing chains of virtual network functions
    • S. Mehraghdam, M. Keller, and H. Karl, "Specifying and placing chains of virtual network functions," in IEEE CloudNet, 2014.
    • (2014) IEEE CloudNet
    • Mehraghdam, S.1    Keller, M.2    Karl, H.3
  • 10
    • 84925061024 scopus 로고    scopus 로고
    • Network function placement for NFV chaining in packet/optical datacenters
    • M. Xia, M. Shirazipour, Y. Zhang, H. Green, and A. Takacs, "Network function placement for NFV chaining in packet/optical datacenters," Journal of Lightwave Technology, vol. 33, no. 8, pp. 1565-1570, 2014.
    • (2014) Journal of Lightwave Technology , vol.33 , Issue.8 , pp. 1565-1570
    • Xia, M.1    Shirazipour, M.2    Zhang, Y.3    Green, H.4    Takacs, A.5
  • 11
    • 79952586177 scopus 로고    scopus 로고
    • Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
    • M. Andrews, J. Chuzhoy, V. Guruswami, S. Khanna, K. Talwar, and L. Zhang, "Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs," Combinatorica, vol. 30, no. 5, pp. 485-520, 2010.
    • (2010) Combinatorica , vol.30 , Issue.5 , pp. 485-520
    • Andrews, M.1    Chuzhoy, J.2    Guruswami, V.3    Khanna, S.4    Talwar, K.5    Zhang, L.6
  • 15
    • 84983326736 scopus 로고    scopus 로고
    • Cogent's network map. [Online]. Available: http://cogentco.com/en/ network/network-map
    • Cogent's Network Map.
  • 17
    • 84954233339 scopus 로고    scopus 로고
    • Low-complexity multi-resource packet scheduling for network function virtualization
    • X. Li and C. Qian, "Low-complexity multi-resource packet scheduling for network function virtualization," in IEEE INFOCOM, 2015.
    • (2015) IEEE INFOCOM
    • Li, X.1    Qian, C.2


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