Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9577
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSarveshwar, B.-
dc.date.accessioned2014-11-19T13:18:26Z-
dc.date.available2014-11-19T13:18:26Z-
dc.date.issued1999-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9577-
dc.guideSarje, A. K.-
dc.description.abstractThis thesis presents a protocol for concurrent and reliable group multicast (many-to-many) from bursty data sources in general networks. In group multicast any node can be a multicast source and multiple nodes may start to multicast simultaneously i.e. asynchronous access to the network. In reliable multicasting the necessary requirement is to ensure that data is received correctly by all the active members of the multicast group. The approach used combines multicast operation along with internal flow control and thus provides the following features: 1. Congestion free multicast dynamic routing with implicit acknowledgements. 2. A node can access all the capacity allocated to it's group with no delay. However, if several nodes are active, the capacity is shared fairly. 3. A node can become active in a transparent fashion i.e. there is no need to explicitly notify the members of the group. 4. Under light load conditions, the multicast should reach all active nodes in a time proportional to the depth of the multicast tree.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectRELIABLE MULTICAST PROTOCOLen_US
dc.subjectIMPROVED DELAY CHARACTERISTICSen_US
dc.subjectCONGESTION FREE MULTICAST DYNAMIC ROUTINGen_US
dc.titleA RELIABLE MULTICAST PROTOCOL WITH IMPROVED DELAY CHARACTERISTICSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number247859en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD247859.pdf2.78 MBAdobe PDFView/Open


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