The routing problem for a high-speed network in which a single packet buffer is associated with each output port of each node is considered. Conflicts occur whenever two or more packets are sent through the same output port. An algorithm to solve such situations is stated. It yields a suboptimal solution for the combinatorial local decision problem. A coordination among the local decision problems is performed by making each node pass aggregate information regarding the congestion of the downstream portion of the network to its predecessors.
A distributed dynamic routing strategy for optical networks
BOLLA, RAFFAELE;DAVOLI, FRANCO;DI FEBBRARO, ANGELA
1992-01-01
Abstract
The routing problem for a high-speed network in which a single packet buffer is associated with each output port of each node is considered. Conflicts occur whenever two or more packets are sent through the same output port. An algorithm to solve such situations is stated. It yields a suboptimal solution for the combinatorial local decision problem. A coordination among the local decision problems is performed by making each node pass aggregate information regarding the congestion of the downstream portion of the network to its predecessors.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
