This Article 
 Bibliographic References 
 Add to: 
A Performance Modeling and Evaluation of the Cambridge Fast Ring
September 1992 (vol. 41 no. 9)
pp. 1110-1125

Performance of the Cambridge Fast Ring (CFR), a high-speed slotted ring with normal slots, is studied. It is shown that the CFR can be represented by a multiqueue multiple cyclic server model with a 1-limited service discipline and with a restriction that only one server at a time can be serving a queue. Exact necessary and sufficient stability conditions are stated. An approximate analytic M/G/1 vacation model in which analysis concentrates on one station while the others are represented by a vacation period is developed to estimate the expected message waiting times. It is shown that the model is accurate and usable over a wide range of parameters. A performance evaluation of the CFR based on this model is presented. The performance is compared to that of a variant which does not restrict the number of slots a station may simultaneously use.

[1] B. van Arem, "Queueing models for slotted transmission systems," Ph.D. dissertation, ISBN 90-9 003 421-8, Dep. Appl. Math., Univ. Twente, Enschede, The Netherlands, June 1990.
[2] Y. Baba, "On the MX/G/1 queue with vacation time,"Oper. Res. Lett., vol. 5, no. 2, Elsevier Sc.Pb.B.V., pp. 93-98, July 1986.
[3] British Telecom, "Stable cycles and analytic results for slotted rings," British Telecom Teletraffic Memorandum 84/08, British Telecom Technical Publications, Mar. 1984.
[4] British Telecom, "Stable cycles and analytic results for the Cambridge ring: Further results," British Telecom Teletraffic Memorandum 84/58, British Telecom Technical Publications, Dec. 1984.
[5] W. Bux, "Local-area subnetworks: A performance comparison,"IEEE Trans. Commun., Oct. 1981.
[6] L. M. Casey, R. C. Dittburner, and R. C. Gamage, "FXNET: A backbone ring for voice and data,"IEEE Commun. Mag., vol. 24, no. 12, pp. 23-28, Dec. 1986.
[7] R. B. Cooper and G. Murray, "Queues served in cyclic order,"Bell Syst. Tech. J., vol. 48, no. 3, pp. 675-689, Mar. 1969.
[8] J. Chauhan, T. J. King, and A. C. Micallef, "Specification of the Orwell protocol," British Telecom Technical Publications, Issue B.2 (12/89), London, Dec. 1989.
[9] R. M. Falconer, J. L. Adams, and G. M. Walley, "A simulation study of the Cambridge ring with voice traffic,"British Telecom Tech. J., vol. 3, no. 2, pp. 85-91, Apr. 1985.
[10] S. W. Fuhrmann and Y. T. Wang, "Mean waiting time approximations of cyclic service systems with limited service," inProc. Performance '87, P.-J. Courtois and G. Latouche, Eds. Amsterdam, The Netherlands: North-Holland, pp. 253-265.
[11] W. K. Giloi, P. Behr, and G. Zuber, "Upperbus, A high speed backbone for metropolitan area networks," inProc. EFOC/LAN'86, June 1986, pp. 286-289.
[12] D. Greaves, D. Lioupis, and A. Hopper, "The Cambridge backbone ring," inProc. IEEE INFOCOM '90, San Francisco, CA, June 1990, pp. 8-14.
[13] W. P. Groenendijk, "Conservation laws in polling systems," Ph.D. dissertation, Rijksuniversiteit Utrecht, Utrecht, The Netherlands, Jan. 1990.
[14] J. F. Hayes and D. N. Sherman, "Traffic analysis of a ring switched data transmission,"Bell Syst. Tech. J., vol. 50, no. 9, pp. 2947-2978, Nov. 1971.
[15] A. Hopper and R. M. Needham, "The Cambridge fast ring networking system,"IEEE Trans. Comput., vol. 37, no. 10, pp. 1214-1223, Oct. 1988.
[16] A. Hopper, "The Cambridge ring--A local network," inAdvanced Techniques for Microprocessor Systems, F. K. Hanna, Ed. Stevenage, U. K.: Peter Pergrinus Ltd., 1980, pp. 67-71.
[17] P. J. B. King and I. Mitrani, "Modeling a slotted ring local area network,"IEEE Trans. Comput., vol. C-36, no. 5, pp. 554-561, May 1987.
[18] L. Kleinrock,Queueing Systems, Vol. I, New York: Wiley, 1979.
[19] P. J. Kuehn, "Multiqeueue systems with nonexhaustive cyclic service,"Bell Syst. Tech. J., vol. 58, no. 3, pp. 671-698, Mar. 1979.
[20] K. van der Lande, "Design and implementation of a Cambridge fast-ring variant simulation model," Rep. 080-87-06, Univ. Twente, The Netherlands, Feb. 1987.
[21] W. M. Loucks, V. C. Hamacher, B. R. Preiss, and L. Wong, "Short packet transfer performance in local area ring networks,"IEEE Trans. Comput., vol. C-34, no. 11, pp. 1006-1014, Nov. 1985.
[22] I. Mitrani, J. L. Adams, and R. M. Falconer, "A modeling study of the Orwell ring protocol," inTeletrafic Analysis and Computer Performance Evaluation, O. Boxma, J. Cohen, and H. Tijms, Eds. Amsterdam, The Netherlands: Elseviers Sc.Pb. B. V., 1986, 429-438.
[23] R. J. I. Morris and Y. I. Wang, "Some results for multi-queue systems with multiple cyclic servers, inPerformance of Computer Communication Systems, H. Rudin and W. Bux, Eds. Amsterdam, The Netherlands: Elsevier Sc.Pb. B. V. 1984, pp. 4.2A-5-1-4.2A-5-7.
[24] I. G. Niemegeers and M. Zafirovic-Vukotic, "HSLAN's for communication within a gateway: A performance evaluation," inProc. IFIP WG 6.4 Workshop HSLAN'88, A. Danthine, Ed., Liege, North Holland, Apr. 1988, pp. 167-185.
[25] L. D. Servi, "Average delay approximation of M/G/1 cyclic service queues with Bernoulli schedules, "IEEE J. Select. Areas Commun., vol. SAC-4, no. 6, pp. 813-822, 1986.
[26] C. E. Skinner, "A priority queueing system with server-walking time,"Oper. Res., vol. 15, no. 2, pp 278-285, Mar.-Apr. 1967.
[27] H. Takagi, "Queueing analysis of polling models,"ACM Comput. Surveys, vol. 20, no. 1, pp. 5-28, Mar. 1988.
[28] H. Takagi, "Queueing analysis of vacation models, part I: M/G/1 and part II: M/G/1 with vacations," TRL Res. Rep. TR87-0032, IBM Tokyo Res. Lab., Tokyo 102, 1987.
[29] S. Temple, "The design of the Cambridge fast ring," inRing Technology Local Area Networks, I. N. Dallas and E. B. Spratt, Eds. Amsterdam, The Netherlands: Elsevier Sc.Pb. B. V., 1984, pp. 79-88.
[30] D. Valk, "Performance analysis of integrated services slotted ring protocols in gathering HSLANs," Rep. 080-87-08, Univ. Twente, Mar. 1987.
[31] E. Vyncke and A. Danthine, "A realistic simulation of a wideband backbone network," inProc. ICCC'86, North Holland, 1986, pp. 176-181.
[32] Z. D. Wu and E. B. Spratt, "The performance analysis of multiple Cambridge rings," inProc. IFIP TC 6/WG6.4 Int. In-depth Symp. Local Commun. Syst.: LAN and PBX, J. P. Cabanel, G. Pujolle, and A. Danthine, Ed., Toulouse, North Holland, 1987.
[33] M. Zafirovic-Vukotic and I. G. Niemegeers, "An evaluation of high speed local area network access mechanisms," in Proc. Commun. Distributed Systems, Aachen, Informatik-Fachberichte no 130, Springer-Verlag, N. Gerner and O. Spaniol, Eds., Feb. 1987, pp. 426-440.
[34] M. Zafirovic-Vukotic and I. G. Niemegeers, "Analytical models of the slotted ring protocols in HSLANs," inProc. IFIP WG 6.4 Workshop High Speed Local Area Networks, A. Danthine, and O. Spaniol, Eds., Aachen, North Holland, 1987, pp. 115-134.
[35] M. Zafirovic-Vukotic and I. G. Niemegeers, "Performance modeling of the Orwell basic access mechanism," inProc. ACM SIGCOMM'87: Frontiers in Comput. Commun. Technol., Stowe,Comput. Comm. Rev., Special Issue, vol. 17, no. 5, pp. 35-48, 1987.
[36] M. Zafirovic-Vukotic and I. G. Niemegeers, "Performance modeling of a HSLAN slotted ring protocol," inProc. ACM SIGMETRICS'88, Santa Fe, NM,Perform. Eval. Rev., Special Issue, vol. 16, no. 1, pp. 37-46, May 1988.
[37] M. Zafirovic-Vukotic and I. G. Niemegeers, "Performance modeling and analysis of the Orwell access mechanism," inProc. ITC 12, Turin, Italy, June 1988, pp. 2.3B.5.1-2.3B.5.7.
[38] M. Zafirovic-Vukotic, I. G. Niemegeers, and D. Valk, "Performance analysis of slotted ring protocols in HSLANs,"IEEE J. Select. Areas Commun., vol. SAC-6, no. 6, pp. 1011-1024, July 1988.

Index Terms:
exact necessary and sufficient stability conditions; performance modeling; Cambridge Fast Ring; high-speed slotted ring; normal slots; multiqueue multiple cyclic server model; 1-limited service discipline; approximate analytic M/G/1 vacation model; vacation period; message waiting times; performance evaluation; local area networks; performance evaluation; queueing theory.
M. Zafirovic-Vukotic, I.G. Niemegeers, "A Performance Modeling and Evaluation of the Cambridge Fast Ring," IEEE Transactions on Computers, vol. 41, no. 9, pp. 1110-1125, Sept. 1992, doi:10.1109/12.165393
Usage of this product signifies your acceptance of the Terms of Use.