On the maximal throughput of networks with finite buffers and its application to buffered crossbars

@article{Giaccone2005OnTM,
  title={On the maximal throughput of networks with finite buffers and its application to buffered crossbars},
  author={Paolo Giaccone and Emilio Leonardi and Devavrat Shah},
  journal={Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.},
  year={2005},
  volume={2},
  pages={971-980 vol. 2}
}
The advent of packet networks has motivated many researchers to study the performance of networks of queues in the last decade or two. However, most of the previous work assumes the availability of infinite queue-size. Instead, in this paper, we study the maximal achievable throughput in a flow-controlled lossless network with finite-queue size. In such networks, throughput depends on the packet scheduling policy utilized. As the main of this paper, we obtain a dynamic scheduling policy that… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS
19 Citations
35 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Bounds on Average Delays and Queue Length Averages and Variances in Input Queued and Combined Input / Output Queued Cell - Based Switches ”

  • M. Mellia Leonardi, F. Neri, M. Ajmone Marsan
  • IEEE INFOCOM
  • 2002

A high throughput scheduling algorithm for a buffered crossbar switch fabric

  • lavadi. R. Masill. T. Hrabik
  • IEEE ICC
  • 2001

Similar Papers

Loading similar papers…