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.
Hon Keung Tony NgÜmi̇t Özgüner
Giuseppe BelleiMaurizio Bielli
Byung‐Wook WieTerry L. FrieszRoger L. Tobin