Copyright © 2012 Vladimir Hottmar and Bohumil Adamec. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

1. H. M. Chaskar and U. Madhow, “Fair scheduling with tunable latency: a Round Robin approach,” in Proceedings of the IEEE Global Telecommunication Conference (GLOBECOM '99), pp. 1328–1333, December 1999. View at Scopus
2. A. Orda and A. Sprintson, “Precomputation schemes for QoS routing,” IEEE/ACM Transactions on Networking, vol. 11, no. 4, pp. 578–591, 2003. View at Publisher · View at Google Scholar · View at Scopus
3. A. Orda, “Routing with end-to-end QoS guarantees in broadband networks,” IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 365–374, 1999. View at Publisher · View at Google Scholar · View at Scopus
4. B. Adamec, Design of optimization model for data communication management in Canpus LAN, Ph.D. dissertation, Department of Telecommunications and Multimedia, Faculty of Electrical Engineering, University of Zilina, Zilina, Slovakia, 2010.
5. X. Liu, K. Ravindran, and D. Loguinov, “A queueing-theoretic foundation of available bandwidth estimation: single-hop analysis,” IEEE/ACM Transactions on Networking, vol. 15, no. 4, pp. 918–931, 2007. View at Publisher · View at Google Scholar · View at Scopus
6. V. Paxson, “End-to-end Internet packet dynamics,” IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 277–292, 1999. View at Publisher · View at Google Scholar · View at Scopus
7. E. Muhammad and S. Stidham, Sample-Path Analysis of Queuing Systems, Kluwer Academic, Boston, Mass, USA, 1999.
8. C. W. Chan, Performance Analysis of Telecommunications and Local Area Networks, Kluwer Academic, Norwell, Mass, USA, 2000.