Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Algorithms for Assigning Substrate Network Resources to Virtual Network Components
 

Summary: Algorithms for Assigning Substrate Network
Resources to Virtual Network Components
Yong Zhu and Mostafa Ammar
Networking and Telecommunications Group
Georgia Institute of Technology, Atlanta, Georgia
Email: {yongzhu,ammar}@cc.gatech.edu
Abstract-- Recent proposals for network virtualization provide
a promising way to overcome the Internet ossification. The key
idea of network virtualization is to build a diversified Internet to
support a variety of network services and architectures through
a shared substrate. A major challenge in network virtualization
is the assigning of substrate resources to virtual networks (VN)
efficiently and on-demand. This paper focuses on two versions of
the VN assignment problem: VN assignment without reconfigu-
ration (VNA-I) and VN assignment with reconfiguration (VNA-
II). For the VNA-I problem, we develop a basic scheme as a
building block for all other advanced algorithms. Subdividing
heuristics and adaptive optimization strategies are then presented
to further improve the performance. For the VNA-II problem, we
develop a selective VN reconfiguration scheme that prioritizes the

  

Source: Ammar, Mostafa - College of Computing, Georgia Institute of Technology

 

Collections: Computer Technologies and Information Sciences