東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Neural network and algorithmic metho...

Feng, Gang.

Linked to FindBook

Google Book

Amazon

博客來

Neural network and algorithmic methods for solving routing problems in high-speed networks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Neural network and algorithmic methods for solving routing problems in high-speed networks./
Author:	Feng, Gang.
Description:	183 p.
Notes:	Source: Dissertation Abstracts International, Volume: 62-11, Section: B, page: 5270.
Contained By:	Dissertation Abstracts International62-11B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3032376
ISBN:	0493457070

Neural network and algorithmic methods for solving routing problems in high-speed networks.
Feng, Gang.

Neural network and algorithmic methods for solving routing problems in high-speed networks. - 183 p.

Source: Dissertation Abstracts International, Volume: 62-11, Section: B, page: 5270.

Thesis (Ph.D.)--University of Miami, 2001.

Three classes of routing problems, namely, minimum delay routing (MDR), virtual path topology optimization (VPTO), and Quality of Service (QoS) unicast routing in a high speed network environment were investigated through both neural network (NN) optimization and algorithmic methods. A two-phase MDR routing algorithm based on Hopfield neural networks (HNNs) were proposed. The goal in the first phase was to provide a set of alternate routes for each source-destination (SD) pair, while the second phase computed the fraction of traffic to be distributed on each alternate route. Experiments demonstrated that the proposed algorithm could achieve better performance than previous non-exact algorithms. The HNN technique was also applied to solve the VPTO problem, which is a critical problem in a quasi-static VP control strategy. Experiments were also conducted to show the superiority of this approach. Subsequently, a set of NP-complete QoS unicast routing problems were studied based on linear or nonlinear Lagrange relaxation techniques. Three heuristic algorithms based on a single-mixed-weight idea were first proposed to solve the most representative delay-constrained least-cost path problem. Compared to previous approximate algorithms, the proposed algorithms can find solutions of high quality with very low time complexities. This idea was then extended to solve the problem of finding paths subject to two additive constraints. The corresponding approximate algorithm also outperformed almost all known heuristics. The single-mixed-weight idea was also used to develop exact algorithms for multi-constrained-path (MCP) problems and multi-constrained optimal-path (MCOP) problems. These exact algorithms can find exact solutions in a reasonable time for networks of a moderate size. Finally, based on a heuristic proposed by other researchers, we developed a modified heuristic algorithm to solve the MCOP problem. Compared to its predecessor, our modified algorithm can significantly reduce the cost of the obtained solution, while the time complexity was only slightly increased. A recommendation for further study is enclosed.

ISBN: 0493457070Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Neural network and algorithmic methods for solving routing problems in high-speed networks.
LDR:03074nmm 2200289 4500 001 1836984
005 20050321084535.5
008 130614s2001 eng d
020 $a 0493457070
035 $a (UnM)AAI3032376
035 $a AAI3032376
040 $a UnM $c UnM
100 1 $a Feng, Gang. $3 1374722
245 1 0 $a Neural network and algorithmic methods for solving routing problems in high-speed networks.
300 $a 183 p.
500 $a Source: Dissertation Abstracts International, Volume: 62-11, Section: B, page: 5270.
500 $a Supervisor: Christos Douligeris.
502 $a Thesis (Ph.D.)--University of Miami, 2001.
520 $a Three classes of routing problems, namely, minimum delay routing (MDR), virtual path topology optimization (VPTO), and Quality of Service (QoS) unicast routing in a high speed network environment were investigated through both neural network (NN) optimization and algorithmic methods. A two-phase MDR routing algorithm based on Hopfield neural networks (HNNs) were proposed. The goal in the first phase was to provide a set of alternate routes for each source-destination (SD) pair, while the second phase computed the fraction of traffic to be distributed on each alternate route. Experiments demonstrated that the proposed algorithm could achieve better performance than previous non-exact algorithms. The HNN technique was also applied to solve the VPTO problem, which is a critical problem in a quasi-static VP control strategy. Experiments were also conducted to show the superiority of this approach. Subsequently, a set of NP-complete QoS unicast routing problems were studied based on linear or nonlinear Lagrange relaxation techniques. Three heuristic algorithms based on a single-mixed-weight idea were first proposed to solve the most representative delay-constrained least-cost path problem. Compared to previous approximate algorithms, the proposed algorithms can find solutions of high quality with very low time complexities. This idea was then extended to solve the problem of finding paths subject to two additive constraints. The corresponding approximate algorithm also outperformed almost all known heuristics. The single-mixed-weight idea was also used to develop exact algorithms for multi-constrained-path (MCP) problems and multi-constrained optimal-path (MCOP) problems. These exact algorithms can find exact solutions in a reasonable time for networks of a moderate size. Finally, based on a heuristic proposed by other researchers, we developed a modified heuristic algorithm to solve the MCOP problem. Compared to its predecessor, our modified algorithm can significantly reduce the cost of the obtained solution, while the time complexity was only slightly increased. A recommendation for further study is enclosed.
590 $a School code: 0125.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Computer Science. $3 626642
650 4 $a Artificial Intelligence. $3 769149
690 $a 0544
690 $a 0984
690 $a 0800
710 2 0 $a University of Miami. $3 1017483
773 0 $t Dissertation Abstracts International $g 62-11B.
790 1 0 $a Douligeris, Christos, $e advisor
790 $a 0125
791 $a Ph.D.
792 $a 2001
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3032376