Corpus ID: 15415757

Towards Delay Assurances in FIFO Networks

@inproceedings{Raghunath2007TowardsDA,
  title={Towards Delay Assurances in FIFO Networks},
  author={S. Raghunath and S. Kalyanaraman},
  year={2007}
}
The goal of this paper is to examine the gains of partial upgrades to existing FIFO networks, to support delay assurances. Specifically, we try to find the number of hops of FIFO multiplexing after which a latency target is violated. We first examine the effect of multiplexing two flows through successive FIFO schedulers, and for a simple scenario where cross-traffic is assumed to be absent, we derive a worst-case bound on the burs tiness increase across n nodes. We use the result to obtain an… CONTINUE READING

Figures and Tables from this paper

References

SHOWING 1-4 OF 4 REFERENCES
Delay Bounds in a Network with Aggregate Scheduling
  • 251
  • PDF
SCED+: efficient management of quality of service guarantees
  • R. Cruz
  • Computer Science
  • Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
  • 133
A calculus for network delay, Part I: Network elements in isolation
  • R. Cruz
  • Computer Science
  • IEEE Trans. Inf. Theory
  • 1991
  • 2,067