Answers are grounded in this paper and cite their sources.
A technique is presented for the derivation of approximate average packet time-delay formulas in a packet-switching store-and-forward network. The approximation technique appropriately incorporates arrival and departure packet interferences with the recent queueing results in a noninterfered communication path. Simulation results, for basic flow configurations, show the approximate timedelay function to constitute a very close lower bound over wide range of traffic intensities. The resulting average time-delay approximation when a Poisson assumption is made, is shown to constitute an upper bound. A procedure for approximate network time-delay analysis is then presented.
No takes yet. Share an insight, caveat, or question.
I. Rubin (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: