Variable window flow control and ergodic discretized learning algorithms for adaptive routing in data networks
作者： Athanasios V. Vasilakos , Christos A. Moschonas , Constantinos T. Paximadis
DOI: 10.1016/0169-7552(91)90062-H
关键词:
摘要: Abstract In this paper we present a scheme that combines two new adaptive algorithms for flow control and routing. The algorithm increments or decrements the window size based on value of sessions' delay routing uses fast accurate Learning Automaton presented in [23] to choose minimum routes network. We compare performance with similar ones discussed literature. scheme, being delay-oriented one, has lower delay, at about same throughput than some schemes given literature, thus resulting higher power ( = throughput/delay).
elsevier.com
sci-hub.se 参考文章(20)
Hisashi Kobayashi, Modeling and analysis : an introduction to system performance evaluation methodology Addison-Wesley Pub. Co.. ,(1978)
K. K. Ramakrishnan, Dah-Ming Chiu, Raj Jain, Congestion avoidance in computer networks with a connectionless network layer Innovations in Internetworking. pp. 140- 156 ,(1988)
A.V. Vasilakos, S.A. Koubias, On routing and performance comparison of techniques for packet-switched networks using learning automata international symposium on circuits and systems. pp. 109- 113 ,(1988) , 10.1109/ISCAS.1988.14879
Athanasios V. Vasilakos, Christos A. Moschonas, Constantinos T. Paximadis, Adaptive window flow control and learning algorithms for adaptive routing in data networks Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems - SIGMETRICS '90. ,vol. 18, pp. 265- 266 ,(1990) , 10.1145/98457.98780
V.R. Saksena, Topological analysis of packet networks IEEE Journal on Selected Areas in Communications. ,vol. 7, pp. 1243- 1252 ,(1989) , 10.1109/49.35569
B.J. Oommen, J.P.R. Christensen, epsilon -optimal discretized linear reward-penalty learning automata systems man and cybernetics. ,vol. 18, pp. 451- 458 ,(1988) , 10.1109/21.7494
R. Gallager, A Minimum Delay Routing Algorithm Using Distributed Computation IEEE Transactions on Communications. ,vol. 25, pp. 73- 85 ,(1977) , 10.1109/TCOM.1977.1093711
Kumpati S. Narendra, Philip Mars, The use of learning algorithms in telephone traffic routing-A methodology Automatica. ,vol. 19, pp. 495- 502 ,(1983) , 10.1016/0005-1098(83)90004-3
Oleg V. Nedzelnitsky, Kumpati S. Narendra, Nonstationary models of learning automata routing in data communication networks systems man and cybernetics. ,vol. 17, pp. 1004- 1015 ,(1987) , 10.1109/TSMC.1987.6499311
Kumpati S. Narendra, M. A. L. Thathachar, Learning Automata - A Survey IEEE Transactions on Systems, Man, and Cybernetics. ,vol. SMC-4, pp. 323- 334 ,(1974) , 10.1109/TSMC.1974.5408453