Neighbor Gradient-based Multicast Routing for Service-Oriented Applications

With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which...

Full description

Saved in:
Bibliographic Details
Published in:KSII transactions on Internet and information systems 2012, 6(9), , pp.2231-2252
Main Authors: Wang, Hui, Mao, Jianbiao, Sun, Zhigang, Gong, Zhenghu, Lv, Gaofeng
Format: Article
Language:English
Subjects:
Algorithms
Analysis
컴퓨터학
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods. Keywords: Multicast, service-oriented application, distributed, neighbor gradient
ISSN:1976-7277
1976-7277
DOI:10.3837/tiis.2012.09.015