This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings
September 1992 (vol. 41 no. 9)
pp. 1137-1155

Analytical models are presented and shown to approximate adequately simulation results for average message queuing time, service time, and control frame round trip time on ring-topology local area networks. These LANs use a PLAYTHROUGH protocol, a data link layer medium access control protocol that achieves concurrent transfer of multiple messages of arbitrary length. The analytical predictions of data message service time and control frame round trip time are used in a queuing system model of average message waiting times versus throughput for this class of multiserver circuit-switched ring under assumptions of uniform and symmetric traffic and a shortest outbound distance first service discipline at each node. The analytical models are validated using simulation results. The analysis includes both the effects of competing traffic originating at other nodes on the ring and the effects of the medium access control mechanism overhead on the waiting times experienced by messages arriving at an arbitrarily chosen node.

[1] J. R. Pierce, "Network for block switching of data,"Bell Syst. Tech. J., vol. 51, no. 6, pp. 1133-1145, July-Aug, 1972.
[2] M. V. Wilkes and D. J. Wheeler, "The Cambridge digital communication ring," inProc. Local Area Commun. Networks Symp., Boston, MA, May 1979, pp. 47-61.
[3] W. Bux, "Local-area subnetworks: A performance comparison,"IEEE Trans. Commun., Oct. 1981.
[4] C. C. Reames and M. T. Liu, "Design and simulation of the distributed loop computer network (DLCN)," inProc. 3rd Annu. Symp. Comput. Architecture, Clearwater, FL, Jan. 1976, pp. 124-129.
[5] W. Bux and M. Schlatter, "An approximation method for the performance analysis of buffer insertion rings,"IEEE Trans. Commun., vol. COM-31, pp. 50-55, Jan. 1983.
[6] T. C. Wilson and C. B. Silio, Jr., "Loop interconnection of processors using a 'play through' protocol," inProc. 9th Int. Symp. Mini and Micro Computers, MIMI'79, Montreal, P.Q. Canada, inMini and Micro Computers, vol. 5, no. 1. Anaheim, CA: ACTA Press, Sept. 1979, pp. 175-180.
[7] T. C. Wilson and C. B. Silio, Jr., "Distributed control of ring networks using a 'play through' protocol," inProc. 21st IEEE Comput. Soc. Int., Conf., COMPCON Fall '80, Washington, DC, Sept. 1980, pp. 507-515.
[8] H. Jafari, T. G. Lewis, and J. D. Spragins, "Simulation of a class of ring structured networks,"IEEE Trans. Comput., vol. C-29, pp. 385-392, May 1980.
[9] S. Leventis, G. Papadopoulos, and S. Koubias, "A new experimental computer network and its simulated performance," inIEEE Proc. INFOCOM '82, Las Vegas, NV, Mar. 1982, pp. 113-121.
[10] W. D. Farmer and E. E. Newhall, "An experimental distributed switching system to handle bursty computer traffic," in1969 Proc. ACM Symp. Problems in the Optimization of Data Commun., Pine Mountain, GA, 1969, pp. 1-33.
[11] Institute of Electrical and Electronics Engineers, Inc., "Token Ring Access Method and Physical Layer Specifications," ANSI/IEEE Std 802.5, New York, NY, 1985.
[12] M. T. Liu, W. Hilal, and B. H. Groomes, "Performance evaluation of channel access protocols for local computer networks," inProc. 25th IEEE Comput. Soc. Int. Conf., COMPCON Fall '82, Washington, DC, Sept. 1982, pp. 417-426.
[13] C. B. Silio, Jr., T. C. Wilson, and L. S. Cohen, "Simulated performance of a single-token, multimessage ring," inIEEE Conf. Rec. Int. Conf. Commun., ICC '83, Boston, MA, vol. 1, June 1983, pp. 172-176.
[14] C. B. Silio, Jr., "Performance approximations for multimessage circuit-switched rings," inIEEE Proc. INFOCOM '86, Miami, FL, Apr. 1986, pp. 85-93.
[15] C. B. Silio, Jr. and T. C. Wilson, "A performance model for double PLAYTHROUGH circuit-switched rings," inIEEE Proc. INFOCOM '87, San Francisco, CA, Apr. 1987, pp. 745-753.
[16] J. Spragins, H. Jafari, and T. Lewis, "Some simplified performance modeling techniques with applications to a new ring-structured microcomputer network, " inIEEE Proc. 6th Annu. Symp. Comput. Architecture, Apr. 1979, pp. 111-116.
[17] J. L. Hammond and P. J. P. O'Reilly,Performance Analysis of Local Computer Networks. Reading, MA: Addison-Wesley, 1986.
[18] R. J. Kaliman, "Physical and medium access control protocols for a multiple access ring local area network," M.S.E.E. thesis, Univ. Maryland, College Park, MD, May 1988.
[19] R. J. Kaliman and C. B. Silio, Jr., "Ternary physical protocol for MARILAN, a multiple-access ring local area network," inIEEE Proc. 18th Int. Symp. Multiple-valued Logic, Palma de Mallorca, Spain, May 1988, pp. 14-20.
[20] R. J. DelCoco, "Specification and analysis of a high speed fiber optic pre-emptive resume (PLAYTHROUGH) ring LAN protocol," M.S.E.E. thesis, Univ. Maryland, College Park, MD, Dec. 1988.
[21] American National Standards Institute, "Fiber distributed data interface, physical layer protocol," Std. X3.148-198x, Draft Proposed, New York, NY, Oct. 1986.
[22] T. C. Wilson and C. B. Silio, Jr., "Extensions to the 'play through' protocol for loop networks, " inProc. IEEE Workshop Interconnection Networks for Parallel and Distributed Processing, W. Lafayette, IN, 1980, pp. 103-104.
[23] L. Kleinrock,Queuing Systems, Vol. II: Computer Applications, New York: Wiley, 1976.
[24] C. B. Silio, Jr., "Performance of multi-message, single-token rings," TR: ENEE85-05-15, Elec. Eng. Dep., Univ. Maryland, College Park, MD, May 1985, 135 pp.
[25] G. Mitchison and R. Durbin, "Optimal numberings of an n×n array,"SIAM J. Algebraic Discrete Methods, vol. 7, pp. 571-582, 1986.
[26] C. B. Silio, Jr. and H. M. Ghafir, "Simulation and analysis of circuit-switched PLAYTHROUGH rings," inIEEE Conf. Rec. Int. Conf. Commun. (ICC '88), Philadelphia, PA, vol. 2, June 1988, pp. 1195-1199.
[27] H. M. Ghafir, "Performance analysis of multiple-access circuit-switched ring networks," Ph.D. dissertation, Univ. Maryland, College Park, MD, Aug. 1989.
[28] C. C. Reames, "System design of the distributed loop computer network," Ph.D. dissertation, The Ohio State Univ., Columbus, OH, Mar. 1976.
[29] R. J. Ryan, "Performance evaluation of multiple priority playthrough protocol networks," M.S.E.E. thesis, Univ. Maryland, College Park, MD, July 1983.
[30] M. R. Parikh, "SIMSCRIPT II.5 simulation model for performance evaluation of playthrough protocol on a ring local area network," M.S.E.E. thesis, Univ. Maryland, College Park, MD, Dec. 1990.
[31] H. Kobayashi,Modeling and Analysis, An Introduction to System Performance Evaluation Methodology, Reading, MA: Addison-Wesley, 1978.
[32] D. P. Gaver, Jr. "A waiting line with interrupted service, including priorities,"J. Royal Statist. Soc., Ser. B (Methodological), vol. 24, no. 1, pp. 73-90, 1962.
[33] CACI, Inc.,SIMSCRIPT II.5 Programming Language, CACI, Inc. - Federal, Los Angeles, CA, 1987.
[34] L. Kleinrock,Queueing Systems, Vol. I: Theory. New York: Wiley, 1975.
[35] C. B. Silio, Jr., "A model for message service time on PLAYTHROUGH rings," inIEEE Conf. Rec. Int. Conf. Commun., ICC '86, Toronto, Ont., Canada, vol. 1, pp. 217-221, June 1986.
[36] H. M. Ghafir, C. B. Silio, Jr., M. Sui, and E. M. Wasser, "An improved model for service time on PLAYTHROUGH rings," inIEEE Proc. Comput. Networking Symp., Washington, DC, Apr. 1988, pp. 87-95.
[37] I. Rubin, "An approximate time-delay analysis for packet-switching communication networks,"IEEE Trans. Commun., vol. COM-24, no. 2, pp. 210-221, Feb. 1976.
[38] H. Takagi, "Queueing analysis of polling models,"ACM Comput. Surveys, vol. 20, no. 1, pp. 5-28, Mar. 1988.
[39] J. J. Wolf, B. W. Weide, and M. T. Liu, "Analysis and simulation of the distributed double-loop computer network (DDLCN)," inIEEE Proc. Comput. Networking Symp., Gaithersburg, MD, Dec. 1979, pp. 82-89.
[40] N. Lin and C. B. Silio, Jr., "A reliability comparison of single and double rings," inIEEE Proc. INFOCOM '90, San Francisco, CA, vol. II, June 1990, pp. 504-511.

Index Terms:
approximate method; performance analysis; PLAYTHROUGH rings; simulation results; average message queuing time; service time; control frame round trip time; ring-topology local area networks; PLAYTHROUGH protocol; data link layer medium access control protocol; concurrent transfer; multiple messages; queuing system model; throughput; multiserver circuit-switched ring; symmetric traffic; shortest outbound distance; waiting times; circuit switching; local area networks; performance evaluation; protocols; queueing theory.
Citation:
C.B. Silio, Jr., H.M. Ghafir, M.R. Parikh, "An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings," IEEE Transactions on Computers, vol. 41, no. 9, pp. 1137-1155, Sept. 1992, doi:10.1109/12.165395
Usage of this product signifies your acceptance of the Terms of Use.