Study of Migration Policies in Energy-Aware Virtual Router Networks

Abstract

The definition of a virtual router layer allows the application of energy saving techniques based on the migration of virtual routers within the physical infrastructure as traffic conditions change. As traffic decreases, physical resources can be vacated through virtual router migration, thus, saving energy. Such resources can be reclaimed if needed because of traffic increase. Unfortunately, the migration of virtual routers involves reconfiguration costs depending on implementation details and characterized, for instance, by the revenue loss due to Quality-of-Service (QoS) degradation during the migration process. In this paper, we propose a methodology based on the Markov decision processes for the evaluation of optimal migration policies taking into account both the operation (in terms of energy consumption) and reconfiguration costs

An Analytical Cost-Optimal Cloudlet Placement Framework over Fiber-Wireless Networks with Quasi-Convex Latency Constraint

“…Thus, optimal placement of cloudlets over wireless access networks and placement of optimal number of VMs in cloudlets appeared to be essential research problems to several researchers because these aspects improve the cloudlet resource utilization significantly [12]. Note that, before the genesis of cloudlets and other edge-computing paradigms, researchers explored various VM migration techniques to optimize the power consumption in Network Function Virtualization (NFV) environments under a dynamic traffic scenario and became aware of its potential benefits [13,14]. The authors of [15] proposed a linear programming solution for computation offloading by considering the QoS requirements of mobile users while maximizing the revenue of service providers.…”

VR-Cluster: Dynamic Migration for Resource Fragmentation Problem in Virtual Router Platform

“…Thus, "resource fragmentation problem" is a severe problem. Unluckily, researchers do not pay any attention to the above problem, while putting lots of efforts into designing virtual router platform with high performance [7][8][9][10][11]. If we want to deploy virtual routers in the future, we should immediately start to attach importance to "resource fragmentation problem.…”

“…Many major router vendors and research communities have begun to follow suit in building support for router virtualization and explore how virtual routers can support multiple router instances running on the same underlying physical platform [2,[6][7][8][9][10][11]. It is a key device for bridging gap between network architectures and physical platforms.…”

“…In worst-fit mapping algorithm, it selects migrated router instance from the last to the first in F-allocated list and s e l e c t ; //search the first resource block (8) while ( < ){ (9) i f ( ( ) ≥ ( ) ) { (10) m o v e to ( ) ; (11) B r e a k ; (12) } (13) } //determine whether or not VR-Cluster meets (14) while ( < ){ (15) i f ( s e l e c t ; //search the first resource block (10) while ( < ){ (11) i f ( ( ) ≥ ( ) ) { (12) m o v e to ( ) ; (13) sort F-idle list from smallest to largest; (14) b r e a k ; (15) } (16) } //determine whether or not VR-Cluster meets (17) while ( < ){ (18) i f ( ( ) ≥ ( ) ){ (19) sort F-idle list from smallest to largest; (20) return SUCESS; searches the first resource block including enough remaining resources for migrated router instance in F-idle list. Once one router instance is moved, worst-fit mapping algorithm determines whether or not VR-Cluster can allocate new router instance: if not, best-fit mapping algorithm will dynamically move router instance again until VR-Cluster can establish new router instance or there is no unmoved router instance.…”

“…sort F-idle list from largest to smallest; (5) return SUCESS; (6) } (7) } (8) for( = ; ≤ ; − −){ (9) s e l e c t ; //search the first resource block (10) while ( < ){ (11) i f( ( ) ≥ ( ) ) { (12) m o v e to ( ) ; (13) sort F-idle list from largest to smallest; (14) b r e a k ; (15) } (16) } //determine whether or not VR-Cluster meets (17) while ( < ){ (18) i f ( ( ) ≥ ( ) ){ (19) sort F-idle list from largest to smallest; (20) return SUCESS; first-fit mapping algorithm, has to sort resource blocks from largest to smallest after VR-Cluster moves router instances or establishes new router instance. So, in worst-fit mapping algorithm, router instances may be located in some different servers in forwarding resource pool and control resource pool.…”