Cost-based placement of vDPI functions in NFV infrastructures

International Journal of Network Management

Volumn 25, Issue 6, 2015, Pages 490-506

  Bouet, Mathieu ^a   Leguay, Jérémie ^b   Combe, Théo ^a   Conan, Vania ^a  

^a THALES COMMUNICATIONS   (France)

^b HUAWEI TECHNOLOGIES CO LTD   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; ELECTRONIC TRADING; ENERGY EFFICIENCY; INTEGER PROGRAMMING; NETWORK SECURITY; TRANSFER FUNCTIONS;

COST MINIMIZATION; DEEP PACKET INSPECTION (DPI); INTEGER LINEAR PROGRAMS; MULTI-COMMODITY FLOW; NETWORK EFFICIENCY; NETWORK STRUCTURES; PLACEMENT PROBLEMS; TRAFFIC MANAGEMENT;

NETWORK FUNCTION VIRTUALIZATION;

EID: 84948404095     PISSN: 10557148     EISSN: 10991190     Source Type: Journal    
DOI: 10.1002/nem.1920     Document Type: Article

References (23)

1. Infonetics Research,. Service Provider Deep Packet Inspection product report, 2014.
2. Margaret C, et al., Network Functions Virtualization-An Introduction, Benefits. Challenges and Call for Action: Enablers, 2012.
3. Biran O, Corradi A, Fanelli M, Foschini L, Nus A, Raz D, Silvera E,. A stable network-aware VM placement for cloud systems. In IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), Washington DC, 2012; 498-506.
4. Jiang JW, Lan T, Ha S, Chen M, Chiang M,. Joint VM placement and routing for data center traffic engineering. In INFOCOM, 2012 Proceedings IEEE, 2012; 25-30.
5. Laoutaris N, Smaragdakis G, Oikonomou K, Stavrakakis I, Bestavros A,. Distributed placement of service facilities in large-scale networks. In IEEE INFOCOM 2007, 2007; 2144-2152.
6. Qi Z, Zhu Q, Zhani MF, Boutaba R,. Dynamic service placement in geographically distributed clouds. In IEEE Distributed Computing Systems (ICDCS), 2012; 526-535.
7. Jennings B, Rolf S,. Resource management in clouds: survey and research challenges. Journal of Network and Systems Management 2015; 23 (3): 567-619.
8. Fischer A, Botero JF, Till Beck M, de Meer H, Hesselbach X,. Virtual network embedding: a survey. In Communications Surveys Tutorials, IEEE, Fourth, 2013; 1888-1906.
9. Guohan L, Miao R, Xiong Y, Guo C,. Using CPU as a traffic co-processing unit in commodity switches. In Proceedings of the First Workshop on Hot Topics in Software Defined Networks (HotSDN), ACM, 2012; 31-36.
10. Gringoli F, Este A, Salgarelli L,. MTCLASS: traffic classification on high-speed links with commodity hardware. In IEEE International Conference on Communications (ICC), 2012; 1177-1182.
11. Bouet M, Leguay J, Conan V,. Cost-based placement of virtualized deep packet inspection functions in SDN. In Military Communications Conference, MILCOM 2013-2013 IEEE, 2013; 992-997.
12. Chaudet C, Fleury E, Lassous IG, Rivano H, Voge ME,. Optimal positioning of active and passive monitoring devices. In Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology (CoNEXT), 2005; 93-124.
13. Bouet M, Leguay J, Conan V,. Cost-based placement of vDPI functions in NFV infrastructures. In Proceedings of the IEEE Network Softwarization Conference (NetSoft 2015), 2015; 1-9.
14. Luizelli MC, Bays LR, Buriol L, Barcellos MP, Gaspary LP,. Piecing together the NFV provisioning puzzle: efficient placement and chaining of virtual network functions. In IFIP/IEEE Integrated Network Management Symposium (IM 2015), 2015; 98-106.
15. Addis B, Belabed D, Bouet M, Secci S,. Virtual network functions placement and routing optimization. In Proceedings of 2015 IEEE Cloud Networking Conference (CLOUDNET), 2015; 1-7.
16. Moens H, De Turck F,. VNF-P: a model for efficient placement of virtualized network functions. In Network and Service Management (CNSM), 2014 10th International Conference on, November 2014; 418-423.
17. Even S, Itai A, Shamir A,. On the complexity of timetable and multi-commodity flow problems. In FOCS, IEEE Computer Society, 1975; 184-193.
18. Procera Networks. Network Application Visibility Library (NAVL).
19. Xiao W, Soong BH, Law CL, Guan YL,. Evaluation of heuristic path selection algorithms for multi-constrained QoS routing. In IEEE International Conference on Networking, Sensing and Control, Taipei, Taiwan, 2004; 112-116.
20. Gen-Huey C, Yung-Chen H,. Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Computers & operations research 1994; 21 (2): 113-118.
21. Uhlig S, Quoitin B, Lepropre J, Balon S,. Providing public intradomain traffic matrices to the research community. ACM SIGCOMM Computer Communication Rev 2006; 36 (1).
22. Barabasi AL, Albert R,. Emergence of scaling in random networks. Science 1999; 286 (5439): 509-512.
23. Erdos P, Renyi A,. On random graphs I. Publicationes Mathematicae Debrecen 1959; 6: 290-297.