Добірка наукової літератури з теми "Service Function Chain Placement"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Service Function Chain Placement".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Service Function Chain Placement"
Khoshkholghi, Mohammad Ali, Michel Gokan Khan, Kyoomars Alizadeh Noghani, Javid Taheri, Deval Bhamare, Andreas Kassler, Zhengzhe Xiang, Shuiguang Deng, and Xiaoxian Yang. "Service Function Chain Placement for Joint Cost and Latency Optimization." Mobile Networks and Applications 25, no. 6 (November 21, 2020): 2191–205. http://dx.doi.org/10.1007/s11036-020-01661-w.
Повний текст джерелаDang-Quang, Nhat-Minh, and Myungsik Yoo. "Optimized placement of symmetrical service function chain in network function virtualization." Computer Science and Information Systems, no. 00 (2022): 6. http://dx.doi.org/10.2298/csis210920006d.
Повний текст джерелаXu, Yansen, and Ved P. Kafle. "An Availability-Enhanced Service Function Chain Placement Scheme in Network Function Virtualization." Journal of Sensor and Actuator Networks 8, no. 2 (June 14, 2019): 34. http://dx.doi.org/10.3390/jsan8020034.
Повний текст джерелаAbdelaal, Marwa A., Gamal A. Ebrahim, and Wagdy R. Anis. "Efficient Placement of Service Function Chains in Cloud Computing Environments." Electronics 10, no. 3 (January 30, 2021): 323. http://dx.doi.org/10.3390/electronics10030323.
Повний текст джерелаEngelmann, Anna, and Admela Jukan. "A Combinatorial Reliability Analysis of Generic Service Function Chains in Data Center Networks." ACM Transactions on Modeling and Performance Evaluation of Computing Systems 6, no. 3 (September 30, 2021): 1–24. http://dx.doi.org/10.1145/3477046.
Повний текст джерелаWang, Zenan, Jiao Zhang, Tao Huang, and Yunjie Liu. "Service Function Chain Composition, Placement, and Assignment in Data Centers." IEEE Transactions on Network and Service Management 16, no. 4 (December 2019): 1638–50. http://dx.doi.org/10.1109/tnsm.2019.2933872.
Повний текст джерелаWang, Yun, Chih-Kai Huang, Shan-Hsiang Shen, and Ge-Ming Chiu. "Adaptive Placement and Routing for Service Function Chains With Service Deadlines." IEEE Transactions on Network and Service Management 18, no. 3 (September 2021): 3021–36. http://dx.doi.org/10.1109/tnsm.2021.3086977.
Повний текст джерелаLi, Wei, Yuan Jiang, Xiaoliang Zhang, Fangfang Dang, Feng Gao, Haomin Wang, and Qi Fan. "Reliability Assurance Dynamic SSC Placement Using Reinforcement Learning." Information 13, no. 2 (January 21, 2022): 53. http://dx.doi.org/10.3390/info13020053.
Повний текст джерелаSubramanya, Tejas, Davit Harutyunyan, and Roberto Riggio. "Machine learning-driven service function chain placement and scaling in MEC-enabled 5G networks." Computer Networks 166 (January 2020): 106980. http://dx.doi.org/10.1016/j.comnet.2019.106980.
Повний текст джерелаBi, Yu, Carlos Colman Meixner, Monchai Bunyakitanon, Xenofon Vasilakos, Reza Nejabati, and Dimitra Simeonidou. "Multi-Objective Deep Reinforcement Learning Assisted Service Function Chains Placement." IEEE Transactions on Network and Service Management 18, no. 4 (December 2021): 4134–50. http://dx.doi.org/10.1109/tnsm.2021.3127685.
Повний текст джерелаДисертації з теми "Service Function Chain Placement"
Behravesh, Rasoul <1988>. "Life-cycle management and placement of service function chains in MEC-enabled 5G networks." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amsdottorato.unibo.it/9732/1/Thesis.pdf.
Повний текст джерелаSubramanya, Tejas. "Autonomic Management and Orchestration Strategies in MEC-Enabled 5G Networks." Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/320883.
Повний текст джерелаAlleg, Abdelhamid. "Service Function Placement and Chaining in Network Function Virtualization Environments." Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0117.
Повний текст джерелаThe emergence of Network Function Virtualization (NFV) technology has aroused keen interest to design, manage and deploy network services in a flexible, automated and vendor-agnostic manner. Implementing NFV technology is expected to be a win-win solution for both service providers and costumers. However, this paradigm shift, sparked by NFV, calls for a progressive abandon of network services that are provided as hardware appliance and rather it proposes a fully or partially virtualized environment that offers software modules called Virtual Network Functions (VNFs). This shift rises a set of challenges related to service deployment and operation such as orchestration and management, service resiliency, Quality of Service (QoS) and resource provisioning among others. Furthermore, the core question that needs to be solved within NFV context is “What is the best way to place and chain VNFs that form a service in order to meet Service Level Agreement requirements (costumer side) while optimizing resource usage (service provider side)?”.This thesis investigates the problem of VNF Placement and Chaining considering service requirements such as end-to-end delay, service availability and energy consumption and proposes a set of algorithms and mechanisms that aim to achieve an optimized deployment of the requested/provided services. Our contributions in this thesis are threefold. First, we propose a delay-aware Placement and Chaining algorithms for delay-sensitive applications over NFV networks. The proposed algorithms aim to meet the appropriate end-to-end delay defined according to the deployed service (VoIP, Streaming, etc.). Second, we provide a comprehensive service availability benchmarking and we propose two availability-aware mechanisms for VNFs chain. The aim is to provide resilient service provisioning by fine-tuning the parameters of the protection scheme (the number, the type, the placement and the size of the spare instances) needed to reach a predefined availability level, despite network failures. Finally, we propose a framework architecture that explores the possibility to extend the virtualization paradigm to Internet of Things (IoT). Toward this end, we define an energy-aware Placement and Chaining for IoT services where inherent IoT functionalities are decoupled from specific dedicated IoT devices and instantiated on-demand. By bringing together NFV and IoT paradigms, this extension opens new perspectives and push toward designing new use cases
Luizelli, Marcelo Caggiani. "Scalable cost-efficient placement and chaining of virtual network functions." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/169337.
Повний текст джерелаNetwork Function Virtualization (NFV) is a novel concept that is reshaping the middlebox arena, shifting network functions (e.g. firewall, gateways, proxies) from specialized hardware appliances to software images running on commodity hardware. This concept has potential to make network function provision and operation more flexible and cost-effective, paramount in a world where deployed middleboxes may easily reach the order of hundreds. Despite recent research activity in the field, little has been done towards scalable and cost-efficient placement & chaining of virtual network functions (VNFs) – a key feature for the effective success of NFV. More specifically, existing strategies have neglected the chaining aspect of NFV (focusing on efficient placement only), failed to scale to hundreds of network functions and relied on unrealistic operational costs. In this thesis, we approach VNF placement and chaining as an optimization problem in the context of Inter- and Intra-datacenter. First, we formalize the Virtual Network Function Placement and Chaining (VNFPC) problem and propose an Integer Linear Programming (ILP) model to solve it. The goal is to minimize required resource allocation, while meeting network flow requirements and constraints. Then, we address scalability of VNFPC problem to solve large instances (i.e., thousands of NFV nodes) by proposing a fixand- optimize-based heuristic algorithm for tackling it. Our algorithm incorporates a Variable Neighborhood Search (VNS) meta-heuristic, for efficiently exploring the placement and chaining solution space. Further, we assess the performance limitations of typical NFV-based deployments and the incurred operational costs of commodity servers and propose an analytical model that accurately predict the operational costs for arbitrary service chain requirements. Then, we develop a general service chain intra-datacenter deployment mechanism (named OCM – Operational Cost Minimization) that considers both the actual performance of the service chains (e.g., CPU requirements) as well as the operational incurred cost. Our novel algorithm is based on an extension of the well-known reduction from weighted matching to min-cost flow problem. Finally, we tackle the problem of monitoring service chains in NFV-based environments. For that, we introduce the DNM (Distributed Network Monitoring) problem and propose an optimization model to solve it. DNM allows service chain segments to be independently monitored, which allows specialized network monitoring requirements to be met in a efficient and coordinated way. Results show that the proposed ILP model for the VNFPC problem leads to a reduction of up to 25% in end-to-end delays (in comparison to chainings observed in traditional infrastructures) and an acceptable resource over-provisioning limited to 4%. Also, we provide strong evidences that our fix-and-optimize based heuristic is able to find feasible, high-quality solutions efficiently, even in scenarios scaling to thousands of VNFs. Further, we provide indepth insights on network performance metrics (such as throughput, CPU utilization and packet processing) and its current limitations while considering typical deployment strategies. Our OCM algorithm reduces significantly operational costs when compared to the de-facto standard placement mechanisms used in Cloud systems. Last, our DNM model allows finer grained network monitoring with limited overheads. By coordinating the placement of monitoring sinks and the forwarding of network monitoring traffic, DNM can reduce the number of monitoring sinks and the network resource consumption (54% lower than a traditional method).
Visser, Riaan. "Operational-cost optimisation and cost management in the sourcing and supply chain : a conceptual framework for a medium-sized service company without a central procurement function." Thesis, Stellenbosch : Stellenbosch University, 2008. http://hdl.handle.net/10019.1/997.
Повний текст джерелаENGLISH ABSTRACT: A typical medium-sized service company in South Africa faces definite challenges and misses opportunities in optimising and managing its operational expenses in its sourcing and supply chain. Medium-sized companies generally do not have the benefit of sophisticated in-house procurement divisions and extensive buying power but they still have to optimise their expenses in order to ensure maximum profitability and business longevity. The study addresses these challenges and opportunities by developing and proposing a framework for a typical medium-sized service company that does not have a central procurement function related to the cost optimisation and management of the identified sourcing and supply-chain elements. The research process entails the development of a conceptual framework developed from literature analysis and a representational practical environment as well as the testing, reviewing and validating of the test implementation of the framework. The results flowing from the testing and implementation of the framework are excluded from the research project. The results are displayed in the form of a summary of specific relevant information around each framework element as well as a conceptual framework. Recommendations are made in relation to the implementation and practical adaptation of the framework. It is concluded that a medium-sized service company can successfully optimise and manage its costs in the sourcing and supply-chain elements in the absence of a central procurement function. This requires the effective implementation of the developed framework, which was adapted from sophisticated larger companies. Implementation and the measurement process need to be driven or, preferably, conducted by the medium-sized company owner or management. Buy-in of the framework and the processes around it needs to be obtained from employees, suppliers and other stakeholders.
AFRIKAANSE OPSOMMING: ’n Tipiese mediumgrootte diensverskaffingsonderneming in Suid-Afrika staar spesifieke uitdagings in die gesig en ontbeer geleenthede met betrekking tot die optimalisering en bestuur van die bedryfsuitgawes in sy aankoop- en verskaffingsketting. Mediumgrootte ondernemings beskik in die algemeen nie oor die voordeel van ’n gesofistikeerde interne aankoopafdeling en groot aankoopkrag nie, maar hierdie ondernemings moet nog steeds hulle koste-uitgawes optimaliseer in die nastreef van maksimale wins en besigheidsukses. Die navorsingstudie neem hierdie uitdagings en geleenthede onder die loep deur die ontwikkeling en aanbeveling van ’n raamwerk vir ’n tipiese mediumgrootte diensverskaffingsonderneming wat nie oor ’n sentrale interne aankoopafdeling beskik nie. Die raamwerk is gebaseer op koste-optimalisering en -bestuur van die geïdentifiseerde aankoop- en verskaffingskettingelemente. Die navorsingsproses behels die ontwikkeling van ’n konseptuele raamwerk deur literatuuranalise en ’n verteenwoordigende praktiese omgewing, sowel as die toetsing, hersiening en geldigverklaring van die raamwerk tydens die toets-implementering daarvan in die praktiese omgewing. Die resultate van die toets en implementering van die raamwerk vorm nie deel van hierdie studie nie. Die navorsingsresultate word ten toon gestel in die vorm van ’n opsomming van die relevante raamwerkelemente sowel as ’n ontwikkelde raamwerk. Aanbevelings ten opsigte van die implementering en praktiese aanpassing van die raamwerk word dan gemaak. Die gevolgtrekking word gemaak dat ’n mediumgrootte diensverskaffingsonderneming wel in die afwesigheid van ’n sentrale interne aankoopafdeling sy kostes in die aankoop- en verskaffingsketting suksesvol kan optimaliseer en bestuur. Dit kan gedoen word deur die doeltreffende implementering en aanwending van die ontwikkelde raamwerk wat vanaf groter ondernemings aangepas is. Die raamwerk se implementering- en metingsproses moet deur die eienaar of bestuur van die mediumgrootte onderneming gelei, of verkieslik uitgevoer, word. Die werknemers, verskaffers en ander belanghebbendes se ondersteuning vir die raamwerk en gepaardgaande prosesse is baie belangrik vir die implementering en sukses van die raamwerk.
WANG, YUN, and 王云. "Adaptive Placement and Routing for Service Function Chains with Deadlines in Software-Defined Networks." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/8zw594.
Повний текст джерела國立臺灣科技大學
資訊工程系
106
Software-defined network(SDN) is shifting data communication in network toward more centralized control. The controller manages all necessary information and decides the transit path through commands. Middleboxes such as firewalls, decryptors, load balancers, etc., are functional hardware devices that are indispensable in the cloud and in corporate networks, but are expensive and difficult to maintain. The availability of virtual machines enables dynamic placement of virtual network functions(VNFs) on demand, it can reduce a large number of manual configuration processes, introduce flexibility, and increase deployment efficiency. Service requirements may need more than one VNF. Instead, it may need to traverse a set of sequential functional services called Service Function Chain (SFC). For example: first through the firewall, then through the encryption device, and finally through the decryption device, if these functional services are unordered, it will affect the correctness of the entire service requirements. A key challenge is to efficiently route service function chains and place processing functions in a network under operational constraints. We must overcome two challenges: (1) determining a flow path that traverses suitable processing nodes in the correct order to meet the requirements of a given service chain, and (2) considering network load and other dynamic characteristics when routing through existing VNFs. We present a method to solve the node-constrained service chain routing problem in a software-defined network. The main idea is to transform the network representation to a layered graph that considers processing steps and allows the use of conventional shortest path algorithms, such as Dijkstra’s algorithm, to solve the problem. We are not only pursuing the high efficiency of acceptance ratio, but also taking into account the execution time of the algorithm.
Hsiao, Chung-Che, and 蕭崇哲. "Placement of Virtual Network Functions Using the Relation of Virtual Network Functions in Service Chains." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/87018831856926973824.
Повний текст джерела國立清華大學
資訊工程學系
104
Network function virtualization (NFV) has changed the traditional usage of network functions from hardware appliances to software implementation. Placement of virtual network functions (VNFs) has become a fundamental problem in NFV. In this study, relation in VNFs, including dependency and changes of flow size, would be important factors in placement of VNFs onto virtual machines on servers. Metric embedding is adopted to combine the relation of VNFs and virtual machines on network servers. The structures shown in service chains are seized by embedding algorithm and thus reflect the result on placement of VNFs on the network. In the simulation section, the proposed technique is evaluated and performs well in test cases, showing that the proposed technique gives a fine solution to VNF placement problem.
Hsieh, Cheng-Husan, and 謝政軒. "Network-aware Service Function Chaining Placement in a Data Center." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/48fqrc.
Повний текст джерела國立交通大學
網路工程研究所
104
Network function virtualization (NFV) has drawn much attention in recent years; some network functions used to be deployed on the specific hardware have become virtualized instances on general servers to achieve more scalability and flexibility. In data center, service function chaining (SFC) makes different workflow traverse different network functions in a specific ordering to provide different levels of the service for its customer. Since the distance between any adjacent network functions in a service chain will decide the total bandwidth consumption for that chain, the placement of the virtualized network functions in data center becomes a major issue. In this thesis, we treat this placement problem as multi-layer bin packing problem and formulate it as Integer Linear Programming. We propose three algorithms for different network topologies. Partition Best-fit is designed for the topology-unaware, and Multi-layer Best-fit and Multi-layer Worst-fit are designed for the tree-like network topology. The experiment results show that both Partition Best-fit and Multi-layer Best-fit can reduce bandwidth consumption in 15% while only increase a little number of used servers in 1% compare to traditional Best-fit algorithm.
Shuo-San, Shih, and 史碩三. "A Service Function Cloud Platform with Hybrid NFV Environment Placement Strategy." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/3344vd.
Повний текст джерела國立中央大學
資訊工程學系
105
In recent years, the network functions virtualization (NFV) was proposed to separate network functions from the underlying hardware to provide value-added service functions with software. The concept of service function chain (SFC) architecture has also been proposed, which allow traffic pass through some value-added network functions between end-to-end services. The placement of the service functions in data centers significantly affects the performance of SFC. We study the service function placement problem in hybrid NFV environment, which is an alternative plan during the transition from traditional networks to NFV networks in data centers. We present GASFP, a high-performance approach for optimizing service function placement and service chaining in hybrid NFV environment. GASFP combine GA (Genetic Algorithm) and Greedy best-first search algorithm to reduce the waste of data center computation resource for providing SFC services and find a good solution to slow down the growth of delay from unsuitable service function placement. Simulation results show that when compared with other 3 algorithms: BINPacking, GKMSFP and VCD, GASFP has the best performance of average delay and VNF placement cost no matter in hybrid NFV environment or pure NFV environment. We also implement a service function cloud platform and a SFC steering mechanism named NSHSFC in XenServer to verify our works are more comprehensive and realistic than the former works. Keyword: Software-defined Networking; Service Function Chain; Network Function Virtualization; service function placement; genetic algorithm
Chou, Hsin-Yao, and 周新堯. "SDN-based Network Resource Management with Service Function Chain." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/qrnak9.
Повний текст джерела國立中央大學
資訊工程學系
103
In recent years, as growth of the cloud computing technology, more demand for network resources allocation and management of value-added services are appeared. The new concept of network service architecture, Service Function Chain (SFC), has been proposed. The specification of various vendor equipments is unique, prompts the traditional network to change. The purpose of Software-Defined Network (SDN) is to change the physical, complex network into a virtual, programmable and open network architecture. OpenFlow protocol is the most common technology for SDN architecture. The Network management can be more flexible by the centralized and programable property of OpenFlow. VLAN and OpenFlow based Service Function Chain (VOFSFC) and services deployment mechanism are proposed to improve the flexibility of the network service deployment and reduce the consumption of network resources. VOFSFC use the virtual LAN (VLAN) technology to develop VLAN of Path adoption mechanism. It can identify different requirements of network traffic, steer/deliver packets to service functions and record information of the traffic. In addition, consider the placement of service functions, develop and propose GARCH and K-Means Service Function Placement (GKMSFP) mechanism to cluster and deploy service functions for reduce the load of network resources. The results shows the proposed VOPSFC system can provide high elasticity and flexibility for the network management, and the proposed GKMSFP mechanism can reduce 45.6% network resource consumption from the general situation which without cluster mechanism. It shows that mechanisms can reduce the traffic load of network in the SFC system.
Частини книг з теми "Service Function Chain Placement"
Chen, Weihan, Xia Yin, Zhiliang Wang, Xingang Shi, and Jiangyuan Yao. "Placement and Routing Optimization Problem for Service Function Chain: State of Art and Future Opportunities." In Communications in Computer and Information Science, 176–88. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8101-4_17.
Повний текст джерелаGao, Lynn, Yutian Chen, and Bin Tang. "Service Function Chain Placement in Cloud Data Center Networks: A Cooperative Multi-agent Reinforcement Learning Approach." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 291–309. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-23141-4_22.
Повний текст джерелаKutiel, Gilad, and Dror Rawitz. "Service Chain Placement in SDNs." In Algorithmic Aspects of Cloud Computing, 27–40. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74875-7_3.
Повний текст джерелаGrigorjew, Alexej, Stanislav Lange, Thomas Zinner, and Phuoc Tran-Gia. "Performance Benchmarking of Network Function Chain Placement Algorithms." In Lecture Notes in Computer Science, 83–98. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74947-1_6.
Повний текст джерелаZhang, Shaojun, Yutong Ji, Yufan Cheng, Ying Wang, and Peng Yu. "Resource-Aware Reliability Assurance of Service Function Chain." In Proceedings of the 11th International Conference on Computer Engineering and Networks, 1500–1508. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-6554-7_165.
Повний текст джерелаOcampo, Andrés F., Juliver Gil-Herrera, Pedro H. Isolani, Miguel C. Neves, Juan F. Botero, Steven Latré, Lisandro Zambenedetti, Marinho P. Barcellos, and Luciano P. Gaspary. "Optimal Service Function Chain Composition in Network Functions Virtualization." In Lecture Notes in Computer Science, 62–76. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60774-0_5.
Повний текст джерелаLiu, Ziyu, Zeming Li, Chengchao Liang, and Zhanjun Liu. "Routing and Resource Allocation for Service Function Chain in Service-Oriented Network." In Communications and Networking, 465–80. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99200-2_35.
Повний текст джерелаShi, Zhan, Zanhong Wu, and Ying Zeng. "A Method of Service Function Chain Arrangement for Load Balancing." In Proceedings of the 9th International Conference on Computer Engineering and Networks, 35–42. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3753-0_4.
Повний текст джерелаKang, Zhongmiao, Yijie Li, Peiming Zhang, Donghai Huang, and Shaoyong Guo. "Service Function Chain Reliability Improvement Algorithm Based on Resource Characteristics." In Lecture Notes in Electrical Engineering, 206–12. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-6901-0_23.
Повний текст джерелаBittar, Abdullah, Ziqiang Wang, Amir Aghasharif, Changcheng Huang, Gauravdeep Shami, Marc Lyonnais, and Rodney Wilson. "Service Function Chaining Design & Implementation Using Network Service Mesh in Kubernetes." In Supercomputing Frontiers, 121–40. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10419-0_8.
Повний текст джерелаТези доповідей конференцій з теми "Service Function Chain Placement"
Kouah, Riad, Abdelhamid Alleg, Abir Laraba, and Toufik Ahmed. "Energy-Aware Placement for IoT-Service Function Chain." In 2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD). IEEE, 2018. http://dx.doi.org/10.1109/camad.2018.8515003.
Повний текст джерелаHmaity, Ali, Marco Savi, Francesco Musumeci, Massimo Tornatore, and Achille Pattavina. "Virtual Network Function placement for resilient Service Chain provisioning." In 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM). IEEE, 2016. http://dx.doi.org/10.1109/rndm.2016.7608294.
Повний текст джерелаYin, Xiaohan, Bo Cheng, Meng Wang, and Junliang Chen. "Availability-aware Service Function Chain Placement in Mobile Edge Computing." In 2020 IEEE World Congress on Services (SERVICES). IEEE, 2020. http://dx.doi.org/10.1109/services48979.2020.00028.
Повний текст джерелаHarutyunyan, Davit, Nashid Shahriar, Raouf Boutaba, and Roberto Riggio. "Latency-Aware Service Function Chain Placement in 5G Mobile Networks." In 2019 IEEE Conference on Network Softwarization (NetSoft). IEEE, 2019. http://dx.doi.org/10.1109/netsoft.2019.8806646.
Повний текст джерелаShang, Xiaojun, Zhenhua Liu, and Yuanyuan Yang. "Network Congestion-aware Online Service Function Chain Placement and Load Balancing." In ICPP 2019: 48th International Conference on Parallel Processing. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3337821.3337850.
Повний текст джерелаSavi, Marco, Massimo Tornatore, and Giacomo Verticale. "Impact of processing costs on service chain placement in network functions virtualization." In 2015 IEEE Conference on Network Function Virtualization and Software-Defined Networks (NFV-SDN). IEEE, 2015. http://dx.doi.org/10.1109/nfv-sdn.2015.7387426.
Повний текст джерелаChai, Hua, Jiao Zhang, Zenan Wang, Jiaming Shi, and Tao Huang. "A Parallel Placement Approach for Service Function Chain Using Deep Reinforcement Learning." In 2019 IEEE 5th International Conference on Computer and Communications (ICCC). IEEE, 2019. http://dx.doi.org/10.1109/iccc47050.2019.9064448.
Повний текст джерелаXu, Yansen, and Ved P. Kafle. "Optimal Service Function Chain Placement Modeling for Minimizing Setup and Operation Cost." In 2018 IEEE 7th International Conference on Cloud Networking (CloudNet). IEEE, 2018. http://dx.doi.org/10.1109/cloudnet.2018.8549288.
Повний текст джерелаWang, Meng, Bo Cheng, Wendi Feng, and Junliang Chen. "An Efficient Service Function Chain Placement Algorithm in a MEC-NFV Environment." In GLOBECOM 2019 - 2019 IEEE Global Communications Conference. IEEE, 2019. http://dx.doi.org/10.1109/globecom38437.2019.9013235.
Повний текст джерелаXu, Yansen, and Ved P. Kafle. "A Delay-Aware Service Function Chain Placement Scheme Based on Dynamic Programming." In 2018 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN). IEEE, 2018. http://dx.doi.org/10.1109/lanman.2018.8475115.
Повний текст джерела