Steiner Tree Compilation of Multicast under Differentiated Services Constraints

This paper deals with the creation of multicast trees in a differentiated services (DiffServ) domain. Initially, we model the integration problems of multicast & DiffServ and give a general de-scription of our framework for multicast provisioning in DiffServ domains. Within this framework, we in...

Full description

Saved in:
Bibliographic Details
Published in:Journal of communications and networks 2007, 9(1), , pp.84-92
Main Authors: Vrontis, Stavros, Xynogalas, Stavros, Sykas, Efstathios
Format: Article
Language:Korean
Subjects:
전자/정보통신공학
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with the creation of multicast trees in a differentiated services (DiffServ) domain. Initially, we model the integration problems of multicast & DiffServ and give a general de-scription of our framework for multicast provisioning in DiffServ domains. Within this framework, we introduce a novel heuristic algorithm which calculates the multicast trees efficiently. The multicast tree's format and the bandwidth constraints per service class are modeled. The heuristic is based on the Dijkstra's shortest path algorithm and aims to produce the cheapest possible trees (Steiner tree problem) that conform to the defined model. The produced trees can be considered as DiffServ-customized Steiner trees. Furthermore, we evaluate the algorithm with theoretical and experimental analysis and finally, we present our conclusions.
ISSN:1229-2370
1976-5541