Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9307
Title: PARALLEL BROADCAST: A NEW ALGORITHM FOR TOPOLOGY MAINTENANCE IN COMPUTER NETWORKS
Authors: Sonney, Ram Harish
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;PARALLEL BROADCAST;TOPOLOGY;COMPUTER NETWORKS
Issue Date: 1995
Abstract: A 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.
URI: http://hdl.handle.net/123456789/9307
Other Identifiers: M.Tech
Research Supervisor/ Guide: Kumar, Padam
metadata.dc.type: M.Tech Dessertation
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.