The advent of lower cost computers has accelerated the use of distributed computer networks. These systems vary in architecture from those that are tightly coupled by extensive parallel busses or shared resources, such as memory, to those that are loosely coupled and connected by long busses, that are usually serial in nature. Both of these extremes serve their particular applications well, but a middle ground exists where neither of the techniques quite satisfies the requirements. Situations exist where the processors may be in close proximity to each other but still have the requirement for high transmission speeds and the requirements for the flexibility and modularity of a loosely coupled network. The proposed architecture for an Immediate Area Network (IAN), that falls into this category, is being investigated in this project. / In an application of this nature, the importance or priority of the message may be a significant factor. In those cases, it is necessary that the high priority messages be delayed as little as possible before transmission. / We may also expect very heavy loads on the bus where bursts of messages far exceed the capacity of the bus for a short time. During such bursts, messages may be delayed for extended periods while multiple collisions and message delays occur. A protocol algorithm for back-off determination using fuzzy set theory is presented to minimize the delay of high priority messages. This priority algorithm will also work with the Ethernet Local Area Network (LAN) and testing is provided to show its performance there. / Source: Dissertation Abstracts International, Volume: 48-07, Section: B, page: 2027. / Thesis (Ph.D.)--The Florida State University, 1987.
Identifer | oai:union.ndltd.org:fsu.edu/oai:fsu.digital.flvc.org:fsu_76144 |
Contributors | HENNE, ALFRED MARLOW., Florida State University |
Source Sets | Florida State University |
Detected Language | English |
Type | Text |
Format | 118 p. |
Rights | On campus use only. |
Relation | Dissertation Abstracts International |
Page generated in 0.0015 seconds