- BIUSTRE Home
- →
- Research Articles
- →
- Faculty of Sciences
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | He, Shiming | |
| dc.contributor.author | Xie, Kun | |
| dc.contributor.author | Zhou, Xuhui | |
| dc.contributor.author | Semong, Thabo | |
| dc.contributor.author | Wang, Jin | |
| dc.date.accessioned | 2022-08-30T08:18:36Z | |
| dc.date.available | 2022-08-30T08:18:36Z | |
| dc.date.issued | 2019-10-01 | |
| dc.identifier.citation | He, S. at al. (2019) Multi-source reliable multicast routing with QoS constraints of NFV in edge computing. Electronics , 8, 1106.doi:10.3390/electronics8101106. | en_US |
| dc.identifier.issn | 2079-9292 | |
| dc.identifier.uri | http://repository.biust.ac.bw/handle/123456789/473 | |
| dc.description.abstract | Edge Computing (EC) allows processing to take place near the user, hence ensuring scalability and low latency. Network Function Virtualization (NFV) provides the significant convenience of network layout and reduces the service operation cost in EC and data center. Nowadays, the interests of the NFV layout focus on one-to-one communication, which is costly when applied to multicast or group services directly. Furthermore, many artificial intelligence applications and services of cloud and EC are generally communicated through groups and have special Quality of Service (QoS) and reliable requirements. Therefore, we are devoted to the problem of reliable Virtual Network Function (VNF) layout with various deployment costs in multi-source multicast. To guarantee QoS, we take into account the bandwidth, latency, and reliability constraints. Additionally, a heuristic algorithm, named Multi-Source Reliable Multicast Tree Construction (RMTC), is proposed. The algorithm aims to find a common link to place the Service Function Chain (SFC) in the multilevel overlay directed (MOD) network of the original network, so that the deployed SFC can be shared by all users, thereby improving the resource utilization. We then constructed a Steiner tree to find the reliable multicast tree. Two real topologies are used to evaluate the performance of the proposed algorithm. Simulation results indicate that, compared to other heuristic algorithms, our scheme effectively reduces the cost of reliable services and satisfies the QoS requirements. | en_US |
| dc.description.sponsorship | This research was funded by the National Natural Science Foundation of China grant number 61802030 and 61572184, the Hunan Provincial Natural Science Foundation of China grant number 2017JJ1010 and 2016JC2075, the Open Research Fund of Key Lab of Broadband Wireless Communication and Sensor Network Technology (Nanjing University of Posts and Telecommunications), Ministry of Education grant number JZNY201905, the International Cooperative Project for “Double First-Class”, CSUST grant number 2018IC24, the Open Research Fund of the Hunan Provincial Key Laboratory of Network Investigational Technology grant number 2018WLZC003, the open project funding of CAS KeyLab of Network Data Science and Technology grant number CASNDST201704, and the open project funding of State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences grant number CARCH201809, and the Open Foundation of State Key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications) grant number SKLNST-2018-1-20. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Electronics | en_US |
| dc.subject | Edge computing | en_US |
| dc.subject | Network function virtualization | en_US |
| dc.subject | Multicast tree | en_US |
| dc.subject | Bandwidth | en_US |
| dc.subject | Latency | en_US |
| dc.title | Multi-source reliable multicast routing with QoS constraints of NFV in edge computing | en_US |
| dc.description.level | phd | en_US |
| dc.description.accessibility | unrestricted | en_US |
| dc.description.department | cis | en_US |
Files in this item
This item appears in the following Collection(s)
-
Faculty of Sciences
This collection is made up of pre and post research articles created by both staff and students from Faculty of Sciences