Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and ideal dynamic priority scheduler. In this paper, we develop two mechanisms f...

Cloud has emerged into another enhancement that manipulates the diversity of resources in order to expand the ability of Cloud facility. Cloud is no longer being seen as one-type service provider. The advantages of the heterogeneous Cloud give great benefits to the users and have business potential in service market. To cope with the dynamic nature of heterogeneous Cloud, the Cloud provider nee...

Task scheduling algorithms are crucial for optimizing the utilization of computing resources. This work proposes a unique approach improving task execution in real-time systems using an enhanced Round Robin algorithm variant incorporating dynamic time quantum and priority. The proposed adjusts slice allocated to each based on priority, resulting more efficient resource utilization. We also prio...

This paper deals with a multi-class priority queueing system with customer transfers that occur only from lower priority queues to higher priority queues. Conditions for the queueing system to be stable/unstable are obtained. An auxiliary queueing system is introduced, for which an explicit product-form solution is found for the stationary distribution of queue lengths. Sample path relationship...

— Ad hoc networks formed without the aid of any established infrastructure are typically multi-hop networks. Location dependent contention and " hidden terminal " problem make priority scheduling in multi-hop networks significantly different from that in wireless LANs. Most of the prior work related to priority scheduling addresses issues in wireless LANs. In this paper, priority scheduling in ...

This paper introduces a new packet scheduling algorithm for multi-media traffic. The proposed modified priority queuing (MPQ) packet scheduling algorithm, realizing the high priority traffic service employs exponential distributions with the higher averages respectively, secures the reduction in the mean waiting time regarding the high priority traffic sensitive to delay. Thus, we could meet th...

Modern communication networks have to support an increasingly diverse range of applications, each bearing their own particular set of Quality of Service (QoS) requirements. Realtime applications (e.g. multimedia streaming, telephony, gaming, ...) are characterized by hard delay requirements: the mean delay and the delay jitter of the data packets should typically be kept minimal. For non-real-t...

We introduce the heap-on-top (hot) priority queue data structure that combines the multi-level bucket data structure of Denardo and Fox 9] and a heap. We use the new data structure to obtain an O(m+n(log C) 1 3 +) expected time implementation of Dijkstra's shortest path algorithm 11], improving the previous bounds.

The present paper deals with the problem of calculating queue length distributions in a priority queueing model with a preemptive-resume policy under the assumption of general arrival and service distributions. The multi-queue priority system is decomposed into single-queue vacation systems, for which the visit and inter-visit distributions are approximated by the idle and busy period of a ΣGI/...