A lot of blood, sweat and tears have been shed in the quest to improve network performance, mostly in terms of flow completion times. But this race to the top has meant that we have been guilty of forgetting what really matters — application performance. Applications have different notions of the utility they derive from flow completion, so determining the right network metric to optimize is a ...

This paper proposes a novel scheduling discipline for service differentiation in multi-service networks, which is referred to as the Probabilistic Priority (PP) discipline. PP is based on the Strict Priority (SP) discipline with the difference that each priority class is assigned a parameter. The parameter determines the probability with which its corresponding queue is served when it is polled...

In this research paper, a new algorithm, Parametric Multi Level Feedback Queue (PMLFQ), has been presented for solving the problems and minimizing the response time. In this algorithm, a parametric approach has been utilized for defining the optimized quantum of each queue and number of queues. One of the most efficient algorithms for real time scheduling is Multi-Layer Queue (MLQ), algorithm t...

In this paper, we analyze a discrete-time GI-G1, Geo2-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. The high-priority class contains packets with generally distributed service times while the low-priority packets are assumed to have geometrically distributed service times. We show th...

The replication of the non-structure data from one data center to another is an urgent task in HBase. The paper studies the priority growth probability of the priority replication queue and proposed a dynamic priority replication task queue algorithm based on the earliest deadline first algorithm (EDF). The experiment results show that the proposed algorithm can balance the replication overhead...

Two different approaches have been commonly used to address problems associated with space sharing scheduling strategies: (a) augmenting space sharing with backfilling, which performs out of order job scheduling; and (b) augmenting space sharing with time sharing, using a technique called coscheduling or gang scheduling. With three important experimental results – impact of priority queue order...

We consider a single-machine scheduling problem with equal-sized jobs. The objective is to minimize the maximum weighted earliness-tardiness and due-date costs. We present an algorithm to solve this problem. Our algorithm makes use of bottleneck jobs and priority queues, and has a computational complexity of O(n logn). This complexity is a significant improvement of the existing algorithm in th...

We present a method for providing hard real time guar antees for tra c through an Asynchronous T ransfer Mode A TM network Guarante eddelivery also im plies that we have to guarantee that no cells are lost due to over full bu ers in the network By using priority queues in the output bu ers we allow urgent messages short end to end delays while still guar anteing end to end delays for low priori...