CS-534: Packet Switch Architecture
Spring 2003 |
Department of Computer Science © University of Crete, Greece |
[Up: Table of Contents] [Prev: 4.2 Shared Buffer Impl.] |
[Next: 4.4 Crossbar Scheduling] |
Attention: results derived for i.i.d. Bernoulli (non-bursty) arrivals, with uniformly-distributed destinations (no overloaded hot-spots), are only useful for gaining a rough, first insight into the behavior of systems, but are often not representative of the real behavior of systems under real traffic!...
Appendices for optional study:
Performance analysis transparencies
by prof. George Stamoulis, CS-534, Spring 2000 semester:
[Up: Table of Contents] [Prev: 4.2 Shared Buffer Impl.] |
[Next: 4.4 Crossbar Scheduling] |
Up to the Home Page of CS-534
|
© copyright
University of Crete, Greece. Last updated: 9 May 2003, by M. Katevenis. |