About the cumulative idle time in multiphase queues

The paper is designated to the analysis of queueing systems, arising in the network theory and communications theory (called multiphase queueing systems, tandem queues or series of queueing systems). Also we note that multiphase queueing systems can be useful for modelling practical multi-stage service systems in a variety of disciplines, especially on manufacturing (assembly lines), computer networking (packet switch structures), and in telecommunications (e.g. cellular mobile networks), etc. This research presents heavy traffic limit theorems for the cumulative idle time in multiphase queues. In this work, functional limit theorems are proved for the values of important probability characteristics of the queueing system (a cumulative idle time of a customer)

Breaking the Legend: Maxmin Fairness notion is no longer effective

In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.Comment: 8 Page

Mean waiting time in the M/H2/s queue: application to mobile communications Systems

In this paper a procedure to approximately calculate the mean waiting time in the M/H2/s queue is presented. The approximation is heuristic although based in the intuitive symmetry between the deterministic and balanced hyperexponential-2 distributions. The three parameters which fully describe the H2 distribution are considered, so the approximation can also be used for the M/G/s queue when the first three moments are known. If only the first two moments of the holding time distribution are known, the estimation can also be applied accepting a lesser accuracy. The estimation proposed is a closed formula extremely easy to compute and the results are very accurate. This features makes it helpful in the design of mobile telecommunication systems with more than one channel and queueing allowed (like trunking Private Mobile Radio PMR systems), where holding time distributions with coefficients of variation higher than one may appear. As a second stage, the possibility of calls owning a certain level of priority is studied. Two service classes are considered according to a non-preemtive priority scheme (also known as Head Of the Line or HOL). This priority feature is often required in mobile telecommunications systems to improve the access delay of some special calls by degrading the delay suffered by the rest. If the proportion of calls owning priority is kept low, the degradation is shared by many calls and then kept small. In this paper a procedure to estimate the mean waiting time in queue for each priority class is presented. This procedure is also very easy to compute. The environment for which the results of this paper are intended suggests medium or heavy overall load and light priority load (priority proportion is kept low). This is the situation under which the accuracy of the proposed method is checked. Although simulations are necessary in the final phase of the design, the procedure presented here is helpful as a first quick insight into the system performance.Peer ReviewedPostprint (published version