9,884 research outputs found
Cost Of Reaching With Prohibition For An Exponential Time-Sharing Queueing Process
A process of servicing of conflict flows with a time-sharing algorithm with readjustments is considered. Input flows are formed in a random environment synchronized with the servicing device. Service and readjustment durations are exponentially distributed. A mathematical model for the servicing process is constructed in form of a denumerable continuous-time Markov chain. To estimate the loading degree of the timesharing queueing system with readjustments an expected cost of reaching with prohibition is proposed. It generalizes Chung functional for homogeneous denumerable discrete-time Markov chains. A control is searched for which minimizes the functional in a class of simple priority controls with threshold
Recommended from our members
Analysis of a class of distributed queues with application
Recently we have developed a class of media access control algorithms for different types of Local Area Networks. A common feature of these LAN algorithms is that they represent various strategies by which the processors in the LAN can simulate the availability of a centralized packet transport facility, but whose service incorporates a particular type of change over time known as 'moving sever' overhead. First we describe the operation of moving server systems in general, for both First-Come - First-Served and Head-of-the-Line orders of service, together with an approach for their delay analysis in which we transform the moving server queueing system into a conventional queueing system having proportional waiting times. Then we describe how the various LAN algorithms may be obtained from the ideal moving server system, and how a significant component of their performance characteristics is determined by the performance characteristics of that ideal system. Finally, we evaluate the compatibility of such LAN algorithms with separable queueing network models of distributed systems by computing the interdeparture time distribution for M/M/1 in the presence of moving server overhead. Although it is not exponential, except in the limits of low server utilization or low overhead, the interdeparture time distribution is a weighted sum of exponential terms with a coefficient of variation not much smaller than unity. Thus, we conjecture that a service centre with moving server overhead could be used to represent one of these LAN algorithms in a product form queueing network model of a distributed system without introducing significant approximation errors
An efficient hybrid model and dynamic performance analysis for multihop wireless networks
Multihop wireless networks can be subjected to nonstationary phenomena due to a dynamic network topology and time varying traffic. However, the simulation techniques used to study multihop wireless networks focus on the steady-state performance even though transient or nonstationary periods will often occur. Moreover, the majority of the simulators suffer from poor scalability. In this paper, we develop an efficient performance modeling technique for analyzing the time varying queueing behavior of multihop wireless networks. The one-hop packet transmission (service) time is assumed to be deterministic, which could be achieved by contention-free transmission, or approximated in sparse or lightly loaded multihop wireless networks. Our model is a hybrid of time varying adjacency matrix and fluid flow based differential equations, which represent dynamic topology changes and nonstationary network queues, respectively. Numerical experiments show that the hybrid fluid based model can provide reasonably accurate results much more efficiently than standard simulators. Also an example application of the modeling technique is given showing the nonstationary network performance as a function of node mobility, traffic load and wireless link quality. © 2013 IEEE
An analytical comparison of the patient-to-doctor policy and the doctor-to-patient policy in the outpatient clinic
Outpatient clinics traditionally organize processes such that the doctor remains in a consultation room, while patients visit for consultation, we call this the Patient-to-Doctor policy. A different approach is the Doctor-to-Patient policy, whereby the doctor travels between multiple consultation rooms, in which patients prepare for their consultation. In the latter approach, the doctor saves time by consulting fully prepared patients. We compare the two policies via a queueing theoretic and a discrete-event simulation approach. We analytically show that the Doctor-to-Patient policy is superior to the Patient-to-Doctor policy under the condition that the doctor’s travel time between rooms is lower than the patient’s preparation time. Simulation results indicate that the same applies when the average travel time is lower than the average preparation time. In addition, to calculate the required number of consultation rooms in the Doctor-to-Patient policy, we provide an expression for the fraction of consultations that are in immediate succession; or, in other words, the fraction of time the next patient is prepared and ready, immediately after a doctor finishes a consultation.We apply our methods for a range of distributions and parameters and to a case study in a medium-sized general hospital that inspired this research
Applying branching processes to delay-tolerant networks
Mobility models that have been used in the past to study delay tolerant networks (DTNs) have been either too complex to allow for deriving analytical expressions for performance measures, or have been too simplistic. In this paper we identify several classes of DTNs where the dynamics of the number of nodes that have a copy of some packet can be modeled as branching process with migration. Using recent results on such processes in a random environment, we obtain explicit formulae for the first two moments of the number of copies of a file that is propagated in the DTN, for quite general mobility models. Numerical examples illustrate our approach
- …