We study the workload (unfinished work) and the waiting time of the queueing system with MAP arrivals under D-policy. The D-policy stipulates that the idle server begin to serve the customers only when the sum of the service times of all waiting customers exceeds some fixed threshold D. We first set up the system equations for workload and obtain the steady-state distributions of workloads at a...

We investigate the control problem of the optimal choice of idle server (if any) for arriving customer in order to minimize the mean system time (waiting time + service time). The considered MAP/MAP/N queue consists of a common infinite buffer and multiple identical servers with MAP service processes whose phases (internal states) are known. Customers arrive according to a MAP (whose phase is a...

Traditionally, radio resources are released in cellular networks by statically configured inactivity timers, causing substantial resource inefficiencies. We propose a novel system RadioProphet (RP), which dynamically and intelligently determines in real time when to deallocate radio resources by predicting the network idle time based on traffic history. We evaluate RP using 7month-long real-wor...

Johnson's rule is a scheduling method for the sequence of jobs. Its primary goal to find perfect functions reduce amount idle time, and it also reduces total time required complete all functions. It suitable purposes two in specific time-dependent both where factor only parameter used this way. Therefore, not work computers network, there are many factors affecting completion such as CPU speed,...

rovide energy efficient routes because mobile nodes’ operation time is idle but listens to the wireless medium