Implementation and Analysis of Minimum Starting-tag Fair Queuing
碩士 === 國立中興大學 === 應用數學系 === 91 === Minimum Starting-tag Fair Queuing (MSFQ)[1] is an efficient packet scheduling algorithm with theoretically proved in performance metrics such as delay bound, fairness, and time complexity. However, MSFQ algorithm didn’t have any implementation yet. In th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/01124730735390550324 |