Evaluating several implementations for the AS Minimum Bandwidth Egress Link Scheduler

The relevance of the provision of QoS is taken into account in the definition of the new network technologies like for example advanced switching (AS). AS is a new fabric- interconnect technology that further enhances the capabilities of PCI Express, which is the next PCI generation. In this paper we discuss the aspects that must be considered for implementing a specific mechanism for the AS minimum bandwidth egress link scheduler, or just MinBW scheduler. We also propose several implementations for this scheduler, analyze their computational complexity, and compare their performance by simulation. The main differentiating aspect from other interconnection technologies that must be taken into account when implementing the AS MinBW scheduler is that both the link-level flow control and the scheduling are made at a Virtual Channel (VC) level. This means that the scheduler must have the ability to enable or disable the selection of a given VC based on the flow control information.

[1]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[2]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[3]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[4]  Analysis and Simulation of a Fair Queuing Algorithm , 2008 .

[5]  Pier Luca Montessoro,et al.  Advanced research issues for tomorrow's multimedia networks , 2001, Proceedings International Conference on Information Technology: Coding and Computing.

[6]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[7]  José L. Sánchez,et al.  Providing quality of service over advanced switching , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

[8]  Raj Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[9]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[10]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[11]  Venkata Krishnan,et al.  PCI express and advanced switching: evolutionary path to building next generation interconnects , 2003, 11th Symposium on High Performance Interconnects, 2003. Proceedings..

[12]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[13]  Salil S. Kanhere,et al.  Fair and Efficient Packet Scheduling Using Elastic Round Robin , 2002, IEEE Trans. Parallel Distributed Syst..

[14]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..

[16]  Rich Seifert.  Gigabit Ethernet , 2001, LCN.