DSpace
 

EPrints@IIT Delhi >
Faculty Research Publicatons  >
Electrical Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/551

Full metadata record

DC FieldValueLanguage
dc.contributor.authorRavikumar, C P-
dc.contributor.authorBajpai, Rajneesh-
dc.date.accessioned2005-07-27T06:34:50Z-
dc.date.available2005-07-27T06:34:50Z-
dc.date.issued1998-
dc.identifier.citationComputer Communications, 21(2), 126- I32en
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/551-
dc.description.abstractIn multimedia communication networks, the problem of multicasting assumes a new dimension. Apart from minimizing the cost of multicast communication, it is also necessary to ensure that each of the destination nodes receives the message within a bounded delay. Such delay-bounded multicast applications typically arise in multimedia conferencing. In this paper, we present agenetic algorithm for solving the delay-bounded multicast problem. We assume source-based routing, i.e. each source node completely determines the Steiner tree along which multicasting is performed. The genetic algorithm is a powerful optimization tool, and our experimental results reveal that a genetic algorithm provides fast and superior quality solutions to the delay-bounded multicast problem.en
dc.format.extent232698 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectMulticastingen
dc.subjectMultimedia communicationen
dc.subjectDelay-bounded communicationen
dc.subjectGenetic algorithmsen
dc.titleSource-based delay-bounded multicasting in multimediaen
dc.typeArticleen
Appears in Collections:Electrical Engineering

Files in This Item:

File Description SizeFormat
ravikumarsou1998.pdf227.24 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback