A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the ex...A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.展开更多
In 2017,it was estimated that the number of persons of all ages visually affected would be two hundred and eighty-five million,of which thirty-nine million are blind.There are several innovative technical solutions av...In 2017,it was estimated that the number of persons of all ages visually affected would be two hundred and eighty-five million,of which thirty-nine million are blind.There are several innovative technical solutions available to facilitate the movement of these people.The next big challenge for technical people is to give cost-effective solutions.One of the challenges for people with visual impairments is navigating safely,recognizing obstacles,and moving freely between locations in unfamiliar environments.A new mobile application solution is developed,and the application can be installed in android mobile.The application will visualize the environment with portable cameras and persons with visual impairment directly to the environment.The designed system mainly uses the YOLO3 program to identify and locate the distance between the objects and the camera.Furthermore,it determines the direction of the object.Finally,the system will give the voice command to teach/inform the visually impaired people to navigate the environment.It is a novel work at the global level.The proposed approach is cost-effective and affordable to all strata of society.展开更多
Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual ne...Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).展开更多
With the popularity and commercialization of cloud computing platforms, the security of virtualization technology must be guaranteed. The paper studies the protection of memory privacy under virtual platform to enhanc...With the popularity and commercialization of cloud computing platforms, the security of virtualization technology must be guaranteed. The paper studies the protection of memory privacy under virtual platform to enhance system security. Based on the monitoring of foreign mapping for Dom0, a memory privacy protection scheme is designed and implemented to prevent process memory pages in DomU being mapped illegally which might result in the leakage of secret data.展开更多
We design a task mapper TPCM for assigning tasks to virtual machines, and an application-aware virtual machine scheduler TPCS oriented for parallel computing to achieve a high performance in virtual computing systems....We design a task mapper TPCM for assigning tasks to virtual machines, and an application-aware virtual machine scheduler TPCS oriented for parallel computing to achieve a high performance in virtual computing systems. To solve the problem of mapping tasks to virtual machines, a virtual machine mapping algorithm (VMMA) in TPCM is presented to achieve load balance in a cluster. Based on such mapping results, TPCS is constructed including three components: a middleware supporting an application-driven scheduling, a device driver in the vip OS kernel, and a virtual machine scheduling algorithm. These components are implemented in the user space, vip OS, and the CPU virtualization subsystem of the Xen hypervisor, respectively. In TPCS, the progress statuses of tasks are transmitted to the underlying kernel from the user space, thus enabling virtual machine scheduling policy to schedule based on the progress of tasks. This policy aims to exchange completion time of tasks for resource utilization. Experimental results show that TPCM can mine the parallelism among tasks to implement the mapping from tasks to virtual machines based on the relations among subtasks. The TPCS scheduler can complete the tasks in a shorter time than can Credit and other schedulers, because it uses task progress to ensure that the tasks in virtual machines complete simultaneously, thereby reducing the time spent in pending, synchronization, communication, and switching. Therefore, parallel tasks can collaborate with each other to achieve higher resource utilization and lower overheads. We conclude that the TPCS scheduler can overcome the shortcomings of present algorithms in perceiving the progress of tasks, making it better than schedulers currently used in parallel computing.展开更多
基金Sponsored by the Funds for Creative Research Groups of China(Grant No. 60821001)National Natural Science Foundation of China(Grant No.60973108 and 60902050)973 Project of China (Grant No.2007CB310703)
文摘A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, the existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, virtual network mapping algorithm is proposed for large-scale network based on small-world characteristic of complex network and network coordinate system. Compared our algorithm with algorithm D-ViNE, experimental results show that our algorithm improves the overall performance.
基金This research is funded by Taif University,TURSP-2020/313.
文摘In 2017,it was estimated that the number of persons of all ages visually affected would be two hundred and eighty-five million,of which thirty-nine million are blind.There are several innovative technical solutions available to facilitate the movement of these people.The next big challenge for technical people is to give cost-effective solutions.One of the challenges for people with visual impairments is navigating safely,recognizing obstacles,and moving freely between locations in unfamiliar environments.A new mobile application solution is developed,and the application can be installed in android mobile.The application will visualize the environment with portable cameras and persons with visual impairment directly to the environment.The designed system mainly uses the YOLO3 program to identify and locate the distance between the objects and the camera.Furthermore,it determines the direction of the object.Finally,the system will give the voice command to teach/inform the visually impaired people to navigate the environment.It is a novel work at the global level.The proposed approach is cost-effective and affordable to all strata of society.
基金supported by the National Basic Research Program (973) of China (No. 2011CB302601)the National Natural Science Foundation of China (No. 90818028)the National High-Tech R&D Program (863) of China (No. 2007AA010301)
文摘Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).
基金Supported by the National Natural Science Foundation of China(61373169)the National High Technology Research and Development Program of China(863 Program)(2015AA016004)the Foundation of Science and Technology on Information Assure Laboratory(KJ-14-110,KJ-14-101)
文摘With the popularity and commercialization of cloud computing platforms, the security of virtualization technology must be guaranteed. The paper studies the protection of memory privacy under virtual platform to enhance system security. Based on the monitoring of foreign mapping for Dom0, a memory privacy protection scheme is designed and implemented to prevent process memory pages in DomU being mapped illegally which might result in the leakage of secret data.
基金Project (No. 2007AA010305) supported by the National High-Tech R&D Program (863) of China
文摘We design a task mapper TPCM for assigning tasks to virtual machines, and an application-aware virtual machine scheduler TPCS oriented for parallel computing to achieve a high performance in virtual computing systems. To solve the problem of mapping tasks to virtual machines, a virtual machine mapping algorithm (VMMA) in TPCM is presented to achieve load balance in a cluster. Based on such mapping results, TPCS is constructed including three components: a middleware supporting an application-driven scheduling, a device driver in the vip OS kernel, and a virtual machine scheduling algorithm. These components are implemented in the user space, vip OS, and the CPU virtualization subsystem of the Xen hypervisor, respectively. In TPCS, the progress statuses of tasks are transmitted to the underlying kernel from the user space, thus enabling virtual machine scheduling policy to schedule based on the progress of tasks. This policy aims to exchange completion time of tasks for resource utilization. Experimental results show that TPCM can mine the parallelism among tasks to implement the mapping from tasks to virtual machines based on the relations among subtasks. The TPCS scheduler can complete the tasks in a shorter time than can Credit and other schedulers, because it uses task progress to ensure that the tasks in virtual machines complete simultaneously, thereby reducing the time spent in pending, synchronization, communication, and switching. Therefore, parallel tasks can collaborate with each other to achieve higher resource utilization and lower overheads. We conclude that the TPCS scheduler can overcome the shortcomings of present algorithms in perceiving the progress of tasks, making it better than schedulers currently used in parallel computing.
