This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analytic Models of Cyclic Service Systems and their Application to Token-Passing Local Networks
October 1988 (vol. 37 no. 10)
pp. 1224-1234

[1] D. Andrews and G. Schulz, "A token-ring architecture for local area networks: An update," inProc. IEEE COMPCON, Fall 1982.
[2] W. Bux, "Performance issues in local area networks,"IBM J., vol. 23, no. 4, 1984.
[3] E. Cinlar,Introduction to Stochastic Processes, Englewood Cliffs, NJ: Prentice-Hall, 1975.
[4] M. Eisenberg, "Queues with periodic service and changeover times,"Oper. Res., vol. 20, pp. 440-451, Mar.-Apr. 1972.
[5] M. J. Ferguson and Y. J. Aminetzah, "Exact results for nonsymmetric token ring systems,"IEEE Trans. Commun., vol. COM-33, pp. 223-231, 1985.
[6] M. Ferguson, "Mean waiting time for a token ring with station dependent overheads," inLocal Area&Multiple Access Networks, R. L. Pickholtz, Ed, Rockville, MD: Computer Science Press, 1986, ch. 3, pp. 43-67.
[7] S. W. Fuhrman, "Symmetric queues served in cyclic order,"Oper. Res. Lett., pp. 139-144, Oct. 1985.
[8] O. Hashida and K. Ohara, "Line accommodation capacity of a communication control unit,"Rev. Elect. Commun. Lab., Nippon Telegraph and Telephone Public Corp., vol. 20, pp. 231-239, 1972.
[9] ANSI/IEEE Standards 802.2-1985, 802.3-1985, 802.4-1985, 802.5- 1985.
[10] A. R. Kaye, "Analysis of a distributed control loop for data transmissions," inProc. P.I.B. Int. Symp. XXII Comput. Commun. Teletraffic, Apr. 4-6, 1972.
[11] A. Konheim and B. Meister, "Waiting lines and times in a system with polling,"J. ACM, vol. 21, pp. 470-490, July 1974.
[12] P. J. Kuehn, "Multiqueue systems with nonexhaustive cyclic service,"Bell Syst. Tech. J., vol. 58, pp. 671-698, Mar. 1979.
[13] C. Mack, T. Murphy, and N. Webb, "The efficiency ofNmachines unidirectionally patrolled by one operative when walking time and repair times are constants,"J. Royal Stat. Soc., Ser. B, vol. 19, pp. 166-172, 1957.
[14] V. J. Rego and L. M. Ni, "A queueing model for token-passing computer networks," TR559, Dep. Comput. Sci., Purdue Univ., West Lafayette, IN, 1986.
[15] V. J. Rego and W. Szpankowski, "Queueing networks and multiqueues: An equivalence, " inProc. Queueing Their Networks Applications, (abstract) ORSA/TIMS, New Brunswick, NJ, 1987.
[16] C. B. Swartz, "Polling in a ring system,"J. ACM, vol. 27, pp. 42- 59, Jan. 1980.
[17] W. Stallings,Local Networks, An Introduction, 2nd ed. New York: Macmillan, 1987.
[18] H. Takagi, "On the analysis of a symmetric polling system with single-message buffers,"Perform. Eval., vol. 5, pp. 149-157, 1985.
[19] J. Van Dam and F. Raaijmakers, "Reliability of a single unit with k spares in case of the hyper-exponential and the Erlang failure distribution,"Nav. Res. Log. Quarterly, vol. 29, no. 4, pp. 547-555.

Citation:
V. Rego, L.M. Ni, "Analytic Models of Cyclic Service Systems and their Application to Token-Passing Local Networks," IEEE Transactions on Computers, vol. 37, no. 10, pp. 1224-1234, Oct. 1988, doi:10.1109/12.5984
Usage of this product signifies your acceptance of the Terms of Use.