GFS: An efficient implementation of fair scheduling for multi-gigabit packet networksGFS: An efficient implementation of fair scheduling for multi-gigabit packet networks Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2015-11-162003enIn order to address the challenge of providing quality of service guarantees in today's network processing systems, the use of efficient scheduling algorithms is required. The efficiency of a scheduler is determined by several factors including its fairness, capability to operate at high speeds, as well as the resources required for its implementation. We present an architecture to support fair scheduling (gigabit FS) considering variable length packets (i. e. for packet forwarding/switching networks) over gigabit links. This high speed scheduler is designed to manage 32 K flows based on an algorithm that yields efficient implementation in hardware by avoiding the complexity of computing the system virtual time function that many packet fair queueing (PFQ) algorithms have proposed. Further, we demonstrate the critical factors in designing an effective scheduling engine at gigabit rates and we present several enhancements together with their associated cost.http://creativecommons.org/licenses/by/4.0/389 - 39914th IEEE International Conference on Application-specific Systems, Architectures and Processors Papaefstathiou Ioannis Παπαευσταθιου Ιωαννης Kornaros Georgios Κορναρος Γεωργιος Orphanoudakis T. Institute of Electrical and Electronics Engineers