Download MINTED: MULTICAST VIRTUAL NETWORK EMBEDDING IN

www.pgembeddedsystems.com
MINTED: MULTICAST VIRTUAL NETWORK EMBEDDING IN CLOUD DATA
CENTERS WITH DELAY CONSTRAINTS
Abstract:
Network Virtualization is regarded as the pillar of cloud computing, enabling the multitenancy concept where multiple Virtual Networks (VNs) can cohabit the same substrate network.
With network virtualization, the problem of allocating resources to the various tenants,
commonly known as the Virtual Network Embedding problem, emerges as a challenging
problem. Its NP-Hard nature has drawn a lot of attention from the research community, many of
which however overlooked the type of communication that a given VN may exhibit, assuming
that they all exhibit a one-to-one (unicast) communication only. In this paper, we motivate the
importance of characterizing the mode of communication in VN requests, and we focus our
attention on the problem of embedding VNs with a one-to-many (multicast) communication
mode. Throughout this paper, we highlight the unique properties of multicast VNs and its distinct
Quality of Service (QoS) requirements, most notably the end-delay and delay-variation
constraints for delay-sensitive multicast services. Further, we showcase the limitations of
handling a multicast VN as unicast. To this extent, we formally define the VNE problem for
Multicast VNs (MVNs) and prove its NP-Hard nature. We propose two novel approach to solve
the Multicast VNE (MVNE) problem with end-delay and delay variation constraints: A 3-Step
MVNE technique, and a Tabu-Search algorithm. We motivate the intuition behind our proposed
embedding techniques, and provide a competitive analysis of our suggested approaches over
multiple metrics and against other embedding heuristics.
www.pgembeddedsystems.com
Existing System:
This resource allocation problem consists of allocating physical resources to the VMs
running a tenant’s service, and routing the traffic flow between them via substrate paths. While
this problem has been widely discussed for unicast VNs, embedding MVNs differs greatly from
that of unicast for several reasons: mainly a multicast VN comprises two types of virtual nodes
(machines): the multicast source node and a set of multicast recipient nodes (terminals). The
traffic flow routing now consists of building a multicast distribution tree between the multicast
source and terminals in order to avoid redundant traffic. Existing IP multicast routing schemes
are not suited for data center networks because they do not exploit path-diversity, thus leading to
poor resource utilization and network throughput. This is particularly true since typical data
center network topologies exhibit an abundance of equal cost paths. Indeed, the work shows that
the conventional receiver-driven multicast routing protocols yield far-from optimal distribution
trees when employed in such data center networks.
Proposed System:
We propose a Tabu-based search for solving the MVNE problem for multicast services
with heterogeneous resource demands over arbitrary network topologies. We compare our Tabu
approach against the 3-Step MVNE and other embedding heuristics, using multiple metrics and
over various substrate networks. Our numerical results prove that our Tabubased search yields
high network admissibility in considerably fast runtime.
www.pgembeddedsystems.com
Hardware Requirements:
• System : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• RAM : 256 Mb.
Software Requirements:
• Operating system : - Windows XP.
• Front End : - JSP
• Back End : - SQL Server
Software Requirements:
• Operating system : - Windows XP.
• Front End : - .Net
• Back End : - SQL Server