Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1993. / Vita. Abstract. Includes bibliographical references (leaf 142). Also available via the Internet.

A method of performance improvement of token ring networks is presented, based on the use of stations with two latency states. Station latency is defined as the time delay introduced in passing data through a station. Most token ring protocol standards (e.g. IEEE 802.5 or ANSI X3T9.5) require incoming data to be decoded and encoded in the station before transmission onto the ring. These encoding and decoding operations add significantly to the station latency. The bypassing of the encoding and decoding steps is proposed, which improves the mean message waiting time. A detailed evaluation and comparison of the networks is based on both analytical and simulation results. The performance of identical stations and symmetric traffic is obtained analytically. A discrete event simulation model for a token ring network is written in GPSS for general traffic. Results show a significant reduction in mean waiting time for the dual latency ring, with performance approaching or exceeding that of gated and exhaustive service, for certain ranges of network utilization. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

Thesis (Ph.D.)--University of Alberta (Canada), 2001. / Adviser: W.D. Grover. Includes bibliographical references.

This thesis is a study of communication protocols (token ring, FDDI, and ISDN), microcontrollers (68HC 1EVB), and fault tolerance schemes. One of the major weaknesses of the token ring network is that if a single station fails, the entire system fails. A scheme involving a combination of hardware and timer interrupts in the software has been designed and implemented which deals with this risk. Software and protocols have been designed and applied to the network to reduce the chance of bit faults in communications. ISDN frame format proved to be exceptional in its capacity to carry echoed data and a large variety of tokens which could be used by the stations to test the data. By its very nature, the token ring supplied another major fault detection device by allowing the data to be returned and tested at its source. The resulting network was successful.

Thesis (Ph.D.) - Carleton University, 2007. / Includes bibliographical references (p. 182-189). Also available in electronic format on the Internet.

<i>Survivability</i> is a means of introducing redundancy in a network architecture which is utilized to maintain communication capability under failure conditions. The need for survivability exists in most communication networks. Fiber optic networks concentrate large amounts of traffic within a few spans, using their high capacity to achieve a cost advantage. It is crucial to incorporate survivability at minimum cost in the design of such networks. This problem is conventionally tackled using techniques such as <i>Automatic Protection Switching</i> (APS), <i>Dual homing and Self-Healing Ring</i> (SHR). These techniques, although relatively simple to implement, are not efficient in utilizing network capacity. Interconnected ring topologies use the network capacity more efficiently at the expense of complex fault detection and routing methodologies. The <i>toroidal grid</i> is shown to be an optimized form of a generalized survivable interconnected ring topology. It is shown to have significantly lower capacity requirements than the simple self healing ring networks. The <i>modified toroidal</i> grid is an improvement on the toroidal grid because it has a planar graph and shorter average link length. A quantity called <i>link-traffic summation</i> is defined as a metric of total link capacity requirement in a network. Analytical values for link-traffic summation are obtained for simple ring, generalized interconnected ring, toroidal grid and modified toroidal grid networks. Simulations are performed for the modified toroidal grid and their results are compared with the analytical values obtained. / Master of Science

This thesis is concerned with the design of a high-speed backbone network which provides a high bandwidth interconnection for various Personal Computer Networks (PC-Networks) with an integrated service of voice and data. With the advanced technology of optical fiber as the transmission medium, several different existing topologies and protocols are discussed for the backbone network design. The token ring protocol is simulated and evaluated to find out a suitable buffer size and the length of voice and data packet for backbone network. The Network II.5 simulation tool is applied to simulate the token ring simulation model with different parameters. The Network Interface Unit (NIU) is designed from the simulation results with a cost-effective consideration.

Wong, Po-Choi. / Summary in Chinese. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1989. / Bibliography: leaves 156-164.

Li Cheng. / Thesis submitted in: November 2002. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 57-61). / Abstracts in English and Chinese. / Chapter CHAPTER 1 --- INTRODUCTION --- p.1 / Chapter 1.1 --- The Evolution of Ring Network Technologies --- p.1 / Chapter 1.1.1 --- Token Ring Technology --- p.1 / Chapter 1.1.2 --- Resilient Packet Ring Technology --- p.4 / Chapter 1.2 --- Optimal Routing --- p.7 / Chapter 1.3 --- Fairness --- p.8 / Chapter 1.4 --- Outline of Thesis --- p.10 / Chapter CHAPTER 2 --- OPTIMAL ROUTING --- p.11 / Chapter 2.1 --- Throughput Analysis --- p.11 / Chapter 2.2 --- Numerical Results --- p.13 / Chapter CHAPTER 3 --- OPTIMAL FAIR ROUTING --- p.19 / Chapter 3.1 --- Overview --- p.19 / Chapter 3.2 --- Max-min Fair Allocation --- p.19 / Chapter 3.3 --- Proportionally Fair Allocation --- p.32 / Chapter 3.4 --- Numerical Results --- p.33 / Chapter CHAPTER 4 --- TRADEOFF ANALYSIS --- p.40 / Chapter 4.1 --- Tradeoff between Throughput and Max-min Fairness --- p.40 / Chapter 4.2 --- Numerical Results --- p.42 / Chapter 4.3 --- Tradeoff between Throughput and Utility --- p.47 / Chapter 4.4 --- Numerical Results --- p.48 / Chapter CHAPTER 5 --- CONCLUSION --- p.54 / Chapter 5.1 --- Summary --- p.54 / Chapter 5.2 --- Discussion and Future Work --- p.55 / BIBLIOGRAPHY --- p.57

Bibliography : leaves 225-232. / xii, 232 leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Computer Science, 1994