Evaluation and Analysis of Three Typical Resource Allocation Algorithms in Virtual Router Platform

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

“…However, unreasonable mapping relationship between router instances and virtual router platform may result in low resource utilization and increase the failure possibility of creation of router instances. We had explored it in our previous works [12].…”

“…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.…”