The use of independence assumptions has made it possible to derive an approximate model of deflection-routing networks that have multibuffer stations and two-connected topologies. A procedure is presented for estimating the mean transport time (and throughput) of these networks, even when the offered traffic is nonuniform. The proposed procedure is efficient and yields very accurate results, as comparisons with simulations have confirmed. The model is quite general and can be applied to deflection-routing networks that deflect packets according to destination-based priorities. The authors have modeled only a few of the several options for designing a deflection-routing network. In particular, they have modeled a network with no user input buffers, a specific admission-routed policy, and destination-based priorities
A Procedure to Evaluate the Mean Transport Time in Multibuffer Deflection-Routing Networks with Nonuniform Traffic
BORGONOVO, FLAMINIO;
1992-01-01
Abstract
The use of independence assumptions has made it possible to derive an approximate model of deflection-routing networks that have multibuffer stations and two-connected topologies. A procedure is presented for estimating the mean transport time (and throughput) of these networks, even when the offered traffic is nonuniform. The proposed procedure is efficient and yields very accurate results, as comparisons with simulations have confirmed. The model is quite general and can be applied to deflection-routing networks that deflect packets according to destination-based priorities. The authors have modeled only a few of the several options for designing a deflection-routing network. In particular, they have modeled a network with no user input buffers, a specific admission-routed policy, and destination-based prioritiesI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
