Mean Waiting Time Evaluation of Packet Switches for Centrally Controlled PBX's

Abstract The performance analysis of packet switched networks usually does not account for the loss of transmission bandwidth caused by the switch processing time. In wide area networks, where transmission channels are of the order of 64 kbps or less, this is a valid approach since switch processing time is negligible compared to average transmission times for packets. However, in Local Area Networks (LANs), the transmission channels are usually of the order of 1 mbps or greater and thus when evaluating the performance of a LAN that is based on a packet switch, it is necessary to consider the effect of the switch processing time which is now comparable to that of the average packet's transmission time. This paper investigates the effect of this processing time on network performance, and an exhaustive cyclic queueing algorithm to minimise this effect on overall network performance is discussed. An approximate analytical technique for evaluating the performance of such a LAN is derived. This technique makes it possible to do interactive calculations which can be used in the provisioning and configuring of such networks.

[1]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[2]  Robert B. Cooper,et al.  Queues served in cyclic order , 1969 .

[3]  Martin Eisenberg.  Two Queues with Changeover Times , 1971, Oper. Res..

[4]  Michael J. Ferguson,et al.  Exact Results for Nonsymmetric Token Ring Systems , 1985, IEEE Trans. Commun..

[5]  Bernd Meister,et al.  Waiting Lines and Times in a System with Polling , 1974, JACM.

[6]  Robert B. Cooper.  Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

[7]  G. Boyd Swartz.  Polling in a Loop System , 1980, JACM.

[8]  Martin Eisenberg,et al.  Queues with Periodic Service and Changeover Time , 1972, Oper. Res..

[9]  Michael J. Ferguson.  Mean waiting time for a token ring with station dependent overheads , 1986 .

[10]  W. Bux.  Local-Area Subnetworks: A Performance Comparison , 1981, IEEE Trans. Commun..

[11]  Hideaki Takagi,et al.  Analysis of polling systems , 1986 .

[12]  R. R. P. Jackson.  Introduction to Queueing Theory , 1943 .

[13]  Werner Bux,et al.  Performance Issues in Local-Area Networks , 1984, IBM Syst. J..

[14]  G. F. Yeo.  Single server queues with modified service mechanisms , 1962, Journal of the Australian Mathematical Society.

[15]  Izhak Rubin,et al.  Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks , 1983, IEEE J. Sel. Areas Commun..

[16]  Robert B. Cooper,et al.  An Introduction To Queueing Theory , 2016 .

[17]  Pierre A. Humblet,et al.  Source coding for communication concentrators , 1978 .

[18]  W. Stallings.  Local network performance , 1984, IEEE Communications Magazine.

[19]  H. Inose,et al.  Theoretical aspects in the analysis and synthesis of packet communication networks , 1978, Proceedings of the IEEE.

[20]  Hong Linh Truong,et al.  Mean-delay approximation for cyclic-service queueing systems , 1983 .

[21]  E. Horowitz.  SAC-1 , 1972, SIGS.

[22]  H. Mouftah,et al.  Performance evaluation of computer communications networks , 1985, IEEE Communications Magazine.

[23]  Peter D. Welch,et al.  On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service , 1964 .