literature
Literature
Authors
Jobs
Seminars
Conferences
DataBETA

Local Routing Algorithms Based on Potts Neural Networks

Mar 2, 1998
16 pages
e-Print:
Report number:
  • LU-TP-98-5
View in:
pdf
reference search0 citations

Citations per year

0 Citations
Abstract: (arXiv)
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. The computational demand is modest.
Note:
  • 15 pages LaTeX, 4 ps figures
  • [1]
    Data Networks New Jersey . 6Optionally, an initial cost bound (obtained e.g. from a heuristic) can be specified to further narrow down the search
    • D. Bertsekas
      ,
    • R. Gallager
  • [2]

    Complex Scheduling with Potts Neural Networks

    • L. Gislén
      ,
    • C. Peterson
      ,
    • B. Söderberg
      • Neural Comput. 4 (1992) 805
  • [3]

    Airline Crew Scheduling with Potts Neurons

    • M. Lagerholm
      ,
    • C. Peterson
      ,
    • B. Söderberg
      • Neural Comput. 9 (1997) 1627
  • [4]

    On a Routing Problem

    • R. Bellman
      • Q.Appl.Math. 16 (1958) 87
  • [5]

    A Fast algorithm for Steiner Trees

    • L. Kou
      ,
    • G. Markowsky
      ,
    • L. Berman
      • Acta Inform. 15 (1981) 141
  • [6]

    A Potts Neuron Approach to Communication Routing

    • J. Häkkinen
      ,
    • M. Lagerholm
      ,
    • C. Peterson
      ,
    • B. Söderberg
    • [7]
      of Computer Computations Miller and Thatcher, Eds. New York
      • R.M. Karp in Complexity
      • [7]
        Press 85-103
      • [8]

        Airline Crew Scheduling Using Potts Mean Field Techniques

        • M. Lagerholm
          ,
        • C. Peterson
          ,
        • B. Söderberg
        • [9]

          Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach

          • J.A. Boyan
            ,
          • M.L. Littman