An efficient adaptive routing algorithm for a network management system

Computer Communications

Volumn 20, Issue 11, 1997, Pages 988-998

  Srikanthan, T ^a   Hura, Gurdeep S ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Adaptive routing; Clustering; Cycles; Graph theoretic; Incidence matrix; Network topology

Indexed keywords

ADAPTIVE ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; LOGIC GATES; MATRIX ALGEBRA; REAL TIME SYSTEMS; VLSI CIRCUITS;

CLUSTERING PROCESS; GRAPH THEORETIC BASED DYNAMIC ROUTING ALGORITHMS; INCIDENCE MATRIX; REAL TIME NETWORK MANAGEMENT SYSTEMS;

TELECOMMUNICATION NETWORKS;

EID: 0031250773     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(97)00084-4     Document Type: Article

References (15)

1. A. Ephremides, Routing Problems in Computer Networks: Communication and Networks, Springer, 1990, pp. 299-324.
2. J.J. Garcia-Luna Aceves, A new minimum-loop routing algorithm, IEEE INFOCOM 13 (1987) 170-180.
3. S.J. Golestanni, Congestion-free of real time traffic packet network, in: Proceedings of IEEE INFOCOM, San Francisco, 1990, pp. 527-536.
4. IEEE Network 2 (1988); IEEE Journal on Selected Areas in Communication Special Issue on Telecommunication Network and Design and Planning 7 (8) (1991).
5. IEEE Network 2 (1988); IEEE Journal on Selected Areas in Communication Special Issue on Telecommunication Network and Design and Planning 7 (8) (1991).
6. S. Ramakrishnan, A protocol for global message ordering, in: Proceedings in Modelling and Simulation, Pittsburgh, 1989, pp. 963-969.
7. D. Finkel, D.A. Goodwin, A. Levine, Simulating a heuristic policy for load sharing in distributed computing systems, in: Proceeding on Modeling and Simulation, Pittsburgh, 1989, pp. 983-989.
8. E. Dijkstra, A note on two problems in connection with graphs, Numer. Math. October (1959).
9. L. Ford, D. Falkorson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
10. D. Narsingh, Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, 1974.
11. T. Srikanthan, Bond graph analysis, Ph.D. Thesis, Coventry University, UK, 1986.
12. D.P. Bertsekas, Linear Network Optimisation Algorithms and Codes, MIT Press, Cambridge, MA, 1991.
13. P.B. Key, G.A. Cope, Distributed dynamic routing schemes, IEEE Commun. Mag. 28 (1991) 54-64.
14. B.M. Maggs, S.A. Plotkin, Minimum-cost spanning tree as a path finding problem, Int. Lett. 26 (1988) 291-293.
15. G. Sasaki, B. Hajeh, Optimal dynamic routing in single commodity network by iterative methods, IEEE INFOCOM 35 (1986) 1199-1206.