QLWFQ: a queue length based weighted fair queueing algorithm in ATM networks
Proceedings of INFOCOM '97, 2002A work conserving O(1) per-VC queueing algorithm named QLWFQ (Queue Length based Weighted Fair Queueing) for high-speed ATM networks is proposed. The basic process in QLWFQ is the comparison of the current queue length with the weight when a cell arrival or departure occurs.
openaire +1 more source
Performance Analysis of Weighted Fair Queues with Variable Service Rates
International Conference on Digital Telecommunications (ICDT'06), 2006This paper provides an analytical technique to estimate the queue length and delay distributions for weighted fair queues (WFQ) with more than two queues and time-correlated variable service rates, based on two-dimensional decoupling. At first, temporal decomposition is used to convert the time-correlated queuing problem into a set of sub-problems over
M. Ashour, null Tho Le-Ngoc
openaire +1 more source
Weighted fair queueing for data service in a multimedia CDMA system
Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152), 2002A new resource allocation scheme is proposed for a data service in an integrated voice/data CDMA system. After delay-sensitive voice users are first allocated, then residual resources are allocated to data users. For fair allocation of the data user, a new weighted fair queueing system is applied to the DS-CDMA system in the consideration of wireless ...
null Seung Sik Choi, null Dong Ho Cho
openaire +1 more source
Sliding weighted fair queueing scheme for real-time applications
IEE Proceedings - Communications, 2005Weighted fair queueing (WFQ) is a popular scheme because of its guaranteed bandwidth and bounded delay. To make WFQ more flexible, sliding weighted fair queueing (SWFQ) is proposed by combining priority-driven and share-driven scheduling for a real-time network.
Y.-S. Yen +3 more
openaire +1 more source
Design and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks
IEICE Transactions on Communications, 2005Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ)
Sheng-Tzong Cheng, Ming-Hung Tao
openaire +1 more source
Weighted Fairness and Correct Sizing of the Secondary Transit Queue in Resilient Packet Rings
Journal of Optical Communications and Networking, 2010The IEEE 802.17 is a standardized ring topology network architecture, called the Resilient Packet Ring (RPR), to be used mainly in metropolitan and wide area networks. After a brief overview of the IEEE 802.17 RPR protocol, this article investigates the weighted fairness aspects as well as the requirements for sizing the secondary transit queue of IEEE
Mete Yilmaz, Nirwan Ansari
openaire +2 more sources
Weighted fair bandwidth allocation and active queue management for adaptive flows
The Ninth International Conference onCommunications Systems, 2004. ICCS 2004., 2004Some gateway algorithms have been proposed to support both fair bandwidth allocation and queue management, but they are not dealing with flow weight. We propose frame-based flow random early drop (F2RED) algorithm that supports the functions of weighted fair bandwidth allocation and active queue management (AQM). Since the packet discarding behavior of
null Changhee Joo, null Saewoong Bahk
openaire +1 more source
An adaptive approach to weighted fair queue with QoS enhanced on IP network
Proceedings of IEEE Region 10 International Conference on Electrical and Electronic Technology. TENCON 2001 (Cat. No.01CH37239), 2002We propose an adaptive bandwidth allocation algorithm for reservation protocols to support quality-of-service networking on the future multimedia Internet. QoS design is the fundamental functionality of the next generation IP router to enable differentiated delivery and to guarantee the delivery quality for diverse service traffic.
null Mong-Fong Homg +3 more
openaire +1 more source
Weighted fair queueing and compensation techniques for wireless packet switched networks
The 5th International Symposium on Wireless Personal Multimedia Communications, 2003Recently there has been a tremendous growth in the popularity of wireless packet switched networks. In addition to the traditional voice services, wireless service providers and equipment manufacturers are working hard on offering higher speed data access over cellular wireless networks.
null Duan-Shin Lee, null Chun-Min Chen
openaire +1 more source
A Priority-Based Weighted Fair Queueing Algorithm in Wireless Sensor Network
2012 8th International Conference on Wireless Communications, Networking and Mobile Computing, 2012Based on the requirement of the transmission of real-time service in wireless sensor networks, the paper studies Weighted Fair Queuing (WFQ) algorithm profoundly. Having analyzed the reason why WFQ can't ensure the quality of real-time service, it proposes P-WFQ, which is a priority-based Weighted Fair Queuing (P-WFQ) algorithm. With sliding windows, P-
Xiao-dong Wang +3 more
openaire +1 more source

