Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9604
Title: STUDY OF ROUTING ALGORITHMS FOR MULTI-DIMENSIONAL TOKEN RING NETWORKS
Authors: Veeresham, B.
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;ROUTING ALGORITHMS;MULTI-DIMENSIONAL TOKEN RING NETWORKS;RING-BASED TOPOLOGY
Issue Date: 1998
Abstract: Operation protocols and various routing schemes for multi-dimensional ring networks, are main focus of this dissertation. A ring-based topology, referred to as the multi-dimensional ring (or MR) networks are member of the class of loop networks . Media access is performed over several link disjoint rings, which results in notable increase in throughput and robust operation in the presence of node and link failures. The primary advantage of this topology over other enhanced ring topologies, such as chordal ring [1] and token grid [2] is its efficient routing and embedding algorithms. The finite automata model is used to develop several routing schemes. The input string, accepted by this particular automation, from a given initial state, corresponds to a path established from a source (initial)node in the network. This dissertation deals with the performance. comparison of three operation protocols of multi-dimensional ring networks with four different routing algorithms. Also compared the speedup of MR(N,r) network for various values of N and r with different routing schemes. The contribution of this dissertation with regard to MR networks is, modify one of the routing schemes (only in certain special cases ) to make it fully efficient. Also to give an idea to extend a protocol operation on MR(N,r) networks having GCD(N,r) greater than one. '-
URI: http://hdl.handle.net/123456789/9604
Other Identifiers: M.Tech
Research Supervisor/ Guide: Kumar, Padam
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECD248175.pdf2.55 MBAdobe PDFView/Open


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