在ATM (asynchronous transfer mode) 網路中，Rate-based調整-排程機制在以控制標定連線的細胞被交換機傳送的速率而達到某種服務品質的保證。只考慮該標定連線本身的調整-排程機制，可以使標定連線的細胞從調整器佇列被換手到排程器佇列的行為得到良好的控制，但由於可能有許多連線在同一條件下換手，而共同競爭其在排程器佇列的位置，使得標定連線的細胞實際被交換機傳送出去的行為和被換手的行為有很大的變形，而與預期的標定連線細胞被傳送的行為有相當程度的差異。已有相關的方法被提出，藉由考慮其他連線的細胞被換手的狀況來降低標定連線的細胞被傳送之速率變化 (rate jitter) 而得到相當好的效果，但在非工作保持 (non-work-conserving) 的調整-排程機制下，排程器的狀況的改變除了肇因於由調整器換手過來的細胞外，還有排程器佇列因為已在調整器等待的細胞皆未合格而被清空造成的閒置狀況，未考慮此閒置狀況必定造成標定連線的細胞被傳送的行為與被預期的行為不必要的差異。我們提出一種新的調整-排程機制，完整地考慮排程器狀況的改變，使得標定連線的細胞被傳送的行為和被換手的行為之間的差異更小，使得細胞被傳送的速率更能被掌握，進而達到更好的服務品質保證。這個機制不論在時間或空間的複雜度都相當的小，足以符合ATM高速網路的要求。

In ATM (asynchronous transfer mode) networks, rate-based regulation-scheduling (R&S) mechanisms guarantee certain quality of service (QoS) with controlling the rate of a tagged connection serviced by the switches. The R&S mechanisms, which consider only the issues of one tagged connection itself but the situation of the scheduling queue, can behave hand-over well. However, there may be many connections hand over in identical condition and compete for the position in the scheduler queue. It makes the transmission to be distorted greatly from the hand-over. There is already a scheme, dynamic R&S, to smooth rate jitter with counting the hand-over of other connections. Dynamic R&S doesn't count the idle slots, which also make the interval between two consecutive tagged cells, and results in unnecessary misses. The new scheme proposed considers the system time and scheduler queue's length. It has less difference between transmission intervals and the premised one of a tagged connection, so that is better in rate-jitter control. This mechanism has O(1) time-complexity, so conforms to the demand of high-speed ATM networks.

目錄
摘要
Abstract
第一章 簡介
第二章 已經提出的方法
第一節 系統架構
第二節 Static Regulation and Scheduling (Static R&S)
第三節 Dynamic R&S
第四節 Static/Dynamic R&S的缺點
第五節 Modified Dynamic R&S (with Jitter Control)
第三章 我們的新方法：Sum of Time and Queue-Length (TQS)
第一節 TQS機制
第二節 關於 (式11) 中的“=”
第三節 每個時槽中合格檢查的次數
第四節 考慮標定連線所分配到的頻寬的改進
Modified TQS (MTQS)
第五節 降低太晚換手的機率的改進
Conditional Accelerated TQS (CATQS)
第四章 數學分析
第五章 模擬結果
模擬一 每時槽能做的合格檢查次數的影響
模擬二 頻寬使用率與暴衝的影響
模擬三 MTQS連線得到的平均頻寬
模擬四 CATQS連線得到的平均頻寬
第六章 總結與未來展望

[1] ATM Forum, Traffic Management Specification Version 4.1. March 1999. ftp://ftp.atmforum.com/pub/approved-specs/af-tm-0121.000.pdf

[2] S. J. Golestani, “Congestion-free communication in high-speed packet networks,” IEEE Trans. Networking, vol. 39, pp. 1801−1812, December 1991.

[3] H. L. Pocher, V. C. M. Leung, and D. W. Gillies, “An efficient ATM voice service with flexible jitter and delay guarantees,” IEEE J. Select. Areas Commun., vol. 17, pp. 51−62, January 1999.

[4] F.-M. Tsou, H.-B. Chiou, and Z. Tsai, “Design and simulation of an efficient real-time traffic scheduler with jitter and delay guarantees,” IEEE Trans. Multimedia, vol. 2, pp. 255−266, December 2000.

[5] A. K. Parekh and R. G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks: The single-node case,” IEEE/ACM Trans. Networking, vol. 1, pp. 344−357, June 1993.

[6] D. Ferrari and D. Verma, “A scheme for real-time channel establishment in wide-area networks,” IEEE J. Select. Areas Commun., vol. 8, pp. 368−379, April 1990.

[7] D. Verma, H. Zhang, and D. Ferrari, “Guaranteeing delay jitter bounds in packet switching networks,” in Proc. Tricomm '91, Chapel Hill, NC, April 1991, pp. 35−46.

[8] C. L. Liu and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard-real-time environment,” J. ACM, vol. 20, no. 1, pp. 46−61, January 1973.

[9] C. R. Kalmanek, H. Kanakia, and S. Keshav, “Rate controlled servers for very high-speed networks,” in Proc. IEEE Global Telecommunication Conf., San Diego, CA, December 1990, pp. 300.3.1−300.3.9.

[10] M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, “Weighted round-robin cell multiplexing in a general-purpose ATM switch chip,” IEEE J. Select. Areas Commun., vol. 9, pp. 1265−1279, October 1991.

[11] M. Shreedhar and G. Varghese, “Efficient fair queuing using deficit round-robin,” IEEE/ACM Trans. Networking, vol. 4, pp. 375−385, June 1996.

[12] C.-S. Wu, J.-C. Jiau, and K.-J. Chen, “Providing traffic smoothness and service guarantees within ATM networks through a rate-controlled service discipline,” Comput. Networks and ISDN System, vol. 29, pp. 2119−2138, 1998.

[13] B. Bensaou, D. H. K. Tsang, and K. T. Chan, “Credit-based fair queueing (CBFQ): A simple service-scheduling algorithm for packet-switched networks,” IEEE/ACM Trans. Networking, vol. 9, pp. 591−604, October 2001.

[14] J. Liebeherr, D. E. Wrege, and D. Ferrari, “Exact admission control for networks with a bounded delay service,” IEEE/ACM Trans. Networking, vol. 4, pp. 885−901, December 1996.

[15] S. Iatrou and I. Stavrakakis, “A dynamic regulation and scheduling scheme for real-time traffic management,” IEEE/ACM Trans. Networking, vol. 8, pp. 60-70, February 2000.

[16] H. Zhang and D. Ferrari, “Rate-controlled static-priority queueing,” in Proc. IEEE INFOCOM '93, September 1993, pp. 227-236.

[17] 石翔任, “一個簡易的利用排程器狀態資訊的動態網路流量調整機制,” M.S. thesis, 國立中山大學.

[18] D. E. McDysan and D. L. Spohn, ATM theory and applications. McGraw-Hill, September 1994.