On the use of a stochastic estimator learning algorithm to the ATM routing problem: A methodology

Computer Communications

Volumn 21, Issue 6, 1998, Pages 538-546

  Atlasis, Antonios F ^a,b   Saltouros, Marios P ^a,b   Vasilakos, Athanasios V ^c  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b HELLENIC AIR FORCE ACADEMY   (Greece)

^c Foundation for Research and Technology Hellas Science and Technology Park of Crete   (Greece)

Author keywords

ATM; Learning automata; Routing problem; Virtual path

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); LEARNING ALGORITHMS; PROBABILITY; RANDOM PROCESSES; REAL TIME SYSTEMS; TELECOMMUNICATION TRAFFIC;

CELL LOSS PROBABILITY; ROUTING ALGORITHMS; STOCHASTIC ESTIMATOR LEARNING ALGORITHM (SELA);

ASYNCHRONOUS TRANSFER MODE;

EID: 0032073451     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0140-3664(98)00122-4     Document Type: Article

References (26)

1. ITU-T, Draft Recc.1.371: B-ISDN General Network Aspects, Geneva, 1992.
2. H. Ahmadi, J. Chen and R. Guerin, Dynamic routing and call control in high-speed integrated networks, Proc. ITC-13, Copenhagen, 1991, pp. 397-403.
3. S. Bahk and M. El Zarki, Congestion control based dynamic routing in ATM networks, Computer Communications, 17 (12) (1994) 826-835.
4. R.H. Hwang, J.F. Kurose and D. Towsley, MDP routing in ATM networks using virtual path concept, IEER INFOCOM'94, June 1994, pp. 1509-1517.
5. N.F. Huang, C.S. Wu and Y.J. Wu, Some routing problems on broadband ISDN, Computer Networks and ISDN systems 27 (1994) 101-116.
6. I. Chlamtac, A. Farago, T. Zhang, Optimizing the system of virtual paths, IEEE/ACM Transactions on Networking, 2 (6) (1994) 581-587.
7. A.V. Vasilakos and G. Papadimitriou, A new approach to the design of reinforcement scheme for learning automata: stochastic estimator learning algorithms, Neurocomputing 7 (3) (1995) 275-297.
8. A.V. Vasilakos and C.T. Paximadis, Virtual circuit routing algorithms using stochastic estimator learning automata (SELA) for high-speed packet-switched networks, 11th ICCC, Genova, Italy, October 1992.
9. K. Narendra and P. Mars, The use of learning algorithms in telephone traffic routing - a methodology, Automatica, 19 (9) (1983).
10. O.V. Nedzeinitsky and K.S. Narendra, Nonstationary models of automata routing in data communication networks, IEEE Trans. Systems, Man and Cybernetics, 17 (1987).
11. A.A. Economides, P.A. Ioannou and J.A. Silvester, Decentralized adaptive routing for virtual circuit networks using stochastic learning automata, Proc. IEEE INFOCOM 88, 1988, pp. 613-622.
12. A.V. Vasilakos, N.H. Loukas and A.F. Atlasis, On the use of a stochastic estimator learning algorithm to the ATM routing problem: a methodology, ICCC '95, Seoul, Korea, August 1995.
13. P. Mars and W.J. Poppelbaum, Stochastic and Deterministing Averaging Processors, Peter Peregrinus, Stevenage, UK, 1981.
14. A.V. Vasilakos, N.H. Loukas and A.F. Atlasis, The use of learning algorithms in ATM networks call admission control problem: a methodology, ICCC '95, Seoul, Korea, August 1995.
15. A.V. Vusilakos and A.F. Atlasis, LB-SELA: rate based access control for ATM networks, IEEE INFOCOM'94, June 1994, pp. 1552-1559.
16. K. Narendra and M. Thathachar, Learning automata: a survey, IEEE Trans. Syst. Man and Cybern, SMC-4 (1974) 323-334.
17. D.W. Glazer and C. Tropper, A new metric for dynamic routing algorithms, IEEE Trans. Commun. 38 (3) (1990) 360-367.
18. Z. Wang and J. Crowcroft, Analysis of shortest-path routing algorithms in a dynamic network environment, ACM SIGCOMM, Computer Communication Review, April (1992) 63-71.
19. G.M. Woodruff and R.H. Rogers et al., A congestion control framework for high speed integrated packetized transport, Proc. IEEE GLOBECOM'88, 1988.
20. J.J. Bae, T. Suda and R. Simha, Analysis of a finite buffer queue with heterogeneous Markov modulated arrival process: a study of the effects of traffic burstiness on individual packet loss, Proc. of the IEEE INFOCOM, 1992, pp. 219-230.
21. Y. Takagi, S. Hino and T. Takahashi, Priority assignment control of ATM line buffers with multiple QOS classes, IEEE Journal on Selected Areas in Communications 9 (1991) 1078-1092.
22. S. Gupta, M. El Zarki, Traffic classification for round-robin scheduling schemes in ATM networks, Proc. of the IEEE INFOCOM, 1993, pp. 820-827.
23. D.R. Shier, On algorithms for linding the k shortest paths in a network, Networks, 9 (1979).
24. D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, Englewood Cliifs, NJ, 1987.
25. D.M. Topkins, A k shortest path algorithm for adaptive routing in communications networks, IEEE Transactions on Communications, 36 (7) (1988).
26. R. Guerin and A. Orda, QoS-based routing in networks with inaccurate information: theory and algorithms, Proc. of the IEEE INFOCOM, Kobe, Japan, 1997.