Latency-rate servers: a general model for analysis of traffic scheduling algorithms

@article{Stiliadis1998LatencyrateSA,
  title={Latency-rate servers: a general model for analysis of traffic scheduling algorithms},
  author={Dimitrios Stiliadis and Anujan Varma},
  journal={IEEE/ACM Trans. Netw.},
  year={1998},
  volume={6},
  pages={611-624}
}
In this paper, we develop a general model, called Latency-Rate servers(LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of an LR server is determined by two parameters—the latency and the allocated rate. Several well-known scheduling algorithms, such as Weighted Fair Queueing, VirtualClock, SelfClocked Fair Queueing, Weighted Round Robin, and Deficit Round Robin, belong to the class ofLR servers. We derive tight upper bounds on the end-to… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS
23 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…