The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2008 vol.57)
pp: 928-939
Georgios Apostolopoulos , Foundation for Research and Technology - Hellas, Heraklion
Francisco J. Alfaro , University of Castilla-La Mancha, Albacete
Alejandro Martínez Vicente , University of Castilla-La Mancha, Albacete
Jose Duato , Technical University of Valencia, Valencia
ABSTRACT
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because in those environments there are different traffic types, each one having its own requirements. In that sense, deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes these algorithms impractical for high-performance networks. In this paper, we explore how to adapt efficiently the Earliest Deadline First family of algorithms to the high-speed network environments. The results show an excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.
INDEX TERMS
Network Architecture and Design, Packet-switching networks, High-speed
CITATION
Georgios Apostolopoulos, Francisco J. Alfaro, Alejandro Martínez Vicente, Jose Duato, "Efficient Deadline-Based QoS Algorithms for High-Performance Networks", IEEE Transactions on Computers, vol.57, no. 7, pp. 928-939, July 2008, doi:10.1109/TC.2008.39
REFERENCES
[1] S. Reinemo, T. Skeie, T. Sodring, O. Lysne, and O. Trudbakken, “An Overview of QoS Capabilities in InfiniBand, Advanced Switching Interconnect, and Ethernet,” IEEE Comm. Magazine, vol. 44, no. 7, pp. 32-38, July 2006.
[2] G. Rodgers and P. Morjan, “Blade Cluster Architecture,” IBM Systems Group—Barcelona Supercomputing Center, technical report, http://www.bsc.es/publications/documentation/ pdfGreg Rodgers_Presentation.pdf, Sept. 2005.
[3] A. Forum, ATM Forum Traffic Management Specification, version4.0, May 1995.
[4] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” Proc. ACM Symp. Comm. Architectures and Protocols, pp. 1-12, http://portal.acm.orgcitation.cfm?id=75248 , 1989.
[5] A.K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp.344-357, 1993.
[6] R. Guerin and V. Peris, “Quality-of-Service in Packet Networks: Basic Mechanisms and Directions,” Computer Networks, vol. 31, no. 3, pp. 169-189, 1999.
[7] L. Georgiadis, R. Guerin, and A.K. Parekh, “Optimal Multiplexing on a Single Link: Delay and Buffer Requirements,” Proc. IEEE INFOCOM '94, vol. 2, pp. 524-532, 1994.
[8] S. Floyd and V. Jacobson, “Link-Sharing and Resource Management Models for Packet Networks,” IEEE/ACM Trans. Networking, vol. 3, no. 4, pp. 365-386, citeseer.ist.psu.edufloyd93linksharing. html , 1995.
[9] R. Braden, D. Clark, and S. Shenker, Integrated Services in the Internet Architecture: An Overview, Internet Eng. Task Force, Internet Request for Comment RFC 1633, http://www.ietf.org/rfcrfc1633.txt, June 1994.
[10] S. Blake, D. Back, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An Architecture for Differentiated Services, Internet Eng. Task Force, Internet Request for Comment RFC 2475, http://www.ietf.org/rfcrfc2275.txt, Dec. 1998.
[11] InfiniBand Architecture Specification, vol. 1, Release 1.0, InfiniBand Trade Assoc., Oct. 2000.
[12] J. Pelissier, “Providing Quality of Service over InfiniBand Architecture Fabrics,” Proc. Eighth Symp. High-Performance Interconnects, http://www.hoti.orghoti8_thursday.html, Aug. 2000.
[13] F.J. Alfaro, J.L. Sánchez, and J. Duato, “QoS in InfiniBand Subnetworks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 9, pp. 810-823, Sept. 2004.
[14] ASI SIG, Advanced Switching Core Architecture Specification, 2005.
[15] C. Minkenberg, F. Abel, M. Gusat, R.P. Luijten, and W. Denzel, “Current Issues in Packet Switch Design,” ACM SIGCOMM Computer Comm. Rev., vol. 33, pp. 119-124, Jan. 2003.
[16] A. Martínez, F. Alfaro, J. Sánchez, and J. Duato, “Deadline-Based QoS Algorithms for High-Performance Networks,” Proc. 21st Int'l Parallel and Distributed Processing Symp., http://investigacion. uclm.es/portali/documentos fi_1169052300-IPDPS07.pdf, Mar. 2007.
[17] L. Zhang, “Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks,” Computer Comm. Rev. (Proc. ACM SIGCOMM '90), vol. 20, no. 4, pp. 19-29, Sept. 1990.
[18] A. Ioannou and M. Katevenis, “Pipelined Heap (Priority Queue) Management for Advanced Scheduling in High Speed Networks,” Proc. IEEE Int'l Conf. Comm., 2001.
[19] D.L. Mills, RFC 958: Network Time Protocol (NTP), Sept. 1985.
[20] N. Boden, D. Cohen, and R. Felderman, “Myrinet—A Gigabit per Second Local Area Network,” IEEE Micro, pp. 29-36, Feb. 1995.
[21] I. Elhanany, D. Chiou, V. Tabatabaee, R. Noro, and A. Poursepanj, “The Network Processing Forum Switch Fabric Benchmark Specifications: An Overview,” IEEE Network, pp. 5-9, Mar. 2005.
[22] R. Jain, The Art of Computer System Performance Analysis: Techniques for Experimental Design, Measurement, Simulation and Modeling. John Wiley & Sons, 1991.
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool