Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9307
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSonney, Ram Harish-
dc.date.accessioned2014-11-19T07:06:04Z-
dc.date.available2014-11-19T07:06:04Z-
dc.date.issued1995-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9307-
dc.guideKumar, Padam-
dc.description.abstractA topology change in a network of computers is a node or,Iink crashing , or a link or node resuming operations. Topology maintenance involves keeping at each node--the correct graph of the currently operational portion of the network when the network is subject to topology changes. -Here I present a fast topology maintenance algorithm for networks with various speeds, which uses less than three time units for each broadcast by each node. The best previous algorithm required O(log D) broadcasts per node before all nodes knew the correct topology of the network, where D is the diameter of the currently operational portion of the network, whereas this algorithm requires at most five broadcasts per node, before all the nodes know the correct topology of the network.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectPARALLEL BROADCASTen_US
dc.subjectTOPOLOGYen_US
dc.subjectCOMPUTER NETWORKSen_US
dc.titlePARALLEL BROADCAST: A NEW ALGORITHM FOR TOPOLOGY MAINTENANCE IN COMPUTER NETWORKSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number246786en_US
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECD246786.pdf2.03 MBAdobe PDFView/Open


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