Fair bandwidth allocation is an important mechanism for traffic management in the Internet. Round robin schedulers, such as Deficit Round Robin (DRR), are well-suited for implementing fair queueing in multi-Gbps routers, as they schedule packets in constant time regardless of the total number of active flows. The main drawback of these schemes, however, lies in the maintenance of per flow queue...

Recently, there has been significant growth in the popularity of cloud computing systems. One main issues building systems is task scheduling. It plays a critical role achieving high-level performance and outstanding throughput by having greatest benefit from resources. Therefore, enhancing scheduling algorithms will enhance QoS, thus leading to more sustainability This paper introduces novel t...

This paper proposes and analyzes bandwidth reclaim scheme for IEEE 802.11 WLAN, which may suffer from severe bandwidth waste resulting from not only the variation of transmission rate and message length but also the overallocation to the real-time traffic in compensating for the delay due to the intervention of non-real-time messages. Built on top of the weighted round robin scheduling policy, ...

packet and cell switched networks. We demonstrate that MCRR exhibits optimal worst-case latency property in a certain class of weighted round robin (WRR) approaches which are currently used for packet (cell) scheduling in high-speed networks, such as ATM networks. We further present a Hierarchical MCRR (HMCRR) mechanism to maximize the efficacy of MCRR in practice and be scalable to large numbe...

Sweden This paper focuses on an experimental analysis of the performance and scalability of cluster-based web servers. We carry out the comparative studies using two experimental platforms, namely, a hardware testbed consisting of sixteen PCs, and a trace-driven discrete-event simulator. Dispatcher and web server service times used in the simulator are determined by carrying out a set of experi...

This paper focuses on an experimental analysis of the performance and scalability of cluster-based web servers. We carry out the comparative studies using two experimental platforms, namely, a hardware testbed consisting of 16 PCs, and a trace-driven discrete-event simulator. Dispatcher and web server service times used in the simulator are determined by carrying out a set of experiments on the...

A novel table-filling schedule algorithm is proposed for the round robin calendar problem with arbitrary competitors. Among schedules calendar, the number of rows is the ID of each competitor and elements of the schedule correspond to a certain round serial number of some two competitors. Competition schedule can be completed by the algorithm when the number of competitors is even. If the numbe...