DSpace
 

EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

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

Full metadata record

DC FieldValueLanguage
dc.contributor.authorKapoor, Sanjiv-
dc.contributor.authorRaghavan, Srivatsan-
dc.date.accessioned2006-08-07T03:25:15Z-
dc.date.available2006-08-07T03:25:15Z-
dc.date.issued2000-
dc.identifier.citationGlobal Telecommunications Conference, GLOBECOM IEEE, 1, 476 - 480p.en
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/2045-
dc.description.abstractMulti point routing algorithms capable of satisfying quality of service constraints such as delay boundedness and delay variation boundedness are becoming crucial with the advent of high speed networks. This paper addresses the problem of determining minimum cost paths to nodes in a multicast group satisfying delay bounds and delay variation bounds. A routing protocol is proposed and compared with previous schemes like DVMA (delay variation bounded multicast algorithm). The results show that the scheme proposed improves over the DVMA in the variation bounds achieved and is comparatively far more efficienten
dc.format.extent61411 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectdelay variation bounded multicast algorithmen
dc.titleImproved multicast routing with delay and delay variation constraintsen
dc.typeArticleen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
kapoorimp2000.pdf59.97 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