Performance analysis of media access protocols for high-speed local and metropolitan area networks.
dc.contributor.author | Chiarawongse, Jhitti | en_US |
dc.contributor.advisor | Teorey, Toby J. | en_US |
dc.contributor.advisor | Srinivasan, Mandyam M. | en_US |
dc.date.accessioned | 2014-02-24T16:12:33Z | |
dc.date.available | 2014-02-24T16:12:33Z | |
dc.date.issued | 1992 | en_US |
dc.identifier.other | (UMI)AAI9303713 | en_US |
dc.identifier.uri | http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9303713 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/103051 | |
dc.description.abstract | Advances in optical fiber technology have opened up the possibility for networks capable of transmitting information at the rate of hundreds of megabits per second or even in the gigabit range. In a shared media network operating at such a high speed, the media access protocol is critical to performance. In this dissertation, we are concerned with modeling and analyzing the performance of two media access protocols for high speed local and metropolitan area networks, namely, the Fiber Distributed Data Interface (FDDI), and the Distributed Queue Dual Bus (DQDB) protocols. Our main performance measure of interest is the mean packet delay. Due to the high degree of interactions among stations in the networks employing these protocols, the exact analysis of these networks is extremely difficult. To simplify the analysis, we focus our attention on the models for a single station in the network. The effects of other stations are captured in the input parameters to the model. We present an analysis of M/G/1 queueing system with vacations in which the sojourn time of the server at the queue is controlled by a timer. The service time of a customer and the vacation time of the server are allowed to take on only integer values. With suitable timer-setting policy, our queueing system can be used as a model for a single station in the FDDI network which generates only asynchronous traffic at a single priority level. We obtain the distributions of the number of customers present in the system at an arbitrary point in time, the time the server spends at the queue in each cycle, and the number of customers at the beginning of a vacation. We analyze a discrete-time queueing system model of a single station in the DQDB networks. By imposing some constrained assumptions for analytical tractability, we are able to employ a numerical approach to obtain the distribution of the number of packets present in the system at an arbitrary point in time. From this distribution, the mean sojourn time of a packet can be computed. | en_US |
dc.format.extent | 98 p. | en_US |
dc.subject | Engineering, Electronics and Electrical | en_US |
dc.subject | Engineering, Industrial | en_US |
dc.subject | Computer Science | en_US |
dc.title | Performance analysis of media access protocols for high-speed local and metropolitan area networks. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Computer Science and Engineering | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/103051/1/9303713.pdf | |
dc.description.filedescription | Description of 9303713.pdf : Restricted to UM users only. | en_US |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.