Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Hakkinen, J.
Right arrow Articles by Soderberg, B.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Hakkinen, J.
Right arrow Articles by Soderberg, B.

Neural Computation, Vol 10, 1587-1599, Copyright © 1998 by The MIT Press

LETTERS

A Potts Neuron Approach To Communication Routing

Jari Hakkinen, Martin Lagerholm, Carsten Peterson and Bo Soderberg

A feedback neural network approach to communication routing problems is developed, with emphasis on multiple shortest path problems, with several requests for transmissions between distinct start and end nodes. The basic ingredients are a set of Potts neurons for each request, with interactions designed to minimize path lengths and prevent overloading of network arcs. The topological nature of the problem is conveniently handled using a propagator matrix approach. Although the constraints are global, the algorithmic steps are based entirely on local information, facilitating distributed implementations. In the polynomially solvable single-request case, the approach reduces to a fuzzy version of the Bellman-Ford algorithm. The method is evaluated for synthetic problems of varying sizes and load levels, by comparing to exact solutions from a branch-and-bound method, or to approximate solutions from a simple heuristic. With very few exceptions, the Potts approach gives high-quality legal solutions. The computational demand scales merely as the product of the numbers of requests, nodes, and arcs.


This article has been cited by other articles:


Home page
 Proc. Natl. Acad. Sci. USAHome page
R. Blankenbecler, M. Ohlsson, C. Peterson, and M. Ringner
Matching protein structures with fuzzy alignments
PNAS, October 14, 2003; 100(21): 11936 - 11940.
[Abstract] [Full Text] [PDF]


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1998 by The MIT Press.