|
[1] A.K. Parekh, R. G. Gallager, “A generalized processor sharing approach to flow control in integrated services networks: the single-node case”, IEEE/ACM Transactions on Networking, Volume: 1, Issue: 3, Pages: 344 – 357, June 1993.
[2] H. Zhang, “Rate-Controlled Service Disciplines,” Journal of High Speed Networks, vol. 3, no. 4, pp.389-412, 1994.
[3] L. Georgiadis, R. Guerin, V. Peris, K. N. Sivarajan, “Efficient Network QoS Provisioning Based on per Node Traffic Shaping”, IEEE/ACM Transactions on Networking 4(4):pp. 482-501. 1996.
[4] A. Charny, “Providing QoS guarantees in input-buffered crossbars with speedup,” Ph.D. dissertation, M.I.T., Cambridge, Sept. 1998.
[5] ATM Forum, “Traffic Management Specification, Vers. 4.1,” March 1999.
[6] ITU-T, “Recommendation 1.371 : Traffic Control and Congestion Control in B-ISDN,” November 1995.
[7] H. J. Chao and J. S. Hong, “Design of an ATM shaping multiplexer with guaranteed output burstiness,” Intl. Journal of Computer System Science & Engineering, Special issue on ATM Switching, 12(2):131-141, Mar. 1997.
[8]J. L. Rexford, A. G. Greenberg,.F. G. Bonomi, and A. Wong, “Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High- Speed ATM Switches,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 5, pp. 938-950, June 1997.
[9] G. Nong, M. Hamdi,” On the provision of quality-of-service guarantees for input queued switches”, IEEE Communications Magazine, Volume: 38 , Issue: 12 , pp. 62 – 69, Dec. 2000.
[10] D. C. Stephens, H. Zhang, ”Implementing distributed packet fair queueing in a scalable switch architecture,” Proceedings of INFOCOM ''98, IEEE,vol.1, pp.282 – 290, March 1998.
[11] M. G. Hluchyj, M. Karol, "Queueing in Space-division Packet Switching," Proc. INFOCOM''88, New Orleans, LA, pp. 334-343, Mar. 1988.
[12] N. McKeown, A. Mekkittikul, V. Anantharam, J. Walrand, ”Achieving 100% throughput in an input-queued switch”, Communications, IEEE Transactions on , Volume: 47 , Issue: 8 , pp.1260 – 1267, Aug. 1999
[13] T.E. Anderson et al., “High-speed switch scheduling for local-area networks,” ACM Trans. Comp. Sys., vol. 11, no. 4, , pp. 319–52. Nov. 1993
[14] I. Stoica, H. Zhang, “Exact Emulation of an Output Queueing Switch by a Combined Input Output Queueing Switch,” Proc. IWQOS’98
[15] A. Charny, P. Krishna, N. Patel, R. Simcoe, ”Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup,” Proc.IWQOS’98
[16] S. Iyer, N. McKeown, “Using constraint sets to achieve delay bounds in CIOQ switches,” Communications Letters, IEEE Volume 7, Issue 6, pp.275 – 277, June 2003
[17] B. Prabhakar, N. McKeown, “On the speedup required for combined input and output queued switching,” Automatica, vol. 35, no. 12, Dec. 1999.
[18] D. Gale, L. S. Shapley, “College Admissions and the Stability of Marriage,” American Mathematical Monthly No.69, pp.9-15. 1962.
[19] IEEE standards for local and metropolitan area networks, Virtual bridged local area networks, IEEE Std 802.1Q, 2003 Edition (Incorporates IEEE Std 802.1Q-1998, IEEE Std 802.1u-2001, IEEE Std 802.1v-2001, and IEEE Std 802.1s-2002) 2003
[20] C.S. Chang, W.J. Chen, H.Y. Huang, “On service guarantee for input buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann,” IEEE IWQoS’99, pp. 79-86, London, U.K., 1999.
[21] http://www.nlanr.net/, National Laboratory for Applied Network Research
|