This paper presents a study carried out on a Weighted Fair Queuing implementation for Unix routers the WFQ implementation of the ALTQ project. It shows the WFQ/ALTQ weaknesses and explains why we cannot expect an interesting behavior from a system using such a

BACKGROUND AND AIMS Low-quality bowel preparation reduces efficacy of colonoscopy. We aimed to summarize effects of bowel preparation on detection of adenomas, advanced adenomas and colorectal cancer. METHODS A systematic literature search was performed regarding detection of colonic lesions after normal and low-quality bowel preparation. Reported bowel preparation quality was transformed to ...

We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

With the advent of the IEEE 802.11 wireless networks that provide high speed connectivity, demand for supporting multiple real-time traffic applications over wireless LANs has been increasing. A natural question is how to provide fair resource allocation to real-time traffic in wireless LANs. Wireless networks are subject to unpredictable location-dependent error bursts, which is different from...

An increasing number of States are using a fair-rental approach for reimbursement of nursing home capital costs. In this study, two variants of the fair-rental capital-reimbursement approach are compared with the traditional cost-based approach in terms of after-tax cash flow to the investor, cost to the State, and rate of return to investor. Simulation models were developed to examine the effe...

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).

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 ability to quickly deploy new protocols, and provide flexibility to both applications and network administrators has been an oft-cited reason for active networks to be seriously examined. This paper describes an architecture and implementation that provides dynamic installation of network services and flexibility to active code. An example of weighted fair queuing being installed dynamicall...