With the popularization of terminal devices and services in Internet of things(IoT),it will be a challenge to design a network resource allocation method meeting various QoS requirements and effectively using substrat...With the popularization of terminal devices and services in Internet of things(IoT),it will be a challenge to design a network resource allocation method meeting various QoS requirements and effectively using substrate resources.In this paper,a dynamic network slicing mechanism including virtual network(VN)mapping and VN reconfiguration is proposed to provide network slices for services.Firstly,a service priority model is defined to create queue for resource allocation.Then a slice including Virtual Network Function(VNF)placement and routing with optimal cost is generated by VN mapping.Next,considering temporal variations of service resource requirements,the size of network slice is adjusted dynamically to guarantee resource utilization in VN reconfiguration.Additionally,load balancing factors are designed to make traffic balanced.Simulation results show that dynamic slicing mechanism not only saves 22%and 31%cost than static slicing mechanism with extending shortest path(SS_ESP)and dynamic slicing mechanism with embedding single path(DS_ESP),but also maintains high service acceptance rate.展开更多
The program slicing technique is employed to calculate the current values of the variables at some interest points in software test data generation. This paper introduces the concept of statement domination to represe...The program slicing technique is employed to calculate the current values of the variables at some interest points in software test data generation. This paper introduces the concept of statement domination to represent the multiple nests, and presents a dynamic program slice algorithm based on forward analysis to generate dynamic slices. In the approach, more attention is given to the statement itself or its domination node, so computing program slices is more easy and accurate, especially for those programs with multiple nests. In addition, a case study is discussed to illustrate our algorithm. Experimental results show that the slicing technique can be used in software test data generation to enhance the effectiveness.展开更多
基金This work is supported by National Natural Science Foundation of China(No.61702048).
文摘With the popularization of terminal devices and services in Internet of things(IoT),it will be a challenge to design a network resource allocation method meeting various QoS requirements and effectively using substrate resources.In this paper,a dynamic network slicing mechanism including virtual network(VN)mapping and VN reconfiguration is proposed to provide network slices for services.Firstly,a service priority model is defined to create queue for resource allocation.Then a slice including Virtual Network Function(VNF)placement and routing with optimal cost is generated by VN mapping.Next,considering temporal variations of service resource requirements,the size of network slice is adjusted dynamically to guarantee resource utilization in VN reconfiguration.Additionally,load balancing factors are designed to make traffic balanced.Simulation results show that dynamic slicing mechanism not only saves 22%and 31%cost than static slicing mechanism with extending shortest path(SS_ESP)and dynamic slicing mechanism with embedding single path(DS_ESP),but also maintains high service acceptance rate.
基金the National Natural Science Foundation of China (No. 60473032)the Science and Technology Emphases Item of China Ministry of Education (No. 105018)the Beijing Natural Science Foundation (No. 4072021)
文摘The program slicing technique is employed to calculate the current values of the variables at some interest points in software test data generation. This paper introduces the concept of statement domination to represent the multiple nests, and presents a dynamic program slice algorithm based on forward analysis to generate dynamic slices. In the approach, more attention is given to the statement itself or its domination node, so computing program slices is more easy and accurate, especially for those programs with multiple nests. In addition, a case study is discussed to illustrate our algorithm. Experimental results show that the slicing technique can be used in software test data generation to enhance the effectiveness.