Concepedia

On decentralized dynamic routing for congested traffic networks

IEEE Transactions on Automatic Control · 1982 · 62 citations · 8 references

Concepts

ComputingComputer ScienceComputer NetworksDecentralizationCongestion ControlCongestion ManagementRoutingRouting AlgorithmsTraffic Flow TheoryRoad Traffic NetworksRouting Theory

Abstract

The problem of routing traffic through single destination congested networks is considered, when the network has deterministic inputs and may contain looping paths. A decentralized dynamic routing strategy is proposed which assures that no traffic is directed around loops.

References

8

Depth-First Search and Linear Graph Algorithms

Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations

Computing, Computer Science, Algorithms +16

A Survey of Matrix Theory and Matrix Inequalities.

Richard Bellman, Marvin Marcus, Henryk Minc · American Mathematical Monthly · 1965 · 844 citations

Natural Sciences, Mathematics, Applied Mathematics +11

A Minimum Delay Routing Algorithm Using Distributed Computation

Robert G. Gallager · IRE Transactions on Communications Systems · 1977 · 651 citations

Computing, Computer Engineering, Computer Science +12

Binary Matrices in System Modeling

John Warfield · IEEE Transactions on Systems Man and Cybernetics · 1973 · 438 citations

Engineering, Systems Engineering, Systems Analysis +13

A Class of Decentralized Routing Algorithms Using Relaxation

Thomas Stern · IRE Transactions on Communications Systems · 1977 · 69 citations

Computing, Computer Engineering, Computer Science +14