In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes will not be tolerated in an interactive environment. If the time quantum is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer thro...

CPU scheduling is one of the most crucial operations performed by operating system. Different algorithms are available for CPU scheduling amongst them RR (Round Robin) is considered as optimal in time shared environment. The effectiveness of Round Robin completely depends on the choice of time quantum. In this paper a new CPU scheduling algorithm has been proposed, named as DABRR (Dynamic Avera...

The General Packet Radio Service (GPRS) augments GSM to provide packet switched data services to the mobile users. Packet scheduling in GPRS is dynamic and several scheduling techniques have been implemented, for example round robin; however, these generally assure only best effort quality of service. In this paper we compare prominent scheduling algorithms by simulation of web and email traffi...

Efficient allocation of tasks to available resources is a critical problem in cloud computing. Load balancing algorithms are basic approach to optimized resource allocation. This paper presents a static load balancing algorithm to allocate tasks to virtual machines in optimized way. The algorithm is based on a group based allocation strategy. The strategy determines the allocation of virtual ma...

The performance analysis of the 32x32 crosspoint queued switch is presented in this paper. Switches with small buffers in crosspoints have been evaluated in the late Eighties, but mostly for uniform traffic. However, due to technological limitations of that time, it was impractical to implement large buffers together with switching fabric. The crosspoint queued switch architecture has been rece...

509 Abstract—Algorithms used for scheduling play a major role in providing quality of service in video streaming. This paper describes a simulation environment that has been designed combining network simulator ns2 with video codec to predict the quality of service. Virtual clock scheduling algorithm has been applied to evaluate the performance metrics and compared with the weighted round robin...

In this paper a new traffic control method called Advanced Round Robin (ARR) is presented. It is shown that ARR can provide both worst case and statistical Quality of Service guarantees without coupling cell loss and delay requirements. A related Connection Admission Control algorithm with performance study is also presented. A comparative performance analysis of ARR using simulation was perfor...