Abstract
New models for optimal dynamic routing in a store- and forward data communication network are introduced. The models naturally accommodate closed-loop strategies changing dynamically the routing procedure as a function of the present network congestion. Algorithms to solve the control problem are indicated.
| Original language | English |
|---|---|
| Pages | 1-5 |
| Number of pages | 5 |
| State | Published - 1975 |
| Event | Proc Natl Telecommun Conf 1975 - New Orleans, LA, USA Duration: 1 Dec 1975 → 3 Dec 1975 |
Conference
| Conference | Proc Natl Telecommun Conf 1975 |
|---|---|
| City | New Orleans, LA, USA |
| Period | 1/12/75 → 3/12/75 |