نتایج جستجو برای: fair 50

تعداد نتایج: 487132  

Journal: :TBC 2003
Anthony T. Chronopoulos Caimu Tang Ece Yaprak

The problem of allocating network resources to application sessions backlogged at an individual switch has a great impact on the end-to-end delay and throughput guarantees offered by the network. There exists a class of algorithms based on Weighted Fair Queueing (WFQ) for scheduling packets which are work-conserving and they guarantee fairness to the backlogged sessions. These algorithms also a...

1997
Subhash Suri George Varghese Girish Chandranmenon

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

2000
Maria Adamou Sanjeev Khanna Insup Lee Insik Shin Shiyu Zhou

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

2002
Jasleen Kaur Harrick M. Vin

In this paper, we present the first end-to-end fairness analysis of a network of fair servers. We argue that it is difficult to extend existing single-node fairness analysis to an end-to-end analysis of a network where each node may employ a different fair scheduling algorithm. We then present a two-step approach for end-to-end fairness analysis of heterogeneous networks. First, we define a cla...

Journal: :Int. Arab J. Inf. Technol. 2012
Muhammad Mostafa Monowar Md. Obaidur Rahman Al-Sakib Khan Pathan Choong Seon Hong

Due to the availability of multiple sensing units on a single radio board of the modern sensor motes, some sensor networks need to handle heterogeneous traffic within the same application. This diverse traffic could have different priorities in terms of transmission rate, required bandwidth, packet loss, etc. Because of the multi-hop transmission characteristic of this prioritized heterogeneous...

2016
H Kaziz N Naouar W Osman MLB Ayeche

Introduction: Elbow dislocations are uncommon in children. The treatment and outcomes remains controversial. MATERIALS AND METHODS We report retrospectively the clinical and functional results of elbow dislocations in children treated in Sahloul University Hospital. Both isolated or pure dislocations and those associated with other injuries were evaluated separately. Results: Forty-eight chil...

2016
Rahim Mahmodlou Kamran Shateri Faramarz Homayooni Sanaz Hatami

BACKGROUND AND AIM Adequate bowel preparation is important for safe and effective colonoscopy. Quality indicators (QI) for colonoscopy include achieving at least 95% completion rate and an adenoma detection rate (ADR) of at least 25% in average-risk men and 15% in average-risk women aged over 50. Our aim was to investigate the impact of bowel preparation on ADR and colonoscopy completion rates....

1998
C. Tang A. T. Chronopoulos E. Yaprak

The scheduling scheme of a switch affects the delay, throughput and fairness of a network and thus has a great impact on the quality of service (QoS). In Part I, we present a theoretical analysis of a burst scheduling for ATM switches and proved QoS guarantees on throughput and fairness of the applications. Here, we use simulation to demonstrate the superiority of the burst based weighted fair ...

2007
Jennifer L. Rexford Albert G. Greenberg Flavio G. Bonomi

ATM network performance hinges on user sessions, or virtual connections, adhering to the traac contracts established by the admission control policy. This paper considers eecient mechanisms for enforcing these contracts by shaping the incoming cell streams. While shaping eeectively accommodates variation in a connection's traac ow, this smoothing function introduces implementation complexity, s...

2001
C. Santiago R. Valadas

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

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید