Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Local routing algorithms based on Potts neural networks.

In English

Författare

Summary, in English

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.

Publiceringsår

2000

Språk

Engelska

Sidor

970-977

Publikation/Tidskrift/Serie

IEEE Transactions on Neural Networks

Volym

11

Issue

4

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Computer Engineering

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 1045-9227