Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/5375

Conventional and neurocomputational methods in teletraffic routing

Authors Au, Wai Kay
Issue Date 1999
Summary Generally, routing methods can be implemented using centralized and decentralized methods. In order to improve the efficiency of a telecommunications network, we want a routing method to have the advantages of both centralized routing - optimal decision and decentralized routing - fast and less work load. The neural network routing uses the centralized routing as teacher, such that it can control with only the local information. We study the learning process of the neural network and use the Estimation and Maximization (EM) algorithm for learning. The result shows some improvements of neural network over previous work, and the performance of the improved neural network routing is almost the same as the EM algorithm of one hierarchy. By comparing different routing methods: Simplex Routing, Maximum Free Circuit Routing, Neural Routing, Free Circuit Ratio Routing, we can see that neural routing is better than typical decentralized routing. Finally, we can see that Free Circuit Ratio Routing have a better performance in a hierarchical network with extensive connectivities.
Note Thesis (M.Phil.)--Hong Kong University of Science and Technology, 1999
Subjects
Language English
Format Thesis
Access
Files in this item:
File Description Size Format
th_redirect.html 337 B HTML