Dynamic and Parallel Resource Allocation with Analytical Performance Estimation for Virtualized Environment

Public Deposited
Resource Type
  • In this thesis, we propose an integrated approach for estimating the performance of virtual network resource allocation and a Genetic Algorithm (GA) based mechanism for online dynamic resource allocation in virtualized environment. The integrated approach is empowered by a novel loss network model with Dynamic Routing And Random Topology (DRART), which is combined with some existing models to create a synergy across different levels through an effective recursive process. Numerical results show the proposed integrated approach can provide accurate predictions on the performances of general virtual network embedding algorithms. We propose a virtual link mapping solution, i.e., Segment Based Genetic Algorithm (SBGA), which provides new definitions for genes and chromosomes in the Genetic Algorithm. Our SBGA approach enables parallel processing for searching optimal allocations. Our theoretical analysis shows that the execution time of our approach can be reduced to logarithmic time. To map virtual nodes and links to physical ones in one stage, we further develop an approach, named as GAOne. Our proposed GAOne approach applies the two-color graph coloring in graph theory to guide the crossover process in the Genetic Algorithm for valid solutions. Our simulation results show that the proposed GAOne approach is fast and efficient for online resource allocation applications in virtualized environment.

Thesis Degree Level
Thesis Degree Name
Thesis Degree Discipline
Rights Notes
  • Copyright © 2022 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
Date Created
  • 2022


In Collection: