Zaloguj się

Gotowe bibliografie tematyczne / Service Function Chains / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Service Function Chains.

Artykuły w czasopismach na temat „Service Function Chains”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Service Function Chains”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Nguyen, Trinh, i Myungsik Yoo. "Mechanism for Dynamically Updating Service Function Chains in NFV". Journal of Korean Institute of Communications and Information Sciences 43, nr 9 (30.09.2018): 1476–82. http://dx.doi.org/10.7840/kics.2018.43.9.1476.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Tarik Moufakir, Mohamed Faten Zhani, Abdelouahed Gherbi, Moayad Aloqaily i Nadir Ghrada. "SFCaaS: Service function chains as a service in NFV environments". ITU Journal on Future and Evolving Technologies 3, nr 3 (8.12.2022): 679–92. http://dx.doi.org/10.52953/zpdb8065.

Pełny tekst źródła

Streszczenie:

With the growing deployment of emergent technologies like software-defined networking, network services are expected to be revolutionized. In this paper, we investigate offering Service Function Chains as a Service (SFCaaS) in NFV environments. We describe the potential business model to offer such a service and then we address the service function chain provisioning and resource allocation problem. As the chain is deployed thanks to virtual machines (i.e., instances) and links, we conduct first a detailed study of the costs of Amazon EC2 instances with respect to their location, size, type and performance. Afterwards, we address the resource allocation problem for service function chains from the SFC provider's perspective. We formulate the problem as an integer linear program aiming at reducing operational costs of the service function chains (i.e., costs of virtual machine instances and links, and synchronization among the instances). To address large-scale instances of the problem, we also propose a new heuristic algorithm to reduce operational costs taking into account the conducted study of the costs of Amazon EC2 instances. We show through extensive simulations that the proposed heuristic significantly reduces operational costs compared to a baseline algorithm inspired by the existing literature.

Style APA, Harvard, Vancouver, ISO itp.

3

Jalalitabar, Maryam, Evrim Guler, Danyang Zheng, Guangchun Luo, Ling Tian i Xiaojun Cao. "Embedding Dependence-Aware Service Function Chains". Journal of Optical Communications and Networking 10, nr 8 (19.07.2018): C64. http://dx.doi.org/10.1364/jocn.10.000c64.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Khosravian, Pouya, Sima Emadi, Ghasem Mirjalily i Behzad Zamani. "QoS-aware service composition based on context-free grammar and skyline in service function chaining using genetic algorithm". PeerJ Computer Science 7 (26.07.2021): e603. http://dx.doi.org/10.7717/peerj-cs.603.

Pełny tekst źródła

Streszczenie:

Service function chaining (SFC) is a mechanism that allows service providers to combine various service functions and exploit the available virtual infrastructure. The best selection of virtual services in the network is essential for meeting user requirements and constraints. This paper proposes a novel approach to generate the optimal composition of the service functions. To this end, a genetic algorithm based on context-free grammar (CFG) that adheres to the Internet Engineering Task Force (IETF) standard and Skyline was developed to use in SFC. The IETF uses cases of the data center, security, and mobile network filtered out the invalid service chains, which resulted in reduced search space. The proposed genetic algorithm found the Skyline service chain instance with the highest quality. The genetic operations were defined to ensure that the service function chains generated in the algorithm process were standard. The experimental results showed that the proposed service composition method outperformed the other methods regarding the quality of service (QoS), running time, and time complexity metrics. Ultimately, the proposed CFG could be generalized to other SFC use cases.

Style APA, Harvard, Vancouver, ISO itp.

5

Farkiani, Behrooz, Bahador Bakhshi, S. Ali MirHassani, Tim Wauters, Bruno Volckaert i Filip De Turck. "Prioritized Deployment of Dynamic Service Function Chains". IEEE/ACM Transactions on Networking 29, nr 3 (czerwiec 2021): 979–93. http://dx.doi.org/10.1109/tnet.2021.3055074.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Cai, Jun, Zhongwei Huang, Jianzhen Luo, Yan Liu, Huimin Zhao i Liping Liao. "Composing and deploying parallelized service function chains". Journal of Network and Computer Applications 163 (sierpień 2020): 102637. http://dx.doi.org/10.1016/j.jnca.2020.102637.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Katsikas, Georgios P., Marcel Enguehard, Maciej Kuźniar, Gerald Q. Maguire Jr i Dejan Kostić. "SNF: synthesizing high performance NFV service chains". PeerJ Computer Science 2 (14.11.2016): e98. http://dx.doi.org/10.7717/peerj-cs.98.

Pełny tekst źródła

Streszczenie:

In this paper we introduce SNF, a framework that synthesizes (S) network function (NF) service chains by eliminating redundant I/O and repeated elements, while consolidating stateful cross layer packet operations across the chain. SNF uses graph composition and set theory to determine traffic classes handled by a service chain composed of multiple elements. It then synthesizes each traffic class using a minimal set of new elements that apply single-read-single-write and early-discard operations. Our SNF prototype takes a baseline state of the art network functions virtualization (NFV) framework to the level of performance required for practical NFV service deployments. Software-based SNF realizes long (up to 10 NFs) and stateful service chains that achieve line-rate 40 Gbps throughput (up to 8.5x greater than the baseline NFV framework). Hardware-assisted SNF, using a commodity OpenFlow switch, shows that our approach scales at 40 Gbps for Internet Service Provider-level NFV deployments.

Style APA, Harvard, Vancouver, ISO itp.

8

Moens, Hendrik, i Filip De Turck. "Customizable Function Chains: Managing Service Chain Variability in Hybrid NFV Networks". IEEE Transactions on Network and Service Management 13, nr 4 (grudzień 2016): 711–24. http://dx.doi.org/10.1109/tnsm.2016.2580668.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Wang, Yun, Chih-Kai Huang, Shan-Hsiang Shen i Ge-Ming Chiu. "Adaptive Placement and Routing for Service Function Chains With Service Deadlines". IEEE Transactions on Network and Service Management 18, nr 3 (wrzesień 2021): 3021–36. http://dx.doi.org/10.1109/tnsm.2021.3086977.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Khosravi, Habib Allah, i Yaghoub Farjami. "Machine Learning Based Classifier for Service Function Chains". Computing and Informatics 39, nr 3 (2020): 410–38. http://dx.doi.org/10.31577/cai_2020_3_410.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Beck, Michael Till, i Juan Felipe Botero. "Scalable and coordinated allocation of service function chains". Computer Communications 102 (kwiecień 2017): 78–88. http://dx.doi.org/10.1016/j.comcom.2016.09.010.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

12

Liu, Weihua, Xuan Zhao i Runze Wu. "Revenue-Sharing Contract Models for Logistics Service Supply Chains with Mass Customization Service". Mathematical Problems in Engineering 2015 (2015): 1–21. http://dx.doi.org/10.1155/2015/572624.

Pełny tekst źródła

Streszczenie:

The revenue-sharing contract is one of the most important supply chain coordination contracts; it has been applied in various supply chains. However, studies related to service supply chains with mass customization (MC) are lacking. Considering the equity of benefit distribution between the members of service supply chains, in this paper, we designed two revenue-sharing contracts. The first contract for the maximum equity of a single logistics service integrator (LSI) and single functional logistics service provider (FLSP) in a two-echelon logistics service supply chain was designed by introducing the fair entropy function (“one to one” model). Furthermore, the method is extended to a more complex supply chain, which consists of a single LSI and multiple FLSPs. A new contract was designed not only for considering the equity of an LSI and each FLSP but also for the equity between each FLSP (“one toN” model). The “one to one” model in three-echelon LSSC is also provided. The result exemplifies that, whether in the “one to one” model or “one toN” model, there exists a best interval of customized level when the revenue-sharing coefficient reaches its maximum.

Style APA, Harvard, Vancouver, ISO itp.

13

Abdelaal, Marwa A., Gamal A. Ebrahim i Wagdy R. Anis. "Efficient Placement of Service Function Chains in Cloud Computing Environments". Electronics 10, nr 3 (30.01.2021): 323. http://dx.doi.org/10.3390/electronics10030323.

Pełny tekst źródła

Streszczenie:

The widespread adoption of network function virtualization (NFV) leads to providing network services through a chain of virtual network functions (VNFs). This architecture is called service function chain (SFC), which can be hosted on top of commodity servers and switches located at the cloud. Meanwhile, software-defined networking (SDN) can be utilized to manage VNFs to handle traffic flows through SFC. One of the most critical issues that needs to be addressed in NFV is VNF placement that optimizes physical link bandwidth consumption. Moreover, deploying SFCs enables service providers to consider different goals, such as minimizing the overall cost and service response time. In this paper, a novel approach for the VNF placement problem for SFCs, called virtual network functions and their replica placement (VNFRP), is introduced. It tries to achieve load balancing over the core links while considering multiple resource constraints. Hence, the VNF placement problem is first formulated as an integer linear programming (ILP) optimization problem, aiming to minimize link bandwidth consumption, energy consumption, and SFC placement cost. Then, a heuristic algorithm is proposed to find a near-optimal solution for this optimization problem. Simulation studies are conducted to evaluate the performance of the proposed approach. The simulation results show that VNFRP can significantly improve load balancing by 80% when the number of replicas is increased. Additionally, VNFRP provides more than a 54% reduction in network energy consumption. Furthermore, it can efficiently reduce the SFC placement cost by more than 67%. Moreover, with the advantages of a fast response time and rapid convergence, VNFRP can be considered as a scalable solution for large networking environments.

Style APA, Harvard, Vancouver, ISO itp.

14

Xin, Baogui, Le Zhang i Lei Xie. "Pricing decision of a dual-channel supply chain with different payment, corporate social responsibility and service level". RAIRO - Operations Research 56, nr 1 (styczeń 2022): 49–75. http://dx.doi.org/10.1051/ro/2021187.

Pełny tekst źródła

Streszczenie:

Strategies such as price, CSR, and service have an important impact on enterprises and supply chains. This paper proposes a two-echelon dual-channel supply chain composed of a manufacturer and a retailer. Considering the product pricing, CSR level, and service level in the supply chain, this paper employs the Stackelberg game to depict supply chain participants’ optimal decisions and analyze the influence of explanatory variables on the optimal decision with retailer’s payment methods. The results state that market share, service level, CSR, and financing interest rate significantly impact the pricing decision of all participants in the supply chain. In addition, strategies of CSR level and service level are also affected by the discount rate of advance payment, financing interest rate, return on investment, and opportunity cost rate. This paper incorporates CSR and service level into the objective function, considers a variety of retailers’ payment methods, enriches the supply chain’s pricing model, and is of great value to scientific decision-making of enterprises and sustainable development of supply chains.

Style APA, Harvard, Vancouver, ISO itp.

15

Sun, Jian, Guanhua Huang, Gang Sun, Hongfang Yu, Arun Kumar Sangaiah i Victor Chang. "A Q-Learning-Based Approach for Deploying Dynamic Service Function Chains". Symmetry 10, nr 11 (16.11.2018): 646. http://dx.doi.org/10.3390/sym10110646.

Pełny tekst źródła

Streszczenie:

As the size and service requirements of today’s networks gradually increase, large numbers of proprietary devices are deployed, which leads to network complexity, information security crises and makes network service and service provider management increasingly difficult. Network function virtualization (NFV) technology is one solution to this problem. NFV separates network functions from hardware and deploys them as software on a common server. NFV can be used to improve service flexibility and isolate the services provided for each user, thus guaranteeing the security of user data. Therefore, the use of NFV technology includes many problems worth studying. For example, when there is a free choice of network path, one problem is how to choose a service function chain (SFC) that both meets the requirements and offers the service provider maximum profit. Most existing solutions are heuristic algorithms with high time efficiency, or integer linear programming (ILP) algorithms with high accuracy. It’s necessary to design an algorithm that symmetrically considers both time efficiency and accuracy. In this paper, we propose the Q-learning Framework Hybrid Module algorithm (QLFHM), which includes reinforcement learning to solve this SFC deployment problem in dynamic networks. The reinforcement learning module in QLFHM is responsible for the output of alternative paths, while the load balancing module in QLFHM is responsible for picking the optimal solution from them. The results of a comparison simulation experiment on a dynamic network topology show that the proposed algorithm can output the approximate optimal solution in a relatively short time while also considering the network load balance. Thus, it achieves the goal of maximizing the benefit to the service provider.

Style APA, Harvard, Vancouver, ISO itp.

16

Cai, Jun, Zhongwei Huang, Liping Liao, Jianzhen Luo i Wai-Xi Liu. "APPM: Adaptive Parallel Processing Mechanism for Service Function Chains". IEEE Transactions on Network and Service Management 18, nr 2 (czerwiec 2021): 1540–55. http://dx.doi.org/10.1109/tnsm.2021.3052223.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Zhao, Dongcheng, Jing Ren, Rongping Lin, Shizhong Xu i Victor Chang. "On Orchestrating Service Function Chains in 5G Mobile Network". IEEE Access 7 (2019): 39402–16. http://dx.doi.org/10.1109/access.2019.2895316.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Hu, Haiyan, Qiaoyan Kang, Shuo Zhao, Jianfeng Wang i Youbin Fu. "Service Function Chain Deployment Method Based on Traffic Prediction and Adaptive Virtual Network Function Scaling". Electronics 11, nr 16 (22.08.2022): 2625. http://dx.doi.org/10.3390/electronics11162625.

Pełny tekst źródła

Streszczenie:

With the development of network function virtualization (NFV), the resource management of service function chains (SFC) in the virtualized environment has gradually become a research hotspot. Usually, users hope that they can get the network services they want anytime and anywhere. The network service requests are dynamic and real-time, which requires that the SFC in the NFV environment can also meet the dynamically changing network service requests. In this regard, this paper proposes an SFC deployment method based on traffic prediction and adaptive virtual network function (VNF) scaling. Firstly, an improved network traffic prediction method is proposed to improve its prediction accuracy for dynamically changing network traffic. Secondly, the predicted traffic data is processed for the subsequent scaling of the VNF. Finally, an adaptive VNF scaling method is designed for the purpose of dynamic management of network virtual resources. The experimental results show that the method proposed in this paper can manage the network resources in dynamic scenarios. It can effectively improve the availability of network services, reduce the operating overhead and achieve a good optimization effect.

Style APA, Harvard, Vancouver, ISO itp.

19

Kang, Rui, Fujun He i Eiji Oki. "Robust Virtual Network Function Allocation in Service Function Chains With Uncertain Availability Schedule". IEEE Transactions on Network and Service Management 18, nr 3 (wrzesień 2021): 2987–3005. http://dx.doi.org/10.1109/tnsm.2021.3076511.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Gausseran, Adrien, Andrea Tomassilli, Frederic Giroire i Joanna Moulierac. "Don’t interrupt me when you reconfigure my Service Function Chains". Computer Communications 171 (kwiecień 2021): 39–53. http://dx.doi.org/10.1016/j.comcom.2021.02.008.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

Bi, Yu, Carlos Colman Meixner, Monchai Bunyakitanon, Xenofon Vasilakos, Reza Nejabati i Dimitra Simeonidou. "Multi-Objective Deep Reinforcement Learning Assisted Service Function Chains Placement". IEEE Transactions on Network and Service Management 18, nr 4 (grudzień 2021): 4134–50. http://dx.doi.org/10.1109/tnsm.2021.3127685.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Mechtri, Marouen, Chaima Ghribi i Djamal Zeghlache. "A Scalable Algorithm for the Placement of Service Function Chains". IEEE Transactions on Network and Service Management 13, nr 3 (wrzesień 2016): 533–46. http://dx.doi.org/10.1109/tnsm.2016.2598068.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

23

Dinh, NGOC-Thanh, i Younghan Kim. "An Efficient Reliability Guaranteed Deployment Scheme for Service Function Chains". IEEE Access 7 (2019): 46491–505. http://dx.doi.org/10.1109/access.2019.2908185.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Khoshkholghi, Mohammad Ali, Michel Gokan Khan, Kyoomars Alizadeh Noghani, Javid Taheri, Deval Bhamare, Andreas Kassler, Zhengzhe Xiang, Shuiguang Deng i Xiaoxian Yang. "Service Function Chain Placement for Joint Cost and Latency Optimization". Mobile Networks and Applications 25, nr 6 (21.11.2020): 2191–205. http://dx.doi.org/10.1007/s11036-020-01661-w.

Pełny tekst źródła

Streszczenie:

AbstractNetwork Function Virtualization (NFV) is an emerging technology to consolidate network functions onto high volume storages, servers and switches located anywhere in the network. Virtual Network Functions (VNFs) are chained together to provide a specific network service, called Service Function Chains (SFCs). Regarding to Quality of Service (QoS) requirements and network features and states, SFCs are served through performing two tasks: VNF placement and link embedding on the substrate networks. Reducing deployment cost is a desired objective for all service providers in cloud/edge environments to increase their profit form demanded services. However, increasing resource utilization in order to decrease deployment cost may lead to increase the service latency and consequently increase SLA violation and decrease user satisfaction. To this end, we formulate a multi-objective optimization model to joint VNF placement and link embedding in order to reduce deployment cost and service latency with respect to a variety of constraints. We, then solve the optimization problem using two heuristic-based algorithms that perform close to optimum for large scale cloud/edge environments. Since the optimization model involves conflicting objectives, we also investigate pareto optimal solution so that it optimizes multiple objectives as much as possible. The efficiency of proposed algorithms is evaluated using both simulation and emulation. The evaluation results show that the proposed optimization approach succeed in minimizing both cost and latency while the results are as accurate as optimal solution obtained by Gurobi (5%).

Style APA, Harvard, Vancouver, ISO itp.

25

Yu, Heng, Zhilong Zheng, Junxian Shen, Congcong Miao, Chen Sun, Hongxin Hu, Jun Bi, Jianping Wu i Jilong Wang. "Octans: Optimal Placement of Service Function Chains in Many-Core Systems". IEEE Transactions on Parallel and Distributed Systems 32, nr 9 (1.09.2021): 2202–15. http://dx.doi.org/10.1109/tpds.2021.3063613.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

Zhai, Dong, Xiangru Meng, Zhenhua Yu, Hang Hu i Xiaoyang Han. "A fine-grained and dynamic scaling method for service function chains". Knowledge-Based Systems 228 (wrzesień 2021): 107289. http://dx.doi.org/10.1016/j.knosys.2021.107289.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

27

Feng, Bohao, Guanglei Li, Guanwen Li, Yuming Zhang, Huachun Zhou i Shui Yu. "Enabling Efficient Service Function Chains at Terrestrial-Satellite Hybrid Cloud Networks". IEEE Network 33, nr 6 (listopad 2019): 94–99. http://dx.doi.org/10.1109/mnet.2019.1800426.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Yao, Hong, Muzhou Xiong, Hui Li, Lin Gu i Deze Zeng. "Joint optimization of function mapping and preemptive scheduling for service chains in network function virtualization". Future Generation Computer Systems 108 (lipiec 2020): 1112–18. http://dx.doi.org/10.1016/j.future.2017.12.021.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Engelmann, Anna, i 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, nr 3 (30.09.2021): 1–24. http://dx.doi.org/10.1145/3477046.

Pełny tekst źródła

Streszczenie:

In data center networks, the reliability of Service Function Chain (SFC)—an end-to-end service presented by a chain of virtual network functions (VNFs)—is a complex and specific function of placement, configuration, and application requirements, both in hardware and software. Existing approaches to reliability analysis do not jointly consider multiple features of system components, including, (i) heterogeneity, (ii) disjointness, (iii) sharing, (iv) redundancy, and (v) failure interdependency. To this end, we develop a novel analysis of service reliability of the so-called generic SFC, consisting of n = k + r sub-SFCs, whereby k ≥ 1 and r ≥ 0 are the numbers of arbitrary placed primary and backup (redundant) sub-SFCs, respectively. Our analysis is based on combinatorics and a reduced binomial theorem—resulting in a simple approach, which, however, can be utilized to analyze rather complex SFC configurations. The analysis is practically applicable to various VNF placement strategies in arbitrary data center configurations, and topologies and can be effectively used for evaluation and optimization of reliable SFC placements.

Style APA, Harvard, Vancouver, ISO itp.

30

Manzanares-Lopez, Pilar, Juan Pedro Muñoz-Gea i Josemaria Malgosa-Sanahuja. "VNF Placement for Service Function Chains with Strong Low-Delay Restrictions in Edge Computing Networks". Applied Sciences 10, nr 18 (20.09.2020): 6573. http://dx.doi.org/10.3390/app10186573.

Pełny tekst źródła

Streszczenie:

The edge computing paradigm, allowing the location of network services close to end users, defines new network scenarios. One of them considers the existence of micro data centers, with reduced resources but located closer to service requesters, to complement remote cloud data centers. This hierarchical and geo-distributed architecture allows the definition of different time constraints that can be taken into account when mapping services into data centers. This feature is especially useful in the Virtual Network Function (VNF) placement problem, where the network functions composing a Service Function Chain (SFC) may require more or less strong delay restrictions. We propose the ModPG (Modified Priority-based Greedy) heuristic, a VNF placement solution that weighs the latency, bandwidth, and resource restrictions, but also the instantiation cost of VNFs. ModPG is an improved solution of a previous proposal (called PG). Although both heuristics share the same optimization target, that is the reduction of the total substrate resource cost, the ModPG heuristic identifies and solves a limitation of the PG solution: the mapping of sets of SFCs that include a significant proportion of SFC requests with strong low-delay restrictions. Unlike PG heuristic performance evaluation, where the amount of SFC requests with strong low-delay restrictions is not considered as a factor to be analyzed, in this work, both solutions are compared considering the presence of 1%, 15%, and 25% of this type of SFC request. Results show that the ModPG heuristic optimizes the target cost similarly to the original proposal, and at the same time, it offers a better performance when a significant number of low-delay demanding SFC requests are present.

Style APA, Harvard, Vancouver, ISO itp.

31

Gunleifsen, Håkon, Thomas Kemmerich i Vasileios Gkioulos. "A Proof-of-Concept Demonstration of Isolated and Encrypted Service Function Chains". Future Internet 11, nr 9 (24.08.2019): 183. http://dx.doi.org/10.3390/fi11090183.

Pełny tekst źródła

Streszczenie:

Contemporary Service Function Chaining (SFC), and the requirements arising from privacy concerns, call for the increasing integration of security features such as encryption and isolation across Network Function Virtualisation (NFV) domains. Therefore, suitable adaptations of automation and encryption concepts for the development of interconnected data centre infrastructures are essential. Nevertheless, packet isolation constraints related to the current NFV infrastructure and SFC protocols, render current NFV standards insecure. Accordingly, the goal of our work was an experimental demonstration of a new SFC packet forwarding standard that enables contemporary data centres to overcome these constraints. This article presents a comprehensive view of the developed architecture, focusing on the elements that constitute a new forwarding standard of encrypted SFC packets. Through a Proof-of-Concept demonstration, we present our closing experimental results of how the architecture fulfils the requirements defined in our use case.

Style APA, Harvard, Vancouver, ISO itp.

32

Aguado, A., D. R. López, A. Pastor, V. López, J. P. Brito, M. Peev, A. Poppe i V. Martín. "Quantum cryptography networks in support of path verification in service function chains". Journal of Optical Communications and Networking 12, nr 4 (7.02.2020): B9. http://dx.doi.org/10.1364/jocn.379799.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

Gour, Riti, Genya Ishigaki, Jian Kong i Jason P. Jue. "Availability-guaranteed slice composition for service function chains in 5G transport networks". Journal of Optical Communications and Networking 13, nr 3 (8.01.2021): 14. http://dx.doi.org/10.1364/jocn.403721.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Luo, Jianzhen, Jun Li, Lei Jiao i Jun Cai. "On the Effective Parallelization and Near-Optimal Deployment of Service Function Chains". IEEE Transactions on Parallel and Distributed Systems 32, nr 5 (1.05.2021): 1238–55. http://dx.doi.org/10.1109/tpds.2020.3043768.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

Huang, Zhongwei, Dagang Li, Chenhao Wu i Hua Lu. "Reinforcement Learning-Based Delay-Aware Path Exploration of Parallelized Service Function Chains". Mathematics 10, nr 24 (11.12.2022): 4698. http://dx.doi.org/10.3390/math10244698.

Pełny tekst źródła

Streszczenie:

The parallel processing of the service function chain (SFC) is expected to provide better low-delay service delivery, because it breaks through the bottleneck of traditional serial processing mode in which service delay increases linearly with the SFC length. However, the provision of parallelized SFC (PSFC) is much more difficult due to the unique construction of PSFCs, inevitable parallelization overhead, and delay balancing requirement of PSFC branches; therefore, existing mechanisms for serial SFC cannot be directly applied to PSFC. After a comprehensive review of recent related work, we find that traffic scheduling mechanisms for PSFCs is still lacking. In this paper, a delay-aware traffic scheduling mechanism (DASM) for PSFCs is proposed. DASM first transforms PSFC into several serial SFCs by releasing the upstream VNF constraints so as to handle them independently while keeping their parallel relations. Secondly, DASM realizes delay-aware PSFC traffic scheduling based on the reinforcement learning (RL) method. To the best knowledge of the authors, this is the first attempt to address the PSFC traffic scheduling problem by transforming them into independent serial SFCs. Simulation results show that the proposed DASM outperforms the advanced PSFCs scheduling strategies in terms of delay balance and throughput.

Style APA, Harvard, Vancouver, ISO itp.

36

Wang, Yangang, Hai Wang, Xianglin Wei, Kuang Zhao, Jianhua Fan, Juan Chen, Yongyang Hu i Runa Jia. "Service Function Chain Scheduling in Heterogeneous Multi-UAV Edge Computing". Drones 7, nr 2 (13.02.2023): 132. http://dx.doi.org/10.3390/drones7020132.

Pełny tekst źródła

Streszczenie:

Supporting Artificial Intelligence (AI)-enhanced intelligent applications on the resource-limited Unmanned Aerial Vehicle (UAV) platform is difficult due to the resource gap between the two. It is promising to partition an AI application into a service function (SF) chain and then dispatch the SFs onto multiple UAVs. However, it is still a challenging task to efficiently schedule the computation and communication resources of multiple UAVs to support a large number of SF chains (SFCs). Under the multi-UAV edge computing paradigm, this paper formulates the SFC scheduling problem as a 0–1 nonlinear integer programming problem. Then, a two-stage heuristic algorithm is put forward to solve this problem. At the first stage, if the resources are surplus, the SFCs are deployed to UAV edge servers in parallel based on our proposed pairing principle between SFCs and UAVs for minimizing the completion time sum of tasks. In contrast, a revenue maximization heuristic method is adopted to deploy the arrived SFCs in a serial service mode when the resource is insufficient. A series of experiments are conducted to evaluate the performance of our proposal. Results show that our algorithm outperforms other benchmark algorithms in the completion time sum of tasks, the overall revenue, and the task execution success ratio

Style APA, Harvard, Vancouver, ISO itp.

37

Xuan, Junlei, Huifang Yang, Xuelin Zhao, Xingpo Ma i Xiaokai Yang. "Deep Reinforcement Learning-Based Algorithm for VNF-SC Deployment". Security and Communication Networks 2021 (6.10.2021): 1–11. http://dx.doi.org/10.1155/2021/7398206.

Pełny tekst źródła

Streszczenie:

Network function virtualization (NFV) has the potential to lead to significant reductions in capital expenditure and can improve the flexibility of the network. Virtual network function (VNF) deployment problem will be one of key problems that need to be addressed in NFV. To solve the problem of routing and VNF deployment, an optimization model, which minimizes the maximum index of used frequency slots, the number of used frequency slots, and the number of initialized VNF, is established. In this optimization model, the dependency among the different VNFs is considered. In order to solve the service chain mapping problem of high dynamic virtual network, a new virtual network function service chain mapping algorithm PDQN-VNFSC was proposed by combining prediction algorithm and DQN (Deep Q-Network). Firstly, the real-time mapping of virtual network service chains is modeled into a partial observable Markov decision process. Then, the real-time mapping process of virtual network service chain is optimized by using global and long-term benefits. Finally, the service chain of virtual network function is mapped through the learning decision framework of offline learning and online deployment. The simulation results show that, compared with the existing algorithms, the proposed algorithm has a lower the maximum index of used frequency slots, the number of used frequency slots, and the number of initialized VNF.

Style APA, Harvard, Vancouver, ISO itp.

38

Pei, Jianing, Peilin Hong, Kaiping Xue i Defang Li. "Efficiently Embedding Service Function Chains with Dynamic Virtual Network Function Placement in Geo-Distributed Cloud System". IEEE Transactions on Parallel and Distributed Systems 30, nr 10 (1.10.2019): 2179–92. http://dx.doi.org/10.1109/tpds.2018.2880992.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

39

Sun, Gang, Run Zhou, Jian Sun, Hongfang Yu i Athanasios V. Vasilakos. "Energy-Efficient Provisioning for Service Function Chains to Support Delay-Sensitive Applications in Network Function Virtualization". IEEE Internet of Things Journal 7, nr 7 (lipiec 2020): 6116–31. http://dx.doi.org/10.1109/jiot.2020.2970995.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

40

Qi Xu, Deyun Gao, Huachun Zhou, Bohao Feng i Taixin Li. "OpenNSP: Open Network Service Provision for Mobile Networks". Research Briefs on Information and Communication Technology Evolution 3 (15.05.2017): 42–52. http://dx.doi.org/10.56801/rebicte.v3i.43.

Pełny tekst źródła

Streszczenie:

In recent years, many innovative techniques are emerged for satisfying various user requirements,such as Software Definition Network (SDN) and Network Function Virtualization (NFV). However,the current solutions for network service provision still lack enough flexibility and openness thatresult in high expenditures and complexity. Thus, we propose an Open Network Service Provision(OpenNSP) solution in this paper, aiming to address the multi-domain problems of service functionchain outsourcing for mobile networks. Particularly, OpenNSP is based on IETF hierarchical servicefunction chaining (hSFC) architecture to implement service chains hierarchically in multi-domainnetworks comprising operator network and cloud datacenters. It outsources service chains, which isusually located in SGi-LAN, to the public clouds, enabling fast, flexible and cost-effective networkservice provision. Besides, OpenNSP achieves the programmable service function placement andchaining by the integration of SDN and NFV. Much work has been done, and the experiment resultsconfirm its feasibility and flexibility.

Style APA, Harvard, Vancouver, ISO itp.

41

Sun, Jian, Yue Chen, Miao Dai, Wanting Zhang, Arun Sangaiah, Gang Sun i Han Han. "Energy Efficient Deployment of a Service Function Chain for Sustainable Cloud Applications". Sustainability 10, nr 10 (29.09.2018): 3499. http://dx.doi.org/10.3390/su10103499.

Pełny tekst źródła

Streszczenie:

With the increasing popularity of the Internet, user requests for cloud applications have dramatically increased. The traditional model of relying on dedicated hardware to implement cloud applications has not kept pace with the rapid growth in demand. Network function virtualization (NFV) architecture emerged at a historic moment. By moving the implementation of functions to software, a separation of functions and hardware was achieved. Therefore, when user demand increases, cloud application providers only need to update the software; the underlying hardware does not change, which can improve network scalability. Although NFV solves the problem of network expansion, deploying service function chains into the underlying network to optimize indicators remains an important research problem that requires consideration of delay, reliability, and power consumption. In this paper, we consider the optimization of power consumption with the premise of guaranteeing a certain virtual function link yield. We propose an efficient algorithm that is based on first-fit and greedy algorithms to solve the problem. The simulation results show that the proposed algorithm substantially improves the path-finding efficiency, achieves a higher request acceptance ratio and reduces power consumption while provisioning the cloud applications. Compared with the baseline algorithm, the service function chain (SFC) acceptance ratio of our proposed algorithms improves by a maximum of approximately 15%, our proposed algorithm reduces the power consumption by a maximum of approximately 15%, the average link load ratio of our proposed algorithm reduces by a maximum of approximately 20%, and the average mapped path length of our proposed algorithm reduces by a maximum of approximately 1.5 hops.

Style APA, Harvard, Vancouver, ISO itp.

42

Venâncio, Giovanni, Rogério C. Turchetti i Elias Procópio Duarte Jr. "NFV-COIN: Unleashing The Power of In-Network Computing with Virtualization Technologies". Journal of Internet Services and Applications 12, nr 1 (18.11.2022): 46–53. http://dx.doi.org/10.5753/jisa.2022.2342.

Pełny tekst źródła

Streszczenie:

Network Functions Virtualization (NFV) allows the implementation in software of middleboxes traditionally available as specialized hardware. Network services can be implemented as SFCs (Service Function Chains) based onvirtualization technologies that run on commodity hardware. Although most virtualized functions have classic middlebox functionalities (e.g. firewalls or intrusion detectors) NFV technology can be used to leverage the networkto provide novel types of services to end-users. Actually, NFV can be very convenient to deploy traditional enduser services in the network, in the paradigm that has been called Computing In the Network (COIN). This articlediscusses the requirements to deploy COIN services using NFV technologies, which we call NFV-COIN. We alsopresent case studies and an NFV-COIN architecture that is compliant with the NFV-MANO reference model.

Style APA, Harvard, Vancouver, ISO itp.

43

Thiruvasagam, Prabhu Kaliyammal, Abhishek Chakraborty, Abin Mathew i C. Siva Ram Murthy. "Reliable Placement of Service Function Chains and Virtual Monitoring Functions With Minimal Cost in Softwarized 5G Networks". IEEE Transactions on Network and Service Management 18, nr 2 (czerwiec 2021): 1491–507. http://dx.doi.org/10.1109/tnsm.2021.3056917.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Ye, Zilong, Xiaojun Cao, Jianping Wang, Hongfang Yu i Chunming Qiao. "Joint topology design and mapping of service function chains for efficient, scalable, and reliable network functions virtualization". IEEE Network 30, nr 3 (maj 2016): 81–87. http://dx.doi.org/10.1109/mnet.2016.7474348.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Raddwan, Basheer, Khalil AL-Wagih, Ibrahim A. Al-Baltah, Mohamed A. Alrshah i Mohammed A. Al-Maqri. "Path Mapping Approach for Network Function Virtualization Resource Allocation with Network Function Decomposition Support". Symmetry 11, nr 9 (16.09.2019): 1173. http://dx.doi.org/10.3390/sym11091173.

Pełny tekst źródła

Streszczenie:

Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers.

Style APA, Harvard, Vancouver, ISO itp.

46

Sun, Jian, Guanhua Huang, Arun Kumar Sangaiah, Guangyang Zhu i Xiaojiang Du. "Towards Supporting Security and Privacy for Social IoT Applications: A Network Virtualization Perspective". Security and Communication Networks 2019 (14.03.2019): 1–15. http://dx.doi.org/10.1155/2019/4074272.

Pełny tekst źródła

Streszczenie:

Network function virtualization (NFV) is a new way to provide services to users in a network. Different from dedicated hardware that realizes the network functions for an IoT application, the network function of an NFV network is executed on general servers, and in order to achieve complete network functions, service function chaining (SFC) chains virtual network functions to work together to support an IoT application. In this paper, we focus on a main challenge in this domain, i.e., resource efficient provisioning for social IoT application oriented SFC requests. We propose an online SFC deployment algorithm based on the layered strategies of physical networks and an evaluation of physical network nodes, which can efficiently reduce bandwidth resource consumption (OSFCD-LSEM) and support the security and privacy of social IoT applications. The results of our simulation show that our proposed algorithm improves the bandwidth carrying rate, time efficiency, and acceptance rate by 50%, 60%, and 15%, respectively.

Style APA, Harvard, Vancouver, ISO itp.

47

Cao, Cui Zhen, i Guo Huao Zhao. "Decision-Making Model of Network Optimization in Green Supply Chain". Advanced Materials Research 962-965 (czerwiec 2014): 2277–82. http://dx.doi.org/10.4028/www.scientific.net/amr.962-965.2277.

Pełny tekst źródła

Streszczenie:

Network optimization design of green supply chains not only decides the structure and value of supply chains themselves, but also has great impact on the healthy, low-carbon development of whole society’s logistics system and transportation system. Based on carbon footprint theory, this paper elaborates the influence of carbon emission on overall value of supply chain. Penalty function coefficient is introduced to covert a multi-objective optimization problem to a single objective one; three objects, namely, profitability, service level and environmental protection, are thus coordinated. A network optimization model is also developed so as to achieve a green, low carbon supply chain, and to balance cost, response time and carbon footprint. An example is offered as proof of this model’s effectiveness, serving as a supplementary solution to optimization design of green supply chain network.

Style APA, Harvard, Vancouver, ISO itp.

48

Boyce, Wesley S., i Ray A. Mundy. "Practice or lip service: exploring collaboration perspectives in purchasing". IMP Journal 11, nr 3 (16.10.2017): 452–67. http://dx.doi.org/10.1108/imp-05-2016-0009.

Pełny tekst źródła

Streszczenie:

Purpose The purpose of this paper is to convey a sample of current collaboration perspectives in purchasing. The purchasing function has a critical role to play in collaborative relationships since it is a key facet of any given supply chain. These relationships may be beneficial when coordinated actions benefit buyers, suppliers, and the entire supply chain more than the uncoordinated efforts of individual firms. Despite the commonly reported benefits that can be gained in close relationships, recent research has indicated that collaboration attempts between firms in supply chains have not been as widespread as anticipated. Design/methodology/approach This research investigates the progress the purchasing function has made in achieving collaborative supply chain relationships. Input is gained from purchasing professionals via semi-structured interviews of procurement professionals. Grounded theory is used to deduct key themes from the interviews. Findings Results from a small sample size of nine interviews indicate that collaboration in purchasing has not yet reached the theoretical ideal, and it is suggested that key issues such as trust still do not exist at levels that would be appropriate to support collaborative relationships. Research limitations/implications This paper can be used as a basis to support further analysis that may broaden the scope of input from purchasing professionals. It is also difficult to draw generalizations from an interview method, and the sampling technique utilized limited the pool of potential interviewees to a sample size of nine semi-structured interviews. Practical implications This paper provides insights that purchasing professionals and those that deal with them can consider when engaging in supply chain relationships. It provides potential insights into where the purchasing function stands in its use of a collaborative strategy. Originality/value This paper focuses specifically on how the purchasing function is utilizing collaboration by gathering input from purchasing professionals. This practical viewpoint provides a realistic perspective that complements previous research on collaboration.

Style APA, Harvard, Vancouver, ISO itp.

49

Li, San-qi. "Generating function approach for discrete queueing analysis with decomposable arrival and service markov chains". Communications in Statistics. Stochastic Models 9, nr 3 (styczeń 1993): 401–20. http://dx.doi.org/10.1080/15326349308807272.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Ren, Wei, Yan Sun, Hong Luo i Mohammad S. Obaidat. "A New Scheme for IoT Service Function Chains Orchestration in SDN-IoT Network Systems". IEEE Systems Journal 13, nr 4 (grudzień 2019): 4081–92. http://dx.doi.org/10.1109/jsyst.2019.2921786.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!