Neural network implementation of the shortest path algorithm for traffic routing in communication networks

Stelios C.A. Thomopoulos; Lei Zhang; Chin Der Wann

Neural network implementation of the shortest path algorithm for traffic routing in communication networks

Stelios C.A. Thomopoulos^*, Lei Zhang, Chin Der Wann

^*Corresponding author for this work

Pennsylvania State University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

Abstract

A neural network computation algorithm is introduced to solve for the optimal traffic routing in a general N-node communication network. The algorithm chooses multilink paths for node-to-node traffic which minimize a certain cost function. Unlike the algorithm introduced earlier in this area, knowledge of the number of links between each origin-destination pair is not required by the algorithm, therefore it can be applied to variable-length path routing problems. The neural network structure for implementing the algorithm is a modified form of the one used by the traveling salesman algorithm. Computer simulation in a nine- and sixteen-node grid network showed that the algorithm performs extremely well in single and multiple paths.

Original language	English
Title of host publication	91 IEEE Int Jt Conf Neural Networks IJCNN 91
Publisher	Publ by IEEE
Pages	2693-2702
Number of pages	10
ISBN (Print)	0780302273
State	Published - 1991
Externally published	Yes
Event	1991 IEEE International Joint Conference on Neural Networks - IJCNN '91 - Singapore, Singapore Duration: 18 11 1991 → 21 11 1991

Publication series

Name	91 IEEE Int Jt Conf Neural Networks IJCNN 91

Conference

Conference	1991 IEEE International Joint Conference on Neural Networks - IJCNN '91
City	Singapore, Singapore
Period	18/11/91 → 21/11/91

Cite this

@inproceedings{a8d3e04d943447e7ac6d55bb85ed051b,

title = "Neural network implementation of the shortest path algorithm for traffic routing in communication networks",

abstract = "A neural network computation algorithm is introduced to solve for the optimal traffic routing in a general N-node communication network. The algorithm chooses multilink paths for node-to-node traffic which minimize a certain cost function. Unlike the algorithm introduced earlier in this area, knowledge of the number of links between each origin-destination pair is not required by the algorithm, therefore it can be applied to variable-length path routing problems. The neural network structure for implementing the algorithm is a modified form of the one used by the traveling salesman algorithm. Computer simulation in a nine- and sixteen-node grid network showed that the algorithm performs extremely well in single and multiple paths.",

author = "Thomopoulos, \{Stelios C.A.\} and Lei Zhang and Wann, \{Chin Der\}",

year = "1991",

language = "英语",

isbn = "0780302273",

series = "91 IEEE Int Jt Conf Neural Networks IJCNN 91",

publisher = "Publ by IEEE",

pages = "2693--2702",

booktitle = "91 IEEE Int Jt Conf Neural Networks IJCNN 91",

note = "1991 IEEE International Joint Conference on Neural Networks - IJCNN '91 ; Conference date: 18-11-1991 Through 21-11-1991",

}

Thomopoulos, SCA, Zhang, L & Wann, CD 1991, Neural network implementation of the shortest path algorithm for traffic routing in communication networks. in 91 IEEE Int Jt Conf Neural Networks IJCNN 91. 91 IEEE Int Jt Conf Neural Networks IJCNN 91, Publ by IEEE, pp. 2693-2702, 1991 IEEE International Joint Conference on Neural Networks - IJCNN '91, Singapore, Singapore, 18/11/91.

Neural network implementation of the shortest path algorithm for traffic routing in communication networks. / Thomopoulos, Stelios C.A.; Zhang, Lei; Wann, Chin Der.
91 IEEE Int Jt Conf Neural Networks IJCNN 91. Publ by IEEE, 1991. p. 2693-2702 (91 IEEE Int Jt Conf Neural Networks IJCNN 91).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Neural network implementation of the shortest path algorithm for traffic routing in communication networks

AU - Thomopoulos, Stelios C.A.

AU - Zhang, Lei

AU - Wann, Chin Der

PY - 1991

Y1 - 1991

N2 - A neural network computation algorithm is introduced to solve for the optimal traffic routing in a general N-node communication network. The algorithm chooses multilink paths for node-to-node traffic which minimize a certain cost function. Unlike the algorithm introduced earlier in this area, knowledge of the number of links between each origin-destination pair is not required by the algorithm, therefore it can be applied to variable-length path routing problems. The neural network structure for implementing the algorithm is a modified form of the one used by the traveling salesman algorithm. Computer simulation in a nine- and sixteen-node grid network showed that the algorithm performs extremely well in single and multiple paths.

AB - A neural network computation algorithm is introduced to solve for the optimal traffic routing in a general N-node communication network. The algorithm chooses multilink paths for node-to-node traffic which minimize a certain cost function. Unlike the algorithm introduced earlier in this area, knowledge of the number of links between each origin-destination pair is not required by the algorithm, therefore it can be applied to variable-length path routing problems. The neural network structure for implementing the algorithm is a modified form of the one used by the traveling salesman algorithm. Computer simulation in a nine- and sixteen-node grid network showed that the algorithm performs extremely well in single and multiple paths.

UR - https://www.scopus.com/pages/publications/0026274710

M3 - 会议稿件

AN - SCOPUS:0026274710

SN - 0780302273

T3 - 91 IEEE Int Jt Conf Neural Networks IJCNN 91

SP - 2693

EP - 2702

BT - 91 IEEE Int Jt Conf Neural Networks IJCNN 91

PB - Publ by IEEE

T2 - 1991 IEEE International Joint Conference on Neural Networks - IJCNN '91

Y2 - 18 November 1991 through 21 November 1991

ER -

Neural network implementation of the shortest path algorithm for traffic routing in communication networks

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this