This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Adaptive Algorithm to Ensure Differential Service in a Token-Ring Network
January 1990 (vol. 39 no. 1)
pp. 19-33

A distributed and adaptive token-passing algorithm that can be used to maintain the values of a designated performance parameter (e.g. mean waiting time) at the hosts of a token-ring network at a prescribed ratio is presented. The algorithm is simple to implement. The authors demonstrate its application in keeping the mean waiting times at the various hosts in a prespecified ratio, in maintaining a designated throughput differential between different classes of customer, and in integrating voice and two classes of data on a token ring.

[1] B. Akselrod and G. Langholz, "A simulation study of advanced routing methods in a multipriority telephone network,"IEEE Trans. Syst., Man, Cybern., vol. SMC-15, no. 6, Nov./Dec. 1985.
[2] U. Bagchi and R. S. Sullivan, "Dynamic, non-preemptive priority queues with general, linearly increasing priority function,"Oper. Res., vol. 33, pp. 1278-1298, 1985.
[3] D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computations. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[4] W. E. Biles, "A response surface method for experimental optimization of multiresponse processes,"Industrial Eng. Chemistry Process Design Develop., vol. 14, no. 2, 1975.
[5] G. E. P. Box, "The exploration and exploitation of response surfaces: Some general considerations and examples,"Biometrics, vol. 10, pp. 16-60, 1954.
[6] G. E. P. Box and N. R. Draper,Evolutionary Operation: A Statistical Method for Process Improvement. New York: Wiley, 1969.
[7] G. E. P. Box and N. R. Draper,Empirical Model-Buiding and Response Surfaces. New York: John Wiley, 1987.
[8] G. E. P. Box and K. B. Wilson, "On the experimental attainment of optimum conditions,"J. Royal Statist. Soc. Series B, vol. XIII, no. 1, 1951.
[9] S. H. Brooks, "A comparison of maximum-seeking methods,"Oper. Res., vol. 7, no. 4, July-Aug. 1959.
[10] S. H. Brooks and M. R. Mickey, "Optimum estimation of gradient direction in steepest ascent experiments,"Biometrics, vol. 17, pp. 48-56, 1961.
[11] W. Bux, F. H. Closs, K. Kuemmerle, H. J. Keller, and H. R. Mueller, "Architecture and design of a reliable token-ring network,"IEEE J. Select. Areas Commun., vol. SAC-1, no. 5, pp. 756-765, Nov. 1983.
[12] E. G. Coffman, Jr. and I. Mitrani, "A characterization of waiting time performance realizable by single-server queues,"Oper. Res., vol. 28, pp. 810-821, 1980.
[13] R. B. Cooper and G. Murray, "Queues served in cyclic order,"Bell Syst. Tech. J., vol. 48, no. 3, 1969.
[14] N. R. Draper, "Ridge analysis of response surfaces,"Technometrics, vol. 5, no. 4, Nov. 1963.
[15] Y. M. A. E. Fattah, P. Boyer, A. Dupuis, and L. Romoeuf, "Use of a learning automaton for control of service activity," Centre National d'Etudes des Telecommunications, Lannion, France.
[16] G. J. H. Hahn and A. F. Dershowitz, "Evolutionary operation today--Some survey results and observations,"J. Royal Statist. Soc. Series C, vol. 23, no. 2, 1974.
[17] D. Karvelas and A. Leon-Garcia, "A performance comparison of voice/data token ring protocols," inProc. IEEE INFOCOM'87, Mar. 1987.
[18] L. Kleinrock,Queueing Systems Vol. II: Computer Applications. New York: Wiley, 1976.
[19] G. P. Klimov, "Time-sharing service systems II,"Theory Probability Appl., vol. 23, 1978.
[20] A. Konheim and B. Meister, "Waiting lines and times in a system with polling,"J. ACM, vol. 21, pp. 470-490, July 1974.
[21] P. J. Kuehn, "Multiqueue systems with nonexhaustive cyclic service,"Bell Syst. Tech. J., vol. 58, no. 3, 1979.
[22] P. R. S. Kumar and G. K. Young, "Distributed learning of the global maximum in a two-player stochastic game with identical payoffs,"IEEE Trans. Syst., Man, Cybern., vol. SMC-15, no. 6, pp. 743-753, Nov./Dec. 1985.
[23] S. Lakshmivarahan,Learning Algorithms Theory and Applications, New York: Springer-Verlag, 1981.
[24] C. W. Lowe, "Evolutionary operation in action,"J. Royal Statist. Soc. Series C, vol. 23, no. 2, 1974.
[25] L. G. Mason and XueDuo Gu, "Learning automata models for adaptive flow control in packet-switching networks," INRS-Telecommunications.
[26] R. H. Myers,Response Surface Methodology. Boston, MA: Allyn and Bacon, 1971.
[27] R. H. Myers and W. H. Carter, Jr., "Response surface techniques for dual response systems,"Technometrics, vol. 15, no. 2, May 1973.
[28] K. S. Narendra and S. Lakshmivarahan, "Learning automata--A critique,"J. Cybern. Inform. Sci., vol. 1, pp. 53-66, Spring-Fall 1977.
[29] K. S. Narendra and P. Mars, "The use of learning algorithms in telephone traffic routing--A methodology,"Automatica, vol. 19, no. 5, pp. 495-502, 1983.
[30] K. S. Narendra and M. A. L. Thathachar, "Learning automata--A survey,"IEEE Trans. Syst., Man, Cybern., vol. SMC-4, no. 4, July 1974.
[31] O. V. Nedzelnitski and K. S. Narendra, "Nonstationary models of leaning automata routing in data communication networks,"IEEE Transactions on Systems, Man and Cybernetics, vol. SMC-17, no. 6, pp. 1004-1015, Nov./Dec. 1987.
[32] V. V. Rykov and E. Ye. Lembert, "Optimal dynamic priorities in single queueing systems,"Eng. Cybern., vol. 5, no. 1, pp. 21-30, 1967.
[33] K. Sriram and W. Whitt, "Characterizing superposition arrival processes in packet multiplexers for voice and data,"IEEE J. Select. Areas Commun., vol. SAC-4, no. 6, pp. 823-832, Sept. 1986.
[34] T. Suda and T. Bradley, "Packetized-voice/data integrated transmission on a token passing ring local area network," inProc. IEEE INFOCOM'87, Mar. 1987.
[35] H. Takagi,Analysis of Polling Systems. Cambridge, MA: MIT Press, 1986.
[36] M. A. L. Thathachar and P. S. Sastry, "A new approach to the design of reinforcement schemes for learning automata,"IEEE Trans. Syst. Man, Cybern., vol. SMC-15, no. 1, pp. 168-175, Jan./Feb. 1985.
[37] J. M. Tienet al., "Performance analysis of a single-token ring communication network," inProc. IEEE Conf. Cybern., Soc., 1982.
[38] C. M. Woodside, "Controllability of computer performance tradeoffs obtained using controlled-share queue schedulers,"IEEE Trans. Software Eng., vol. SE-12, no. 10, pp. 1041-1048, Oct. 1986.

Index Terms:
adaptive algorithm; differential service; token-ring network; performance parameter; mean waiting time; performance evaluation; token networks.
Citation:
M. Choi, C.M. Krishna, "An Adaptive Algorithm to Ensure Differential Service in a Token-Ring Network," IEEE Transactions on Computers, vol. 39, no. 1, pp. 19-33, Jan. 1990, doi:10.1109/12.46278
Usage of this product signifies your acceptance of the Terms of Use.