GPSPA: A new adaptive algorithm for maintaining shortest path routing trees in stochastic networks

International Journal of Communication Systems

Volumn 17, Issue 10, 2004, Pages 963-984

  Misra, Sudip ^a   Oommen, B John ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Algorithm; Dynamic; Generalized pursuit learning; Routing; Shortest path

Indexed keywords

ADAPTIVE ALGORITHMS; INTERNET; LEARNING SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS; TREES (MATHEMATICS);

DYNAMIC SHORTEST PATH ROUTING PROBLEM; GENERALIZED PURSUIT LEARNING; ROUTING; STOCHASTIC NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 10444288729     PISSN: 10745351     EISSN: None     Source Type: Journal    
DOI: 10.1002/dac.684     Document Type: Article

References (25)

1. Tanenbaum A. Computer Networks (4th edn). Prentice-Hall: Englewood Cliffs, NJ, 2003.
2. Peterson L, Davie B. Computer Networks: A Systems Approach. Morgan Kaufmann: Los Altos, CA, 2000.
3. Moy J. OSPF Version 2. Internet Draft, RFC 2178, 1997.
4. Schwartz M, Stern T. Routing techniques used in computer communications networks. IEEE Transactions on Communications 1980; 28:539-552.
5. Narvaez P, Siu K-Y, Tzeng H-Y. New dynamic SPT algorithm based on ball-and-string model. IEEE/ACM Transactions on Networking 2001; 9(6):706-718.
6. Frigioni D, Marchetti-Spaccamela A, Nanni U. Fully dynamic output bounded single source shortest path problem. ACM-SIAM Symposium Discrete Algorithms 1996; 1:212-221.
7. Frigioni D, Marchetti-Spaccamela A, Nanni U. Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms 2000; 34:251-281.
8. Narvaez P, Siu K-Y, Tzeng HY. New dynamic algorithms for shortest path tree computation. IEEE/ACM Transactions on Networking 2000; 8(6):734-746.
9. Ramalingam G, Reps T. On the computational complexity of dynamic graph problems. Theoretical Computer Science 1996; 158(1):233-277.
10. Bellman R. On a routing problem. Quarterly of Applied Mathematics 1958; 16:87-90.
11. Dijkstra EW. A note on two problems in connection with graphs. Numerische Mathematik 1959; 1:269-271.
12. Spira P, Pan A. On finding and updating spanning trees and shortest paths. SIAM Journal on Computing 1975; 4(3):375-380.
13. McQuillan J, Richer I, Rosen E. The new routing algorithm for the ARPANET. IEEE Transactions on Communications 1980; COM-28(5):711-719.
14. Franciosa PG, Frigioni D, Giaccio R. Semi-dynamic shortest paths and breadth first search in digraphs. Proceedings of STACS, Lecture Notes in Computer Science 1997; 1200:33-46.
15. Lakshmivarahan S. Learning Algorithms: Theory and Applications. Springer: New York, 1981.
16. Narendra KS, Thathachar MAL. Learning Automata. Prentice-Hall: Englewood Cliffs, NJ, 1989.
17. Misra S, Oommen BJ. Dynamic algorithms for the shortest path routing problem: learning automata-based solutions (available from the authors as a technical report).
18. Misra S, Oommen BJ. Stochastic learning automata-based dynamic algorithms for the single-source shortest path problem. Proceedings of the 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE 2004), Ottawa, Ont., Canada, 2004.
19. Obaidat MS, Papadimitriou GI, Pomportsis AS. Learning automata: theory, paradigms and applications. IEEE Transactions on Systems, Man, and Cybernetics 2002; 32(6):706-709.
20. Oommen BJ, De St Croix EV. Graph partitioning using learning automata. IEEE Transactions on Computers 1995; 45(2):195-208.
21. Oommen BJ, Roberts TD. Continuous learning automata solutions to the capacity assignment problem. IEEE Transactions on Computers 2000; 49:608-620.
22. Thathachar ML, Sastry PS. Estimator algorithms for learning automata. Proceedings of the Platinum Jubilee Conference On Systems Signal Processing, Department of Electrical Engineering, Indian Institute of Science, Bangalore, India, 1986.
23. Oommen BJ, Lanctot JK. Discretized pursuit learning automata. IEEE Transactions on Systems, Man, and Cybernetics 1990; 20(4):931-938.
24. Oommen BJ, Agache M. Continuous and discretized pursuit learning schemes: various algorithms and their comparison. IEEE Transactions on Systems, Man, and Cybernetics 2001; SMC-31(B):277-287.
25. Agache M, Oommen BJ. Generalized pursuit learning schemes: new families of continuous and discretized learning automata. IEEE Transactions on Systems, Man, and Cybernetics 2002; 32(6):738-749.