臺灣博碩士論文加值系統

由於網路上不同話務量(Traffic)有其不同之傳輸特性與服務品質需求，本論文對於非同步傳送模式網路之各種話務量提出兩個封包排列方法：一個稱為LDBE方法，另一個為BMSF方法。LDBE方法可同時處理即時性與非即時性話務量資料，並滿足其個別之服務品質要求；而BMSF方法主要用來處理非即時性話務量資料，並提供多種優異之服務品質。
LDBE方法給即時性服務(CBR)、非即時性可變速率(nrt-VBR)服務及無指示速率(UBR)服務有不同之服務優先權，其中CBR優先權最高，nrt-VBR服務次之，UBR服務最低。當有不同型態服務等待傳送時，原則上LDBE將優先傳送優先權較高之服務。根據GCRA演算法，每個封包有其預定到達時間與實際到達時間，當封包之實際到達時間比預定到達時間早，且若兩者之間之差值又比此封包所屬連線之CDVT大時，則此封包將可能被GCRA丟掉，而造成封包遺失。為避免於下一個交換機節點造成封包延遲差異與封包遺失比率增加，於目前交換機節點中，當所有即時性服務連線於緩衝區內第一個封包之預定到達時間比目前系統時間早時，則LDBE將先傳送非即時性服務；否則先傳送即時性服務封包。若所有非即時性可變速率服務於緩衝區內第一個封包之預定到達時間均比目前系統時間早時，則LDBE將先傳送無指示速率服務。因此LDBE並沒有將不同類別之服務優先權固定，而是根據不同服務之服務品質要求而決定封包傳送順序。根據LDBE與其他現有封包排列方式之模擬比較結果得知， LDBE對於即時性話務量之封包傳送延遲(CTD)、封包延遲差異(CDV)與封包遺失比率(CLR)，非即時性可變速率服務之封包遺失比率，及無指示速率服務之封包傳送延遲等服務品質均同時比其他方法優異。
儘管非即時性話務量對於封包傳送延遲與封包延遲差異等服務品質沒有嚴格要求，但當一個封包排列方法處理非即時性話務量時除應提供優異之封包遺失比率效能外，亦應儘量提供其他多種較佳之效能參數，這包括：減少每條連線之最大緩衝器(Buffer)需求、讓每條連線有公平性之封包等待傳送時間與每條連線有公平性之最大緩衝器需求。所提出之BMSF方法目標即是讓非即時性話務量資料有優異之上述多種效能參數。利用讓每條連線有不同之傳送封包機會與優先傳送緩衝器中具最多封包之連線，BMSF方法將可達成提供多種服務品質參數之目標。

Owing to the different traffic characteristics associated with real-time (RT) and non-real-time (NRT) traffic, ATM networks should provide them with differentiated quality of service (QoS) requirements. RT services such as constant bit rate (CBR) and real-time variable bit rate services (rt-VBR) have become increasingly important owing to the rapid proliferation of multimedia applications. A cell scheduling method capable of handling RT traffic should satisfy QoS requirements including cell transfer delay (CTD), cell delay variation (CDV) and cell loss ratio (CLR). Moreover, NRT services such as non-real-time variable bit rate (nrt-VBR), available bit rate (ABR) and unspecified bit rate (UBR) services are intended for data applications. Although NRT services do not have stringent QoS requirements with respect to CTD and CDV, ATM networks should provide NRT services while considering other criteria to ensure an excellent performance such as CLR, buffer size requirement and service fairness. Therefore, this dissertation presents two novel cell schedulers to provide related QoS requirements for RT and NRT traffic in ATM networks.
First, we propose a method, called longest delay beyond expectation (LDBE), to schedule RT and NRT traffic simultaneously. For RT connections, LDBE scheme can minimize CDV, and reduce CLR and CTD, particularly when different CDV tolerance (CDVT) values are applied at each ATM node along the path of a connection. Simulation results demonstrate that the proposed LDBE performs better than other cell scheduling methods regarding these CLR, CDV and CTD criteria for real-time traffic. Furthermore, the LDBE is also suitable for scheduling NRT traffic by providing a low CLR for nrt-VBR and minimizing the CTD for UBR traffic.
Second, to provide as much as good performance as possible for NRT traffic, we present another scheduling scheme, called buffer minimized and service fairness (BMSF), to schedule NRT services in ATM networks. Using probability constraints and selecting a connection with the longest buffer size to transmit first allow BMSF to attain satisfactory performance with respect to maximum buffer size requirement, CLR, and service fairness in terms of the maximum buffer size and cell waiting delay. Simulation results demonstrate that BMSF performs better than conventional schemes in terms of these criteria, particularly when NRT services have diverse arrival rates. Thus, the BMSF scheme proposed herein can feasibly schedule NRT services in ATM networks.

封面
Chinese Abstract
English Abstract
Contents
Figures
Tables
Chinese Manuscript
Chapter 1 Introduction
Chapter 2 QoS and Cell Scheduling in ATM Networks
2.1 Quality of Service
2.2 Cell Schedulers
Chapter 3 Previous works on Scheduling
3.1 Generic Cell Rate Algorithm(GCRA)
3.2 Overview of Cell Scheduling Schemes
Chapter 4 Proposed LDBE Scheme for Real-time and Non-real-time Srvices
4.1 Motivations
4.2 Algorithm of the LDBE Scheme
4.3 Implementations of the LDBE Scheme
4.4 Performances of the LDBE Scheme
Chapter 5 Proposed BMSF Scheme for Non-real-time Services
5.1 Motivations
5.2 Operations of the BMSF Scheme
5.3 Performance Analysis
5.4 Performances of the BMSF Scheme
Chapter 6 Conclusions and Future Works
References

REFERENCES
[1] Dong-Yong Kwak and Hong-Shik Park, "A CAC algorithm using CDV measurement," in Proc. IEEE ICC''96, pp. 1730-1734, 1996.
[2] ATM Forum Technical Committee, Traffic management specification Ver. 4.0, April 1996.
[3] Chiung-Shien Wu, Gin-Kou Ma, and Bao-Shuh P. Lin, "A cell scheduling algorithm for VBR traffic in an ATM multiplexer," in Proc. IEEE GLOBECOM''95, pp. 632-637, 1996.
[4] Yao-Tzung Wang, Tzung-Pao Lin, and Kuo-Chung Gan, "An improved scheduling algorithm for weighted round-robin cell multiplexing in an ATM switch," in Proc. IEEE ICC''94, pp. 1032-1037, 1994.
[5] Zvi Rosberg, "Cell multiplexing in ATM networks," IEEE/ACM Trans. Networking, vol. 4, pp. 112-122, Feb. 1996.
[6] Ting-li Ling and Ness Shroff, "Scheduling real-time traffic in ATM networks," in Proc. IEEE INFOCOM''96, pp. 198-205, 1996.
[7] Jon M. Peha and Fouad A. Tobagi, "Cost-based scheduling and dropping algorithms to support integrated services," IEEE Trans. on Commun., vol. 44, pp. 192-202, Feb. 1996.
[8] M. Vishnu and J. W. Mark, "HOL-EDD: A flexible service scheduling scheme for ATM networks," in Proc. IEEE INFOCOM''96, pp. 647-654, 1996.
[9] M. Grossglauser and S. Keshav, "On CBR service," in Proc. IEEE INFOCOM''96, pp. 129-137, 1996.
[10] Hiroshi ISHIDA, Hiroshi INOUE, and Yoshikatsu SHIRAISHI, "A multiplexing method in consideration of cell delay variation," in Proc. IEEE ICC''94, pp. 1501-1505, 1994.
[11] F. M. Chissi and A. Franciui, "Implementing Fair Queuing in ATM Switches: The Discrete Rate Approach," Proc. IEEE Infocom, pp. 272-281, 1998.
[12] Manolis Katevenis et al., "Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip," IEEE J. Select. Areas in Commun., vol. 9, no. 8, pp. 1265-1279, Oct. 1991.
[13] S. J. Golestani, " A self-clocked fair queueing scheme for broadband applications," Proc. IEEE Infocom, pp. 636-646, 1994.
[14] Pramod Pancha and Mark Karol, "Guaranteeing Bandwidth And Minimizing Delay In Packet-Switched (ATM) Networks," Proc. IEEE Globecom, pp. 1064-1070, 1995.
[15] W. T. Chen, R. R. Lee, and H. J. Lin, "A QoS-Guaranteed and Delay-Minimized Cell Multiplexing Method in ATM Networks," Proc. IEEE ICC, pp. 1723-1727, 1998.
[16] E. Wallmeier, "A Connection Acceptance Algorithm for ATM Networks Based on Mean and Peak Bit Rates," International Journal of Digital and Analog Communication Systems, vol.3, pp. 143-153, 1990.
[17] R. Guerin, H. Ahmadi, and M. Naghshineh, "Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks," IEEE J. Select. Areas in Commun., vol. 9, no. 7, pp. 968-981, Sept. 1991.
[18] F. Vakil, "A capacity Allocation Rule for ATM Networks," Proc. IEEE globecom, pp. 406-416, 1993.
[19] Changming Liu and H. T. Mouftah, "Virtual Call Admission Control - A Strategy for Dynamic Routing over ATM Networks," Proc. IEEE ICC, pp. 201-205, 1995.
[20] B. Mukherjee and J. S. Meditch, "The pi-Persistent Protocol for Unidirectional Broadcast Bus Network," IEEE Trans. Commun., vol. 36, no. 12, pp. 1277-1295, Dec. 1988.
[21] A. Birman et al., "An optimal service policy for buffer system," J. ACM, vol. 42, no. 3, pp. 641-657, 1995.
[22] A. Itai and Z. Rosberg, "A golden ratio control policy for a multiple-access channel." IEEE Autom. Contr., vol. AC-29, pp. 712-718, 1984.
[23] ITU-T, Draft Recommendation I.371, "Traffic control and congestion control in B-ISDN," Geneva, June 1992.
[24] W. T. Chen and R. R. Lee "A Cell Scheduler for Non-real-time Traffic with Service Fairness in ATM Networks," Proc. IEEE Globecom 1998.
[25] W. T. Chen, R. R. Lee, and H. J. Lin, "A Novel Cell Multiplexing Method for Services in ATM Networks," IEICE Transactions on Communications, vol. E82-B, no. 2, pp. 447-454, Feb. 1999.
[26] S. Chan, E. W. M. Wong, K. T. Ko, "Fair Packet Discarding for Controlling ABR Traffic in ATM Networks," IEEE Trans. Commun., vol. 45, no. 8, pp. 913-916, August 1997.
[27] M. Casoni, J. S. Turner, "On the performance of Early Packet Discard," IEEE J. Select. Areas in Commun., vol. 15, no. 5, pp. 892-902, June 1997.
[28] M. Casoni, "Early Packet Discard with Diverse Management Policies for EOM cells," Proc. II IEEE Workshop on Broadband Switching Systems, Taipei, Taiwan pp. 33-37, Dec. 1997,.
[29] W. R. Stevens, "TCP/IP Illustrated, Volume 1: The Protocol", Reading, MA: Addison-Wesley, 1994.
[30] G. Armitage and K. Adams, "Packet reassembly during cell loss," IEEE Network Magazine., vol. 7, no. 5, pp. 26-34, Sept. 1993.
[31] A. Romanow, and S. Floyd, "Dynamics of TCP Traffic over ATM Networks," IEEE J. Select. Areas in Commun., vol. 13, no. 4, pp. 633-641, May 1995.
[32] S. Dixit and S. Elby, "Frame relay and ATM interworking," IEEE Commun. Mag., vol. 34, pp. 64-82, June 1996.
[33] S. Dixit and S. Kumar, "Traffic Descriptor Mapping and Traffic Control for Frame Relay Over ATM Network," IEEE/ACM Trans. Networking, vol. 6, no. 1, pp. 56-70, Feb. 1998.
[34] D. Clark and W. Fang, "Explicit Allocation of Best-Effort Packet Delivery Service," IEEE/ACM Trans. Networking, vol. 6, no. 4, pp. 362-373, August. 1998.
[35] ATM Forum Technical Committee, LAN Emulation Over ATM-LUNI Specification, Ver. 2.0, July 1997.
[36] M. Laubach, "Classical IP and ARP over ATM," IETF RFC 1577, January 1994.
[37] R. G. Cole, D. H. Shur, and C. Villamizar, "IP over ATM: A framework document," IETF RFC 1932, April 1996.
[38] J. V. Luciani, D. Katz, D. Piscitello, and B. Cole, "NBMA next hop resolution protocol (NHRP)," IETF Internet Draft, Sept. 1997.
[39] ATM Forum Technical Committee, Multiprotocol over ATM Specification, Ver. 1.0, July 1997.
[40] P. Newman, G. Minshall, L. Lyon, "IP switching-ATM Under IP," IEEE/ACM Trans. Networking, vol. 6, no. 2, pp. 117-129, April 1998.
[41] H. Li, K. Siu, H. Tzeng, C. Ikeda, and H. Suzuki, "A Simulation Study of TCP Performance in ATM Networks with ABR and UBR Services," Proc. IEEE Infocom, pp. 1269-1276, 1996.
[42] Dallas E. Wrege, J. Liebeherr, "A Near-Optimal Packet Scheduler for QoS Networks," Proc. IEEE Infocom, pp. 577-584, 1997.
[43] Y. Ohba, "QLWFQ: A Queue Length Based Weighted Fair Queueing Algorithm in ATM Networks," Proc. IEEE Infocom, pp. 567-576, 1997.
[44] Y. Chen, and J. S. Turner, "Design of a Weighted Fair Queueing Cell Scheduler for ATM Networks," Proc. IEEE Globecom, pp. 120-128, 1998.
[45] S. Suri, G. Varghese, and G. Chandranmenon, "Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness," Proc. IEEE Infocom, pp. 558-566, 1997
[46] D. C. Stephens and H. Zhang, "Implementing Distributed Packet Fair Queuing in a Scalable Switch Architecture," Proc. IEEE Infocom, pp. 282-290, 1998.
[47] A. Bestavros and G. Kim, "TCP BOSTON: A Fragmentation-tolerance TCP Protocol for ATM Networks," Proc. IEEE Infocom, pp. 1212-1219, 1997.
[48] P. Newman et al., "IP Switching and Gigabit Router," IEEE Commun. Mag., pp. 64-69, January 1997.
[49] R. Callon et al., "A Framework for Multiprotocol Label Switching," IETF Internet draft-ietf-mpls-framework-01.txt, July 1997.
[50] H. B. Chiou and Z. Tsai, "Improving the Performance of Broadband Internet Services Using Layer-3 ATM Switches," Proc. IEEE Globecom 1998.
[51] S. Chan, M. Zukerman, Eric W. M. Wong, K. T. Ko, and E. Yeung, "Achieving Fair and High Packet-level Throughput in ABR Service," Proc. IEEE ICC, pp.635-639, 1998.
[52] M. Zukerman and S. Chan, "Fairness in ATM Networks", Computer Network and ISDN Systems, vol.26, pp. 109-117, 1993.
[53] F. Tontain, "Decoupled Generalized Processor-Sharing: A Fair Queuing Principle for Adaptive Multimedia Applications," Proc. IEEE Infocom, pp. 291-298, 1998.
[54] J. S. Turner, "Maintaining high throughput during overload in ATM switches," Proc. IEEE Infocom, pp. 287-295, 1996.
[55] A. Parekh, R. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case," IEEE/ACM Trans. on Networking, vol. 1, No. 3, pp. 344-357, June 1993.
[56] P. Goyal et al, "Start-time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks," ACM Sigcomm, pp. 143-156, 1996.
[57] D. Ferrari and D. C. Verma, "A Scheme for Real-time Channel Establishment in Wide-Area Networks," IEEE J. Select. Areas in Commun., vol. 8, no. 3, pp. 368-379, April 1990.
[58] L. Georgiadis, R. Guerin, and A. Parekh, "Optimal Multiplexing on a Single Link: Delay and Buffer Requirements," Proc. IEEE Infocom, pp. 524-532, 1996.
[59] D. Tse and M. Grossglauser, "Measurement-based Call Admission Control: Analysis and Simulation," Proc. IEEE Infocom, pp. 983-991, 1997.
[60] J. Liebeherr and D. E. Wrege, and D. Ferrari, "A Versatile Packet Multiplexer for Quality-of-Service Networks," Proc. 4th International Symposium on High-Performance Distributed Computing (HPDC-4), pp. 148-155, 1996.
[61] Y. Lim, and J. E. Kobza, "Analysis of a Delay-dependent Priority Discipline in an Integrated Multiclass Traffic Fast Packet Switch," IEEE Trans. Commun., vol. 38, no. 5, pp. 659-665, May 1990.
[62] J. M. Peha and F. A. Togagi, "Implementation Strategies for Scheduling Algorithms in Integrated Services Packet-Switched Networks," Proc. IEEE Globecom, pp. 1733-1740, 1991.
[63] G. Ramamurthy and Q. Ren, "Multi-class Connection Admission Control Policy for High-speed ATM switches," Proc. IEEE Infocom, pp. 965-974, 1997.
[64] K. Sriram, "Dynamic Bandwidth Allocation and Congestion Control Schemes for Voice and Data Multiplexing in Wideband Packet Technology," Proc. IEEE ICC, pp. 1003-1009, 1990.
[65] J. Mata, G. Pagan, and S. Sallent, "Multiplexing and Resource Allocation of VBR MPEG Video Traffic on ATM Network," Proc. IEEE ICC, pp. 1401-1405, 1996.
[66] K. Liu, H. Zhu, D. W. Petr, V. S. Frost, C. Braun, and W. Edwards, "Design and Analysis of A Bandwidth Management Framework for ATM-based Broadband ISDN," Proc. IEEE ICC, pp. 1712-1716, 1996.
[67] K. Liu, D. W. Petr and C. Braun, "A Measurement-Based CAC Strategy for ATM Networks," Proc. IEEE ICC, pp. 1714-1718, 1997.
[68] F. Guillemin, C. Rosenberg and J. Mignault, "On Characterizing an ATM Source via the Sustainable Cell Rate Traffic Descriptor," Proc. IEEE Globecom, pp. 1129-1136, 1996.
[69] A. R. Reibman, A. W. Berger, "Traffic Descriptors for VBR Video Teleconfereencing Over ATM Networks," IEEE/ACM Trans .on Networking, vol. 3, no. 3, pp. 329-339, June 1995.
[70] D. J. Reininger, D. Raychaudhuri and J. Y. Hui, "Bandwidth Renegotiation for VBR Video over ATM Networks," IEEE J. Select. Areas in Commun., vol. 14, no. 6, pp. 1076-1085, August 1996.
[71] M. Krunz, R. Sass and H. Hughes, "Statistical Characteristics and Multiplexing of MPEG Streams," Proc. IEEE Infocom, pp. 452-462, 1995.
[72] T. Murase, H. Suzuki, and T. Takeuchi, "A Call Admission Control for ATM networks based on Individual Multiplexed Traffic Characteristics," Proc. IEEE ICC, pp. 193-198, 1991.
[73] T. Shan and O. W. W. Yang, "An Admission Control Scheme for the Real-Time VBR Traffic in the ATM Network: Deterministic Bandwidth Allocation," Proc. IEEE ICC, pp. 1505-1509, 1998.
[74] S. Fahmy, R. Jain, S. Kalyanaraman, R. Goyal, and B. Vandalore, "On Determining the Fair Bandwidth Share for ABR Connections in ATM Networks," Proc. IEEE ICC, pp. 1485-1491, 1998.
[75] Y. T. Hou, H. Y. Tzeng, and S. S. Panwar, "A Generic Weight-Based Network Bandwidth Sharing Policy for ATM ABR Service," Proc. IEEE ICC, pp. 1492-1499, 1998.
[76] D. Lapsley and S. Low, "An Optimization Approach to ABR Control," Proc. IEEE ICC, pp. 1500-1504, 1998.
[77] M. Krunz, "Bandwidth Allocation Strategies for Transporting Variable-Bit-Rate Video Traffic," IEEE Commun. Mag., pp. 40-46, January 1999.
[78] W. C. Feng and J. Rexford, "A Comparison of Bandwidth Smoothing Techniques for the Transmission of Prerecorded Compressed Video," Proc. IEEE Infocom, pp. 67-74, 1997.
[79] E. W. Knightly, "M-BIND: A New Approach to Provide Statistical Performance Guarantee to VBR Traffic," Proc. IEEE Infocom, pp. 1091-1099, 1996.
[80] B. Vandalore, S. Fahmy, R. Jain, R. Goyal, and M. Goyal, "QoS and Multipoint Support for Multimedia Applications over the ATM ABR Service," IEEE Commun. Mag., pp. 53-57, January 1999.
[81] S. Fahmy et al., "Feedback Consolidation Algorithm for ABR Point-to-Multipoint Connections," Proc. IEEE Infocom, pp. 1004-1013, 1998.
[82] S. Fahmy et al., "Fairness for ABR Multipoint-to-Point Connections," ATM Forum/97-0832, Sept. 1997.
[83] D. Tsang and W. Wong, "A New Rate-based Switch Algorithm for ABR Traffic to Achieve Max-Min Fairness with Analytical Approximation and Delay Adjustment," Proc. IEEE Infocom, pp. 1174-1181, 1996.
[84] Y. T. Hou, H. Tzeng and S. S. Panwar, "Weighted Max-Min Fairness for ABR Service: Theorey and Implementation," Proc. IEEE Infocom, pp. 492-497, 1997.
[85] N. Yin, "Max-Min Fairness vs. MCR Guarantee on Bandwidth Allocation for ABR," Proc. IEEE ATM Workshop 1996.
[86] S. Keshav, "An Engineering Approach to Computer Networking, ATM Networks, the Internet, and the Telephone Network", Reading, MA: Addison-Wesley, 1997.
[87] ITU-T, Draft Recommendation I.356, "B-ISDN ATM layer cell transfer performance," Geneva, 1995.
[88] ATM Forum Technical Committee, User-Network Interface (UNI) Signaking Specification Ver. 4.0, 1996.
[89] ATM Forum Technical Committee, Private Network-Node Interface (PNNI) Specification Ver. 1.0, 1997.
[90] D. Ferrari and D. Verma, "A Scheme for Real-time Channel Establishment in Wide-Area Networks," IEEE J. Select. Areas in Commun., vol. 8, no. 3, pp. 368-379, April 1990.
[91] P. Goyal S. Lam, and H. Vin, "Determining End-to-End Delay Bounds in Heterogeneous Networks," Proc. Fifth International Workshop on Network and Operating System Support for Digital Audio and Video, pp. 287-298, April 1996.
[92] B. Snter, T. V. Lakshman, D. Stiliads and A. Chomdlory, "Design Consideration for Supporting TCP with Per-Flow Queuing," Proc. IEEE Infocom, pp. 299-306, 1998.
[93] N. S. V. Rao and S. G. Batrell, "QoS Routing via Multiple Paths Using Bandwidth Reservations," Proc. IEEE Infocom, pp. 11-18, 1998.
[94] E. Hashem, "Analysis of Random Drop for Gateway Congestion Control," Technical Report LCS/TR-465, Laboratory for Computer Science, MIT, Cambridge, MA, 1989.
[95] Y. Lapid, R. Rom and M. Sidi," Analysis of Packet Discarding Policies in High-speed Networks," Proc. IEEE Infocom, pp. 1193-1200, 1997.
[96] S. Kalyanaraman, R. Jain, S. Fahmy and R. Goyal, "Performance and Buffering Requirements of Internet Protocols over ATM ABR and UBR Services," IEEE Network Magazine, vol. 36, no. 6, pp. 152-157, June 1998.
[97] Li. Zhang, "A New Architecture for Packet Switching Network Protocols," Technical Report MIT/LCS/TR-455, Laboratory for Computer Science, MIT, Cambridge, MA, August 1989.
[98] C. Fang, H. Chen, and J. Hutchins, "A Simulation Study of TCP Performance in ATM Networks," Proc. IEEE Globecom, pp.1217-1223, 1994.
[99] K. Cheon, S. S. Panwar, "On the Performance of ATM-UBR with Early Selective Packet Discard," Proc. IEEE ICC''98, pp.221-227, June 1998.
[100] 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 .on Networking, pp. 344-357, June 1993.
[101] A. K. Parekh and R. G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks - The Multiple Node Case," IEEE/ACM Trans .on Networking, pp. 137-150, April 1994.
[102] J. R. Perkins and P. R. Kumar, "Stable Distributed Real-time Scheduling of Flexible Manufacturing Systems," IEEE Trans. Automat. Control, vol. AC-34, pp. 139-148, 1989.