Local Routing Algorithms Based on Potts Neural Networks  

Oleh:

Peterson, C. ; Lagerholm, M. ; Soderberg, B. ; Hakkimen, J.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 11 no. 4 (2000), page 970-977.
Topik: neural network; local routing; algorithms; potts; neural networks

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.4 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

A feedback neural approach to static communication routing in asymmetric networks is presented, where a mean field formulation of the Bellman - Ford method for the single unicast problem is used as a common platform for developing algorithms for multiple unicast, multicast and multiple multicast problems. The appealing locality and update philosophy of the Bellman - Ford algorithm is inherited. For all problem types the objective is to minimize a total connection cost, defined as the sum of the individual costs of the involved arcs, subject to capacity constraints. The methods are evaluated for synthetic problem instances by comparing to exact solutions for cases where these are accessible, and else with approximate results from simple heuristics. In general, the quality of the results are better than those of the heuristics. Furthermore, the computational demands are modest, even when the distributed nature of the the approach is not exploited numerically.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali