DocumentCode
838698
Title
An effective local dynamic strategy to clear congested multidestination networks
Author
Sarachik, Philip E.
Author_Institution
Polytechnic Institute of New York, Brooklyn, NY, USA
Volume
27
Issue
2
fYear
1982
fDate
4/1/1982 12:00:00 AM
Firstpage
510
Lastpage
513
Abstract
The solution of a local routing problem for a congested node with two alternative paths to 
destinations of a traffic network is presented. The solution shows that the admissible state space is divided into a finite number of regions within which a different set of optimal flow conditions must be satisfied. A specific realization of these optimal conditions is presented which can be utilized by local node controllers in decentralized control strategies for larger networks.
destinations of a traffic network is presented. The solution shows that the admissible state space is divided into a finite number of regions within which a different set of optimal flow conditions must be satisfied. A specific realization of these optimal conditions is presented which can be utilized by local node controllers in decentralized control strategies for larger networks.Keywords
Networks; Communication system traffic control; Delay; Distributed control; Feedback; Optimal control; Routing; State-space methods; Steady-state; Traffic control; Transportation;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.1982.1102943
Filename
1102943
Link To Document