This paper presents a set of simulation studies for comparing the performance of several flow-based scheduling algorithms, namely Weighted Fair Queuing, Self-Clock Fair Queuing, Start-Time Fair Queuing, Virtual Clock, Worst-case Fair Weighted Fair Queuing and Worstcase Fair Weighted Fair Queuing-plus. These algorithms are being considered for IP networks supporting Quality of Service (QoS).

This work seeks a better understanding of the relations between the better network service provided by QoSoriented wireless packet scheduling and the actual benefits perceived by the multimedia applications that use them. Through extensive simulations driven by real (multimedia and wireless channel error) traces, we observe that in general, there is a performance gap between application perceiv...

Network performance bounds, including the maximal end-toend (E2E) delay, the maximal jitter and the maximal buffer backlog amount, are very important for network QoS control, buffer management and network optimization. QoS-enhanced To Next-hop Port Sequence Switch (QTNPOSS) is a recently proposed transmission scheme to achieve scalable fast forwarding for multimedia applications. However, the e...

In this paper we investigate the e ectiveness of packet drop mechanisms in conjunction with fair queuing link scheduling and hierarchical link sharing Under fair queuing the link share of a ow changes dynamically due to the arrivals and departures of ows and their bursts This phenomenon becomes more pronounced in the case of hierarchical link sharing Packet drop mechanisms play an integral role...

Fair scheduling algorithms are an important component of most QoS mechanisms designed to support the performance guarantees required by real-time applications. In this paper, we present Greedy Fair Queueing (GrFQ), a novel scheduler based on a greedy strategy of reducing the maximum difference in normalized service received by any two flows at each trasmission boundary. We prove that the GrFQ s...

The paper presents different combinations of queuing methods and their impact on the VoIP traffic delay within the network. In our experiment we combined three of the most useful queuing methods where we put together priority queuing (PQ) with class-based weighted fair queuing (CBWFQ), custom queuing (CQ) with CBWFQ and weighted fair queuing (WFQ) with CBWFQ. Each hybrid method is compared with...

Programmable network paradigm allows the execution of active applications in routers or switches to provide more flexibility to traditional networks, and richer services for users. In this paper, we discuss issues in designing resource schedulers for processing engines at programmable routers. One of the key problems is the inability to determine execution times of packets from information in h...

In this study, the authors consider a delay control problem with proportional fair scheduling in time-varying wireless channels. For proportional fairness of transmission rates among users, a congestion control scheme is proposed for guaranteeing both throughput and delay of the wireless network. Specifically, a scheduling weight is introduced to control queue lengths without degrading the thro...