Today’s cloud networks are shared among many tenants. Bandwidth guarantees and work conservation are two key properties to ensure predictable performance for tenant applications and high network utilization for providers. Despite significant efforts, very little prior work can really achieve both properties simultaneously even some of them claimed so. In this paper, we present QShare, a compreh...

In this paper, we investigate the eeectiveness of packet-drop mechanisms in conjunction with fair queuing link scheduling and hierarchical link sharing. Under fair queuing, the link share of a ow changes dynamically due to the arrivals and departures of ows and their bursts. This phenomenon becomes more pronounced in the case of hierarchical link sharing. Packet-drop mechanisms play an integral...

This work aims to analyse different design proposals for a dynamic Weighted Fair Queuing (WFQ) scheduler to provide Quality of Service (QoS) guarantees in general at IP level and specifically for the applications of the PHOENIX project. Several possible design options and configuration parameters have been investigated and studied for a dynamic scheduling discipline able to support QoS in a rel...

results: most addict patients had a medium level of education. improvement in knowledge, attitude and practice (kap) of patients after intervention was observed as follows; decreasing kap in poor level (2.8% vs. 30.6%), (3% vs. 50%), (25% vs. 80.6%), respectively; also, increasing kap in fair level (7% vs. 55.6 %), (15% vs. 15%), (19% vs. 7%), respectively and increasing kap in satisfactory lev...

There i s an increasing demand for Internet core nodes to have (I) quality-of-service (QoS) guarantees and (2) higher switching capacity. The combined input and output queued (CiOQ) switching has been shown to be a promising solution to meet such demand. However, many of the proposed scheduling algorithms fo r a CIOQ switch cannot be practically implemented due to problems from scalability and ...

This paper introduces a scheme for online dynamic bandwidth allocation for variable bit rate (VBR) traffic over ATM networks. The presented method determines the optimum bandwidth renegotiation time and bandwidth amount to allocate to VBR traffic source by minimizing predefined cost functions. Traffic rate predictor designed by wavelets is provided as feedback to the system. The results show th...

It is expected that the proportional fair (PF) scheduler will be used widely in cdma2000 1xEV-DO systems because it maximizes the sum of each user’s utility, which is given by the logarithm of its average throughput. In this paper, we address an influence of the PF scheduler on the packet transmission delay in base station (BS) and propose an analytic model.

We consider a queue fed by a mixture of light-tailed and heavytailed traffic. The two traffic classes are served in accordance with the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated networks. We derive the asymptotic workload behavio...

Assured Service has been proposed within the Differentiated Services (DiffServ) model to provide relative service differentiation by attempting to allocate bandwidth to different users in a controlled way during periods of network congestion. In this paper, we analyze the Assured Service scheme by means of a priority queueing system with statedependent service scheduling based on thresholds. We...