Development and analysis of a practical, asynchronous FCFS splitting CSMA-CD algorithm /
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | Thesis Book |
| Language: | English |
| Published: |
1991.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Abstract: | The objective of this dissertation is the development of a practical, asynchronous version of a First Come First Serve (FCFS) splitting algorithm with Carrier Sense Multiple Access and Collision Detection (CSMA-CD). The proposed algorithm could be useful in a real time environment, such as process control or factory automation where it is important to be able to bound the maximum packet delay, as a simple alternative to the complex Token Bus protocol. A priority mechanism which has the Head-of-the-Line priority and no added overhead is developed. It could also be used for an integrated voice/data application and ISDN. In this research, we consider unreliable feedback information and robustness. The asynchronous FCFS splitting CSMA-CD algorithm is modified to be able to handle unreliable history information. The Markov Chain model is revised to be able to take into account the modifications. Sufficient conditions for stability axe studied for the proposed algorithm from the revised Markov model. We seek the maximum stable throughput, the optimal splitting interval size, virtual clock speed and the optimal number of skipping levels by numerical analysis. Based on the numerical analysis, we choose compromise values for the splitting interval size, the virtual clock speed and the number of skipping levels. An approximate mean delay analysis model is The performance between the ideal model and the practical model is compared for the infinite and finite population models via simulations. With the compromise values for the virtual clock speed, the splitting constant and the maximum number of skipping levels, the proposed algorithm works well with respect to the maximum throughput and time delay for values of β in the range 0.01 [less than or equal to] β [less than or equal to] 0.43 (i.e., the proposed algorithm achieves more than 90% of the maximum throughput). The effects of both spatially distributed stations and the number of stations are examined. The number of stations does not affect the maximum throughput. When the offered load is less than the maximum throughput, the performance of each station does not depend on station location. Analytic results and simulation results are also compared... |
|---|---|
| Item Description: | Typescript (photocopy). Vita. "Major subject: Electrical Engineering." |
| Physical Description: | xv, 193 leaves : illustrations ; 29 cm |
| Bibliography: | Includes bibliographical references. |