Steiner tree compilation of multicast under differentiated services constraints

Vrontis, S; Xynogalas, S; Sykas, E

dc.contributor.author	Vrontis, S	en
dc.contributor.author	Xynogalas, S	en
dc.contributor.author	Sykas, E	en
dc.date.accessioned	2014-03-01T01:27:18Z
dc.date.available	2014-03-01T01:27:18Z
dc.date.issued	2007	en
dc.identifier.issn	1229-2370	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/18385
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-34247129472&partnerID=40&md5=7ccfa629111d2059d4ca4403f515707f	en
dc.subject	Differentiated services (DiffServ)	en
dc.subject	Multicast	en
dc.subject	Steiner tree problem	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Telecommunications	en
dc.subject.other	DIFFSERV	en
dc.title	Steiner tree compilation of multicast under differentiated services constraints	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	2007	en
heal.abstract	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 description 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. © 2007 KICS.	en
heal.publisher	KOREAN INST COMMUNICATIONS SCIENCES (K I C S)	en
heal.journalName	Journal of Communications and Networks	en
dc.identifier.isi	ISI:000245493000011	en
dc.identifier.volume	9	en
dc.identifier.issue	1	en
dc.identifier.spage	84	en
dc.identifier.epage	92	en