Analysis of new protocols for computer communication networks Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/fx719q907

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • An advanced forward 'area tactical radar network, now under conceptual development by the Air Force Electronic Systems Division, can be viewed as a novel form of computer network but with other unique problems resulting from the specialized nature of the application. The proposed network will link together a number of short-range radars, each with associated data processing equipment, so that each radar site has a complete file of tracks for all targets seen by any radar in the network. In addition, the communication network is expected to be used for transmission of a variety of other types of command and control messages. A new class of adaptive routing protocols for computer communication networks have been developed in this thesis, using the radar network as a basis, but applicable to any computer comrnunication network. These new routing protocols utilize new techniques for searching out and using both reciprocal paths (paths over which messages can travel in either direction) and non-reciprocal paths (paths over which messages can travel in only one direction) for directed message routing. The computations required by the new routing protocols are carried out in a distributed manner at each network node. The only information on network structure which a node needs to store in order to carry out any of the routing computations is the identity of its neighbors. A GPSS simulation model of a 13 node radar network was used to determine the steady state characteristics of the new routing protocols in an undamaged network, from which a performance model was developed, and to determine the transient characteristics of the new routing protocols while adapting to various cases of network damage. The transient tests indicate that each of the new routing algorithms possess varying degrees of adaptability to network damage. Some of the new routing algorithms were shown to possess the capability to adapt to extreme cases of network damage. Further transient tests indicated that when some of the new routing algorithms are combined with acknowledgement techniques, complete protocols which reliably deliver all messages to their destinations, even following severe network damage, are formed. The new protocols developed in this thesis are suitable for use in conventional computer communication networks. Overhead comparisons with an ARPA type routing protocol indicate that the new routing protocols developed in this thesis generally require less overhead for large networks with low connectivity.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0.82 on a Canon DR-9080C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2013-09-26T21:35:34Z (GMT). No. of bitstreams: 1 WarnerCliffordJ1980.pdf: 2654050 bytes, checksum: 129f7ec0e94da2d55e0eba5802e00238 (MD5) Previous issue date: 1979-07-27
  • description.provenance : Approved for entry into archive by Kirsten Clark(kcscannerosu@gmail.com) on 2013-09-26T21:35:34Z (GMT) No. of bitstreams: 1 WarnerCliffordJ1980.pdf: 2654050 bytes, checksum: 129f7ec0e94da2d55e0eba5802e00238 (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2013-09-05T20:09:24Z (GMT) No. of bitstreams: 1 WarnerCliffordJ1980.pdf: 2654050 bytes, checksum: 129f7ec0e94da2d55e0eba5802e00238 (MD5)
  • description.provenance : Submitted by Kevin Martin (martikev@onid.orst.edu) on 2013-09-05T19:55:32Z No. of bitstreams: 1 WarnerCliffordJ1980.pdf: 2654050 bytes, checksum: 129f7ec0e94da2d55e0eba5802e00238 (MD5)

Relationships

In Administrative Set:
Last modified: 08/17/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items