Off-campus UMass Amherst users: To download campus access theses, please use the following link to log into our proxy server with your UMass Amherst user name and password.
Non-UMass Amherst users: Please talk to your librarian about requesting this thesis through interlibrary loan.
Theses that have an embargo placed on them will not be available to anyone until the embargo expires.
Access Type
Campus Access
Document Type
thesis
Degree Program
Electrical & Computer Engineering
Degree Type
Master of Science in Electrical and Computer Engineering (M.S.E.C.E.)
Year Degree Awarded
2011
Month Degree Awarded
February
Keywords
Network Virtualization, Virtual Network Mapping, Algorithms, Optimization, Mixed Integer Programming, Hub location Problem
Abstract
Network virtualization has become a primary enabler to solve the internet ossi- fication problem. It allows to run multiple architectures or protocols on a shared physical infrastructure. One of the important aspects of network virtualization is to have a virtual network (VN) mapping technique which uses the substrate resources efficiently. Currently, there exists very few VN mapping techniques and there is no common evaluation strategy which can test these algorithms effectively. In this thesis, we advocate the need for such a tool and develop it by considering a wide spectrum of parameters and simulation scenarios. We also provide various performance metrics and do a comparison study of the existing algorithms. Based on the comparative study, we point out the positives and negatives of the existing mapping algorithms and propose a new LP formulation based on Hub location approach that efficiently allocates substrate resources to the virtual network requests. Our results show that our algorithm does better in terms of number of successful network mappings and average time to map while balancing load on the network.
DOI
https://doi.org/10.7275/1694618
First Advisor
Tilman Wolf
Second Advisor
Ramgopal Mettu