Results 161 to 170 of about 1,204,282 (208)
Some of the next articles are maybe not open access.

Enhancing Fairness for Approximate Weighted Fair Queueing With a Single Queue

IEEE/ACM Transactions on Networking
Ye Tian, Xinming Zhang, Bowen Zheng
exaly   +3 more sources

Opportunistic Weighted Fair Queueing

IEEE Vehicular Technology Conference, 2006
The ongoing evolution towards the generalization of wireless access to multi-service networks stresses on the need for optimizing the control of radio resources and in particular, for designing efficient scheduling approaches. The scheduling mechanisms proposed for wireline links do not carry over to wireless interfaces due to the variability of radio ...
Kinda Khawam, Daniel Kofman
openaire   +1 more source

Tandem queue weighted fair smooth scheduling

Design Automation for Embedded Systems, 2014
Network devices supporting 100G links are in demand to meet the communication requirements of computing nodes in datacenters and warehouse computers. In this paper, we propose TQ and TQ-Smooth, two light-weight, fair schedulers that accommodate an arbitrarily large number of requestors and are suitable for ultra high-speed links. We show that our first
Nikolaos Chrysos   +6 more
openaire   +1 more source

WF/sup 2/Q: worst-case fair weighted fair queueing

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, 2002
The generalized processor sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an end-to-end bounded-delay service to a session whose traffic is constrained by a leaky bucket; (b) it can ensure fair allocation of bandwidth among all back logged sessions regardless of whether or not their traffic is constrained.
Jon C. R. Bennett, Hui Zhang 0001
openaire   +2 more sources

A Weighted Fair Queue Management on DOCSIS Multi-downstream Channels

網際網路技術學刊, 2021

Yao-Chiang Yang Yao-Chiang Yang   +2 more
openaire   +1 more source

Dynamic predictive weighted fair queueing for differentiated services

ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2002
The main objective of this paper is to establish that it is not efficient to use weighted fair queueing (WFQ) with a static allocation of bandwidth for the different traffic classes in a differentiated services environment and to propose an extension to WFQ, based on prediction techniques of realistic traffic models, in order to provide it with the ...
José R. Gallardo, Dimitrios Makrakis
openaire   +2 more sources

A Novel Sliding Weighted Fair Queueing Scheme for Multimedia Transmission

19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers), 2005
Weighted fair queueing (WFQ) is a popular scheme because of its guaranteed bandwidth and bounded delay. To make WFQ more flexible, we propose sliding weighted fair queueing (SWFQ) by combining priority-driven and share-driven scheduling for a real-time network.
Yun-Sheng Yen   +3 more
openaire   +2 more sources

A Bandwidth Bargain Model based on Adaptive Weighted Fair Queueing

2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006, 2006
Efficient usage of network bandwidth is a key factor of providing Quality of Service guarantees in the Internet. In this paper, a Bandwidth Bargain Model is developed which aims to dynamically allocate network bandwidth based on the varying demand of packet flows.
Lijun Wang   +2 more
openaire   +1 more source

Dynamically weighted queueing for fair bandwidth allocation and its performance analysis

2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2003
We describe how to allocate bandwidth fairly to each user in a differentiated services architecture. Our method estimates the number of active users in each class by simple traffic measurement. Using this estimate, it dynamically changes the weight assigned to each class queue and adaptively updates the target rate used for selective packet discarding.
Ryoichi Kawahara, Naohisa Komatsu
openaire   +2 more sources

Weighted Fair Queueing and Compensation Techniques for Wireless Packet Switched Networks

IEEE Transactions on Vehicular Technology, 2007
One of the key challenges of next-generation wireless networks (such as enhanced general packet radio service) is the ability to provide different grades of quality of service to users. Weighted fair queueing (WFQ) is a popular scheduling algorithm to guarantee bounded delay, guaranteed throughput, and fairness.
Duan-Shin Lee   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy