By Topic

Mapping Multicast Service-Oriented Virtual Networks with Delay and Delay Variation Constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Min Zhang ; Comput. Sci. Coll., Zhejiang Univ., Hangzhou, China ; Chunming Wu ; Ming Jiang ; Qiang Yang

As a key issue of building a virtual network (VN), the VN mapping problem can be addressed by various state-of-the-art algorithms. While these algorithms are efficient for the construction of unicast service-oriented VNs, they are generally not suitable for multicast cases. In this paper, we investigate the mapping problem in the context of virtual multicast service-oriented network subject to delay and delay variation constraints (VMNDDVC). We present a novel and efficient heuristic algorithm to tackle this problem based on a sliding window approach. The primary objective of this algorithm is in two-fold: to minimize the cost of VMNDDVC request mapping, and to achieve load balancing so as to increase the acceptance ratio of virtual multicast network (VMN) requests. The numerical results obtained from extensive simulation experiments demonstrate the effectiveness of the proposed approach and superiority than existing solutions in terms of VN mapping acceptance ratio, total revenue and cost in the long term.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010