On the Jitter and Delay of the ATM Multiplexing Using Interleaved Round Robin Service Discipline
碩士 === 國立中正大學 === 電機工程研究所 === 87 === The switches multiplex the data from different input links to the same output link in ATM networks. It will determine which connection gets the time slot according to the algorithm applied to the switch. After scheduling, it will have different effect...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/47556764310189254180 |
| Summary: | 碩士 === 國立中正大學 === 電機工程研究所 === 87 === The switches multiplex the data from different input links to the same output link in ATM networks. It will determine which connection gets the time slot according to the algorithm applied to the switch. After scheduling, it will have different effect on delay and jitter by different algorithms. In network environment, the FCFS and best effort discipline are generally adapted. This is simple and implement easily but can not provide QoS any more in real-time environment. Thus it is an important topic to define a algorithm to support QoS in ATM networks.
My advisor Dr. Cheng-Shong Wu and Dr. Jin-Chyang Jiau have proposed a new round-robin algorithm called “Interleaved-Round-Robin”. The philosophy of original IRR is non-work-conserving to reduce traffic burstiness so that the delay and jitter can be controlled and only just need small buffer.
In this thesis, we present the concept of priority and class and extend IRR to be a work-conserving algorithm. Here we adapt the concept of CoS and QoS in ATM networks to prioritized the class and the performance of each connection can still be guaranteed.
|
|---|