An Approximate Method for the Performance Analysis of PLAYTHROUGH Rings

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]  W. Bux.  Local-Area Subnetworks: A Performance Comparison , 1981, IEEE Trans. Commun..

[2]  Cecil Clay Reames.  System design of the distributed loop computer network (dlcn). , 1976 .

[3]  Ming T. Liu,et al.  Design and simulation of the distributed loop computer network (DLCN) , 1976, ISCA.

[4]  D. Gaver.  A Waiting Line with Interrupted Service, Including Priorities , 1962 .

[5]  Charles B. Silio.  A Model for Message Service Time on Playthrough Rings , 1986, ICC.

[6]  H. M. Ghafir,et al.  A performance model for concurrent message transfer on Playthrough rings , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[7]  E. E. Newhall,et al.  An experimental distributed switching system to handle bursty computer traffic , 1969, Symposium on Problems in the Optimization of Data Communications Systems.

[8]  C.B. Silio,et al.  Ternary physical protocol for MARILAN, a multiple-access ring local area network , 1988, [1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic.

[9]  H. M. Ghafir,et al.  Simulation and analysis of circuit-switched playthrough rings , 1988, IEEE International Conference on Communications, - Spanning the Universe..

[10]  Charles B. Silio,et al.  A reliability comparison of single and double rings , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[11]  Peter O'Reilly,et al.  Performance Analysis of Local Computer Networks , 1986 .

[12]  W. Bux,et al.  An Approximate Method for the Performance Analysis of Buffer Insertion Rings , 1983, IEEE Trans. Commun..

[13]  C.B. Silio,et al.  An improved model for service time on playthrough rings , 1988, [1988] Proceedings. Computer Networking Symposium.

[14]  Hisashi Kobayashi,et al.  Modeling and analysis , 1978 .

[15]  Ted G. Lewis,et al.  Some simplified performance modeling techniques with applications to a new ring-structured microcomputer network , 1979, ISCA '79.

[16]  W. D. Farmer,et al.  An experimental distributed switching system to handle bursty computer traffic , 1969, Symposium on Problems in the Optimization of Data Communications Systems.

[17]  Izhak Rubin.  An Approximate Time-Delay Analysis for Packet-Switching Communication Networks , 1976, IEEE Trans. Commun..

[18]  Hideaki Takagi,et al.  Queuing analysis of polling models , 1988, CSUR.

[19]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[20]  J. R. Pierce,et al.  Network for block switching of data , 1972 .

[21]  Ted G. Lewis,et al.  Simulation of a Class of Ring-Structured Networks , 1980, IEEE Transactions on Computers.