Analysis of the asymmetrical shortest two-server queueing model

NARCIS (Netherlands)

J.W. Cohen

1995-01-01

textabstractThis study presents the analytic solution for the asymmetrical two-server queueing model with arriving customers joining the shorter queue for the case with Poisson arrivals and negative exponentially distributed service times. The bivariate generating function of the stationary joint

Large Deviation Bounds for a Polling System with Two Queues and Multiple Servers

OpenAIRE

Wei, Fen

2004-01-01

In this paper, we present large deviation bounds for a discrete-time polling system consisting of two-par-allel queues and m servers. The arrival process in each queue is an arbitrary, and possibly correlated, stochastic process. Each server (serves) independently serves the two queues according to a Bernoulli service schedule. Using large deviation techniques, we analyze the tail behavior of the stationary distribution of the queue length processes, and derive upper and lower bounds of the b...

Modelling M/G/1 queueing systems with server vacations using ...

African Journals Online (AJOL)

Simple numerical examples are also provided to illustrate the func- ... M/G/1/N queueing systems with server vacations under a limited service discipline ...... system contents in a discrete-time non-preemptive priority queue with general service.

On the optimal use of a slow server in two-stage queueing systems

Science.gov (United States)

Papachristos, Ioannis; Pandelis, Dimitrios G.

2017-07-01

We consider two-stage tandem queueing systems with a dedicated server in each queue and a slower flexible server that can attend both queues. We assume Poisson arrivals and exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming that two servers cannot collaborate to work on the same job and preemptions are not allowed. We formulate the problem as a Markov decision process and derive properties of the optimal allocation for the dedicated (fast) servers. Specifically, we show that the one downstream should not idle, and the same is true for the one upstream when holding costs are larger there. The optimal allocation of the slow server is investigated through extensive numerical experiments that lead to conjectures on the structure of the optimal policy.

Queue Length and Server Content Distribution in an Infinite-Buffer Batch-Service Queue with Batch-Size-Dependent Service

Directory of Open Access Journals (Sweden)

U. C. Gupta

2015-01-01

Full Text Available We analyze an infinite-buffer batch-size-dependent batch-service queue with Poisson arrival and arbitrarily distributed service time. Using supplementary variable technique, we derive a bivariate probability generating function from which the joint distribution of queue and server content at departure epoch of a batch is extracted and presented in terms of roots of the characteristic equation. We also obtain the joint distribution of queue and server content at arbitrary epoch. Finally, the utility of analytical results is demonstrated by the inclusion of some numerical examples which also includes the investigation of multiple zeros.

General bulk service queueing system with N-policy, multiplevacations, setup time and server breakdown without interruption

Science.gov (United States)

Sasikala, S.; Indhira, K.; Chandrasekaran, V. M.

2017-11-01

In this paper, we have considered an MX / (a,b) / 1 queueing system with server breakdown without interruption, multiple vacations, setup times and N-policy. After a batch of service, if the size of the queue is ξ (customers in the queue. After a vacation, if the server finds at least N customers waiting for service, then the server needs a setup time to start the service. After a batch of service, if the amount of waiting customers in the queue is ξ (≥ a) then the server serves a batch of min(ξ,b) customers, where b ≥ a. We derived the probability generating function of queue length at arbitrary time epoch. Further, we obtained some important performance measures.

Simple and efficient importance sampling scheme for a tandem queue with server slow-down

NARCIS (Netherlands)

Miretskiy, D.I.; Scheinhardt, W.R.W.; Mandjes, M.R.H.

2008-01-01

This paper considers importance sampling as a tool for rare-event simulation. The system at hand is a so-called tandem queue with slow-down, which essentially means that the server of the first queue (or: upstream queue) switches to a lower speed when the second queue (downstream queue) exceeds some

Markov-modulated infinite-server queues driven by a common background process

OpenAIRE

Mandjes , Michel; De Turck , Koen

2016-01-01

International audience; This paper studies a system with multiple infinite-server queues which are modulated by a common background process. If this background process, being modeled as a finite-state continuous-time Markov chain, is in state j, then the arrival rate into the i-th queue is λi,j, whereas the service times of customers present in this queue are exponentially distributed with mean µ −1 i,j ; at each of the individual queues all customers present are served in parallel (thus refl...

Transient queue-size distribution in a finite-capacity queueing system with server breakdowns and Bernoulli feedback

Science.gov (United States)

Kempa, Wojciech M.

2017-12-01

A finite-capacity queueing system with server breakdowns is investigated, in which successive exponentially distributed failure-free times are followed by repair periods. After the processing a customer may either rejoin the queue (feedback) with probability q, or definitely leave the system with probability 1 - q. The system of integral equations for transient queue-size distribution, conditioned by the initial level of buffer saturation, is build. The solution of the corresponding system written for Laplace transforms is found using the linear algebraic approach. The considered queueing system can be successfully used in modelling production lines with machine failures, in which the parameter q may be considered as a typical fraction of items demanding corrections. Morever, this queueing model can be applied in the analysis of real TCP/IP performance, where q stands for the fraction of packets requiring retransmission.

Complete analysis of MAP/G/1/N queue with single (multiple vacation(s under limited service discipline

Directory of Open Access Journals (Sweden)

U. C. Gupta

2005-01-01

Full Text Available We consider a finite-buffer single-server queue with Markovian arrival process (MAP where the server serves a limited number of customers, and when the limit is reached it goes on vacation. Both single- and multiple-vacation policies are analyzed and the queue length distributions at various epochs, such as pre-arrival, arbitrary, departure, have been obtained. The effect of certain model parameters on some important performance measures, like probability of loss, mean queue lengths, mean waiting time, is discussed. The model can be applied in computer communication and networking, for example, performance analysis of token passing ring of LAN and SVC (switched virtual connection of ATM.

An M/M/2 Queueing System with Heterogeneous Servers Including One with Working Vacation

Directory of Open Access Journals (Sweden)

A. Krishnamoorthy

2012-01-01

Full Text Available This paper analyzes an M/M/2 queueing system with two heterogeneous servers, one of which is always available but the other goes on vacation in the absence of customers waiting for service. The vacationing server, however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady state using matrix geometric method. Busy period of the system is analyzed and mean waiting time in the stationary regime computed. Conditional stochastic decomposition of stationary queue length is obtained. An illustrative example is also provided.

An M[X]/G(a,b/1 Queueing System with Breakdown and Repair, Stand-By Server, Multiple Vacation and Control Policy on Request for Re-Service

Directory of Open Access Journals (Sweden)

G. Ayyappan

2018-06-01

Full Text Available In this paper, we discuss a non-Markovian batch arrival general bulk service single-server queueing system with server breakdown and repair, a stand-by server, multiple vacation and re-service. The main server’s regular service time, re-service time, vacation time and stand-by server’s service time are followed by general distributions and breakdown and repair times of the main server with exponential distributions. There is a stand-by server which is employed during the period in which the regular server remains under repair. The probability generating function of the queue size at an arbitrary time and some performance measures of the system are derived. Extensive numerical results are also illustrated.

On the Discrete-Time GeoX/G/1 Queues under N-Policy with Single and Multiple Vacations

Directory of Open Access Journals (Sweden)

Sung J. Kim

2013-01-01

Full Text Available We consider the discrete-time GeoX/G/1 queue under N-policy with single and multiple vacations. In this queueing system, the server takes multiple vacations and a single vacation whenever the system becomes empty and begins to serve customers only if the queue length is at least a predetermined threshold value N. Using the well-known property of stochastic decomposition, we derive the stationary queue-length distributions for both vacation models in a simple and unified manner. In addition, we derive their busy as well as idle-period distributions. Some classical vacation models are considered as special cases.

Transient solution of an M/M/1 vacation queue with a waiting server and impatient customers

Directory of Open Access Journals (Sweden)

Sherif I. Ammar

2017-07-01

Full Text Available Recently, Ammar [1] has discussed the transient behavior of a multiple vacations queue with impatient customers. In this paper, a similar technique is used to derive a new elegant explicit solution for an M/M/1 vacation queue with impatient customers and a waiting server, where the server is allowed to take a vacation whenever the system is empty after waiting for a random period of time. If the server does not return from the vacation before the expiry of the customer impatience time, the customer abandons the system forever. Moreover, the formulas of mean and variance expressed in terms of the obtained possibilities for this model.

Waiting-time approximations in multi-queue systems with cyclic service

NARCIS (Netherlands)

Boxma, O.J.; Meister, B.W.

1987-01-01

This study is devoted to mean waiting-time approximations in a single-server multi-queue model with cyclic service and zero switching times of the server between consecutive queues. Two different service disciplines are considered: exhaustive service and (ordinary cyclic) nonexhaustive service. For

Analysis of Multiserver Queueing System with Opportunistic Occupation and Reservation of Servers

Directory of Open Access Journals (Sweden)

Bin Sun

2014-01-01

Full Text Available We consider a multiserver queueing system with two input flows. Type-1 customers have preemptive priority and are lost during arrival only if all servers are occupied by type-1 customers. If all servers are occupied, but some provide service to type-2 customers, service of type-2 customer is terminated and type-1 customer occupies the server. If the number of busy servers is less than the threshold M during type-2 customer arrival epoch, this customer is accepted. Otherwise, it is lost or becomes a retrial customer. It will retry to obtain service. Type-2 customer whose service is terminated is lost or moves to the pool of retrial customers. The service time is exponentially distributed with the rate dependent on the customer’s type. Such queueing system is suitable for modeling cognitive radio. Type-1 customers are interpreted as requests generated by primary users. Type-2 customers are generated by secondary or cognitive users. The problem of optimal choice of the threshold M is the subject of this paper. Behavior of the system is described by the multidimensional Markov chain. Its generator, ergodicity condition, and stationary distribution are given. The system performance measures are obtained. The numerical results show the effectiveness of considered admission control.

Analysis of a multi-server queueing model of ABR

Directory of Open Access Journals (Sweden)

R. Núñez-Queija

1998-01-01

Full Text Available In this paper we present a queueing model for the performance analysis of Available Bit Rate (ABR traffic in Asynchronous Transfer Mode (ATM networks. We consider a multi-channel service station with two types of customers, denoted by high priority and low priority customers. In principle, high priority customers have preemptive priority over low priority customers, except on a fixed number of channels that are reserved for low priority traffic. The arrivals occur according to two independent Poisson processes, and service times are assumed to be exponentially distributed. Each high priority customer requires a single server, whereas low priority customers are served in processor sharing fashion. We derive the joint distribution of the numbers of customers (of both types in the system in steady state. Numerical results illustrate the effect of high priority traffic on the service performance of low priority traffic.

A single-server queue with random accumulation level

Directory of Open Access Journals (Sweden)

Jewgeni H. Dshalalow

1991-01-01

The author establishes an ergodicity criterion for both the queueing process with continuous time parameter and the imbedded process. Under this criterion, the author obtains explicit formulas for the stationary distributions of both processes by using semi-regenerative techniques.

A two-queue model with alternating limited service and state-dependent setups

NARCIS (Netherlands)

Winands, E.M.M.; Adan, I.J.B.F.; Houtum, van G.J.J.A.N.; Papadopoulos, C.T.

2005-01-01

We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. We obtain the transforms of the queue length and

A single-server queue with batch arrivals and semi-Markov services

NARCIS (Netherlands)

Abhishek,; Boon, M.A.A.; Boxma, O.J.; Núñez-Queija, R.

2017-01-01

We investigate the transient and stationary queue length distributions of a class of service systems with correlated service times. The classical (Formula presented.) queue with semi-Markov service times is the most prominent example in this class and serves as a vehicle to display our results. The

Analysis on preemptive priority retrial queue with two types of customers, balking, optional re-service, single vacation and service interruption

Science.gov (United States)

Yuvarani, S.; Saravanarajan, M. C.

2017-11-01

This paper concerned with performance analysis of single server preemptive priority retrial queue with a single vacation where two types of customers are considered and they are called priority customers and ordinary customers. The ordinary customers arrive in batch into the system. The priority customers do not form any queue. After the completion of regular service, the customers may demand re-service for the previous service without joining the orbit or may leave the system. As soon as the system is empty, the server goes for vacation and the regular busy server can be subjected to breakdown. By using the supplementary variable technique, we obtain the steady-state probability generating functions for the system/orbit size. Some important system performance measures and the stochastic decomposition are discussed. Finally, numerical examples are presented to visualize the effect of parameters on system performance measures.

Performance analysis of tandem queues with small buffers

NARCIS (Netherlands)

Vuuren, van M.; Adan, I.J.B.F.; Papadopoulos, C.T.

2005-01-01

In this paper we present an approximation for the performance analysis of single-server tandem queues with small buffers and generally distributed service times. The approximation is based on decomposition of the tandem queue in subsystems, the parameters of which are determined by an iterative

On the Nonsymmetric Longer Queue Model: Joint Distribution, Asymptotic Properties, and Heavy Traffic Limits

Directory of Open Access Journals (Sweden)

Charles Knessl

2013-01-01

Full Text Available We consider two parallel queues, each with independent Poisson arrival rates, that are tended by a single server. The exponential server devotes all of its capacity to the longer of the queues. If both queues are of equal length, the server devotes ν of its capacity to the first queue and the remaining 1−ν to the second. We obtain exact integral representations for the joint probability distribution of the number of customers in this two-node network. Then we evaluate this distribution in various asymptotic limits, such as large numbers of customers in either/both of the queues, light traffic where arrivals are infrequent, and heavy traffic where the system is nearly unstable.

Sojourn time distributions in a Markovian G-queue with batch arrival and batch removal

Directory of Open Access Journals (Sweden)

Yang Woo Shin

1999-01-01

Full Text Available We consider a single server Markovian queue with two types of customers; positive and negative, where positive customers arrive in batches and arrivals of negative customers remove positive customers in batches. Only positive customers form a queue and negative customers just reduce the system congestion by removing positive ones upon their arrivals. We derive the LSTs of sojourn time distributions for a single server Markovian queue with positive customers and negative customers by using the first passage time arguments for Markov chains.

Optimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue

Directory of Open Access Journals (Sweden)

Alexandra Koshman-Kaz

2015-02-01

Full Text Available This article deals with strategic control of information in a single-server model. It considers an M/M/1 system with identical customers. There is a single cut-off number, and the level of congestion is said to be low (high if the queue length is less than (at least this value. The firm can dynamically change the admission fee according to the level of congestion. Arriving customers cannot observe the queue length, but they are informed about the current level of congestion and the admission fee. The article deals with finding the profit maximizing admission fee, using analytical and numerical methods. We observe that such a pricing regime can be used to increase the profit and the proportion of the increase relative to the single price unobservable queue is unbounded. We observe that the profit maximizing threshold is usually quite small and therefore raise a question whether there is a significant difference in profit when rather than being informed about the congestion level, customers only join the system when the server is idle. We also investigate this question considering the classical observable model.

Matrix-Geometric Method for Queueing Model with State-Dependent Arrival of an Unreliable Server and PH Service

Directory of Open Access Journals (Sweden)

M.ReniSagaya Raj

2016-03-01

Full Text Available In this paper, we consider a state-dependent queueing system in which the system is subject to random breakdowns. Customer arrive at the system randomly following a Poisson process with state-dependent rates. Service times follows PH distribution and repair times are exponentially distributed. The server may fail to service with probability depending on the number of customer completed since the last repair. The main result of this paper is the matrix-geometric solution of the steady-state queue length from which many performance measurements of this queueing system like the stationary queue length distribution, waiting time distribution and the distribution of regular busy period, system utilization are obtained. Numerical examples are presented for both cases.

The optimal control in batch arrival queue with server vacations, startup and breakdowns

Directory of Open Access Journals (Sweden)

Ke Jau-Chuan

2004-01-01

Full Text Available This paper studies the N policy M[x]/G/1 queue with server vacations; startup and breakdowns, where arrivals form a compound Poisson process and service times are generally distributed. The server is turned off and takes a vacation whenever the system is empty. If the number of customers waiting in the system at the instant of a vacation completion is less than N, the server will take another vacation. If the server returns from a vacation and finds at least N customers in the system, he is immediately turned on and requires a startup time before providing the service until the system is empty again. It is assumed that the server breaks down according to a Poisson process whose repair time has a general distribution. The system characteristics of such a model are analyzed and the total expected cost function per unit time is developed to determine the optimal threshold of N at a minimum cost.

A study on an M/G/1 retrial G-queue with unreliable server under variant working vacations policy and vacation interruption

Directory of Open Access Journals (Sweden)

Pakkirisami Rajadurai

2018-02-01

Full Text Available We consider a single server retrial queueing system with variant working vacations and vacation interruption where the regular busy server is subjected to breakdown due to the arrival of negative customers. As soon as the orbit becomes empty at the time of regular service completion for a positive customer, the server takes at most J number working vacations until at least one customer is received in the orbit when the server returns from a working vacation. During the working vacation period, the server serves at a lower speed service rate (µv<µb. Using the method of supplementary variable technique, we determined the steady state probability generating function for the system and its orbit. We also obtained some analytical expressions for various performance measures such as system state probabilities, the mean orbit size, the mean system size, and reliability measures of this model. Finally, some numerical examples are presented.

ANALYSIS OF MULTI-SERVER QUEUEING SYSTEM WITH PREEMPTIVE PRIORITY AND REPEATED CALLS

Directory of Open Access Journals (Sweden)

S. A. Dudin

2015-01-01

Full Text Available Multi-server retrial queueing system with no buffer and two types of customers is analyzed as the model of cognitive radio system. Customers of type 1 have a preemptive priority. Customers of both types arrive according to Markovian Arrival Processes. Service times have exponential distribution with parameter depending on the customer type. Type 2 customers are admitted for service only if the number of busy servers is less than the predefined threshold. The rejected type 2 customers retry for the service. Existence condition of the stationary mode of system operation is derived. Formulas for computing key performance measures of the system are presented.

Sojourn-time approximations in queueing networks with feedback

NARCIS (Netherlands)

Gijsen, B.M.M.; van der Mei, R.D.; Engelberts, P.; van den Berg, J.L.; van Wingerden, K.M.C.

2006-01-01

This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

Sojourn time approximations in queueing networks with feedback

NARCIS (Netherlands)

Gijsen, B.M.M.; Mei, R.D. van der; Engelberts, P.; Berg, J.L. van den; Wingerden, K.M.C. van

2006-01-01

This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

Sojourn-time approximations in queueing networks with feedback

NARCIS (Netherlands)

Gijsen, B.M.M.; van der Mei, R.D.; van den Berg, Hans Leo; van Wingerden, K.M.C.

This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number

Bulk input queues with quorum and multiple vacations

Directory of Open Access Journals (Sweden)

Dshalalow Jewgeni H.

1996-01-01

Full Text Available The authors study a single-server queueing system with bulk arrivals and batch service in accordance to the general quorum discipline: a batch taken for service is not less than r and not greater than R ( ≥ r . The server takes vacations each time the queue level falls below r ( ≥ 1 in accordance with the multiple vacation discipline. The input to the system is assumed to be a compound Poisson process. The analysis of the system is based on the theory of first excess processes developed by the first author. A preliminary analysis of such processes enabled the authors to obtain all major characteristics for the queueing process in an analytically tractable form. Some examples and applications are given.

The Supermarket Model with Bounded Queue Lengths in Equilibrium

Science.gov (United States)

Brightwell, Graham; Fairthorne, Marianne; Luczak, Malwina J.

2018-04-01

In the supermarket model, there are n queues, each with a single server. Customers arrive in a Poisson process with arrival rate λ n , where λ = λ (n) \\in (0,1) . Upon arrival, a customer selects d=d(n) servers uniformly at random, and joins the queue of a least-loaded server amongst those chosen. Service times are independent exponentially distributed random variables with mean 1. In this paper, we analyse the behaviour of the supermarket model in the regime where λ (n) = 1 - n^{-α } and d(n) = \\lfloor n^β \\rfloor , where α and β are fixed numbers in (0, 1]. For suitable pairs (α , β ) , our results imply that, in equilibrium, with probability tending to 1 as n → ∞, the proportion of queues with length equal to k = \\lceil α /β \\rceil is at least 1-2n^{-α + (k-1)β } , and there are no longer queues. We further show that the process is rapidly mixing when started in a good state, and give bounds on the speed of mixing for more general initial conditions.

The ×-BMAP/G/1 Queueing Model: Queue Contents and Delay Analysis

Directory of Open Access Journals (Sweden)

Bart Steyaert

2011-01-01

Full Text Available We consider a single-server discrete-time queueing system with N sources, where each source is modelled as a correlated Markovian customer arrival process, and the customer service times are generally distributed. We focus on the analysis of the number of customers in the queue, the amount of work in the queue, and the customer delay. For each of these quantities, we will derive an expression for their steady-state probability generating function, and from these results, we derive closed-form expressions for key performance measures such as their mean value, variance, and tail distribution. A lot of emphasis is put on finding closed-form expressions for these quantities that reduce all numerical calculations to an absolute minimum.

A bulk queueing system under N-policy with bilevel service delay discipline and start-up time

Directory of Open Access Journals (Sweden)

David C. R. Muh

1993-01-01

Full Text Available The author studies the queueing process in a single-server, bulk arrival and batch service queueing system with a compound Poisson input, bilevel service delay discipline, start-up time, and a fixed accumulation level with control operating policy. It is assumed that when the queue length falls below a predefined level r(≥1, the system, with server capacity R, immediately stops service until the queue length reaches or exceeds the second predefined accumulation level N(≥r. Two cases, with N≤R and N≥R, are studied.

Paying for Express Checkout: Competition and Price Discrimination in Multi-Server Queuing Systems

Science.gov (United States)

Deck, Cary; Kimbrough, Erik O.; Mongrain, Steeve

2014-01-01

We model competition between two firms selling identical goods to customers who arrive in the market stochastically. Shoppers choose where to purchase based upon both price and the time cost associated with waiting for service. One seller provides two separate queues, each with its own server, while the other seller has a single queue and server. We explore the market impact of the multi-server seller engaging in waiting cost-based-price discrimination by charging a premium for express checkout. Specifically, we analyze this situation computationally and through the use of controlled laboratory experiments. We find that this form of price discrimination is harmful to sellers and beneficial to consumers. When the two-queue seller offers express checkout for impatient customers, the single queue seller focuses on the patient shoppers thereby driving down prices and profits while increasing consumer surplus. PMID:24667809

Paying for express checkout: competition and price discrimination in multi-server queuing systems.

Directory of Open Access Journals (Sweden)

Cary Deck

Full Text Available We model competition between two firms selling identical goods to customers who arrive in the market stochastically. Shoppers choose where to purchase based upon both price and the time cost associated with waiting for service. One seller provides two separate queues, each with its own server, while the other seller has a single queue and server. We explore the market impact of the multi-server seller engaging in waiting cost-based-price discrimination by charging a premium for express checkout. Specifically, we analyze this situation computationally and through the use of controlled laboratory experiments. We find that this form of price discrimination is harmful to sellers and beneficial to consumers. When the two-queue seller offers express checkout for impatient customers, the single queue seller focuses on the patient shoppers thereby driving down prices and profits while increasing consumer surplus.

Sojourn time tails in the single server queue with heavy-tailed service times

NARCIS (Netherlands)

Boxma, O.J.; Denisov, D.E.

2009-01-01

We consider the GI/GI/1 queue with regularly varying service requirement distribution of index -a. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1 - a, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution

The curse of the first-in-first-out queue discipline

DEFF Research Database (Denmark)

Platz, Trine Tornøe; Østerdal, Lars Peter Raahave

2017-01-01

We consider a game in which a large number of identical agents choose when to queue up at a single server after it opens. Agents are impatient for service and also incur a cost proportional to time spent in the queue. We show that the first-in–first-out queue discipline and the last......-in–first-out queue discipline both lead to a unique equilibrium arrival distribution. However, among all work-conserving queue disciplines, the first-in–first-out performs the worst in terms of equilibrium utility and welfare, while the last-in–first-out performs the best....

Sojourn time tails in the single server queue with heavy-tailed service times

NARCIS (Netherlands)

Boxma, O.J.; Denisov, D.E.

2011-01-01

We consider the GI/GI/1 queue with regularly varying service requirement distribution of index -a. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1-a, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is

An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities

NARCIS (Netherlands)

Sleptchenko, Andrei; van Harten, Aart; van der Heijden, Matthijs C.

2005-01-01

We consider a multi-class, multi-server queueing system with preemptive priorities. We distinguish two groups of priority classes that consist of multiple customer types, each having their own arrival and service rate. We assume Poisson arrival processes and exponentially distributed service times.

An asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1989-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length. he joins queue 1 say with probability q and queue 2

Upper Bounds on Performance Measures of Heterogeneous // Queues

Directory of Open Access Journals (Sweden)

F. S. Q. Alves

2011-01-01

Full Text Available In many real-life queueing systems, the servers are often heterogeneous, namely they work at different rates. This paper provides a simple method to compute tight upper bounds on two important performance measures of single-class heterogeneous multi-server Markovian queueing systems, namely the average number in queue and the average waiting time in queue. This method is based on an expansion of the state space that is followed by an approximate reduction of the state space, only considering the most probable states. In most cases tested, we were able to approximate the actual behavior of the system with smaller errors than those obtained from traditional homogeneous multiserver Markovian queues, as shown by GPSS simulations. In addition, we have correlated the quality of the approximation with the degree of heterogeneity of the system, which was evaluated using its Gini index. Finally, we have shown that the bounds are robust and still useful, even considering quite different allocation strategies. A large number of simulation results show the accuracy of the proposed method that is better than that of classical homogeneous multiserver Markovian formulae in many situations.

APPLICATION OF THE SINGLE SERVER QUEUING SYSTEM ANALYSIS IN WOOD PRODUCTS INDUSTRY

Directory of Open Access Journals (Sweden)

Arif GÜRAY

2001-01-01

Full Text Available The aim of this study, simulated of the single server queuing system(CNC at the door-joinery facilities. We simulated the system both by hand and computer programming with SIMAN languages. From the obtained results, we aimed to provide some suggestions to the manager. Because, the ending of the study, simulation showed the real system in some hypothesis. As a result of simulated system will have long queues in future time.

On Mx/(G1G2/1/G(BS/Vs vacation queue with two types of general heterogeneous service

Directory of Open Access Journals (Sweden)

Kailash C. Madan

2005-01-01

Full Text Available We analyze a batch arrival queue with a single server providing two kinds of general heterogeneous service. Just before his service starts, a customer may choose one of the services and as soon as a service (of any kind gets completed, the server may take a vacation or may continue staying in the system. The vacation times are assumed to be general and the server vacations are based on Bernoulli schedules under a single vacation policy. We obtain explicit queue size distribution at a random epoch as well as at a departure epoch and also the mean busy period of the server under the steady state. In addition, some important performance measures such as the expected queue size and the expected waiting time of a customer are obtained. Further, some interesting particular cases are also discussed.

A polling model with an autonomous server

NARCIS (Netherlands)

de Haan, Roland; Boucherie, Richardus J.; van Ommeren, Jan C.W.

2009-01-01

This paper considers polling systems with an autonomous server that remain at a queue for an exponential amount of time before moving to a next queue incurring a generally distributed switch-over time. The server remains at a queue until the exponential visit time expires, also when the queue

An M/G/1 queue with multiple types of feedback and gated vacations

NARCIS (Netherlands)

O.J. Boxma (Onno); U. Yechiali

1995-01-01

textabstractThis paper considers a single-server queue with Poisson arrivals and multiple customer feedbacks. If the first service attempt of a newly arriving customer is not successful, he returns to the end of the queue for another service attempt, with a different service time distribution. He

Performance Evaluation of a M/Geo[xy]/1 Queue with varying probabilities of success which Treats Two Like Jobs As a Single Entity

Science.gov (United States)

Gowrishankar, Lavanya; Bhaskar, Vidhyacharan; Sundarammal, K.

2018-04-01

The developed model comprises of a single server capable of handling two different job types X and Y type job. Job Y takes more time for execution than job X. The objective is to construct a single server which would replace the standard M/M/2 queuing model The method used to find the relative measures involves the cost equation. The properties of the service distribution are discussed in detail. The maximum likelihood estimates for the parameters are obtained. The results are analytically derived for the M/Geo[xy]/1 model. A comparison is done between the model proposed and the standard M/M/2 queue. From the numerical results, it is observed that the waiting time in queue increases as the number of cycles is increased but however it is more economical than the M/M/2 model with restriction on the number of time slices.

A finite capacity queue with Markovian arrivals and two servers with group services

Directory of Open Access Journals (Sweden)

S. Chakravarthy

1994-01-01

Full Text Available In this paper we consider a finite capacity queuing system in which arrivals are governed by a Markovian arrival process. The system is attended by two exponential servers, who offer services in groups of varying sizes. The service rates may depend on the number of customers in service. Using Markov theory, we study this finite capacity queuing model in detail by obtaining numerically stable expressions for (a the steady-state queue length densities at arrivals and at arbitrary time points; (b the Laplace-Stieltjes transform of the stationary waiting time distribution of an admitted customer at points of arrivals. The stationary waiting time distribution is shown to be of phase type when the interarrival times are of phase type. Efficient algorithmic procedures for computing the steady-state queue length densities and other system performance measures are discussed. A conjecture on the nature of the mean waiting time is proposed. Some illustrative numerical examples are presented.

On one problem of the busy period determination in queues with infinitely many servers

International Nuclear Information System (INIS)

Dvurecenskij, A.; Kuljukina, L.A.; Ososkov, G.A.

1982-01-01

In the paper the problem of the discretized cluster length probability determination based on the scanning in the track chambers is considered. This problem is solved in the frame of the queueing system with infinitely many servers as a discretized busy period probability determination of this system. The precise formulae of a probability are given and it is proved that those probabilities converge weakly to the probability distribution of the nondiscretized cluster when the discretization steps are diminished

On a first passage problem in general queueing systems with multiple vacations

Directory of Open Access Journals (Sweden)

Jewgeni H. Dshalalow

1992-01-01

Full Text Available The author studies a generalized single-server queueing system with bulk arrivals and batch service, where the server takes vacations each time the queue level falls below r(≥1 in accordance with the multiple vacation discipline. The input to the system is assumed to be a compound Poisson process modulated by the system and the service is assumed to be state dependent. One of the essential part in the analysis of the system is the employment of new techniques related to the first excess level processes. A preliminary analysis of such processes and recent results of the author on modulated processes enabled the author to obtain all major characteristics for the queueing process explicitly. Various examples and applications are discussed.

A Discrete-Time Queue with Balking, Reneging, and Working Vacations

Directory of Open Access Journals (Sweden)

Veena Goswami

2014-01-01

Full Text Available This paper presents an analysis of balking and reneging in finite-buffer discrete-time single server queue with single and multiple working vacations. An arriving customer may balk with a probability or renege after joining according to a geometric distribution. The server works with different service rates rather than completely stopping the service during a vacation period. The service times during a busy period, vacation period, and vacation times are assumed to be geometrically distributed. We find the explicit expressions for the stationary state probabilities. Various system performance measures and a cost model to determine the optimal service rates are presented. Moreover, some queueing models presented in the literature are derived as special cases of our model. Finally, the influence of various parameters on the performance characteristics is shown numerically.

discouraged by queue length

Directory of Open Access Journals (Sweden)

P. R. Parthasarathy

2001-01-01

Full Text Available The transient solution is obtained analytically using continued fractions for a state-dependent birth-death queue in which potential customers are discouraged by the queue length. This queueing system is then compared with the well-known infinite server queueing system which has the same steady state solution as the model under consideration, whereas their transient solutions are different. A natural measure of speed of convergence of the mean number in the system to its stationarity is also computed.

Transient error approximation in a Lévy queue

NARCIS (Netherlands)

Mathijsen, B.; Zwart, A.P.

2017-01-01

Motivated by a capacity allocation problem within a finite planning period, we conduct a transient analysis of a single-server queue with Lévy input. From a cost minimization perspective, we investigate the error induced by using stationary congestion measures as opposed to time-dependent measures.

Analysis of the shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1989-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal length, he joins either queue with probability ½. We show

Transient Analysis of an M/M/1 queue with Multiple Exponential Vacation and N-Policy

Directory of Open Access Journals (Sweden)

Vijayashree KV

2015-12-01

Full Text Available A single server Markovian queueing model is considered.  The arrivals are allowed to join the queue according to a Poisson distribution and the service takes place according to an exponential distribution.  Whenever the system is empty, the server goes for a vacation and return back to the system after N or more customers are found in the system. If the number of customers in the system is less than ‘’ then the server takes another vacation.  In this paper, we obtain explicit expressions for the time dependent system size probabilities of such a model using Laplace transform and generating function techniques.  Numerical illustrations are added to support the theoretical results obtained.

Analysis of the symmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On· arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability ½. By using

Analysis of the symmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two identical servers, each with exponentially distributed service times. Jobs arrive according to a Poisson stream. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins either queue with probability 1/2. By

The M/G/1 queue with quasi-restricted accessibility

NARCIS (Netherlands)

Boxma, O.J.; Perry, D.; Stadje, W.; Zacks, S.

2009-01-01

We consider single-server queues of the M/G/1 kind with a special kind of partial customer rejection called quasi-restricted accessibility (QRA). Under QRA, the actual service time assigned to an arriving customer depends on his service requirement, say x, the current workload, say w, and a

Optimal control of arrival and service rates in tandem queues

International Nuclear Information System (INIS)

Moustafa, M.S.

1995-08-01

We consider n M/M/1 queues in series. At queue one the arrival and service rates are chosen in pair from a finite set whenever there are arrivals or service completions at any queue. Customers arriving to queue L (L=1,2,...,n-1) must go on to queue L+1 after finishing service at server L. Customers arriving to queue n leave the system after finishing service at the last server. At queues 2 to n arrival and service rates are fixed. The objective is to minimize the expected discounted cost of the system over finite and infinite horizons. We show that the optimal policy is of threshold type. In order to establish the result, we formulate the optimal control problem as a Linear Programming. (author). 9 refs

Queues with waiting time dependent service

DEFF Research Database (Denmark)

Bekker, R.; Koole, G. M.; Nielsen, Bo Friis

2011-01-01

Motivated by service levels in terms of the waiting-time distribution seen, for instance, in call centers, we consider two models for systems with a service discipline that depends on the waiting time. The first model deals with a single server that continuously adapts its service rate based...... derive steady-state waiting-time distributions for both models. The results are illustrated with numerical examples....... on the waiting time of the first customer in line. In the second model, one queue is served by a primary server which is supplemented by a secondary server when the waiting of the first customer in line exceeds a threshold. Using level crossings for the waiting-time process of the first customer in line, we...

Two parallel finite queues with simultaneous services and Markovian arrivals

Directory of Open Access Journals (Sweden)

S. R. Chakravarthy

1997-01-01

Full Text Available In this paper, we consider a finite capacity single server queueing model with two buffers, A and B, of sizes K and N respectively. Messages arrive one at a time according to a Markovian arrival process. Messages that arrive at buffer A are of a different type from the messages that arrive at buffer B. Messages are processed according to the following rules: 1. When buffer A(B has a message and buffer B(A is empty, then one message from A(B is processed by the server. 2. When both buffers, A and B, have messages, then two messages, one from A and one from B, are processed simultaneously by the server. The service times are assumed to be exponentially distributed with parameters that may depend on the type of service. This queueing model is studied as a Markov process with a large state space and efficient algorithmic procedures for computing various system performance measures are given. Some numerical examples are discussed.

Markovian inventory model with two parallel queues, jockeying and impatient customers

Directory of Open Access Journals (Sweden)

Jeganathan K.

2016-01-01

Full Text Available This article presents a perishable stochastic inventory system under continuous review at a service facility consisting of two parallel queues with jockeying. Each server has its own queue, and jockeying among the queues is permitted. The capacity of each queue is of finite size L. The inventory is replenished according to an (s; S inventory policy and the replenishing times are assumed to be exponentially distributed. The individual customer is issued a demanded item after a random service time, which is distributed as negative exponential. The life time of each item is assumed to be exponential. Customers arrive according to a Poisson process and on arrival; they join the shortest feasible queue. Moreover, if the inventory level is more than one and one queue is empty while in the other queue, more than one customer are waiting, then the customer who has to be received after the customer being served in that queue is transferred to the empty queue. This will prevent one server from being idle while the customers are waiting in the other queue. The waiting customer independently reneges the system after an exponentially distributed amount of time. The joint probability distribution of the inventory level, the number of customers in both queues, and the status of the server are obtained in the steady state. Some important system performance measures in the steady state are derived, so as the long-run total expected cost rate.

The Completion of Non-Steady-State Queue Model on The Queue System in Dr. Yap Eye Hospital Yogyakarta

Science.gov (United States)

Helmi Manggala Putri, Arum; Subekti, Retno; Binatari, Nikenasih

2017-06-01

Dr Yap Eye Hospital Yogyakarta is one of the most popular reference eye hospitals in Yogyakarta. There are so many patients coming from other cities and many of them are BPJS (Badan Penyelenggara Jaminan Sosial, Social Security Administrative Bodies) patients. Therefore, it causes numerous BPJS patients were in long queue at counter C of the registration section so that it needs to be analysed using queue system. Queue system analysis aims to give queue model overview and determine its effectiveness measure. The data collecting technique used in this research are by interview and observation. After getting the arrival data and the service data of BPJS patients per 5 minutes, the next steps are investigating steady-state condition, examining the Poisson distribution, determining queue models, and counting the effectiveness measure. Based on the result of data observation on Tuesday, February 16th, 2016, it shows that the queue system at counter C has (M/M/1):(GD/∞/∞) queue model. The analysis result in counter C shows that the queue system is a non-steady-state condition. Three ways to cope a non-steady-state problem on queue system are proposed in this research such as bounding the capacity of queue system, adding the servers, and doing Monte Carlo simulation. The queue system in counter C will reach steady-state if the capacity of patients is not more than 52 BPJS patients or adding one more server. By using Monte Carlo simulation, it shows that the effectiveness measure of the average waiting time for BPJS patients in counter C is 36 minutes 65 seconds. In addition, the average queue length of BPJS patients is 11 patients.

A two-station queue with dependent preparation and service times

NARCIS (Netherlands)

Vlasiou, M.; Adan, I.J.B.F.; Boxma, O.J.

2009-01-01

We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the

State-dependent importance sampling for a slowdown tandem queue

NARCIS (Netherlands)

Miretskiy, D.I.; Scheinhardt, W.R.W.; Mandjes, M.R.H.

2011-01-01

In this paper we investigate an advanced variant of the classical (Jackson) tandem queue, viz. a two-node system with server slowdown. By this mechanism, the service speed of the upstream queue is reduced as soon as the number of jobs in the downstream queue reaches some pre-specified threshold. We

Pricing Analysis in Geo/Geo/1 Queueing System

Directory of Open Access Journals (Sweden)

Yan Ma

2015-01-01

Full Text Available This paper studies the equilibrium behavior of customers and optimal pricing strategies of servers in a Geo/Geo/1 queueing system. Two common pricing mechanisms are considered. The first one is called ex-post payment (EPP scheme where the server collects tolls proportional to queue times, and the second one is called ex-ante payment (EAP scheme where the server charges a flat fee for the total service. The server sets the toll price to maximize its own profit. It is found that, under a customer’s choice equilibrium, the two toll mechanisms are equivalent from the economic point of view. Finally, we present several numerical experiments to investigate the effects of system parameters on the equilibrium customer joining rate and servers’ profits.

On the correlation structure of a Lévy-driven queue

NARCIS (Netherlands)

A. Es-Saghouani; M.R.H. Mandjes (Michel)

2007-01-01

textabstractIn this paper we consider a single-server queue with Lévy input, and in particular its workload process (Q(t)), for t > 0, with a focus on the correlation structure. With the correlation function defined as r(t) := Cov(Q(0),Q(t))/Var Q(0) (assuming that the workload process is in

Convergence of a Queueing System in Heavy Traffic with General Abandonment Distributions

Science.gov (United States)

2010-10-08

331–391, 2005. [4] R. Atar . Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic. Ann. Appl. Probab., 15...4):2606–2650, 2005. 37 [5] R. Atar , A. Mandelbaum, and M. I. Reiman. Scheduling a multi class queue with many exponential servers: asymptotic

Analysis of the asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Analysis of the asymmetric shortest queue problem

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W. H M

1991-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load

Directory of Open Access Journals (Sweden)

Ekaterina Evdokimova

2017-01-01

Full Text Available This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i overloaded and (ii under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.

Algorithm for queueing networks with multi-rate traffic

DEFF Research Database (Denmark)

Iversen, Villy Bæk; Ko, King-Tim

2011-01-01

the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolution algorithm to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate......In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory...... of queueing networks in general, presumes that we have product form between the nodes. Otherwise, we have the state space explosion. Even so, the detailed state space of each node may become very large because there is no product form between chains inside a node. A prerequisite for product form...

Vacation queueing models theory and applications

CERN Document Server

Tian, Naishuo

2006-01-01

A classical queueing model consists of three parts - arrival process, service process, and queue discipline. However, a vacation queueing model has an additional part - the vacation process which is governed by a vacation policy - that can be characterized by three aspects: 1) vacation start-up rule; 2) vacation termination rule, and 3) vacation duration distribution. Hence, vacation queueing models are an extension of classical queueing theory. Vacation Queueing Models: Theory and Applications discusses systematically and in detail the many variations of vacation policy. By allowing servers to take vacations makes the queueing models more realistic and flexible in studying real-world waiting line systems. Integrated in the book's discussion are a variety of typical vacation model applications that include call centers with multi-task employees, customized manufacturing, telecommunication networks, maintenance activities, etc. Finally, contents are presented in a "theorem and proof" format and it is invaluabl...

Algorithm for queueing networks with multi-rate traffic

DEFF Research Database (Denmark)

Iversen, Villy Bæk; King-Tim, Ko

2011-01-01

the nodes behave as independent nodes. For closed queueing networks with multiple servers in every node and multi-rate services we may apply multidimensional convolutions to aggregate the nodes so that we end up with two nodes, the aggregated node and a single node, for which we can calculate the detailed......In this paper we present a new algorithm for evaluating queueing networks with multi-rate traffic. The detailed state space of a node is evaluated by explicit formulæ. We consider reversible nodes with multi-rate traffic and find the state probabilities by taking advantage of local balance. Theory...... of queueing networks in general presumes that we have product form between the nodes. Other ways we have the state space explosion. Even so the detailed state space of each node may easily become very large because there is no product form between chains inside a node. A prerequisite for product form...

Analysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control

Directory of Open Access Journals (Sweden)

A. D. Banik

2013-01-01

Full Text Available We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP. The service discipline is P-limited service, also called E-limited with limit variation (ELV where the server serves until either the system is emptied or a randomly chosen limit of L customers has been served. Depending on the number of customers present in the system, the server will monitor his vacation times. Queue-length distributions at various epochs such as before, arrival, arbitrary and after, departure have been obtained. Several other service disciplines like Bernoulli scheduling, nonexhaustive service, and E-limited service can be treated as special cases of the P-limited service. Finally, the total expected cost function per unit time is considered to determine locally optimal values N* of N or a maximum limit L^* of L^ as the number of customers served during a service period at a minimum cost.

Quasi-stationary analysis for queues with temporary overload

NARCIS (Netherlands)

Cheung, S.K.; Boucherie, Richardus J.; Núñez-Queija, R.

2010-01-01

Motivated by the high variation in transmission rates for document transfer in the Internet and file down loads from web servers, we study the buffer content in a queue with a fluctuating service rate. The fluctuations are assumed to be driven by an independent stochastic process. We allow the queue

A Capacity Supply Model for Virtualized Servers

Directory of Open Access Journals (Sweden)

Alexander PINNOW

2009-01-01

Full Text Available This paper deals with determining the capacity supply for virtualized servers. First, a server is modeled as a queue based on a Markov chain. Then, the effect of server virtualization on the capacity supply will be analyzed with the distribution function of the server load.

Routing policies for a partially observable two-server queueing system

NARCIS (Netherlands)

Ellens, W.; Kovács, P.; Núñez-Queija, R.; Berg, H. van den

2015-01-01

We consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues with independent

Routing policies for a partially observable two-server queueing system

NARCIS (Netherlands)

W. Ellens; P. Kovacs; J.L. van den Berg (Hans); R. Núñez Queija (Rudesindo); A. Busic; M. Gribaudo; P. Reinecke

2015-01-01

htmlabstractWe consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues

A group arrival retrial G - queue with multi optional stages of service, orbital search and server breakdown

Science.gov (United States)

Radha, J.; Indhira, K.; Chandrasekaran, V. M.

2017-11-01

A group arrival feedback retrial queue with k optional stages of service and orbital search policy is studied. Any arriving group of customer finds the server free, one from the group enters into the first stage of service and the rest of the group join into the orbit. After completion of the i th stage of service, the customer under service may have the option to choose (i+1)th stage of service with θi probability, with pI probability may join into orbit as feedback customer or may leave the system with {q}i=≤ft\\{\\begin{array}{l}1-{p}i-{θ }i,i=1,2,\\cdots k-1\\ 1-{p}i,i=k\\end{array}\\right\\} probability. Busy server may get to breakdown due to the arrival of negative customers and the service channel will fail for a short interval of time. At the completion of service or repair, the server searches for the customer in the orbit (if any) with probability α or remains idle with probability 1-α. By using the supplementary variable method, steady state probability generating function for system size, some system performance measures are discussed.

Simulation-based computation of the workload correlation function in a Levy-driven queue

NARCIS (Netherlands)

P. Glynn; M.R.H. Mandjes (Michel)

2009-01-01

htmlabstractIn this paper we consider a single-server queue with Levy input, and in particular its workload process (Q_t), focusing on its correlation structure. With the correlation function defined as r(t) := Cov(Q_0, Q_t)/Var Q_0 (assuming the workload process is in stationarity at time 0), we

Request queues for interactive clients in a shared file system of a parallel computing system

Science.gov (United States)

Bent, John M.; Faibish, Sorin

2015-08-18

Interactive requests are processed from users of log-in nodes. A metadata server node is provided for use in a file system shared by one or more interactive nodes and one or more batch nodes. The interactive nodes comprise interactive clients to execute interactive tasks and the batch nodes execute batch jobs for one or more batch clients. The metadata server node comprises a virtual machine monitor; an interactive client proxy to store metadata requests from the interactive clients in an interactive client queue; a batch client proxy to store metadata requests from the batch clients in a batch client queue; and a metadata server to store the metadata requests from the interactive client queue and the batch client queue in a metadata queue based on an allocation of resources by the virtual machine monitor. The metadata requests can be prioritized, for example, based on one or more of a predefined policy and predefined rules.

Integrated service resource reservation using queueing networks theory

DEFF Research Database (Denmark)

Brewka, Lukasz Jerzy; Iversen, Villy Bæk; Kardaras, Georgios

2014-01-01

This study analyses multi-server multi-service queueing networks with service protection. To guarantee each service a certain quality-of-service and at the same time ensure high utilisation of servers, a minimum capacity is reserved each service. In addition, all services share the remaining non...

Simulation-based computation of the workload correlation function in a Lévy-driven queue

NARCIS (Netherlands)

P. Glynn; M.R.H. Mandjes (Michel)

2010-01-01

htmlabstractIn this paper we consider a single-server queue with Levy input, and in particular its workload process (Q_t), focusing on its correlation structure. With the correlation function defined as r(t) := Cov(Q_0,Q_t)/Var(Q_0) (assuming the workload process is in stationarity at time 0), we

A Busy period analysis of the level dependent PH/PH/1/K queue

NARCIS (Netherlands)

Al Hanbali, Ahmad

2011-01-01

In this paper, we study the transient behavior of a level dependent single server queuing system with a waiting room of finite size during the busy period. The focus is on the level dependent PH/PH/1/K queue. We derive in closed form the joint transform of the length of the busy period, the number

Markov-modulated M/G/1-type queue in heavy traffic and its application to time-sharing disciplines

NARCIS (Netherlands)

H. Thorsdottir (Halldora); I.M. Verloop (Maaike)

2016-01-01

textabstractThis paper deals with a single-server queue with modulated arrivals, service requirements and service capacity. In our first result, we derive the mean of the total workload assuming generally distributed service requirements and any service discipline which does not depend on the

Approximations for Markovian multi-class queues with preemptive priorities

NARCIS (Netherlands)

van der Heijden, Matthijs C.; van Harten, Aart; Sleptchenko, Andrei

2004-01-01

We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach

Study of a Dynamic Cooperative Trading Queue Routing Control Scheme for Freeways and Facilities with Parallel Queues

OpenAIRE

Lloret-Batlle, Roger; Jayakrishnan, R.

2018-01-01

This article explores the coalitional stability of a new cooperative control policy for freeways and parallel queuing facilities with multiple servers. Based on predicted future delays per queue or lane, a VOT-heterogeneous population of agents can agree to switch lanes or queues and transfer payments to each other in order to minimize the total cost of the incoming platoon. The strategic interaction is captured by an n-level Stackelberg model with coalitions, while the cooperative structure ...

Convolution Model of a Queueing System with the cFIFO Service Discipline

Directory of Open Access Journals (Sweden)

Sławomir Hanczewski

2016-01-01

Full Text Available This article presents an approximate convolution model of a multiservice queueing system with the continuous FIFO (cFIFO service discipline. The model makes it possible to service calls sequentially with variable bit rate, determined by unoccupied (free resources of the multiservice server. As compared to the FIFO discipline, the cFIFO queue utilizes the resources of a multiservice server more effectively. The assumption in the model is that the queueing system is offered a mixture of independent multiservice Bernoulli-Poisson-Pascal (BPP call streams. The article also discusses the results of modelling a number of queueing systems to which different, non-Poissonian, call streams are offered. To verify the accuracy of the model, the results of the analytical calculations are compared with the results of simulation experiments for a number of selected queueing systems. The study has confirmed the accuracy of all adopted theoretical assumptions for the proposed analytical model.

Simulation-based computation of the workload correlation function in a Lévy-driven queue

NARCIS (Netherlands)

Glynn, P.W.; Mandjes, M.

2011-01-01

In this paper we consider a single-server queue with Lévy input, and, in particular, its workload process (Qt)t≥0, focusing on its correlation structure. With the correlation function defined as r(t):= cov(Q0, Qt) / varQ0 (assuming that the workload process is in stationarity at time 0), we first

On response time and cycle time distributions in a two-stage cyclic queue

NARCIS (Netherlands)

Boxma, O.J.; Donk, P.

1982-01-01

We consider a two-stage closed cyclic queueing model. For the case of an exponential server at each queue we derive the joint distribution of the successive response times of a custumer at both queues, using a reversibility argument. This joint distribution turns out to have a product form. The

Queue-length balance equations in multiclass multiserver queues and their generalizations

NARCIS (Netherlands)

Boon, M.A.A.; Boxma, O.J.; Kella, O.; Miyazawa, M.

2017-01-01

A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: The distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid

Queue-length balance equations in multiclass multiserver queues and their generalizations

NARCIS (Netherlands)

Boon, M.; Boxma, O.J.; Kella, O.; Miyazawa, M.

2017-01-01

A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid

Optimal control of M/M/1 two-phase queueing system with state-dependent arrival rate, server breakdowns, delayed repair, and N-policy

Science.gov (United States)

Rao, Hanumantha; Kumar, Vasanta; Srinivasa Rao, T.; Srinivasa Kumar, B.

2018-04-01

In this paper, we examine a two-stage queueing system where the arrivals are Poisson with rate depends on the condition of the server to be specific: vacation, pre-service, operational or breakdown state. The service station is liable to breakdowns and deferral in repair because of non-accessibility of the repair facility. The service is in two basic stages, the first being bulk service to every one of the customers holding up on the line and the second stage is individual to each of them. The server works under N-policy. The server needs preliminary time (startup time) to begin batch service after a vacation period. Startup times, uninterrupted service times, the length of each vacation period, delay times and service times follows an exponential distribution. The closed form of expressions for the mean system size at different conditions of the server is determined. Numerical investigations are directed to concentrate the impact of the system parameters on the ideal limit N and the minimum base expected unit cost.

On applications of excess level processes to (N,D-policy bulk queueing systems

Directory of Open Access Journals (Sweden)

Jewgeni H. Dshalalow

1996-01-01

Full Text Available The paper deals with queueing systems in which N- and D-policies are combined into one. This means that an idle or vacationing server will resume his service if the queueing or workload process crosses some specified fixed level N or D, respectively. For the proposed (N,D-policy we study the queueing processes in models with and without server vacations, with compound Poisson input, and with generally distributed service and vacation periods. The analysis of the models is essentially based on fluctuation techniques for two-dimensional marked counting processes newly developed by the author. The results enable us to arrive at stationary distributions for the embedded and continuous time parameter queueing processes in closed analytic forms, enhancing the well-known Kendall formulas and their modifications.

MX/G/1 unreliable retrial queue with option of additional service and Bernoulli vacation

Directory of Open Access Journals (Sweden)

Charan Jeet Singh

2016-03-01

Full Text Available In this paper, retrial queue with unreliable server and bulk arrivals is investigated. The server is capable of providing m-optional services and any one of these available services, may be rendered to the customer after the first essential service if the customer opts for the same. It is assumed that the server may fail while rendering any phase of service and undergoes for the immediate repair. After the completion of the service of a customer, the server may either take a vacation for a random period or may continue to provide the service to the other customers waiting in the queue. The supplementary variables corresponding to service time, repair time and retrial time are incorporated to determine the queue size distribution. To examine the effect of different parameters on the performance measures of the system, the numerical illustration is given which is supported by numerical simulation and sensitivity analysis.

Matrix-geometric analysis of the shortest queue problem with threshold jockeying

NARCIS (Netherlands)

Zijm, Willem H.M.; Adan, I.J.B.F.; Wessels, J.

1993-01-01

In this paper we study a system consisting of c parallel servers with possibly different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. An arriving job joins the shortest queue, where in case of multiple shortest queues, one of these

Analysis of the asymmetric shortest queue problem : part 2: numerical analysis

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first

Analysis of the asymmetric shortest queue problem : Part 1: theoretical analysis

NARCIS (Netherlands)

Adan, I.J.B.F.; Wessels, J.; Zijm, W.H.M.

1990-01-01

In this paper we study a system consisting of two parallel servers with different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths. be joins the first

On the busy period of discretized GI/GI/infinity queue

International Nuclear Information System (INIS)

Dvurecenskij, A.; Ososkov, G.A.

1982-01-01

The problem of determining the distribution of the busy period, i. e., of the time when at least one customer is served, of the discretized queueing system with infinitely many servers is investigated. Moreover, the idle period and the cycle of a queue are studied. The recurrent formulae are determined and in particular case of a queue with the geometric input the simpler recurrent formulae are given. Those problems arise in the discrete blob length determination in track chambers in high energy physics

Performance analysis of preemptive priority retrial queue with immediate Bernoulli feedback under working vacations and vacation interruption

Directory of Open Access Journals (Sweden)

Pakkirisami Rajadurai

2016-10-01

Full Text Available The present investigation deals with performance analysis of single server preemptive priority retrial queue with immediate Bernoulli feedback. There are two types of customers are considered, which are priority customers and ordinary customers. The priority customers do not form any queue and have an exclusive preemptive priority to receive their services over ordinary customers. After completion of regular service for ordinary customer, the customer is allowed to make an immediate feedback with probability r. When the orbit becomes empty at service completion instant for a priority customer or ordinary customer; the server goes for multiple working vacations. By using the supplementary variable technique, we obtained the steady state probability generating functions for the system/orbit. Some important system performance measures, the mean busy period and the mean busy cycle are discussed. Finally, some numerical examples are presented.

On a Batch Arrival Queuing System Equipped with a Stand-by Server during Vacation Periods or the Repairs Times of the Main Server

Directory of Open Access Journals (Sweden)

Rehab F. Khalaf

2011-01-01

Full Text Available We study a queuing system which is equipped with a stand-by server in addition to the main server. The stand-by server provides service to customers only during the period of absence of the main server when either the main server is on a vacation or it is in the state of repairs due to a sudden failure from time to time. The service times, vacation times, and repair times are assumed to follow general arbitrary distributions while the stand-by service times follow exponential distribution. Supplementary variables technique has been used to obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers, and the average waiting time in the queue while the MathCad software has been used to illustrate the numerical results in this work.

Strategies for a centralized single product multiclass M/G/1 make-to-stock queue

OpenAIRE

Abouee-Mehrizi, Hossein; Balcıoğlu, Ahmet Barış; Balcioglu, Ahmet Baris; Baron, Opher

2012-01-01

Make-to-stock queues are typically investigated in the M/M/1 settings. For centralized single-item systems with backlogs, the multilevel rationing (MR) policy is established as optimal and the strict priority (SP) policy is a practical compromise, balancing cost and ease of implementation. However, the optimal policy is unknown when service time is general, i.e., for M/G/1 queues. Dynamic programming, the tool commonly used to investigate the MR policy in make-to-stock queues, is less practic...

M/M/1 RETRIAL QUEUEING SYSTEM WITH VACATION INTERRUPTIONS UNDER PRE-EMPTIVE PRIORITY SERVICE

Directory of Open Access Journals (Sweden)

Muthu Ganapathi Subramanian Annasamy

2010-10-01

Full Text Available Consider a single server retrial queueing system with pre-emptive priority service and vacation interruptions in which customers arrive in a Poisson process with arrival rate λ1 for low priority customers and λ2 for high priority customers. Further it is assume that the service times follow an exponential distribution with parameters μ1 and μ2 for low and high priority customers respectively. The retrial is introduced for low priority customers only. The server goes for vacation after exhaustively completing the service to both types of customers.  The vacation rate follows an exponential distribution with parameter α. The concept of vacation interruption is used in this paper that is the server comes from the vacation into normal working condition without completing his vacation period subject to some conditions. Let k be the maximum number of waiting spaces for high priority customers in front of the service station. The high priority customers will be governed by the pre-emptive priority service. We assume that the access from orbit to the service facility is governed by the classical retrial policy. This model is solved by using Matrix geometric Technique. Numerical  study  have been done for Analysis of Mean number of low priority customers in the orbit (MNCO, Mean number of high priority customers in the queue(MPQL,Truncation level (OCUT,Probability of server free and Probabilities  of server busy with low and high priority customers and probability of server in vacation for various values of λ1 , λ2 , μ1 , μ2, α and σ  in elaborate manner and also various particular cases of  this model have been discussed.

Tool supported modeling of sensor communication networks by using finite-source priority retrial queues

Directory of Open Access Journals (Sweden)

Tamas Berczes

2012-06-01

Full Text Available The main aim of the present paper is to draw the attention of the readers of this special issue to the modeling issues of sensor networks. The novelty of this investigation is the introduction of servers vacation combined with priority customers for finite-source retrial queues and its application to wireless sensor networks. In this paper we analyze a priority finite-source retrial queue with repeated vacations. Two types of priority customers are defined, customers with priority 1 (P1 go directly to an ordinary FIFO queue. However, if customers with priority 2 (P2 find the server in busy or unavailable state go to the orbit. These customers stay in the orbit and retry their request until find the server in idle and available state. We assume that P1 customers have non-preemptive priority over P2 customers. The server starts with a listening period and if no customer arrive during this period it will enter in the vacation mode. When the vacation period is terminated, then the node wakes up. If there is a P1 customer in the queue the server begin to serve it, and when there is no any P1 customer, the node will remain awake for exponentially distributed time period. If that period expires without arrivals the node will enter in the next sleeping period. All random variables involved in model construction are supposed to be independent and exponentially distributed ones. Our main interest is to give the main steady-state performance measures of the system computed by the help of the MOSEL tool. Several Figures illustrate the effect of input parameters on the mean response time.

Two Coupled Queues with Vastly Different Arrival Rates: Critical Loading Case

Directory of Open Access Journals (Sweden)

Charles Knessl

2011-01-01

Full Text Available We consider two coupled queues with a generalized processor sharing service discipline. The second queue has a much smaller Poisson arrival rate than the first queue, while the customer service times are of comparable magnitude. The processor sharing server devotes most of its resources to the first queue, except when it is empty. The fraction of resources devoted to the second queue is small, of the same order as the ratio of the arrival rates. We assume that the primary queue is heavily loaded and that the secondary queue is critically loaded. If we let the small arrival rate to the secondary queue be O(ε, where 0≤ε≪1, then in this asymptotic limit the number of customers in the first queue will be large, of order O(ε-1, while that in the second queue will be somewhat smaller, of order O(ε-1/2. We obtain a two-dimensional diffusion approximation for this model and explicitly solve for the joint steady state probability distribution of the numbers of customers in the two queues. This work complements that in (Morrison, 2010, which the second queue was assumed to be heavily or lightly loaded, leading to mean queue lengths that were O(ε-1 or O(1, respectively.

Pricing in M/M/1 queues when cost of waiting in queue differs from cost of waiting in service

Directory of Open Access Journals (Sweden)

Görkem Sarıyer

2016-11-01

Full Text Available Service providers can adjust the entrance price to the state of the demand in real life service systems where the customers' decision to receive the service, is based on this price, state of demand and other system parameters. We analyzed service provider's short and long term pricing problems in unobservable M/M/1 queues having the rational customers, where, for customers, the unit cost of waiting in the queue is higher than unit cost of waiting in the service. We showed that waiting in the queue has a clear negative effect on customers’ utilities, hence the service provider's price values. We also showed that, in the short term, monopolistic pricing is optimal for congested systems with high server utilization levels, whereas in the long term, market capturing pricing is more profitable.

Effect of information, uncertainty and parameter variability on profits in a queue with various pricing strategies

Science.gov (United States)

Sun, Wei; Li, Shiyong

2014-08-01

This paper presents an unobservable single-server queueing system with three types of uncertainty, where the service rate, or waiting cost or service quality is random variable that may obtain n(n > 2) values. The information about the realised values of parameters is only known to the server. We are concerned about the server's behaviour: revealing or concealing the information to customers. The n-value assumption and the server's behaviour enable us to consider various pricing strategies. In this paper, we analyse the effect of information and uncertainty on profits and make comparisons between the profits under different pricing strategies. Moreover, as for parameter variability reflected by the number of each parameter's possible choices n, we observe the effect of variable n on all types of profits and find that revealing the parameter information can much more benefit the server with the increase of n.

Age Replacement and Service Rate Control of Stochastically Degrading Queues

National Research Council Canada - National Science Library

Chapin, Patrick

2004-01-01

This thesis considers the problem of optimally selecting a periodic replacement time for a multiserver queueing system in which each server is subject to degradation as a function of the mean service...

Analysis of a multi-server queueing model of ABR

NARCIS (Netherlands)

R. Núñez Queija (Rudesindo); O.J. Boxma (Onno)

1996-01-01

textabstractIn this paper we present a queueing model for the performance a-na-ly-sis of ABR traffic in ATM networks. We consider a multi-channel service station with two types of customers, the first having preemptive priority over the second. The arrivals occur according to two independent Poisson

Analysis of Single-Server Queue with Phase-Type Service and Energy Harvesting

Directory of Open Access Journals (Sweden)

Sergey A. Dudin

2016-01-01

Full Text Available We propose a queueing model suitable, for example, for modelling operation of nodes of sensor networks. The sensor node senses a random field and generates packets to be transmitted to the central node. The sensor node has a battery of a finite capacity and harvests energy during its operation from outside (using solar cells, wind turbines, piezoelectric cells, etc.. We assume that, generally speaking, service (transmission of a packet consists of a random number of phases and implementation of each phase requires a unit of energy. If the battery becomes empty, transmission is failed. To reduce the probability of forced transmission termination, we suggest that the packet can be accepted for transmission only when the number of energy units is greater than or equal to some threshold. Under quite general assumptions about the pattern of the arrival processes of packets and energy, we compute the stationary distributions of the system states and the waiting time of a packet in the system and numerically analyze performance measures of the system as functions of the threshold. Validity of Little’s formula and its counterpart is verified.

Statistical Inference for a two station tandem queue with atmost one customer to wait between the stations

Directory of Open Access Journals (Sweden)

Vaidya Nathan

2012-03-01

Full Text Available A maximum likelihood estimator (MLE, a consistent asymptotically normal (CAN estimator and asymptotic confidence limits for the expected number of customers in the system for a sequential two station, single server system with Poisson input and exponential service, where no queue is allowed in front of station 1 and atmost one customer is allowed to wait between the stations and with blocking are obtained.

Positive Harris recurrence and diffusion scale analysis of a push pull queueing network

NARCIS (Netherlands)

Nazarathy, J.; Weiss, G.

2010-01-01

We consider a push pull queueing network with two servers and two types of job which are processed by the two servers in opposite order, with stochastic generally distributed processing times. This push pull network was introduced by Kopzon and Weiss, who assumed exponential processing times. It is

A queueing theory description of fat-tailed price returns in imperfect financial markets

Science.gov (United States)

Lamba, H.

2010-09-01

In a financial market, for agents with long investment horizons or at times of severe market stress, it is often changes in the asset price that act as the trigger for transactions or shifts in investment position. This suggests the use of price thresholds to simulate agent behavior over much longer timescales than are currently used in models of order-books. We show that many phenomena, routinely ignored in efficient market theory, can be systematically introduced into an otherwise efficient market, resulting in models that robustly replicate the most important stylized facts. We then demonstrate a close link between such threshold models and queueing theory, with large price changes corresponding to the busy periods of a single-server queue. The distribution of the busy periods is known to have excess kurtosis and non-exponential decay under various assumptions on the queue parameters. Such an approach may prove useful in the development of mathematical models for rapid deleveraging and panics in financial markets, and the stress-testing of financial institutions.

On-line single server dial-a-ride problems

NARCIS (Netherlands)

Feuerstein, E.; Stougie, L.

1998-01-01

In this paper results on the dial-a-ride problem with a single server are presented. Requests for rides consist of two points in a metric space, a source and a destination. A ride has to be made by the server from the source to the destination. The server travels at unit speed in the metric space

The Geo/Geo/1+1 Queueing System with Negative Customers

OpenAIRE

Ma, Zhanyou; Guo, Yalin; Wang, Pengcheng; Hou, Yumei

2013-01-01

We study a Geo/Geo/1+1 queueing system with geometrical arrivals of both positive and negative customers in which killing strategies considered are removal of customers at the head (RCH) and removal of customers at the end (RCE). Using quasi-birth-death (QBD) process and matrix-geometric solution method, we obtain the stationary distribution of the queue length, the average waiting time of a new arrival customer, and the probabilities of servers in busy or idle period, respectively. Finally, ...

State dependent arrival in bulk retrial queueing system with immediate Bernoulli feedback, multiple vacations and threshold

Science.gov (United States)

Niranjan, S. P.; Chandrasekaran, V. M.; Indhira, K.

2017-11-01

The objective of this paper is to analyse state dependent arrival in bulk retrial queueing system with immediate Bernoulli feedback, multiple vacations, threshold and constant retrial policy. Primary customers are arriving into the system in bulk with different arrival rates λ a and λ b . If arriving customers find the server is busy then the entire batch will join to orbit. Customer from orbit request service one by one with constant retrial rate γ. On the other hand if an arrival of customers finds the server is idle then customers will be served in batches according to general bulk service rule. After service completion, customers may request service again with probability δ as feedback or leave from the system with probability 1 - δ. In the service completion epoch, if the orbit size is zero then the server leaves for multiple vacations. The server continues the vacation until the orbit size reaches the value ‘N’ (N > b). At the vacation completion, if the orbit size is ‘N’ then the server becomes ready to provide service for customers from the main pool or from the orbit. For the designed queueing model, probability generating function of the queue size at an arbitrary time will be obtained by using supplementary variable technique. Various performance measures will be derived with suitable numerical illustrations.

Analysis of Repairable Geo/G/1 Queues with Negative Customers

Directory of Open Access Journals (Sweden)

Doo Ho Lee

2014-01-01

Full Text Available We consider discrete-time Geo/G/1 queues with negative customers and a repairable server. The server is subject to failure due to a negative customer arrival. As soon as a negative customer arrives at a system, the server fails and one positive (ordinary customer is forced to leave. At a failure instant, the server is turned off and the repair process immediately begins. We construct the mathematical model and present the probability generating functions of the system size distribution and the FCFS sojourn time distribution. Finally, some numerical examples are given to show the influence of negative customer arrival on the performance measures of the system.

Scaling and comparison of fluid limits of queues applied to call centers with time-varying parameters

NARCIS (Netherlands)

Jiménez, T.; Koole, G.M.

2004-01-01

Temporary overload situations in queues can be approximated by fluid queues. We strengthen earlier results on the comparison of multi-server tandem systems with their fluid limits. At the same time we give conditions under which economies of scale hold. We apply the results to call centers. ©

Applied discrete-time queues

CERN Document Server

Alfa, Attahiru S

2016-01-01

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...

A single-server Markovian queuing system with discouraged arrivals and retention of reneged customers

Directory of Open Access Journals (Sweden)

Kumar Rakesh

2014-01-01

Full Text Available Customer impatience has a very negative impact on the queuing system under investigation. If we talk from business point of view, the firms lose their potential customers due to customer impatience, which affects their business as a whole. If the firms employ certain customer retention strategies, then there are chances that a certain fraction of impatient customers can be retained in the queuing system. A reneged customer may be convinced to stay in the queuing system for his further service with some probability, say q and he may abandon the queue without receiving the service with a probability p(=1− q. A finite waiting space Markovian single-server queuing model with discouraged arrivals, reneging and retention of reneged customers is studied. The steady state solution of the model is derived iteratively. The measures of effectiveness of the queuing model are also obtained. Some important queuing models are derived as special cases of this model.

A diffusion model for two parallel queues with processor sharing: transient behavior and asymptotics

Directory of Open Access Journals (Sweden)

Charles Knessl

1999-01-01

Full Text Available We consider two identical, parallel M/M/1 queues. Both queues are fed by a Poisson arrival stream of rate λ and have service rates equal to μ. When both queues are non-empty, the two systems behave independently of each other. However, when one of the queues becomes empty, the corresponding server helps in the other queue. This is called head-of-the-line processor sharing. We study this model in the heavy traffic limit, where ρ=λ/μ→1. We formulate the heavy traffic diffusion approximation and explicitly compute the time-dependent probability of the diffusion approximation to the joint queue length process. We then evaluate the solution asymptotically for large values of space and/or time. This leads to simple expressions that show how the process achieves its stead state and other transient aspects.

A queueing model with randomized depletion of inventory

NARCIS (Netherlands)

Albrecher, H.-J.; Boxma, O.J.; Essifi, R.; Kuijstermans, A.C.M.

2015-01-01

In this paper we study an M/M/1 queue, where the server continues to work during idle periods and builds up inventory. This inventory is used for new arriving service requirements, but it is completely emptied at random epochs of a Poisson process, whose rate depends on the current level of the

Analysis of an MAP/PH/1 Queue with Flexible Group Service

Directory of Open Access Journals (Sweden)

Brugno Arianna

2017-03-01

Full Text Available A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian arrival process. An individual customer’s service time has a phase-type distribution. The service time of a batch is defined as the maximum of the individual service times of the customers which form the batch. The dynamics of such a system are described by a multi-dimensional Markov chain. An ergodicity condition for this Markov chain is derived, a stationary probability distribution of the states is computed, and formulas for the main performance measures of the system are provided. The Laplace–Stieltjes transform of the waiting time is obtained. Results are numerically illustrated.

Design heuristic for parallel many server systems under FCFS-ALIS

NARCIS (Netherlands)

Adan, I.J.B.F.; Boon, M.; Weiss, G.

2016-01-01

We study a parallel service queueing system with servers of types $s_1,\\ldots,s_J$, customers of types $c_1,\\ldots,c_I$, bipartite compatibility graph $\\mathcal{G}$, where arc $(c_i, s_j)$ indicates that server type $s_j$ can serve customer type $c_i$, and service policy of first come first served

Response times in a two-node queueing network with feedback

NARCIS (Netherlands)

van der Mei, R.D.; Gijsen, B.M.M.; in 't Veld, N.; van den Berg, J.L.

2002-01-01

The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a

Response times in a two-node queueing network with feedback

NARCIS (Netherlands)

van der Mei, R.D.; Gijsen, B.M.M.; Gijsen, B.M.M.; in 't Veld, N.; van den Berg, Hans Leo

The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in a two-node open queueing network with a

Optimal control of two queues in series

International Nuclear Information System (INIS)

Moustafa, M.S.; Mohammed, R.M.

1994-08-01

In this paper we give a fairly complete survey of the available results on the control of arrival and service rates for both single queue and networks of queues. We also study two M/M/1 queues in series. At the first queue, the arrival and the service rates are chosen in pair from a finite set whenever the queue lengths at both queues change. Each choice has a switching cost depending on the chosen rates and the queue lengths. At the second queue, the arrival and the service rates are fixed. Our objective is to find a policy for dynamically choosing rates, based on the current rates and queues lengths that minimizes the expected total discounted cost over a finite horizon, numerical results are given. (author). 8 refs, 1 fig

Single-server blind quantum computation with quantum circuit model

Science.gov (United States)

Zhang, Xiaoqian; Weng, Jian; Li, Xiaochun; Luo, Weiqi; Tan, Xiaoqing; Song, Tingting

2018-06-01

Blind quantum computation (BQC) enables the client, who has few quantum technologies, to delegate her quantum computation to a server, who has strong quantum computabilities and learns nothing about the client's quantum inputs, outputs and algorithms. In this article, we propose a single-server BQC protocol with quantum circuit model by replacing any quantum gate with the combination of rotation operators. The trap quantum circuits are introduced, together with the combination of rotation operators, such that the server is unknown about quantum algorithms. The client only needs to perform operations X and Z, while the server honestly performs rotation operators.

On a random area variable arising in discrete-time queues and compact directed percolation

International Nuclear Information System (INIS)

Kearney, Michael J

2004-01-01

A well-known discrete-time, single-server queueing system with mean arrival rate λ and mean departure rate μ is considered from the perspective of the area, A, swept out by the queue occupation process during a busy period. We determine the exact form of the tail of the distribution, Pr(A > x); in particular, we show that Pr(A > x) ∼ Cx -1/4 exp(-Dx 1/2 ) for all ρ ≠ 1, where ρ ≡ λ/μ, and expressions for C and D are given. For the critical case ρ = 1 we show that Pr(A > x) ∼ C'x -1/3 , with C' also given. A simple mapping, used in the derivation, establishes a connection with compact directed percolation on a square lattice. As a corollary, therefore, we are also able to specify the large-area asymptotic behaviour of this model at all points in the phase diagram. This extends previous scaling results, which are only valid close to the percolation threshold

Some reflections on the Renewal-theory paradox in queueing theory

Directory of Open Access Journals (Sweden)

Robert B. Cooper

1998-01-01

Full Text Available The classical renewal-theory (waiting time, or inspection paradox states that the length of the renewal interval that covers a randomly-selected time epoch tends to be longer than an ordinary renewal interval. This paradox manifests itself in numerous interesting ways in queueing theory, a prime example being the celebrated Pollaczek-Khintchine formula for the mean waiting time in the M/G/1 queue. In this expository paper, we give intuitive arguments that “explain” why the renewal-theory paradox is ubiquitous in queueing theory, and why it sometimes produces anomalous results. In particular, we use these intuitive arguments to explain decomposition in vacation models, and to derive formulas that describe some recently-discovered counterintuitive results for polling models, such as the reduction of waiting times as a consequence of forcing the server to set up even when no work is waiting.

Transient analysis of an M/M/1 queue with multiple vacations

Directory of Open Access Journals (Sweden)

Kaliappan Kalidass

2014-05-01

Full Text Available In this paper, we have obtained explicit expressions for the time dependent probabilities of the M/M/1  queue with server vacations under a multiple vacation scheme. The corresponding steady state probabilities have been obtained. We also obtain the time dependent performance measures of the systems

Operational behavior of the MAP/G/1 queue under N-policy with a single vacation and set-up

Directory of Open Access Journals (Sweden)

Ho Woo Lee

2002-01-01

Full Text Available This paper considers the MAP/G/1 queue under N-policy with a single vacation and set-up. We derive the vector generating functions of the queue length at an arbitrary time and at departures in decomposed forms. We also derive the Laplace-Stieltjes transform of the waiting time. Computation algorithms for mean performance measures are provided.

Analysis of MAP/PH(1, PH(2/2 Queue with Bernoulli Vacations

Directory of Open Access Journals (Sweden)

V. Thangaraj

2008-12-01

Full Text Available We consider a two-heterogeneous-server queueing system with Bernoulli vacation in which customers arrive according to a Markovian arrival process (MAP. Servers returning from vacation immediately take another vacation if no customer is waiting. Using matrix-geometric method, the steady-state probability of the number of customers in the system is investigated. Some important performance measures are obtained. The waiting time distribution and the mean waiting time are also discussed. Finally, some numerical illustrations are provided.

The busy period of order n in the GI/D/infinity queue

International Nuclear Information System (INIS)

Dvurecenskij, A.

1982-01-01

The problem of determination of the distribution function, integral equation and all moments of the busy period of order n, that is, the period when at least n servers are busy from infinitely many servers of the GI/D/infinity queueing system are investigated. The idle period of order n, i. e., the period between two neighbouring busy periods of order n is also studied. Those problems arise in the blob length determination in track chambers in high energy physics

On the Two-Moment Approximation of the Discrete-Time GI/G/1 Queue with a Single Vacation

Directory of Open Access Journals (Sweden)

Doo Ho Lee

2016-01-01

Full Text Available We consider a discrete-time GI/G/1 queue in which the server takes exactly one vacation each time the system becomes empty. The interarrival times of arriving customers, the service times, and the vacation times are all generic discrete random variables. Under our study, we derive an exact transform-free expression for the stationary system size distribution through the modified supplementary variable technique. Utilizing obtained results, we introduce a simple two-moment approximation for the system size distribution. From this, approximations for the mean system size along with the system size distribution could be obtained. Finally, some numerical examples are given to validate the proposed approximation method.

Look-ahead policies for admission to a single server loss system

NARCIS (Netherlands)

Nawijn, W.M.

1990-01-01

Consider a single server loss system in which the server, being idle, may reject or accept an arriving customer for service depending on the state at the arrival epoch. It is assumed that at every arrival epoch the server knows the service time of the arriving customer, the arrival time of the next

Openlobby: an open game server for lobby and matchmaking

Science.gov (United States)

Zamzami, E. M.; Tarigan, J. T.; Jaya, I.; Hardi, S. M.

2018-03-01

Online Multiplayer is one of the most essential feature in modern games. However, while developing a multiplayer feature can be done with a simple computer networking programming, creating a balanced multiplayer session requires more player management components such as game lobby and matchmaking system. Our objective is to develop OpenLobby, a server that available to be used by other developers to support their multiplayer application. The proposed system acts as a lobby and matchmaker where queueing players will be matched to other player according to a certain criteria defined by developer. The solution provides an application programing interface that can be used by developer to interact with the server. For testing purpose, we developed a game that uses the server as their multiplayer server.

Networks of ·/G/∞ queues with shot-noise-driven arrival intensities

NARCIS (Netherlands)

Koops, D.T.; Boxma, O.J.; Mandjes, M.R.H.

2017-01-01

We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by a shot-noise process. A shot-noise rate emerges naturally in cases where the arrival rate tends to exhibit sudden increases (or shots) at random

A finite-buffer queue with a single vacation policy: An analytical study with evolutionary positioning

Directory of Open Access Journals (Sweden)

Woźniak Marcin

2014-12-01

Full Text Available In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments are presented. A cost optimization problem is solved using an evolutionary strategy for a class of queueing systems described by exponential and Erlang distributions.

Two coupled Lévy queues with independent input

OpenAIRE

Jevgenijs Ivanovs; Onno Boxma

2014-01-01

We consider a pair of coupled queues driven by independent spectrally-positive Lévy processes. With respect to the bi-variate workload process this framework includes both the coupled processor model and the two-server fluid network with independent Lévy inputs. We identify the joint transform of the stationary workload distribution in terms of Wiener-Hopf factors corresponding to two auxiliary Lévy processes with explicit Laplace exponents. We reinterpret and extend the ideas of Cohen and Bo...

Single Sign-on Authentication server (part of CLARIN infrastructure)

NARCIS (Netherlands)

de Jong, H.A.; Maas, M.

2013-01-01

The Huygens Single Sign-on server allows federated logins (authentication) via SURFconext affiliates thus facilitating all connected (academic / research) institutes to use online Huygens ING software services.

The MX/G/1 queue with queue length dependent service times

Directory of Open Access Journals (Sweden)

Bong Dae Choi

2001-01-01

Full Text Available We deal with the MX/G/1 queue where service times depend on the queue length at the service initiation. By using Markov renewal theory, we derive the queue length distribution at departure epochs. We also obtain the transient queue length distribution at time t and its limiting distribution and the virtual waiting time distribution. The numerical results for transient mean queue length and queue length distributions are given.

The queue-length in GI/G/s queues

Directory of Open Access Journals (Sweden)

Le Gall Pierre

2000-01-01

Full Text Available The distribution of the queue-length in the stationary symmetrical GI/G/s queue is given with an application to the M/G/s queue, particularly in the case of the combination of several packet traffics, with various constant service times, to dimension the buffer capacity.

A Novel Analytic Technique for the Service Station Reliability in a Discrete-Time Repairable Queue

Directory of Open Access Journals (Sweden)

Renbin Liu

2013-01-01

Full Text Available This paper presents a decomposition technique for the service station reliability in a discrete-time repairable GeomX/G/1 queueing system, in which the server takes exhaustive service and multiple adaptive delayed vacation discipline. Using such a novel analytic technique, some important reliability indices and reliability relation equations of the service station are derived. Furthermore, the structures of the service station indices are also found. Finally, special cases and numerical examples validate the derived results and show that our analytic technique is applicable to reliability analysis of some complex discrete-time repairable bulk arrival queueing systems.

A numerical solution for the multi-server queue with hyper-exponential service times

NARCIS (Netherlands)

de Smit, J.H.A.

1983-01-01

In this paper we present a numerical method for the queue GI/H2/s, which is based on general results for GI/Hm/s. We give a complete description of the algorithm which yields exact results for the steady distributions of the actual waiting time, the virtual waiting time and the number of customers

Concurrent array-based queue

Science.gov (United States)

Heidelberger, Philip; Steinmacher-Burow, Burkhard

2015-01-06

According to one embodiment, a method for implementing an array-based queue in memory of a memory system that includes a controller includes configuring, in the memory, metadata of the array-based queue. The configuring comprises defining, in metadata, an array start location in the memory for the array-based queue, defining, in the metadata, an array size for the array-based queue, defining, in the metadata, a queue top for the array-based queue and defining, in the metadata, a queue bottom for the array-based queue. The method also includes the controller serving a request for an operation on the queue, the request providing the location in the memory of the metadata of the queue.

A fixed-size batch service queue with vacations

Directory of Open Access Journals (Sweden)

Ho Woo Lee

1996-01-01

Full Text Available The paper deals with batch service queues with vacations in which customers arrive according to a Poisson process. Decomposition method is used to derive the queue length distributions both for single and multiple vacation cases. The authors look at other decomposition techniques and discuss some related open problems.

A discrete-time queueing system with changes in the vacation times

Directory of Open Access Journals (Sweden)

Atencia Ivan

2016-06-01

Full Text Available This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.

Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues

NARCIS (Netherlands)

Cheung, S.K.; van den Berg, Hans Leo; Boucherie, Richardus J.

2005-01-01

We obtain a decomposition result for the steady state queue length distribution in egalitarian processor-sharing (PS) models. In particular, for an egalitarian PS queue with $K$ customer classes, we show that the marginal queue length distribution for class $k$ factorizes over the number of other

Approximate anlysis of an unreliable $M/M/c$ retrial queue with phase merging algorithm.

Directory of Open Access Journals (Sweden)

faiza BELARBI

2016-06-01

Full Text Available In this paper, we investigate an approximate analysis of unreliable $M/M/c$ retrial queue with $c\\geq 3$ in which all servers are subject to breakdowns and repairs. Arriving customers that are unable to access a server due to congestion or failure can choose to enter a retrial orbit for an exponentially distributed amount of time and persistently attempt to gain access to a server, or abandon their request and depart the system. Once a customer is admitted to a service station, they remain there for a random duration until service is complete and then depart the system. However, if the server fails during service, i.e., an active breakdown, the customer may choose to abandon the system or proceed directly to the retrial orbit while the server begins repair immediately. In the unreliable model, there are no exact solutions when the number of servers exceeds one. Therefore, we seek to approximate the steady-state joint distribution of the number of customers in orbit and the status of the $c$ servers for the case of Markovian arrival and service times. Our approach to deriving the approximate steady-state probabilities employs a phase-merging algorithm.

Vacation and polling models with retrials

NARCIS (Netherlands)

Boxma, O.J.; Resing, J.A.C.; Horváth, A.; Wolter, K.

2014-01-01

We study a vacation-type queueing model, and a single-server multi-queue polling model, with the special feature of retrials. Just before the server arrives at a station there is some deterministic glue period. Customers (both new arrivals and retrials) arriving at the station during this glue

Analysis and optimization of vacation and polling models with retrials

NARCIS (Netherlands)

Abidini, M.A.; Boxma, O.J.; Resing, J.A.C.

2016-01-01

We study a vacation-type queueing model, and a single-server multi-queue polling model, with the special feature of retrials. Just before the server arrives at a station there is some deterministic glue period. Customers (both new arrivals and retrials) arriving at the station during this glue

Analysis and optimization of vacation and polling models with retrials

NARCIS (Netherlands)

Abidini, M.A.; Boxma, O.J.; Resing, J.A.C.

2015-01-01

We study a vacation-type queueing model, and a single-server multi-queue polling model, with the special feature of retrials. Just before the server arrives at a station there is some deterministic glue period. Customers (both new arrivals and retrials) arriving at the station during this glue

Slowdown in the $M/M/1$ discriminatory processor-sharing queue

NARCIS (Netherlands)

Cheung, S.K.; Kim, Bara; Kim, Jeongsim

2008-01-01

We consider a queue with multiple K job classes, Poisson arrivals, and exponentially distributed required service times in which a single processor serves according to the discriminatory processor-sharing (DPS) discipline. For this queue, we obtain the first and second moments of the slowdown, which

GEOM/GEOM[a]/1/ queue with late arrival system with delayed access and delayed multiple working vacations

Directory of Open Access Journals (Sweden)

Cheng Jiang

2014-01-01

Full Text Available This paper considers a discrete-time bulk-service queue with infinite buffer space and delay multiple working vacations. Considering a late arrival system with delayed access (LAS-AD, it is assumed that the inter-arrival times, service times, vacation times are all geometrically distributed. The server does not take a vacation immediately at service complete epoch but keeps idle period. According to a bulk-service rule, at least one customer is needed to start a service with a maximum serving capacity 'a'. Using probability analysis method and displacement operator method, the queue length and the probability generating function of waiting time at pre-arrival epochs are obtained. Furthermore, the outside observer’s observation epoch queue length distributions are given. Finally, computational examples with numerical results in the form of graphs and tables are discussed.

Queueing networks a fundamental approach

CERN Document Server

Dijk, Nico

2011-01-01

This handbook aims to highlight fundamental, methodological and computational aspects of networks of queues to provide insights and to unify results that can be applied in a more general manner.  The handbook is organized into five parts: Part 1 considers exact analytical results such as of product form type. Topics include characterization of product forms by physical balance concepts and simple traffic flow equations, classes of service and queue disciplines that allow a product form, a unified description of product forms for discrete time queueing networks, insights for insensitivity, and aggregation and decomposition results that allow subnetworks to be aggregated into single nodes to reduce computational burden. Part 2 looks at monotonicity and comparison results such as for computational simplification by either of two approaches: stochastic monotonicity and ordering results based on the ordering of the proces generators, and comparison results and explicit error bounds based on an underlying Markov r...

The WorkQueue project - a task queue for the CMS workload management system

Science.gov (United States)

Ryu, S.; Wakefield, S.

2012-12-01

We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

The WorkQueue project - a task queue for the CMS workload management system

International Nuclear Information System (INIS)

Ryu, S; Wakefield, S

2012-01-01

We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

The WorkQueue project: A task queue for the CMS workload management system

Energy Technology Data Exchange (ETDEWEB)

Ryu, S. [Fermilab; Wakefield, Stuart [Imperial Coll., London

2012-01-01

We present the development and first experience of a new component (termed WorkQueue) in the CMS workload management system. This component provides a link between a global request system (Request Manager) and agents (WMAgents) which process requests at compute and storage resources (known as sites). These requests typically consist of creation or processing of a data sample (possibly terabytes in size). Unlike the standard concept of a task queue, the WorkQueue does not contain fully resolved work units (known typically as jobs in HEP). This would require the WorkQueue to run computationally heavy algorithms that are better suited to run in the WMAgents. Instead the request specifies an algorithm that the WorkQueue uses to split the request into reasonable size chunks (known as elements). An advantage of performing lazy evaluation of an element is that expanding datasets can be accommodated by having job details resolved as late as possible. The WorkQueue architecture consists of a global WorkQueue which obtains requests from the request system, expands them and forms an element ordering based on the request priority. Each WMAgent contains a local WorkQueue which buffers work close to the agent, this overcomes temporary unavailability of the global WorkQueue and reduces latency for an agent to begin processing. Elements are pulled from the global WorkQueue to the local WorkQueue and into the WMAgent based on the estimate of the amount of work within the element and the resources available to the agent. WorkQueue is based on CouchDB, a document oriented NoSQL database. The WorkQueue uses the features of CouchDB (map/reduce views and bi-directional replication between distributed instances) to provide a scalable distributed system for managing large queues of work. The project described here represents an improvement over the old approach to workload management in CMS which involved individual operators feeding requests into agents. This new approach allows for a

Near-optimality of special periodic protocols for fluid models of single server switched networks with switchover times

Science.gov (United States)

Matveev, A. S.; Ishchenko, R.

2017-11-01

We consider a generic deterministic time-invariant fluid model of a single server switched network, which consists of finitely many infinite size buffers (queues) and receives constant rate inflows of jobs from the outside. Any flow undergoes a multi-phase service, entering a specific buffer after every phase, and ultimately leaves the network; the route of the flow over the buffers is pre-specified, and flows may merge inside the network. They share a common source of service, which can serve at most one buffer at a time and has to switch among buffers from time to time; any switch consumes a nonzero switchover period. With respect to the long-run maximal scaled wip (work in progress) performance metric, near-optimality of periodic scheduling and service protocols is established: the deepest optimum (that is over all feasible processes in the network, irrespective of the initial state) is furnished by such a protocol up to as small error as desired. Moreover, this can be achieved with a special periodic protocol introduced in the paper. It is also shown that the exhaustive policy is optimal for any buffer whose service at the maximal rate does not cause growth of the scaled wip.

Mixed gated/exhaustive service in a polling model with priorities

NARCIS (Netherlands)

Boon, M.A.A.; Adan, I.J.B.F.

2008-01-01

In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue,

An unreliable group arrival queue with k stages of service, retrial under variant vacation policy

Science.gov (United States)

Radha, J.; Indhira, K.; Chandrasekaran, V. M.

2017-11-01

In this research work we considered repairable retrial queue with group arrival and the server utilize the variant vacations. A server gives service in k stages. Any arriving group of units finds the server free, one from the group entering the first stage of service and the rest are joining into the orbit. After completion of the i th stage of service, the customer may have the option to choose (i+1)th stage of service with probability θi , with probability pi may join into orbit as feedback customer or may leave the system with probability {q}i=≤ft\\{\\begin{array}{l}1-{p}i-{θ }i,i=1,2,\\cdots k-1\\ 1-{p}i,i=k\\end{array}\\right\\}. If the orbit is empty at the service completion of each stage service, the server takes modified vacation until at least one customer appears in the orbit on the server returns from a vacation. Busy server may get to breakdown and the service channel will fail for a short interval of time. By using the supplementary variable method, steady state probability generating function for system size, some system performance measures are discussed.

Modelling M/G/1 queueing systems with server vacations using stochastic Petri nets

Directory of Open Access Journals (Sweden)

K Ramanath

2006-12-01

Full Text Available The theory of non-Markovian stochastic Petri nets is employed in this paper to derive an alternative method for studying the steady state behaviour of the M/G/1 vacation queueing system with a limited service discipline. Three types of vacation schemes are considered, and sytems with both a finite population and those with an infinite population (but finite capacity are considered. Simple numerical examples are also provided to illustrate the functionality of the methods and some useful performance measures for the system are obtained.

On Two-Level State-Dependent Routing Polling Systems with Mixed Service

Directory of Open Access Journals (Sweden)

Guan Zheng

2015-01-01

Full Text Available Based on priority differentiation and efficiency of the system, we consider an N+1 queues’ single-server two-level polling system which consists of one key queue and N normal queues. The novel contribution of the present paper is that we consider that the server just polls active queues with customers waiting in the queue. Furthermore, key queue is served with exhaustive service and normal queues are served with 1-limited service in a parallel scheduling. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we derive the explicit closed-form expressions for the mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical and the new system is efficient both at key queue and normal queues.

Delay in a tandem queueing model with mobile queues: An analytical approximation

NARCIS (Netherlands)

Al Hanbali, Ahmad; de Haan, Roland; Boucherie, Richardus J.; van Ommeren, Jan C.W.

In this paper, we analyze the end-to-end delay performance of a tandem queueing system with mobile queues. Due to state-space explosion, there is no hope for a numerical exact analysis for the joint-queue-length distribution. For this reason, we present an analytical approximation that is based on

Hospital Registration Process Reengineering Using Simulation Method

Directory of Open Access Journals (Sweden)

Qiang Su

2010-01-01

Full Text Available With increasing competition, many healthcare organizations have undergone tremendous reform in the last decade aiming to increase efficiency, decrease waste, and reshape the way that care is delivered. This study focuses on the operational efficiency improvement of hospital’s registration process. The operational efficiency related factors including the service process, queue strategy, and queue parameters were explored systematically and illustrated with a case study. Guided by the principle of business process reengineering (BPR, a simulation approach was employed for process redesign and performance optimization. As a result, the queue strategy is changed from multiple queues and multiple servers to single queue and multiple servers with a prepare queue. Furthermore, through a series of simulation experiments, the length of the prepare queue and the corresponding registration process efficiency was quantitatively evaluated and optimized.

On the number of observable customers, served during he busy period of GI/GI/infinity queue

International Nuclear Information System (INIS)

Dvurechenskij, A.

1982-01-01

It is proved that the number of observable customers, served during the busy period of the GI/GI infinity queue with infinitely many servers has a geometric distribution. The parameter of this distribution is determined, too. It is shown that the normalized distributions converge to the exponential distribution. As a particular result is obtained that the distribution of the number of nonabsorbing streamers in a streamer blob has a geometric distribution

Adaptive Mean Queue Size and Its Rate of Change: Queue Management with Random Dropping

OpenAIRE

Karmeshu; Patel, Sanjeev; Bhatnagar, Shalabh

2016-01-01

The Random early detection (RED) active queue management (AQM) scheme uses the average queue size to calculate the dropping probability in terms of minimum and maximum thresholds. The effect of heavy load enhances the frequency of crossing the maximum threshold value resulting in frequent dropping of the packets. An adaptive queue management with random dropping (AQMRD) algorithm is proposed which incorporates information not just about the average queue size but also the rate of change of th...

Simple bounds and monotonicity results for finite multi-server exponential tandem queues

NARCIS (Netherlands)

Dijk, van N.M.; Wal, van der J.

1989-01-01

Simple and computationally attractive lower and upper bounds are presented for the call congestion such as those representing multi-server loss or delay stations. Numerical computations indicate a potential usefulness of the bounds for quick engineering purposes. The bounds correspond to

Queueing System with Heterogeneous Customers as a Model of a Call Center with a Call-Back for Lost Customers

OpenAIRE

Dudin, Sergey; Kim, Chesoong; Dudina, Olga; Baek, Janghyun

2013-01-01

A multiserver queueing system with infinite and finite buffers, two types of customers, and two types of servers as a model of a call center with a call-back for lost customers is investigated. Type 1 customers arrive to the system according to a Markovian arrival process. All rejected type 1 customers become type 2 customers. Type r, r=1,2, servers serve type r customers if there are any in the system and serve type r′, r′=1,2,  r′≠r, customers if there are no type r customers in the system....

Interacting queues in heavy traffic

NARCIS (Netherlands)

J.A. Morrison; S.C. Borst (Sem)

2010-01-01

htmlabstractWe consider a system of parallel queues with Poisson arrivals and exponentially distributed service requirements. The various queues are coupled through their service rates, causing a complex dynamic interaction. Specifically, the system consists of one primary queue and several

The WIYN Queue: Theory Meets Reality

Science.gov (United States)

Boroson, T. A.; Harmer, D. L.; Saha, A.; Smith, P. S.; Willmarth, D. W.; Silva, D. R.

1998-07-01

During the past two years NOAO has conducted a queue observing experiment with the 3.5 m WIYN telescope on Kitt Peak, Arizona. The WIYN telescope is ideally suited to queue-scheduled operation in terms of its performance and its instrument complement. The queue scheduling experiment on WIYN was designed to test a number of beliefs and hypotheses about gains in efficiency and scientific effectiveness due to queue scheduling. In addition, the experiment was a test of our implementation strategy and management of community expectations. The queue is run according, to a set of rules that guide decisions about which observation to do next. In practice, scientific rank, suitability of current conditions, and the desire to complete programs all enter into these decisions. As predicted by Monte Carlo simulations, the queue increases the overall efficiency of the telescope, particularly for observations requiring, rare conditions. Together with this improvement for typical programs, the queue enables synoptic, target-of-opportunity, and short programs that could not be scheduled classically. Despite this success, a number of sociological issues determine the community's perception of the WIYN queue.

The symmetric longest queue system

NARCIS (Netherlands)

van Houtum, Geert-Jan; Adan, Ivo; van der Wal, Jan

1997-01-01

We derive the performance of the exponential symmetric longest queue system from two variants: a longest queue system with Threshold Rejection of jobs and one with Threshold Addition of jobs. It is shown that these two systems provide lower and upper bounds for the performance of the longest queue

Bad Luck When Joining the Shortest Queue

NARCIS (Netherlands)

Blanc, J.P.C.

2008-01-01

A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one’s own queue. This paper quantifies the probability that one’s service would have started earlier if one had joined another queue than the queue that was

Performance of an M/M/1 Retrial Queue with Working Vacation Interruption and Classical Retrial Policy

Directory of Open Access Journals (Sweden)

Tao Li

2016-01-01

Full Text Available An M/M/1 retrial queue with working vacation interruption is considered. Upon the arrival of a customer, if the server is busy, it would join the orbit of infinite size. The customers in the orbit will try for service one by one when the server is idle under the classical retrial policy with retrial rate nα, where n is the size of the orbit. During a working vacation period, if there are customers in the system at a service completion instant, the vacation will be interrupted. Under the stable condition, the probability generating functions of the number of customers in the orbit are obtained. Various system performance measures are also developed. Finally, some numerical examples and cost optimization analysis are presented.

A study on M/G/1 retrial G - queue with two phases of service, immediate feedback and working vacations

Science.gov (United States)

Varalakshmi, M.; Chandrasekaran, V. M.; Saravanarajan, M. C.

2017-11-01

In this paper, we discuss about the steady state behaviour of M/G/1 retrial queueing system with two phases of services and immediate feedbacks under working vacation policy where the regular busy server is affected due to the arrival of negative customers. Upon arrival if the customer finds the server busy, breakdown or on working vacation it enters an orbit; otherwise the customer enters into the service area immediately. After service completion, the customer is allowed to make finite number of immediate feedback. The feedback service also consists of two phases. At the service completion epoch of a positive customer, if the orbit is empty the server goes for a working vacation. The server works at a lower service rate during working vacation (WV) period. Using the supplementary variable technique, we found out the steady state probability generating function for the system and in orbit. System performance measures and reliability measures are discussed. Finally, some numerical examples are presented to validate the analyticalresults.

A queueing network model to analyze the impact of parallelization of care on patient cycle time.

Science.gov (United States)

Jiang, Lixiang; Giachetti, Ronald E

2008-09-01

The total time a patient spends in an outpatient facility, called the patient cycle time, is a major contributor to overall patient satisfaction. A frequently recommended strategy to reduce the total time is to perform some activities in parallel thereby shortening patient cycle time. To analyze patient cycle time this paper extends and improves upon existing multi-class open queueing network model (MOQN) so that the patient flow in an urgent care center can be modeled. Results of the model are analyzed using data from an urgent care center contemplating greater parallelization of patient care activities. The results indicate that parallelization can reduce the cycle time for those patient classes which require more than one diagnostic and/ or treatment intervention. However, for many patient classes there would be little if any improvement, indicating the importance of tools to analyze business process reengineering rules. The paper makes contributions by implementing an approximation for fork/join queues in the network and by improving the approximation for multiple server queues in both low traffic and high traffic conditions. We demonstrate the accuracy of the MOQN results through comparisons to simulation results.

On the GI/M/1 Queue with Vacations and Multiple Service Phases

Directory of Open Access Journals (Sweden)

Jianjun Li

2017-01-01

Full Text Available This paper considers a GI/M/1 queue with vacations and multiple service phases. Whenever the system becomes empty, the server takes a vacation, causing the system to move to vacation phase 0. If the server returns from a vacation to find no customer waiting, another vacation begins. Otherwise, the system jumps from phase 0 to some service phase i with probability qi,  i=1,2,…,N. Using the matrix geometric solution method and semi-Markov process, we obtain the distributions of the stationary system size at both arrival and arbitrary epochs. The distribution of the stationary waiting time of an arbitrary customer is also derived. In addition, we present some performance measures such as mean waiting time of an arbitrary customer, mean length of the type-i cycle, and mean number of customers in the system at the end of phase 0. Finally, some numerical examples are presented.

Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies

Directory of Open Access Journals (Sweden)

Gaidamaka Yuliya

2014-09-01

Full Text Available Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system M[X]|G|1(L,H|(H,R with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode is presented. Numerical examples that allow comparison of the efficiency of both policies are given

Preventing messaging queue deadlocks in a DMA environment

Science.gov (United States)

Blocksome, Michael A; Chen, Dong; Gooding, Thomas; Heidelberger, Philip; Parker, Jeff

2014-01-14

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate and interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

Optimal purely functional priority queues

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Okasaki, Chris

1996-01-01

Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert and meld in O(1) worst-case time, and deleteMin in O(log n) worst-case time. These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt...... Brodal's data structure to a purely functional setting. In doing so, we both simplify the data structure and clarify its relationship to the binomial queues of Vuillemin, which support all four operations in O(log n) time. Specifically, we derive our implementation from binomial queues in three steps......: first, we reduce the running time of insert to O(1) by eliminating the possibility of cascading links; second, we reduce the running time of findMin to O(1) by adding a global root to hold the minimum element; and finally, we reduce the running time of meld to O(1) by allowing priority queues to contain...

Parallel Computing Using Web Servers and "Servlets".

Science.gov (United States)

Lo, Alfred; Bloor, Chris; Choi, Y. K.

2000-01-01

Describes parallel computing and presents inexpensive ways to implement a virtual parallel computer with multiple Web servers. Highlights include performance measurement of parallel systems; models for using Java and intranet technology including single server, multiple clients and multiple servers, single client; and a comparison of CGI (common…

Random queues and risk averse users

DEFF Research Database (Denmark)

de Palma, André; Fosgerau, Mogens

2013-01-01

We analyze Nash equilibrium in time of use of a congested facility. Users are risk averse with general concave utility. Queues are subject to varying degrees of random sorting, ranging from strict queue priority to a completely random queue. We define the key “no residual queue” property, which...

Publishing E-RDF linked data for many agents by single third-party server

DEFF Research Database (Denmark)

Wang, Dongsheng; Zhang, Yongyuan; Wang, Zhengjun

2017-01-01

do not have the ability or do not want to make an additional effort to publish linked data. Thus, for agents who are willing to open part of their data but do not want to make an effort, the task can be undertaken by a professional third-party server (together with professional experts......) that publishes linked data for these agents. Consequently, when a single third-party server is on behalf of multiple agents, it is also responsible to organize these multiple-source URIs (data) in a systematic way to make them referable, satisfying the 4-star data principles, as well as protect the confidential...... data. For validation, we implement a prototype system as a third-party server that publishes linked data for a number of agents. It demonstrates well-organized 5-star linked data plus E-RDF and shows the additional advantages of data integration and interlinking among agents....

Queueing for healthcare.

Science.gov (United States)

Palvannan, R Kannapiran; Teow, Kiok Liang

2012-04-01

Patient queues are prevalent in healthcare and wait time is one measure of access to care. We illustrate Queueing Theory-an analytical tool that has provided many insights to service providers when designing new service systems and managing existing ones. This established theory helps us to quantify the appropriate service capacity to meet the patient demand, balancing system utilization and the patient's wait time. It considers four key factors that affect the patient's wait time: average patient demand, average service rate and the variation in both. We illustrate four basic insights that will be useful for managers and doctors who manage healthcare delivery systems, at hospital or department level. Two examples from local hospitals are shown where we have used queueing models to estimate the service capacity and analyze the impact of capacity configurations, while considering the inherent variation in healthcare.

Discrete-time retrial queue with Bernoulli vacation, preemptive resume and feedback customers

Directory of Open Access Journals (Sweden)

Peishu Chen

2015-09-01

Full Text Available Purpose: We consider a discrete-time Geo/G/1 retrial queue where the retrial time follows a general distribution, the server subject to Bernoulli vacation policy and the customer has preemptive resume priority, Bernoulli feedback strategy. The main purpose of this paper is to derive the generating functions of the stationary distribution of the system state, the orbit size and some important performance measures. Design/methodology: Using probability generating function technique, some valuable and interesting performance measures of the system are obtained. We also investigate two stochastic decomposition laws and present some numerical results. Findings: We obtain the probability generating functions of the system state distribution as well as those of the orbit size and the system size distributions. We also obtain some analytical expressions for various performance measures such as idle and busy probabilities, mean orbit and system sizes. Originality/value: The analysis of discrete-time retrial queues with Bernoulli vacation, preemptive resume and feedback customers is interesting and to the best of our knowledge, no other scientific journal paper has dealt with this question. This fact gives the reason why efforts should be taken to plug this gap.

Optimal dispatching in a tandem queue

NARCIS (Netherlands)

van Leeuwen, D.; Núñez Queija, R.

2017-01-01

We investigate a Markovian tandem queueing model in which service to the first queue is provided in batches. The main goal is to choose the batch sizes so as to minimize a linear cost function of the mean queue lengths. This model can be formulated as a Markov Decision Process (MDP) for which the

Lévy-driven queues

NARCIS (Netherlands)

Debicki, K.G.; Mandjes, M.R.H.

2012-01-01

This survey addresses the class of queues with Lévy input, which covers the classical M/G/1 queue and the reflected Brownian motion as special cases. First the stationary behavior is treated, with special attention to the case of the input process having one-sided jumps (i.e., spectrally one-sided

Fast meldable priority queues

DEFF Research Database (Denmark)

Brodal, Gerth Stølting

1995-01-01

We present priority queues that support the operations Find-Min, Insert, MakeQueue and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations wh...

Performance Analysis and Optimal Allocation of Layered Defense M/M/N Queueing Systems

Directory of Open Access Journals (Sweden)

Longyue Li

2016-01-01

Full Text Available One important mission of strategic defense is to develop an integrated layered Ballistic Missile Defense System (BMDS. Motivated by the queueing theory, we presented a work for the representation, modeling, performance simulation, and channels optimal allocation of the layered BMDS M/M/N queueing systems. Firstly, in order to simulate the process of defense and to study the Defense Effectiveness (DE, we modeled and simulated the M/M/N queueing system of layered BMDS. Specifically, we proposed the M/M/N/N and M/M/N/C queueing model for short defense depth and long defense depth, respectively; single target channel and multiple target channels were distinguished in each model. Secondly, we considered the problem of assigning limited target channels to incoming targets, we illustrated how to allocate channels for achieving the best DE, and we also proposed a novel and robust search algorithm for obtaining the minimum channel requirements across a set of neighborhoods. Simultaneously, we presented examples of optimal allocation problems under different constraints. Thirdly, several simulation examples verified the effectiveness of the proposed queueing models. This work may help to understand the rules of queueing process and to provide optimal configuration suggestions for defense decision-making.

Priority Queues Resilient to Memory Faults

DEFF Research Database (Denmark)

Jørgensen, Allan Grønlund; Moruz, Gabriel; Mølhave, Thomas

2007-01-01

In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we...... introduce a resilient priority queue. The deletemin operation of a resilient priority queue returns either the minimum uncorrupted element or some corrupted element. Our resilient priority queue uses $O(n)$ space to store $n$ elements. Both insert and deletemin operations are performed in $O(\\log n......+\\delta)$ time amortized, where $\\delta$ is the maximum amount of corruptions tolerated. Our priority queue matches the performance of classical optimal priority queues in the RAM model when the number of corruptions tolerated is $O(\\log n)$. We prove matching worst case lower bounds for resilient priority...

Priority Queues Resilient to Memory Faults

DEFF Research Database (Denmark)

Jørgensen, Allan Grønlund; Moruz, Gabriel; Mølhave, Thomas

2007-01-01

In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we...... introduce a resilient priority queue. The deletemin operation of a resilient priority queue returns either the minimum uncorrupted element or some corrupted element. Our resilient priority queue uses $O(n)$ space to store $n$ elements. Both insert and deletemin operations are performed in $O(\\log n...... queues storing only structural information in the uncorruptible registers between operations....

Survey on queueing models with standbys support

Directory of Open Access Journals (Sweden)

Kolledath Sreekanth

2018-01-01

Full Text Available This paper is a survey article on queueing models with standbys support. Due to many real life applications of queueing models, it has become an interesting area for researchers and a lot of research work has been exerted so far. It is worthwhile to examine the performance based analysis for queueing modelling system as it provides a valuable insight to the tractability of the system and accelerates its efficiency. The provision of standbys to the queueing modelling of a real system is needed for smooth functioning in the presence of its unavoidable failures. The present survey provides a dig into the research work done, and emphasis the sequential developments on queueing models with standbys support.

Equilibrium Arrival Times to Queues

DEFF Research Database (Denmark)

Breinbjerg, Jesper; Østerdal, Lars Peter

We consider a non-cooperative queueing environment where a finite number of customers independently choose when to arrive at a queueing system that opens at a given point in time and serves customers on a last-come first-serve preemptive-resume (LCFS-PR) basis. Each customer has a service time...... requirement which is identically and independently distributed according to some general probability distribution, and they want to complete service as early as possible while minimizing the time spent in the queue. In this setting, we establish the existence of an arrival time strategy that constitutes...... a symmetric (mixed) Nash equilibrium, and show that there is at most one symmetric equilibrium. We provide a numerical method to compute this equilibrium and demonstrate by a numerical example that the social effciency can be lower than the effciency induced by a similar queueing system that serves customers...

Analysis of queues methods and applications

CERN Document Server

Gautam, Natarajan

2012-01-01

Introduction Analysis of Queues: Where, What, and How?Systems Analysis: Key ResultsQueueing Fundamentals and Notations Psychology in Queueing Reference Notes Exercises Exponential Interarrival and Service Times: Closed-Form Expressions Solving Balance Equations via Arc CutsSolving Balance Equations Using Generating Functions Solving Balance Equations Using Reversibility Reference Notes ExercisesExponential Interarrival and Service Times: Numerical Techniques and Approximations Multidimensional Birth and Death ChainsMultidimensional Markov Chains Finite-State Markov ChainsReference Notes Exerci

Queues and Lévy fluctuation theory

CERN Document Server

Dębicki, Krzysztof

2015-01-01

The book provides an extensive introduction to queueing models driven by Lévy-processes as well as a systematic account of the literature on Lévy-driven queues. The objective is to make the reader familiar with the wide set of probabilistic techniques that have been developed over the past decades, including transform-based techniques, martingales, rate-conservation arguments, change-of-measure, importance sampling, and large deviations. On the application side, it demonstrates how Lévy traffic models arise when modelling current queueing-type systems (as communication networks) and includes applications to finance. Queues and Lévy Fluctuation Theory will appeal to graduate/postgraduate students and researchers in mathematics, computer science, and electrical engineering. Basic prerequisites are probability theory and stochastic processes.

A Survey on Priority Queues

DEFF Research Database (Denmark)

Brodal, Gerth Stølting

2013-01-01

Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority qu...

Designing of vague logic based multilevel feedback queue scheduler

Directory of Open Access Journals (Sweden)

Supriya Raheja

2016-03-01

Full Text Available Multilevel feedback queue scheduler suffers from major issues of scheduling such as starvation for long tasks, fixed number of queues, and static length of time quantum in each queue. These factors directly affect the performance of the scheduler. At many times impreciseness exists in attributes of tasks which make the performance even worse. In this paper, our intent is to improve the performance by providing a solution to these issues. We design a multilevel feedback queue scheduler using a vague set which we call as VMLFQ scheduler. VMLFQ scheduler intelligently handles the impreciseness and defines the optimum number of queues as well as the optimal size of time quantum for each queue. It also resolves the problem of starvation. This paper simulates and analyzes the performance of VMLFQ scheduler with the other multilevel feedback queue techniques using MatLab.

Efficient Content Delivery in the Presence of Impatient Jobs

NARCIS (Netherlands)

M. Larrañaga; O.J. Boxma (Onno); R. Núñez Queija (Rudesindo); M.S. Squillante (Mark); S. Wittevrongel; M.C. Meo; C. Rosenberg

2015-01-01

htmlabstractWe consider a content delivery problem in which jobs are processed in batches and may abandon before their service has been initiated. We model the problem as a Markovian single-server queue and analyze two different settings: (1) the system is cleared as soon as the server is

Fundamentals of queueing theory

CERN Document Server

Gross, Donald; Thompson, James M; Harris, Carl M

2013-01-01

Praise for the Third Edition ""This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented.""-IIE Transactions on Operations Engineering Thoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than pre

Implementation of shared queues

OpenAIRE

Motte, Nicolas

2012-01-01

The transactional framework used to develop Amadeus C++ applications is based on a mechanism of queues to manage the message exchanges between components. These structures are protected from concurrent access thanks to synchronization services provided by Linux. But theses services have a cost in term of performance and they bound the volume of messages transmitted by these queues. In a first step, I have to investigate on the state-of-the-art in term of management algorithms o...

Mathematical Analysis of Queue with Phase Service: An Overview

Directory of Open Access Journals (Sweden)

Richa Sharma

2014-01-01

Full Text Available We discuss various aspects of phase service queueing models. A large number of models have been developed in the area of queueing theory incorporating the concept of phase service. These phase service queueing models have been investigated for resolving the congestion problems of many day-to-day as well as industrial scenarios. In this survey paper, an attempt has been made to review the work done by the prominent researchers on the phase service queues and their applications in several realistic queueing situations. The methodology used by several researchers for solving various phase service queueing models has also been described. We have classified the related literature based on modeling and methodological concepts. The main objective of present paper is to provide relevant information to the system analysts, managers, and industry people who are interested in using queueing theory to model congestion problems wherein the phase type services are prevalent.

Efficient content delivery in the presence of impatient jobs

NARCIS (Netherlands)

Larrañaga, M.; Boxma, O.J.; Núñez Queija, R.; Squillante, M.S.

2015-01-01

We consider a content delivery problem in which jobs are processed in batches and may abandon before their service has been initiated. We model the problem as a Markovian single-server queue and analyze two different settings: (1) the system is cleared as soon as the server is activated, i.e.,

Efficient Content Delivery in the Presence of Impatient Jobs

NARCIS (Netherlands)

Larrañaga, M.; Boxma, O.J.; Núñez-Queija, R.; Squillante, M.S.

2015-01-01

We consider a content delivery problem in which jobs are processed in batches and may abandon before their service has been initiated. We model the problem as a Markovian single-server queue and analyze two different settings: (1) the system is cleared as soon as the server is activated, i.e.,

Near-optimal switching strategies for a tandem queue

NARCIS (Netherlands)

van Leeuwen, D.; Núñez-Queija, R.; Boucherie, R.J.; van Dijk, N.M.

2017-01-01

Motivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as possible,

Near-optimal switching strategies for a tandem queue

NARCIS (Netherlands)

D. van Leeuwen (Daphne); R. Núñez Queija (Rudesindo)

2017-01-01

textabstractMotivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as

Performance optimization of queueing systems with perturbation realization

KAUST Repository

Xia, Li

2012-04-01

After the intensive studies of queueing theory in the past decades, many excellent results in performance analysis have been obtained, and successful examples abound. However, exploring special features of queueing systems directly in performance optimization still seems to be a territory not very well cultivated. Recent progresses of perturbation analysis (PA) and sensitivity-based optimization provide a new perspective of performance optimization of queueing systems. PA utilizes the structural information of queueing systems to efficiently extract the performance sensitivity information from a sample path of system. This paper gives a brief review of PA and performance optimization of queueing systems, focusing on a fundamental concept called perturbation realization factors, which captures the special dynamic feature of a queueing system. With the perturbation realization factors as building blocks, the performance derivative formula and performance difference formula can be obtained. With performance derivatives, gradient-based optimization can be derived, while with performance difference, policy iteration and optimality equations can be derived. These two fundamental formulas provide a foundation for performance optimization of queueing systems from a sensitivity-based point of view. We hope this survey may provide some inspirations on this promising research topic. © 2011 Elsevier B.V. All rights reserved.

Vacation model for Markov machine repair problem with two heterogeneous unreliable servers and threshold recovery

Science.gov (United States)

Jain, Madhu; Meena, Rakesh Kumar

2018-03-01

Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back to render repair job when the pre-specified workload of failed machines is build up. The first (second) repairman turns on only when the work load of N1 (N2) failed machines is accumulated in the system. The both servers may go for vacation in case when all the machines are in good condition and there are no pending repair jobs for the repairmen. Runge-Kutta method is implemented to solve the set of governing equations used to formulate the Markov model. Various system metrics including the mean queue length, machine availability, throughput, etc., are derived to determine the performance of the machining system. To provide the computational tractability of the present investigation, a numerical illustration is provided. A cost function is also constructed to determine the optimal repair rate of the server by minimizing the expected cost incurred on the system. The hybrid soft computing method is considered to develop the adaptive neuro-fuzzy inference system (ANFIS). The validation of the numerical results obtained by Runge-Kutta approach is also facilitated by computational results generated by ANFIS.

GPS queues with heterogeneous traffic classes

NARCIS (Netherlands)

Borst, Sem; Mandjes, M.R.H.; van Uitert, Miranda

2002-01-01

We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic classes are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing (WFQ), have emerged as an important mechanism for

Queues and Lévy Fluctuation Theory

NARCIS (Netherlands)

Dębicki, K.; Mandjes, M.

2015-01-01

The book provides an extensive introduction to queueing models driven by Lévy-processes as well as a systematic account of the literature on Lévy-driven queues. The objective is to make the reader familiar with the wide set of probabilistic techniques that have been developed over the past decades,

Transient analysis of a queue with queue-length dependent MAP and its application to SS7 network

Directory of Open Access Journals (Sweden)

Bong Dae Choi

1999-01-01

Full Text Available We analyze the transient behavior of a Markovian arrival queue with congestion control based on a double of thresholds, where the arrival process is a queue-length dependent Markovian arrival process. We consider Markov chain embedded at arrival epochs and derive the one-step transition probabilities. From these results, we obtain the mean delay and the loss probability of the nth arrival packet. Before we study this complex model, first we give a transient analysis of an MAP/M/1 queueing system without congestion control at arrival epochs. We apply our result to a signaling system No. 7 network with a congestion control based on thresholds.

Difference and differential equations with applications in queueing theory

CERN Document Server

Haghighi, Aliakbar Montazer

2013-01-01

  A Useful Guide to the Interrelated Areas of Differential Equations, Difference Equations, and Queueing Models Difference and Differential Equations with Applications in Queueing Theory presents the unique connections between the methods and applications of differential equations, difference equations, and Markovian queues. Featuring a comprehensive collection of

Study on the Queue-Length Distribution in Geo/G(MWV/1/N Queue with Working Vacations

Directory of Open Access Journals (Sweden)

Chuanyi Luo

2015-01-01

Full Text Available This paper analyzes a finite buffer size discrete-time Geo/G/1/N queue with multiple working vacations and different input rate. Using supplementary variable technique and embedded Markov chain method, the queue-length distribution solution in the form of formula at arbitrary epoch is obtained. Some performance measures associated with operating cost are also discussed based on the obtained queue-length distribution. Then, several numerical experiments follow to demonstrate the effectiveness of the obtained formulae. Finally, a state-dependent operating cost function is constructed to model an express logistics service center. Regarding the service rate during working vacation as a control variable, the optimization analysis on the cost function is carried out by using parabolic method.

Queueing in a spent fuel transportation system - preliminary analysis of implications for system design

International Nuclear Information System (INIS)

Cashwell, J.W.; Wood, T.W.

1985-01-01

Compliance with the Nuclear Waste Policy Act of 1982 (PL 97-425) will require the transportation of large volumes of spent fuel to a central receiving facility (either a geologic repository or a monitored retrievable storage facility). Decisions on the transport mode and technology will evolve over the next several years, in anticipation of the deployment of a receiving facility in the late 1990s. Regardless of the particular transportation mode or modes and the details of cask technology, the transport system from many diverse sources to a single point will generate an essentially random arrival pattern. This random arrival pattern will lead to the formation of queues at the receiving facility. As is normal in any queueing system, the waiting time distribution caused by this queueing will depend on the receiving facility input processing rate and the characteristics of the traffic. Since this is a cyclic system, there is also a reverse effect in which (for a given size cask fleet) average wait time affects traffic intensity. Both effects must be accounted for to properly represent the system. This paper develops a simple analytic queueing model which accounts for both of these effects simultaneously. Since both effects are determined by receiving facility input rates and cask fleet size and characteristics, two major sets of system design parameters are linked by the queueing process. The model is used with estimated traffic and service parameters to predict the severity of queueing under plausible reference system conditions, and to establish shadow prices for the trade off between larger cask fleets and more efficient receiving facilities. Since many of the parameter values used in this estimation are quite preliminary, these results are presented primarily in the context of demonstrating the utility of the queueing model for future trade off studies

Adaptive Filtering Queueing for Improving Fairness

Directory of Open Access Journals (Sweden)

Jui-Pin Yang

2015-06-01

Full Text Available In this paper, we propose a scalable and efficient Active Queue Management (AQM scheme to provide fair bandwidth sharing when traffic is congested dubbed Adaptive Filtering Queueing (AFQ. First, AFQ identifies the filtering level of an arriving packet by comparing it with a flow label selected at random from the first level to an estimated level in the filtering level table. Based on the accepted traffic estimation and the previous fair filtering level, AFQ updates the fair filtering level. Next, AFQ uses a simple packet-dropping algorithm to determine whether arriving packets are accepted or discarded. To enhance AFQ’s feasibility in high-speed networks, we propose a two-layer mapping mechanism to effectively simplify the packet comparison operations. Simulation results demonstrate that AFQ achieves optimal fairness when compared with Rotating Preference Queues (RPQ, Core-Stateless Fair Queueing (CSFQ, CHOose and Keep for responsive flows, CHOose and Kill for unresponsive flows (CHOKe and First-In First-Out (FIFO schemes under a variety of traffic conditions.

An Approach to Active Queue Management in Computer Network

OpenAIRE

Asimkiran Dandapat

2016-01-01

Active queue management is a key technique for reducing the packet drop rate in the internet. This packet dropping mechanism is used in a router to minimize congestion when the packets are dropped before queue gets full. In this paper a new framework of Active queue management namely MYRED is proposed. The goal of this new scheme is to improve the performance of AQM by keeping router queue length optimized. In RED packets are marked or dropped with a statistical probability before packet buff...

Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South AfricaExperiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa

Directory of Open Access Journals (Sweden)

Dudu G. Sokhela

2013-07-01

Full Text Available Background: Comprehensive Primary Health Care (PHC, based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans.Objectives: Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients’ experiences led to satisfaction or dissatisfaction with the Fast Queue service.Method: A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed.Results: Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources

Analysis of an M[X]/(G1,G2/1 retrial queueing system with balking, optional re-service under modified vacation policy and service interruption

Directory of Open Access Journals (Sweden)

P. Rajadurai

2014-09-01

Full Text Available This paper deals with the steady state analysis of batch arrival retrial queueing system with two types of service under modified vacation policy, where each type consists of an optional re-service. An arriving batch may balk the system at some particular times. After the completion of each types of service the customers may re-service of the same type without joining the orbit or may leave the system. If the orbit is empty at the service completion of each types of service, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from a vacation. Busy server may breakdown at any instance and the service channel will fail for a short interval of time. The steady state probability generating function for system/orbit size is obtained by using the supplementary variable method. Some system performance measures and numerical illustrations are discussed.

Design and implementation of streaming media server cluster based on FFMpeg.

Science.gov (United States)

Zhao, Hong; Zhou, Chun-long; Jin, Bao-zhao

2015-01-01

Poor performance and network congestion are commonly observed in the streaming media single server system. This paper proposes a scheme to construct a streaming media server cluster system based on FFMpeg. In this scheme, different users are distributed to different servers according to their locations and the balance among servers is maintained by the dynamic load-balancing algorithm based on active feedback. Furthermore, a service redirection algorithm is proposed to improve the transmission efficiency of streaming media data. The experiment results show that the server cluster system has significantly alleviated the network congestion and improved the performance in comparison with the single server system.

Design and Implementation of Streaming Media Server Cluster Based on FFMpeg

Science.gov (United States)

Zhao, Hong; Zhou, Chun-long; Jin, Bao-zhao

2015-01-01

Poor performance and network congestion are commonly observed in the streaming media single server system. This paper proposes a scheme to construct a streaming media server cluster system based on FFMpeg. In this scheme, different users are distributed to different servers according to their locations and the balance among servers is maintained by the dynamic load-balancing algorithm based on active feedback. Furthermore, a service redirection algorithm is proposed to improve the transmission efficiency of streaming media data. The experiment results show that the server cluster system has significantly alleviated the network congestion and improved the performance in comparison with the single server system. PMID:25734187

Buffer Management of Multi-Queue QoS Switches with Class Segregation

OpenAIRE

Itoh, Toshiya; Yoshimoto, Seiji

2013-01-01

In this paper, we focus on buffer management of multi-queue QoS switches in which packets of different values are segregated in different queues. Our model consists of $m$ queues and $m$ packet values $0 < v_{1} < v_{2} < ... < v_{m}$. Recently, Al-Bawani and Souza [IPL 113(4), pp.145-150, 2013] presented an online algorithm GREEDY for buffer management of multi-queue QoS switches with class segregation and showed thatif $m$ queues have the same size, then the competitive ratio of GREEDY is $...

Discovering queues from event logs with varying levels of information

NARCIS (Netherlands)

Senderovich, A.; Leemans, S,J.J.; Harel, S.; Gal, A.; Mandelbaum, A.; van der Aalst, W.M.P.; Reichert, M.; Reijers, H.A.

2016-01-01

Detecting and measuring resource queues is central to business process optimization. Queue mining techniques allow for the identification of bottlenecks and other process inefficiencies, based on event data. This work focuses on the discovery of resource queues. In particular, we investigate the

Queueing in a spent fuel transportation system: a preliminary analysis of implications for system design

International Nuclear Information System (INIS)

Cashwell, J.W.; Wood, T.W.

1985-03-01

Compliance with the Nuclear Waste Policy Act of 1982 (PL 97-425) will require the transportation of large volumes of spent fuel to a central receiving facility (Either a geologic repository or a monitored retrievable storage facility). Decisions on the transport mode and technology will evolve over the next several years, in anticipation of the deployment of a receiving facility in the late 1990s. Regardless of the particular transportation mode or modes and the details of cask technology, the transport system from many diverse sources to a single point will generate an essentially random arrival pattern. This random arrival pattern will lead to the formation of queues at the receiving facility. As is normal in any queueing system, the waiting time distribution caused by this queueing will depend on the receiving facility input processing rate and the characteristics of the traffic. Since this is a cyclic system, there is also a reverse effect in which (for a given size cask fleet) average wait time affects traffic intensity. Both effects must be accounted for to properly represent the system. This paper develops a simple analytic queueing model which accounts for both of these effects simultaneously. Since both effects are determined by receiving facility input and cask fleet size characteristics, two major sets of system design parameters are linked by the queueing process. The model is used with estimated traffic and service parameters to predict the severity of queueing under plausible reference system conditions, and to establish ''shadow prices'' for the trade off between larger cask fleets and more efficient receiving facilities. Since many of the parameter values used in this estimation are quite preliminary, these results are presented primarily in the context of demonstrating the utility of the queueing model for future trade off studies. 5 refs., 5 figs., 2 tabs

A course on queueing models

CERN Document Server

Jain, Joti Lal; Böhm, Walter

2006-01-01

The application of engineering principles in divergent fields such as management science and communications as well as the advancement of several approaches in theory and computation have led to growing interest in queueing models, creating the need for a comprehensive text. Emphasizing Markovian structures and the techniques that occur in different models, A Course on Queueing Models discusses recent developments in the field, different methodological tools - some of which are not available elsewhere - and computational techniques.While most books essentially address the classical methods of

Performance optimization of queueing systems with perturbation realization

KAUST Repository

Xia, Li; Cao, Xiren

2012-01-01

After the intensive studies of queueing theory in the past decades, many excellent results in performance analysis have been obtained, and successful examples abound. However, exploring special features of queueing systems directly in performance

Competing for jobs: labor queues and gender sorting in the hiring process.

Science.gov (United States)

Fernandez, Roberto M; Mors, Marie Louise

2008-12-01

While much research has documented the pattern and extent of sex segregation of workers once they are employed, few studies have addressed the pre-hire mechanisms that are posited to produce sex segregation in employment. While the notion of a labor queue-the rank order of the set of people that employers choose among-plays a prominent role in pre-hire accounts of job sex sorting mechanisms, few studies have examined the ways in which job candidates are sorted into labor queues. In this paper, we explore the mechanisms by which labor queues contribute to the gendering of jobs by studying the hiring process for all jobs at a call center. Being placed in a queue has a clear gendering effect on the hiring process: the sex distribution of applicants who are matched to queues and those who are rejected at this phase diverge, and among those assigned to queues, women are prevalent in queues for low pay, low status jobs. The screening process also contributes to the gendering of the population of hires at this firm. Females are more prevalent among hires than they are among candidates at initial queue assignment. Among high status jobs, however, males are more prevalent than females. Moreover, there are important wage implications associated with matching to queues. While there are large between-queue sex differences in the paid wages associated with allocation to queues, once allocated to queues the wage differences between male and female candidates are nil. Consequently, the roots of gender wage inequality in this setting lie in the initial sorting of candidates to labor queues.

On the dependence structure of Gaussian queues

NARCIS (Netherlands)

Es-Saghouani, A.; Mandjes, M.R.H.

2009-01-01

In this article we study Gaussian queues (that is, queues fed by Gaussian processes, such as fractional Brownian motion (fBm) and the integrated Ornstein-Uhlenbeck (iOU) process), with a focus on the dependence structure of the workload process. The main question is to what extent does the workload

STATIONARY DISTRIBUTION OF A TANDEM QUEUE WITH ADDITIONAL FLOWS ON THE STATIONS OF THE TANDEM

Directory of Open Access Journals (Sweden)

V. I. Klimenok

2017-01-01

Full Text Available A tandem queueing system consisting of a finite number of multi-server stations without buffers is analized. The input flow at the first station is a ???????????? (Markovian arrival process. The customers from this flow aim to be served at all stations of the tandem. For any station, besides transit customers proceeding from the previous station, an additional ???????????? flow of new customers arrives at this station directly. Customers from this flow aim to be served at this station and all subsequent stations of the tandem. The service times of customer at the stations are exponentially distributed with the service rate depending of number of the station. The algorithms for culculation of stationary distributions and the loss probabilities associated with the tandem are given.

Increasing available FIFO space to prevent messaging queue deadlocks in a DMA environment

Science.gov (United States)

Blocksome, Michael A [Rochester, MN; Chen, Dong [Croton On Hudson, NY; Gooding, Thomas [Rochester, MN; Heidelberger, Philip [Cortlandt Manor, NY; Parker, Jeff [Rochester, MN

2012-02-07

Embodiments of the invention may be used to manage message queues in a parallel computing environment to prevent message queue deadlock. A direct memory access controller of a compute node may determine when a messaging queue is full. In response, the DMA may generate an interrupt. An interrupt handler may stop the DMA and swap all descriptors from the full messaging queue into a larger queue (or enlarge the original queue). The interrupt handler then restarts the DMA. Alternatively, the interrupt handler stops the DMA, allocates a memory block to hold queue data, and then moves descriptors from the full messaging queue into the allocated memory block. The interrupt handler then restarts the DMA. During a normal messaging advance cycle, a messaging manager attempts to inject the descriptors in the memory block into other messaging queues until the descriptors have all been processed.

Probability, statistics, and queueing theory

CERN Document Server

Allen, Arnold O

1990-01-01

This is a textbook on applied probability and statistics with computer science applications for students at the upper undergraduate level. It may also be used as a self study book for the practicing computer science professional. The successful first edition of this book proved extremely useful to students who need to use probability, statistics and queueing theory to solve problems in other fields, such as engineering, physics, operations research, and management science. The book has also been successfully used for courses in queueing theory for operations research students. This second edit

Cluster Server IPTV dengan Penjadwalan Algoritma Round Robin

Directory of Open Access Journals (Sweden)

Didik Aribowo

2016-03-01

Full Text Available Perkembangan teknologi informasi yang pesat, otomatis seiring juga dengan meningkatnya para pengguna yang terhubung pada jaringan internet. Berawal dari sebuah single server yang selalu mendapatkan request dari banyak user, perlahan tapi pasti akan terjadi overload dan crash sehingga berdampak pada request yang tidak dapat dilayani oleh single server. Desain arsitektur cluster dapat dibangun dengan menggunakan konsep network load balancing yang memungkinkan proses pengolahan data di share ke dalam beberapa komputer. Dalam penelitian ini menggunakan algoritma penjadwalan round robin sebagai solusi alternatif mengatasi permasalah overload data pada server yang dapat mempengaruhi kinerja sistem IPTV. Untuk  jumlah request yang digunakan dalam penelitian ini adalah 5000, 15000, 25000, dan 50000 request. Dengan metode tersebut, maka performansi algoritma penjawalan dapat diamati dengan menekankan pada parameter sebagai berikut, yaitu throughput, respon time, reply connection, dan error connection sehingga didapatkan algoritma penjadwalan terbaik dalam rangka optimalisasi cluster server IPTV. Secara otomatis dalam proses load balancing mampu mengurangi beban kerja setiap server sehingga tidak ada server yang overload dan memungkinkan server  menggunakan bandwidth  yang tersedia secara lebih efektif serta menyediakan akses yang cepat ke web browser yang dihosting. Implementasi webserver cluster dengan skema load balancing dapat memberikan alvalaibilitas sistem yang tetap terjaga dan skalabilitas yang cukup untuk dapat tetap melayani setiap request dari pengguna

QUEUEING DISCIPLINES BASED ON PRIORITY MATRIX

Directory of Open Access Journals (Sweden)

Taufik I. Aliev

2014-11-01

Full Text Available The paper deals with queueing disciplines for demands of general type in queueing systems with multivendor load. A priority matrix is proposed to be used for the purpose of mathematical description of such disciplines, which represents the priority type (preemptive priority, not preemptive priority or no priority between any two demands classes. Having an intuitive and simple way of priority assignment, such description gives mathematical dependencies of system operation characteristics on its parameters. Requirements for priority matrix construction are formulated and the notion of canonical priority matrix is given. It is shown that not every matrix, constructed in accordance with such requirements, is correct. The notion of incorrect priority matrix is illustrated by an example, and it is shown that such matrixes do not ensure any unambiguousness and determinacy in design of algorithm, which realizes corresponding queueing discipline. Rules governing construction of correct matrixes are given for canonical priority matrixes. Residence time for demands of different classes in system, which is the sum of waiting time and service time, is considered as one of the most important characteristics. By introducing extra event method Laplace transforms for these characteristics are obtained, and mathematical dependencies are derived on their basis for calculation of two first moments for corresponding characteristics of demands queueing

Mfold web server for nucleic acid folding and hybridization prediction.

Science.gov (United States)

Zuker, Michael

2003-07-01

The abbreviated name, 'mfold web server', describes a number of closely related software applications available on the World Wide Web (WWW) for the prediction of the secondary structure of single stranded nucleic acids. The objective of this web server is to provide easy access to RNA and DNA folding and hybridization software to the scientific community at large. By making use of universally available web GUIs (Graphical User Interfaces), the server circumvents the problem of portability of this software. Detailed output, in the form of structure plots with or without reliability information, single strand frequency plots and 'energy dot plots', are available for the folding of single sequences. A variety of 'bulk' servers give less information, but in a shorter time and for up to hundreds of sequences at once. The portal for the mfold web server is http://www.bioinfo.rpi.edu/applications/mfold. This URL will be referred to as 'MFOLDROOT'.

Studying Pensions Funds Through an Infinite Servers Nodes Network: A Theoretical Problem

International Nuclear Information System (INIS)

Ferreira, M A M; Andrade, M; Filipe, J A

2012-01-01

This study intends to present a representation of a pensions fund through a stochastic network with two infinite servers nodes. With this representation it is allowed to deduce an equilibrium condition of the system with basis on the identity of the random rates expected values, for which the contributions arrive to the fund and the pensions are paid by the fund. In our study a stochastic network is constructed where traffic is represented. This network allows to study the equilibrium in the system and it is admissible to get a balance to a pensions fund. A specific case is studied. When the arrivals from outside at nodes A and B are according to a Poisson process, with rates λ A and λ B , respectively, the system may be seen as a two nodes network where the first node is a M/G/∞ queue and second a M t /G/∞ queue. For this case in the long term the conditions of equilibrium are as follows: m A λ A α A = m B (ρλ A + λ B )α B . In this formula it is established a relationship among the two nodes. Several examples are given in the study.

The impact of reneging in processor sharing queues

NARCIS (Netherlands)

Gromoll, H.C.; Robert, Ph.; Zwart, B.; Bakker, R.F.

2006-01-01

We investigate an overloaded processor sharing queue with renewal arrivals and generally distributed service times. Impatient customers may abandon the queue, or renege, before completing service. The random time representing a customer’s patience has a general distribution and may be dependent on

A unifying property for distribution-sensitive priority queues

DEFF Research Database (Denmark)

Elmasry, Amr Ahmed Abd Elmoneim; Farzan, Arash; Iacono, John

2011-01-01

, before) the last access of x and are still in the priority queue at the time when the corresponding operation is performed. Our priority queue then has both the working-set and the queueish properties; and, more strongly, it satisfies these properties in the worst-case sense. We also argue...... that these bounds are the best possible with respect to the considered measures. Moreover, we modify our priority queue to satisfy a new unifying property - the time-finger property - which encapsulates both the working-set and the queueish properties. In addition, we prove that the working-set bound......We present a priority queue that supports the operations: insert in worst-case constant time, and delete, delete-min, find-min and decrease-key on an element x in worst-case O(lg(min{wx, qx} + 2)) time, where wx (respectively, qx) is the number of elements that were accessed after (respectively...

Triple-server blind quantum computation using entanglement swapping

Science.gov (United States)

Li, Qin; Chan, Wai Hong; Wu, Chunhui; Wen, Zhonghua

2014-04-01

Blind quantum computation allows a client who does not have enough quantum resources or technologies to achieve quantum computation on a remote quantum server such that the client's input, output, and algorithm remain unknown to the server. Up to now, single- and double-server blind quantum computation have been considered. In this work, we propose a triple-server blind computation protocol where the client can delegate quantum computation to three quantum servers by the use of entanglement swapping. Furthermore, the three quantum servers can communicate with each other and the client is almost classical since one does not require any quantum computational power, quantum memory, and the ability to prepare any quantum states and only needs to be capable of getting access to quantum channels.

Influence of queue propagation and dissipation on route travel times

DEFF Research Database (Denmark)

Raovic, Nevena

into account (Bliemer, 2008). Yperman (2007) indicates that there is a significant difference in queue-propagation and queue-dissipation between the LTM and DQM. This results in different route travel times, and can further affect route choice. In this paper, different approaches to represent queue propagation...... and dissipation through the CTM, LTM and DQM are studied. A simple network allows to show how these approaches influence route travel time. Furthermore, the possibility of changing the existing DQM is considered in order to more realistically represent queue propagation and dissipation, which would lead to more...... accurate route travel times....

Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa.

Science.gov (United States)

Sokhela, Dudu G; Makhanya, Nonhlanhla J; Sibiya, Nokuthula M; Nokes, Kathleen M

2013-07-05

Comprehensive Primary Health Care (PHC), based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans. Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients' experiences led to satisfaction or dissatisfaction with the Fast Queue service. A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed. Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources. Effective health communication strategies contribute to positive

Experiences of Fast Queue health care users in primary health care facilities in eThekwini district, South Africa

Directory of Open Access Journals (Sweden)

Dudu G. Sokhela

2013-07-01

Full Text Available Background: Comprehensive Primary Health Care (PHC, based on the principles of accessibility, availability, affordability, equity and acceptability, was introduced in South Africa to address inequalities in health service provision. Whilst the Fast Queue was instrumental in the promotion of access to health care, a major goal of the PHC approach, facilities were not prepared for the sudden influx of clients. Increased access resulted in long waiting times and queues contributing to dissatisfaction with the service which could lead to missed appointments and non-compliance with established treatment plans. Objectives: Firstly to describe the experiences of clients using the Fast Queue strategy to access routine healthcare services and secondly, to determine how the clients’ experiences led to satisfaction or dissatisfaction with the Fast Queue service. Method: A descriptive qualitative survey using content analysis explored the experiences of the Fast Queue users in a PHC setting. Setting was first identified based on greatest number using the Fast Queue and geographic diversity and then a convenience sample of health care users of the Fast Queue were sampled individually along with one focus group of users who accessed the Queue monthly for medication refills. The same interview guide questions were used for both individual interviews and the one focus group discussion. Five clinics with the highest number of attendees during a three month period and a total of 83 health care users of the Fast Queue were interviewed. The average participant was female, 31 years old, single and unemployed. Results: Two themes with sub-themes emerged: health care user flow and communication, which highlights both satisfaction and dissatisfaction with the fast queue and queue marshals, could assist in directing users to the respective queues, reduce waiting time and keep users satisfied with the use of sign posts where there is a lack of human resources

Australia: a matter of Queues and As

Energy Technology Data Exchange (ETDEWEB)

NONE

2007-05-15

Australia has been very much in the news recently, with ship queues at port terminals and storms hitting the Hunter Valley, flooding coal yards and rail links. In December 2006 a 'capacity balancing system' (CBS) introduced by Port Waratah Coal Services to solve queuing problems in Newcastle ports in mid-2004 was discontinued but then the queues started to grow again. A new CBS was introduced and was beginning to take effect when storms struck New South Wales. Port Dalrymple Coal Services has a queue management system but nevertheless there were 58 ships waiting in Dalrymple Bay and Hay Point in late June. A number of coal terminals are undergoing expansion in an attempt to solve the situation. 4 photos.

A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks

Directory of Open Access Journals (Sweden)

Doo Il Choi

1999-01-01

Full Text Available A queueing system (M/G1,G2/1/K is considered in which the service time of a customer entering service depends on whether the queue length, N(t, is above or below a threshold L. The arrival process is Poisson, and the general service times S1 and S2 depend on whether the queue length at the time service is initiated is

The M/G/1 queue with permanent customers

NARCIS (Netherlands)

Boxma, O.J.; Cohen, J.W.

1991-01-01

The authors examine an M/G/1 FCFS (first come, first served) queue with two types of customers: ordinary customers, who arrive according to a Poisson process, and permanent customers, who immediately return to the end of the queue after having received a service. The influence of the permanent

CPU Server

CERN Multimedia

The CERN computer centre has hundreds of racks like these. They are over a million times more powerful than our first computer in the 1960's. This tray is a 'dual-core' server. This means it effectively has two CPUs in it (eg. two of your home computers minimised to fit into a single box). Also note the copper cooling fins, to help dissipate the heat.

A Parallel Priority Queue with Constant Time Operations

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Träff, Jesper Larsson; Zaroliagis, Christos D.

1998-01-01

We present a parallel priority queue that supports the following operations in constant time:parallel insertionof a sequence of elements ordered according to key,parallel decrease keyfor a sequence of elements ordered according to key,deletion of the minimum key element, anddeletion of an arbitrary...... application is a parallel implementation of Dijkstra's algorithm for the single-source shortest path problem, which runs inO(n) time andO(mlogn) work on a CREW PRAM on graphs withnvertices andmedges. This is a logarithmic factor improvement in the running time compared with previous approaches....

Priority Queues with Fractional Service for Tiered Delay QoS

Directory of Open Access Journals (Sweden)

Gary Chang

2015-12-01

Full Text Available Packet scheduling is key to quality of service (QoS capabilities of broadband wired and wireless networks. In a heterogeneous traffic environment, a comprehensive QoS packet scheduler must strike a balance between flow fairness and access delay. Many advanced packet scheduling solutions have targeted fair bandwidth allocation while protecting delay-constrained traffic by adding priority queue(s on top of a fair bandwidth scheduler. Priority queues are known to cause performance uncertainties and, thus, various modifications have been proposed. In this paper, we present a packet queueing engine dubbed Fractional Service Buffer (FSB, which, when coupled with a configurable flow scheduler, can achieve desired QoS objectives, such as fair throughputs and differentiated delay guarantees. Key performance metrics, such as delay limit and probability of delay limit violation, are derived as a function of key FSB parameters for each delay class in the packet queueing engine using diffusion approximations. OPNET simulations verify these analytical results.

Network characteristics for server selection in online games

Science.gov (United States)

Claypool, Mark

2008-01-01

Online gameplay is impacted by the network characteristics of players connected to the same server. Unfortunately, the network characteristics of online game servers are not well-understood, particularly for groups that wish to play together on the same server. As a step towards a remedy, this paper presents analysis of an extensive set of measurements of game servers on the Internet. Over the course of many months, actual Internet game servers were queried simultaneously by twenty-five emulated game clients, with both servers and clients spread out on the Internet. The data provides statistics on the uptime and populations of game servers over a month long period an an in-depth look at the suitability for game servers for multi-player server selection, concentrating on characteristics critical to playability--latency and fairness. Analysis finds most game servers have latencies suitable for third-person and omnipresent games, such as real-time strategy, sports and role-playing games, providing numerous server choices for game players. However, far fewer game servers have the low latencies required for first-person games, such as shooters or race games. In all cases, groups that wish to play together have a greatly reduced set of servers from which to choose because of inherent unfairness in server latencies and server selection is particularly limited as the group size increases. These results hold across different game types and even across different generations of games. The data should be useful for game developers and network researchers that seek to improve game server selection, whether for single or multiple players.

Computational Procedures for a Class of GI/D/k Systems in Discrete Time

Directory of Open Access Journals (Sweden)

Md. Mostafizur Rahman

2009-01-01

Full Text Available A class of discrete time GI/D/k systems is considered for which the interarrival times have finite support and customers are served in first-in first-out (FIFO order. The system is formulated as a single server queue with new general independent interarrival times and constant service duration by assuming cyclic assignment of customers to the identical servers. Then the queue length is set up as a quasi-birth-death (QBD type Markov chain. It is shown that this transformed GI/D/1 system has special structures which make the computation of the matrix R simple and efficient, thereby reducing the number of multiplications in each iteration significantly. As a result we were able to keep the computation time very low. Moreover, use of the resulting structural properties makes the computation of the distribution of queue length of the transformed system efficient. The computation of the distribution of waiting time is also shown to be simple by exploiting the special structures.

Personalized Pseudonyms for Servers in the Cloud

Directory of Open Access Journals (Sweden)

Xiao Qiuyu

2017-10-01

Full Text Available A considerable and growing fraction of servers, especially of web servers, is hosted in compute clouds. In this paper we opportunistically leverage this trend to improve privacy of clients from network attackers residing between the clients and the cloud: We design a system that can be deployed by the cloud operator to prevent a network adversary from determining which of the cloud’s tenant servers a client is accessing. The core innovation in our design is a PoPSiCl (pronounced “popsicle”, a persistent pseudonym for a tenant server that can be used by a single client to access the server, whose real identity is protected by the cloud from both passive and active network attackers. When instantiated for TLS-based access to web servers, our design works with all major browsers and requires no additional client-side software and minimal changes to the client user experience. Moreover, changes to tenant servers can be hidden in supporting software (operating systems and web-programming frameworks without imposing on web-content development. Perhaps most notably, our system boosts privacy with minimal impact to web-browsing performance, after some initial setup during a user’s first access to each web server.

Analisis Perbandingan Load Balancing Web Server Tunggal Dengan Web Server Cluster Menggunakan Linux Virtual Server

OpenAIRE

Lukitasari, Desy; Oklilas, Ahmad Fali

2010-01-01

Virtual server adalah server yang mempunyai skalabilitas dan ketersedian yang tinggi yang dibangun diatas sebuah cluster dari beberapa real server. Real server dan load balancer akan saling terkoneksi baik dalam jaringan lokal kecepatan tinggi atau yang terpisah secara geografis. Load balancer dapat mengirim permintaan-permintaan ke server yang berbeda dan membuat paralel service dari sebuah cluster pada sebuah alamat IP tunggal dan meminta pengiriman dapat menggunakan teknologi IP load...

Adaptive optimization for active queue management supporting TCP flows

NARCIS (Netherlands)

Baldi, S.; Kosmatopoulos, Elias B.; Pitsillides, Andreas; Lestas, Marios; Ioannou, Petros A.; Wan, Y.; Chiu, George; Johnson, Katie; Abramovitch, Danny

2016-01-01

An adaptive decentralized strategy for active queue management of TCP flows over communication networks is presented. The proposed strategy solves locally, at each link, an optimal control problem, minimizing a cost composed of residual capacity and buffer queue size. The solution of the optimal

Waiting time analysis for MX/G/1 priority queues with/without vacations under random order of service discipline

Directory of Open Access Journals (Sweden)

Norikazu Kawasaki

2000-01-01

Full Text Available We study MX/G/1 nonpreemptive and preemptive-resume priority queues with/without vacations under random order of service (ROS discipline within each class. By considering the conditional waiting times given the states of the system, which an arbitrary message observes upon arrival, we derive the Laplace-Stieltjes transforms of the waiting time distributions and explicitly obtain the first two moments. The relationship for the second moments under ROS and first-come first-served disciplines extends the one found previously by Takacs and Fuhrmann for non-priority single arrival queues.

A spectral theory approach for extreme value analysis in a tandem of fluid queues

NARCIS (Netherlands)

J.W. Bosman (Joost); R. Núñez Queija (Rudesindo)

2014-01-01

htmlabstractWe consider a model to evaluate performance of streaming media over an unreliable network. Our model consists of a tandem of two fluid queues. The first fluid queue is a Markov modulated fluid queue that models the network congestion, and the second queue represents the play-out buffer.

On finite capacity queueing systems with a general vacation policy

Directory of Open Access Journals (Sweden)

Jacqueline Loris-Teghem

2000-01-01

Full Text Available We consider a Poisson arrival queueing system with finite capacity and a general vacation policy as described in Loris-Teghem [Queueing Systems 3 (1988, 41-52]. From our previous results regarding the stationary queue length distributions immediately after a departure and at an arbitrary epoch, we derive a relation between both distributions which extends a result given in Frey and Takahashi [Operations Research Letters 21 (1997, 95-100] for the particular case of an exhaustive service multiple vacation policy.

Computing moving and intermittent queue propagation in highway work zones.

Science.gov (United States)

2012-07-01

Drivers may experience intermittent congestion and moving queue conditions in work zones due to several reasons such as presence of lane closure, roadway geometric changes, higher demand, lower speed, and reduced capacity. The congestion and queue ha...

The transient M/G/1/0 queue: some bounds and approximations for light traffic with application to reliability

Directory of Open Access Journals (Sweden)

J. Ben Atkinson

1995-01-01

Full Text Available We consider the transient analysis of the M/G/1/0 queue, for which Pn(t denotes the probability that there are no customers in the system at time t, given that there are n(n=0,1 customers in the system at time 0. The analysis, which is based upon coupling theory, leads to simple bounds on Pn(t for the M/G/1/0 and M/PH/1/0 queues and improved bounds for the special case M/Er/1/0. Numerical results are presented for various values of the mean arrival rate λ to demonstrate the increasing accuracy of approximations based upon the above bounds in light traffic, i.e., as λ→0. An important area of application for the M/G/1/0 queue is as a reliability model for a single repairable component. Since most practical reliability problems have λ values that are small relative to the mean service rate, the approximations are potentially useful in that context. A duality relation between the M/G/1/0 and GI/M/1/0 queues is also described.

A novel fair active queue management algorithm based on traffic delay jitter

Science.gov (United States)

Wang, Xue-Shun; Yu, Shao-Hua; Dai, Jin-You; Luo, Ting

2009-11-01

In order to guarantee the quantity of data traffic delivered in the network, congestion control strategy is adopted. According to the study of many active queue management (AQM) algorithms, this paper proposes a novel active queue management algorithm named JFED. JFED can stabilize queue length at a desirable level by adjusting output traffic rate and adopting a reasonable calculation of packet drop probability based on buffer queue length and traffic jitter; and it support burst packet traffic through the packet delay jitter, so that it can traffic flow medium data. JFED impose effective punishment upon non-responsible flow with a full stateless method. To verify the performance of JFED, it is implemented in NS2 and is compared with RED and CHOKe with respect to different performance metrics. Simulation results show that the proposed JFED algorithm outperforms RED and CHOKe in stabilizing instantaneous queue length and in fairness. It is also shown that JFED enables the link capacity to be fully utilized by stabilizing the queue length at a desirable level, while not incurring excessive packet loss ratio.

Perbandingan Metode Simple Queues Dan Queues Tree Untuk Optimasi Manajemen Bandwidth Jaringan Komputer Di STMIK PPKIA Pradnya Paramita Malang

OpenAIRE

Syaifuddin, Aris; Yunus, Mahmud; Sundari, Retno

2013-01-01

This research resulted in a comparison between the Simple Queues method and Queues Tree using Mikrotik router that takes a case study in STMIK PPKIA PRADNYA PARAMITA MALANG has been tested to determine which method is the most optimal deal of bandwidth sharing on computer networks. After finding out where the most optimal method will be applied in STMIK PPKIA PRADNYA PARAMITA MALANG to maximize network performance and bandwidth sharing in place, the results of the study lead to the conclusion...

Optimal Control for Bufferbloat Queue Management Using Indirect Method with Parametric Optimization

Directory of Open Access Journals (Sweden)

Amr Radwan

2016-01-01

Full Text Available Because memory buffers become larger and cheaper, they have been put into network devices to reduce the number of loss packets and improve network performance. However, the consequences of large buffers are long queues at network bottlenecks and throughput saturation, which has been recently noticed in research community as bufferbloat phenomenon. To address such issues, in this article, we design a forward-backward optimal control queue algorithm based on an indirect approach with parametric optimization. The cost function which we want to minimize represents a trade-off between queue length and packet loss rate performance. Through the integration of an indirect approach with parametric optimization, our proposal has advantages of scalability and accuracy compared to direct approaches, while still maintaining good throughput and shorter queue length than several existing queue management algorithms. All numerical analysis, simulation in ns-2, and experiment results are provided to solidify the efficiency of our proposal. In detailed comparisons to other conventional algorithms, the proposed procedure can run much faster than direct collocation methods while maintaining a desired short queue (≈40 packets in simulation and 80 (ms in experiment test.

The evaluation of a formalized queue management system for coronary angiography waiting lists.

Science.gov (United States)

Alter, D A; Newman, Alice M; Cohen, Eric A; Sykora, Kathy; Tu, Jack V

2005-11-01

Lengthy waiting lists for coronary angiography have been described in many health care systems worldwide. The extent to which formal queue management systems may improve the prioritization and survival of patients in the angiography queue is unknown. To prospectively evaluate the performance of a formal queue management system for patients awaiting coronary angiography in Ontario. The coronary angiography urgency scale, a formal queue management system developed in 1993 using a modified Delphi panel, allocates recommended maximum waiting times (RMWTs) in accordance with clinical necessity. By using a provincial clinical registry, 35,617 consecutive patients referred into the coronary angiography queue between April 1, 2001, and March 31, 2002, were prospectively tracked. Cox proportional hazards models were used to examined mortality risk across urgency after adjusting for additional clinical and comorbid factors. Good agreement was determined in urgency ratings between scores from the coronary angiography urgency scale and implicit physician judgement, which was obtained independently at the time of the index referral (weighted kappa = 0.49). The overall mortality in the queue was 0.3% (0.47%, 0.26% and 0.13% for urgent, semiurgent and elective patients, respectively). Urgency, as specified by the coronary angiography urgency scale, was the strongest predictor of death in the queue (Pqueue management system may decrease mortality in the coronary angiography queue. The authors recommend its implementation in health care systems where patients experience excessive waiting time delays for coronary angiography.

Infinite Queue Management via Cascade Control for Industrial Routers in Smart Grid IP Networks

Directory of Open Access Journals (Sweden)

Ku-Hwan Kim

2016-01-01

Full Text Available Smart grid applications experience an extremely wide range of communication delay. Data flows of those applications are normally aggregated at industrial network routers in substations, form infinite (long queues termed bufferbloat issue, and might damage the operation of transmission control protocol. The default queue management scheme, DropTail, in such routers just drops packets if queue is full while the others in literature are mostly based on one-loop feedback control where an optimal point of performance between queue length and drop rate is limited. In this paper, we study the problem of managing a long queue of industrial router at substation under heterogeneous smart grid networks. Specifically, we propose an enqueue-dequeue dropping cascade control using a two-loop design method to control both window size and queue length. Moreover, our proposal can be easily implemented into router firmware with provided discrete expressions. Finally, our simulation results are presented to validate the possible benefits that can be gained from cascade control and compare the existing queue management methods as well.

Time Is Not on Our Side: How Radiology Practices Should Manage Customer Queues.

Science.gov (United States)

Loving, Vilert A; Ellis, Richard L; Rippee, Robert; Steele, Joseph R; Schomer, Donald F; Shoemaker, Stowe

2017-11-01

As health care shifts toward patient-centered care, wait times have received increasing scrutiny as an important metric for patient satisfaction. Long queues form when radiology practices inefficiently service their customers, leading to customer dissatisfaction and a lower perception of value. This article describes a four-step framework for radiology practices to resolve problematic queues: (1) analyze factors contributing to queue formation; (2) improve processes to reduce service times; (3) reduce variability; (4) address the psychology of queues. Copyright © 2017 American College of Radiology. Published by Elsevier Inc. All rights reserved.

International Journal of Science and Technology (STECH) Bahir Dar ...

African Journals Online (AJOL)

Nneka Umera-Okeke

In this paper, analysis of single queue, multi-server with limited system capacity under first come first served discipline was carried out using iterative method. The arrivals of customers and service times of customers are assumed poisson and exponential distributions respectively. This queuing model is an extension of ...

A survey on queues in machining system: Progress from 2010 to 2017

Directory of Open Access Journals (Sweden)

Shekhar C.

2017-01-01

Full Text Available The aim of the present article is to give a historical survey of some important research works related to queues in machining system since 2010. Queues of failed machines in machine repairing problem occur due to the failure of machines at random in the manufacturing industries, where different jobs are performed on machining stations. Machines are subject to failure what may result in significant loss of production, revenue, or goodwill. In addition to the references on queues in machining system, which is also called `Machine Repair Problem' (MRP or `Machine Interference Problem' (MIP, a meticulous list of books and survey papers is also prepared so as to provide a detailed catalog for understanding the research in queueing domain. We have classified the relevant literature according to a year of publishing, methodological, and modeling aspects. The author(s hope that this survey paper could be of help to learners contemplating research on queueing domain.

Routing in Networks with Random Topologies

Science.gov (United States)

Bambos, Nicholas

1997-01-01

We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

NARCIS (Netherlands)

van Houtum, Geert-Jan; Adan, I.J.B.F.; Wessels, J.; Zijm, Willem H.M.

In this paper we study a production system consisting of a group of parallel machines producing multiple job types. Each machine has its own queue and it can process a restricted set of job types only. On arrival a job joins the shortest queue among all queues capable of serving that job. Under the

Transient probabilities for queues with applications to hospital waiting list management.

Science.gov (United States)

Joy, Mark; Jones, Simon

2005-08-01

In this paper we study queuing systems within the NHS. Recently imposed government performance targets lead NHS executives to investigate and instigate alternative management strategies, thereby imposing structural changes on the queues. Under such circumstances, it is most unlikely that such systems are in equilibrium. It is crucial, in our opinion, to recognise this state of affairs in order to make a balanced assessment of the role of queue management in the modern NHS. From a mathematical perspective it should be emphasised that measures of the state of a queue based upon the assumption of statistical equilibrium (a pervasive methodology in the study of queues) are simply wrong in the above scenario. To base strategic decisions around such ideas is therefore highly questionable and it is one of the purposes of this paper to offer alternatives: we present some (recent) research whose results generate performance measures and measures of risk, for example, of waiting-times growing unacceptably large; we emphasise that these results concern the transient behaviour of the queueing model-there is no asssumption of statistical equilibrium. We also demonstrate that our results are computationally tractable.

BioQueue: a novel pipeline framework to accelerate bioinformatics analysis.

Science.gov (United States)

Yao, Li; Wang, Heming; Song, Yuanyuan; Sui, Guangchao

2017-10-15

With the rapid development of Next-Generation Sequencing, a large amount of data is now available for bioinformatics research. Meanwhile, the presence of many pipeline frameworks makes it possible to analyse these data. However, these tools concentrate mainly on their syntax and design paradigms, and dispatch jobs based on users' experience about the resources needed by the execution of a certain step in a protocol. As a result, it is difficult for these tools to maximize the potential of computing resources, and avoid errors caused by overload, such as memory overflow. Here, we have developed BioQueue, a web-based framework that contains a checkpoint before each step to automatically estimate the system resources (CPU, memory and disk) needed by the step and then dispatch jobs accordingly. BioQueue possesses a shell command-like syntax instead of implementing a new script language, which means most biologists without computer programming background can access the efficient queue system with ease. BioQueue is freely available at https://github.com/liyao001/BioQueue. The extensive documentation can be found at http://bioqueue.readthedocs.io. li_yao@outlook.com or gcsui@nefu.edu.cn. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Modelling of packet traffic with matrix analytic methods

DEFF Research Database (Denmark)

Andersen, Allan T.

1995-01-01

BISDN network. The heuristic formula did not seem to yield substantially better results than already available approximations. Finally, some results for the finite capacity BMAP/G/1 queue have been obtained. The steady state probability vector of the embedded chain is found by a direct method where...... process. A heuristic formula for the tail behaviour of a single server queue fed by a superposition of renewal processes has been evaluated. The evaluation was performed by applying Matrix Analytic methods. The heuristic formula has applications in the Call Admission Control (CAC) procedure of the future...

UNIX secure server : a free, secure, and functional server example

OpenAIRE

Sastre, Hugo

2016-01-01

The purpose of this thesis work was to introduce UNIX server as a personal server but also as a start point for investigation and developing at a professional level. The objective of this thesis was to build a secure server providing not only a FTP server but also an HTTP server and a cloud system for remote backups. OpenBSD was used as the operating system. OpenBSD is a UNIX-like operating system made by hackers for hackers. The difference with other systems that might partially provid...

Weak Convergence and Fluid Limits in Optimal Time-to-Empty Queueing Control Problems

Energy Technology Data Exchange (ETDEWEB)

Day, Martin V., E-mail: day@math.vt.edu [Virginia Tech, Department of Mathematics (United States)

2011-12-15

We consider a class of controlled queue length processes, in which the control allocates each server's effort among the several classes of customers requiring its service. Served customers are routed through the network according to (prescribed) routing probabilities. In the fluid rescaling, X{sup n}(t) = 1/nX(nt) , we consider the optimal control problem of minimizing the integral of an undiscounted positive running cost until the first time that X{sup n}=0. Our main result uses weak convergence ideas to show that the optimal value functions V{sup n} of the stochastic control problems for X{sup n}(t) converge (as n{yields}{infinity}) to the optimal value V of a control problem for the limiting fluid process. This requires certain equicontinuity and boundedness hypotheses on (V{sup n}). We observe that these are essentially the same hypotheses that would be needed for the Barles-Perthame approach in terms of semicontinuous viscosity solutions. Sufficient conditions for these equicontinuity and boundedness properties are briefly discussed.

Strategic behavior and social outcomes in a bottleneck queue

DEFF Research Database (Denmark)

Breinbjerg, J.; Sebald, Alexander; Østerdal, L. P.

2016-01-01

the first-in-first-out (FIFO), last-in-first-out (LIFO), and service-in-random-order (SIRO) queue disciplines and compare these predictions to outcomes from a laboratory experiment. In line with our theoretical predictions, we find that people arrive with greater dispersion when participating under the LIFO......We theoretically and experimentally study the differential incentive effects of three well known queue disciplines in a strategic environment in which a bottleneck facility opens and impatient players decide when to arrive. For a class of three-player games, we derive equilibrium arrivals under...... discipline, whereas they tend to arrive immediately under FIFO and SIRO. As a consequence, shorter waiting times are obtained under LIFO as compared to FIFO and SIRO. However, while our theoretical predictions admit higher welfare under LIFO, this is not recovered experimentally as the queue disciplines...

Client/server models for transparent, distributed computational resources

International Nuclear Information System (INIS)

Hammer, K.E.; Gilman, T.L.

1991-01-01

Client/server models are proposed to address issues of shared resources in a distributed, heterogeneous UNIX environment. Recent development of automated Remote Procedure Call (RPC) interface generator has simplified the development of client/server models. Previously, implementation of the models was only possible at the UNIX socket level. An overview of RPCs and the interface generator will be presented and will include a discussion of generation and installation of remote services, the RPC paradigm, and the three levels of RPC programming. Two applications, the Nuclear Plant Analyzer (NPA) and a fluids simulation using molecular modelling, will be presented to demonstrate how client/server models using RPCs and External Data Representations (XDR) have been used production/computation situations. The NPA incorporates a client/server interface for transferring/translation of TRAC or RELAP results from the UNICOS Cray to a UNIX workstation. The fluids simulation program utilizes the client/server model to access the Cray via a single function allowing it to become a shared co-processor to the workstation application. 5 refs., 6 figs

Research into Queueing Network Theory.

Science.gov (United States)

1977-09-01

and Zeigler, B. (1975) "Equilibrium properties of arbitrarily interconnected queueing netowrks ," Tech. Report 75-4, Computer and Communication...Associate. The project was extremely fortunate to secure the services of Dr. Wendel. Dr. Wendel was a project member for one month in the summer of

Usage of Thin-Client/Server Architecture in Computer Aided Education

Science.gov (United States)

Cimen, Caghan; Kavurucu, Yusuf; Aydin, Halit

2014-01-01

With the advances of technology, thin-client/server architecture has become popular in multi-user/single network environments. Thin-client is a user terminal in which the user can login to a domain and run programs by connecting to a remote server. Recent developments in network and hardware technologies (cloud computing, virtualization, etc.)…

Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments.

Directory of Open Access Journals (Sweden)

Qaisar Ayub

Full Text Available Delay Tolerant Network (DTN multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.

Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments.

Science.gov (United States)

Ayub, Qaisar; Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

2018-01-01

Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.

A Queueing Model for Supervisory Control of Unmanned Autonomous Vehicles

Science.gov (United States)

2013-09-01

Autonomous Vehicles Joseph DiVita, PhD Robert L. Morris Maria Olinda Rodas SSC Pacific Approved...298 (Rev. 8/98) Prescribed by ANSI Std. Z39.18 09–2013 Final A Queueing Model for Supervisory Control of Unmanned Autonomous Vehicles Joseph...Mission Area: Command and Control, Queueing Model; Supervisory Control; Unmanned Autonomous Vehicles M. O. Rodas U U U U 38 (619)

An ASIP model with general gate opening intervals

NARCIS (Netherlands)

Boxma, O.J.; Kella, O.; Yechiali, U.

2016-01-01

We consider an asymmetric inclusion process, which can also be viewed as a model of n queues in series. Each queue has a gate behind it, which can be seen as a server. When a gate opens, all customers in the corresponding queue instantaneously move to the next queue and form a cluster with the

Markov queue game with virtual reality strategies | Nwobi-Okoye ...

African Journals Online (AJOL)

A non cooperative markov game with several unique characteristics was introduced. Some of these characteristics include: the existence of a single phase multi server queuing model and markovian transition matrix/matrices for each game, introduction of virtual situations (virtual reality) or dummies to improve the chances ...

Apparatus and method for managing digital resources by passing digital resource tokens between queues

Science.gov (United States)

Crawford, H.J.; Lindenstruth, V.

1999-06-29

A method of managing digital resources of a digital system includes the step of reserving token values for certain digital resources in the digital system. A selected token value in a free-buffer-queue is then matched to an incoming digital resource request. The selected token value is then moved to a valid-request-queue. The selected token is subsequently removed from the valid-request-queue to allow a digital agent in the digital system to process the incoming digital resource request associated with the selected token. Thereafter, the selected token is returned to the free-buffer-queue. 6 figs.

Fluid queues and regular variation

NARCIS (Netherlands)

O.J. Boxma (Onno)

1996-01-01

textabstractThis paper considers a fluid queueing system, fed by $N$ independent sources that alternate between silence and activity periods. We assume that the distribution of the activity periods of one or more sources is a regularly varying function of index $zeta$. We show that its fat tail

Physics development of web-based tools for use in hardware clusters doing lattice physics

International Nuclear Information System (INIS)

Dreher, P.; Akers, W.; Chen, J.; Chen, Y.; Watson, C.

2002-01-01

Jefferson Lab and MIT are developing a set of web-based tools within the Lattice Hadron Physics Collaboration to allow lattice QCD theorists to treat the computational facilities located at the two sites as a single meta-facility. The prototype Lattice Portal provides researchers the ability to submit jobs to the cluster, browse data caches, and transfer files between cache and off-line storage. The user can view the configuration of the PBS servers and to monitor both the status of all batch queues as well as the jobs in each queue. Work is starting on expanding the present system to include job submissions at the meta-facility level (shared queue), as well as multi-site file transfers and enhanced policy-based data management capabilities

Physics development of web-based tools for use in hardware clusters doing lattice physics

International Nuclear Information System (INIS)

Dreher, P.; Akers, Walt; Jian-ping Chen; Chen, Y.; William, A. Watson III

2001-01-01

Jefferson Lab and MIT are developing a set of web-based tools within the Lattice Hadron Physics Collaboration to allow lattice QCD theorists to treat the computational facilities located at the two sites as a single meta-facility. The prototype Lattice Portal provides researchers the ability to submit jobs to the cluster, browse data caches, and transfer files between cache and off-line storage. The user can view the configuration of the PBS servers and to monitor both the status of all batch queues as well as the jobs in each queue. Work is starting on expanding the present system to include job submissions at the meta-facility level (shared queue), as well as multi-site file transfers and enhanced policy-based data management capabilities

Physics development of web-based tools for use in hardware clusters doing lattice physics

Energy Technology Data Exchange (ETDEWEB)

Dreher, P.; Akers, W.; Chen, J.; Chen, Y.; Watson, C

2002-03-01

Jefferson Lab and MIT are developing a set of web-based tools within the Lattice Hadron Physics Collaboration to allow lattice QCD theorists to treat the computational facilities located at the two sites as a single meta-facility. The prototype Lattice Portal provides researchers the ability to submit jobs to the cluster, browse data caches, and transfer files between cache and off-line storage. The user can view the configuration of the PBS servers and to monitor both the status of all batch queues as well as the jobs in each queue. Work is starting on expanding the present system to include job submissions at the meta-facility level (shared queue), as well as multi-site file transfers and enhanced policy-based data management capabilities.

Performance study of Active Queue Management methods: Adaptive GRED, REDD, and GRED-Linear analytical model

Directory of Open Access Journals (Sweden)

Hussein Abdel-jaber

2015-10-01

Full Text Available Congestion control is one of the hot research topics that helps maintain the performance of computer networks. This paper compares three Active Queue Management (AQM methods, namely, Adaptive Gentle Random Early Detection (Adaptive GRED, Random Early Dynamic Detection (REDD, and GRED Linear analytical model with respect to different performance measures. Adaptive GRED and REDD are implemented based on simulation, whereas GRED Linear is implemented as a discrete-time analytical model. Several performance measures are used to evaluate the effectiveness of the compared methods mainly mean queue length, throughput, average queueing delay, overflow packet loss probability, and packet dropping probability. The ultimate aim is to identify the method that offers the highest satisfactory performance in non-congestion or congestion scenarios. The first comparison results that are based on different packet arrival probability values show that GRED Linear provides better mean queue length; average queueing delay and packet overflow probability than Adaptive GRED and REDD methods in the presence of congestion. Further and using the same evaluation measures, Adaptive GRED offers a more satisfactory performance than REDD when heavy congestion is present. When the finite capacity of queue values varies the GRED Linear model provides the highest satisfactory performance with reference to mean queue length and average queueing delay and all the compared methods provide similar throughput performance. However, when the finite capacity value is large, the compared methods have similar results in regard to probabilities of both packet overflowing and packet dropping.

Parallel discrete-event simulation of FCFS stochastic queueing networks

Science.gov (United States)

Nicol, David M.

1988-01-01

Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

Queue and stack sorting algorithm optimization and performance analysis

Science.gov (United States)

Qian, Mingzhu; Wang, Xiaobao

2018-04-01

Sorting algorithm is one of the basic operation of a variety of software development, in data structures course specializes in all kinds of sort algorithm. The performance of the sorting algorithm is directly related to the efficiency of the software. A lot of excellent scientific research queue is constantly optimizing algorithm, algorithm efficiency better as far as possible, the author here further research queue combined with stacks of sorting algorithms, the algorithm is mainly used for alternating operation queue and stack storage properties, Thus avoiding the need for a large number of exchange or mobile operations in the traditional sort. Before the existing basis to continue research, improvement and optimization, the focus on the optimization of the time complexity of the proposed optimization and improvement, The experimental results show that the improved effectively, at the same time and the time complexity and space complexity of the algorithm, the stability study corresponding research. The improvement and optimization algorithm, improves the practicability.

Fluid queues and regular variation

NARCIS (Netherlands)

Boxma, O.J.

1996-01-01

This paper considers a fluid queueing system, fed by N independent sources that alternate between silence and activity periods. We assume that the distribution of the activity periods of one or more sources is a regularly varying function of index ¿. We show that its fat tail gives rise to an even

GeoServer cookbook

CERN Document Server

Iacovella, Stefano

2014-01-01

This book is ideal for GIS experts, developers, and system administrators who have had a first glance at GeoServer and who are eager to explore all its features in order to configure professional map servers. Basic knowledge of GIS and GeoServer is required.

Manajemen Bandwidth Simple Queue dan Queue Tree pada PT. Endorsindo Makmur Selaras

OpenAIRE

Budiman, Arif

2015-01-01

  The purpose of this study is to analyze and optimize the bandwidth management at PT. Endorsindo Makmur Selaras, with the expectation that the distribution of bandwidth can be evenly distributed to each employee so that the employee can improve performance and quality of the company. Research methods used include analysis methods (survey and interview system that runs directly on the user) and to optimize bandwidth management method to configure the proxy using the Queue Tree. The re...

Analysing admission rules to a service system with two job classes and mandatory pre-emption

DEFF Research Database (Denmark)

Larsen, Christian

, the pre-emptive action will cause a time delay before the server can start the service. Therefoe, the administrator might in some instances deny a class 2 job access to an idle server and instead hold it back in queue. We develop a semi-Markov decision model for this problem. In order to compute......We consider a queueing system consisting of S identical servers and two job classes, where class 1 jobs must always be processed as soon as possible. Therefore, the administrator of the system must, if neccesary, pre-empt a class 2 job and allocate the server to an arriving class 1 job. However...

Infinite Queue Management via Cascade Control for Industrial Routers in Smart Grid IP Networks

OpenAIRE

Kim, Ku-Hwan; To, Hoang-Linh; Hwang, Won-Joo; Lee, Jung-Tae

2016-01-01

Smart grid applications experience an extremely wide range of communication delay. Data flows of those applications are normally aggregated at industrial network routers in substations, form infinite (long) queues termed bufferbloat issue, and might damage the operation of transmission control protocol. The default queue management scheme, DropTail, in such routers just drops packets if queue is full while the others in literature are mostly based on one-loop feedback control where an optimal...

DecreaseKeys are Expensive for External Memory Priority Queues

OpenAIRE

Eenberg, Kasper; Larsen, Kasper Green; Yu, Huacheng

2016-01-01

One of the biggest open problems in external memory data structures is the priority queue problem with DecreaseKey operations. If only Insert and ExtractMin operations need to be supported, one can design a comparison-based priority queue performing $O((N/B)\\lg_{M/B} N)$ I/Os over a sequence of $N$ operations, where $B$ is the disk block size in number of words and $M$ is the main memory size in number of words. This matches the lower bound for comparison-based sorting and is hence optimal fo...

Dobrushin's approach to queueing network theory

Directory of Open Access Journals (Sweden)

F. I. Karpelevich

1996-01-01

Full Text Available R.L. Dobrushin (1929-1995 made substantial contributions to Queueing Network Theory (QNT. A review of results from QNT which arose from his ideas or were connected to him in other ways is given. We also comment on various related open problems.

An asymptotic analysis of closed queueing networks with branching populations

OpenAIRE

Bayer, N.; Coffman, E.G.; Kogan, Y.A.

1995-01-01

textabstractClosed queueing networks have proven to be valuable tools for system performance analysis. In this paper, we broaden the applications of such networks by incorporating populations of {em branching customers: whenever a customer completes service at some node of the network, it is replaced by N>=0 customers, each routed independently to a next node, where N has a given, possibly node-dependent branching distribution. Applications of these branching and queueing networks focus on {e...

An introduction to queueing theory modeling and analysis in applications

CERN Document Server

Bhat, U Narayan

2015-01-01

This introductory textbook is designed for a one-semester course on queueing theory that does not require a course on stochastic processes as a prerequisite. By integrating the necessary background on stochastic processes with the analysis of models, the work provides a sound foundational introduction to the modeling and analysis of queueing systems for a wide interdisciplinary audience of students in mathematics, statistics, and applied disciplines such as computer science, operations research, and engineering. This edition includes additional topics in methodology and applications. Key features: • An introductory chapter including a historical account of the growth of queueing theory in more than 100 years. • A modeling-based approach with emphasis on identification of models. • Rigorous treatment of the foundations of basic models commonly used in applications with appropriate references for advanced topics. • Applications in manufacturing and, computer and communication systems. • A chapter on ...

Exclusive queueing model including the choice of service windows

Science.gov (United States)

Tanaka, Masahiro; Yanagisawa, Daichi; Nishinari, Katsuhiro

2018-01-01

In a queueing system involving multiple service windows, choice behavior is a significant concern. This paper incorporates the choice of service windows into a queueing model with a floor represented by discrete cells. We contrived a logit-based choice algorithm for agents considering the numbers of agents and the distances to all service windows. Simulations were conducted with various parameters of agent choice preference for these two elements and for different floor configurations, including the floor length and the number of service windows. We investigated the model from the viewpoint of transit times and entrance block rates. The influences of the parameters on these factors were surveyed in detail and we determined that there are optimum floor lengths that minimize the transit times. In addition, we observed that the transit times were determined almost entirely by the entrance block rates. The results of the presented model are relevant to understanding queueing systems including the choice of service windows and can be employed to optimize facility design and floor management.

Beginning SQL Server Modeling Model-driven Application Development in SQL Server

CERN Document Server

Weller, Bart

2010-01-01

Get ready for model-driven application development with SQL Server Modeling! This book covers Microsoft's SQL Server Modeling (formerly known under the code name "Oslo") in detail and contains the information you need to be successful with designing and implementing workflow modeling. Beginning SQL Server Modeling will help you gain a comprehensive understanding of how to apply DSLs and other modeling components in the development of SQL Server implementations. Most importantly, after reading the book and working through the examples, you will have considerable experience using SQL M

Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues

Science.gov (United States)

Chakravarthy, Srinivas R.; Rumyantsev, Alexander

2018-03-01

Cloud computing is continuing to prove its flexibility and versatility in helping industries and businesses as well as academia as a way of providing needed computing capacity. As an important alternative to cloud computing, desktop grids allow to utilize the idle computer resources of an enterprise/community by means of distributed computing system, providing a more secure and controllable environment with lower operational expenses. Further, both cloud computing and desktop grids are meant to optimize limited resources and at the same time to decrease the expected latency for users. The crucial parameter for optimization both in cloud computing and in desktop grids is the level of redundancy (replication) for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results.

Efficient Redundancy Techniques in Cloud and Desktop Grid Systems using MAP/G/c-type Queues

Directory of Open Access Journals (Sweden)

Chakravarthy Srinivas R.

2018-03-01

Full Text Available Cloud computing is continuing to prove its flexibility and versatility in helping industries and businesses as well as academia as a way of providing needed computing capacity. As an important alternative to cloud computing, desktop grids allow to utilize the idle computer resources of an enterprise/community by means of distributed computing system, providing a more secure and controllable environment with lower operational expenses. Further, both cloud computing and desktop grids are meant to optimize limited resources and at the same time to decrease the expected latency for users. The crucial parameter for optimization both in cloud computing and in desktop grids is the level of redundancy (replication for service requests/workunits. In this paper we study the optimal replication policies by considering three variations of Fork-Join systems in the context of a multi-server queueing system with a versatile point process for the arrivals. For services we consider phase type distributions as well as shifted exponential and Weibull. We use both analytical and simulation approach in our analysis and report some interesting qualitative results.

Departure Queue Prediction for Strategic and Tactical Surface Scheduler Integration

Science.gov (United States)

Zelinski, Shannon; Windhorst, Robert

2016-01-01

A departure metering concept to be demonstrated at Charlotte Douglas International Airport (CLT) will integrate strategic and tactical surface scheduling components to enable the respective collaborative decision making and improved efficiency benefits these two methods of scheduling provide. This study analyzes the effect of tactical scheduling on strategic scheduler predictability. Strategic queue predictions and target gate pushback times to achieve a desired queue length are compared between fast time simulations of CLT surface operations with and without tactical scheduling. The use of variable departure rates as a strategic scheduler input was shown to substantially improve queue predictions over static departure rates. With target queue length calibration, the strategic scheduler can be tuned to produce average delays within one minute of the tactical scheduler. However, root mean square differences between strategic and tactical delays were between 12 and 15 minutes due to the different methods the strategic and tactical schedulers use to predict takeoff times and generate gate pushback clearances. This demonstrates how difficult it is for the strategic scheduler to predict tactical scheduler assigned gate delays on an individual flight basis as the tactical scheduler adjusts departure sequence to accommodate arrival interactions. Strategic/tactical scheduler compatibility may be improved by providing more arrival information to the strategic scheduler and stabilizing tactical scheduler changes to runway sequence in response to arrivals.

Moving toward queue operations at the Large Binocular Telescope Observatory

Science.gov (United States)

Edwards, Michelle L.; Summers, Doug; Astier, Joseph; Suarez Sola, Igor; Veillet, Christian; Power, Jennifer; Cardwell, Andrew; Walsh, Shane

2016-07-01

The Large Binocular Telescope Observatory (LBTO), a joint scientific venture between the Instituto Nazionale di Astrofisica (INAF), LBT Beteiligungsgesellschaft (LBTB), University of Arizona, Ohio State University (OSU), and the Research Corporation, is one of the newest additions to the world's collection of large optical/infrared ground-based telescopes. With its unique, twin 8.4m mirror design providing a 22.8 meter interferometric baseline and the collecting area of an 11.8m telescope, LBT has a window of opportunity to exploit its singular status as the "first" of the next generation of Extremely Large Telescopes (ELTs). Prompted by urgency to maximize scientific output during this favorable interval, LBTO recently re-evaluated its operations model and developed a new strategy that augments classical observing with queue. Aided by trained observatory staff, queue mode will allow for flexible, multi-instrument observing responsive to site conditions. Our plan is to implement a staged rollout that will provide many of the benefits of queue observing sooner rather than later - with more bells and whistles coming in future stages. In this paper, we outline LBTO's new scientific model, focusing specifically on our "lean" resourcing and development, reuse and adaptation of existing software, challenges presented from our one-of-a-kind binocular operations, and lessons learned. We also outline further stages of development and our ultimate goals for queue.

Mastering Lync Server 2010

CERN Document Server

Winters, Nathan

2012-01-01

An in-depth guide on the leading Unified Communications platform Microsoft Lync Server 2010 maximizes communication capabilities in the workplace like no other Unified Communications (UC) solution. Written by experts who know Lync Server inside and out, this comprehensive guide shows you step by step how to administer the newest and most robust version of Lync Server. Along with clear and detailed instructions, learning is aided by exercise problems and real-world examples of established Lync Server environments. You'll gain the skills you need to effectively deploy Lync Server 2010 and be on

Cost Optimal Elastic Auto-Scaling in Cloud Infrastructure

Science.gov (United States)

Mukhopadhyay, S.; Sidhanta, S.; Ganguly, S.; Nemani, R. R.

2014-12-01

Today, elastic scaling is critical part of leveraging cloud. Elastic scaling refers to adding resources only when it is needed and deleting resources when not in use. Elastic scaling ensures compute/server resources are not over provisioned. Today, Amazon and Windows Azure are the only two platform provider that allow auto-scaling of cloud resources where servers are automatically added and deleted. However, these solution falls short of following key features: A) Requires explicit policy definition such server load and therefore lacks any predictive intelligence to make optimal decision; B) Does not decide on the right size of resource and thereby does not result in cost optimal resource pool. In a typical cloud deployment model, we consider two types of application scenario: A. Batch processing jobs → Hadoop/Big Data case B. Transactional applications → Any application that process continuous transactions (Requests/response) In reference of classical queuing model, we are trying to model a scenario where servers have a price and capacity (size) and system can add delete servers to maintain a certain queue length. Classical queueing models applies to scenario where number of servers are constant. So we cannot apply stationary system analysis in this case. We investigate the following questions 1. Can we define Job queue and use the metric to define such a queue to predict the resource requirement in a quasi-stationary way? Can we map that into an optimal sizing problem? 2. Do we need to get into a level of load (CPU/Data) on server level to characterize the size requirement? How do we learn that based on Job type?

Queue Management Practices of Quick ServiceRestaurants (QSR in Lipa City, Philippines

Directory of Open Access Journals (Sweden)

Leoven A. Austria

2015-12-01

Full Text Available –Problems regarding waiting line in quick service restaurants (QSR has been one of the main concerns of industries and scholars nowadays. It is because people today demand not only for qualityfood but also for speed. Quick service restaurant players explore on the approaches to optimize the efficiency of restaurant management. One important area that defines how well and efficient a fast food restaurant delivers its product and services to customers is its waiting line (queue management practices. The study was conducted at Lipa City, involving five popular quick service restaurants named by the researcher as QSR A, B, C, D, and E. It made used of 363customer respondents proportionally obtained from five restaurants.It intended to assess the extent of implementation of the queue management practices of the restaurants and the level of satisfaction of the customers in such practices in terms of customer arrival, waiting line and service facility. The findings revealed the queuing system used and the waiting line structured utilized by the restaurants. The extent of implementation of the queue management practices in the three areas mentioned of the five QSR’s was presented comparatively. Likewise, the level of customer’s satisfaction on the queue management practices was also determined. Significant difference in the extent of implementation and in the level of customer satisfaction were determined if the respondents were grouped according to restaurant’s profile. Recommendations in the improvement of queue were given based on the findings.

Markov-modulated and feedback fluid queues

NARCIS (Netherlands)

Scheinhardt, Willem R.W.

1998-01-01

In the last twenty years the field of Markov-modulated fluid queues has received considerable attention. In these models a fluid reservoir receives and/or releases fluid at rates which depend on the actual state of a background Markov chain. In the first chapter of this thesis we give a short

Fokker-Planck description for the queue dynamics of large tick stocks

Science.gov (United States)

Garèche, A.; Disdier, G.; Kockelkoren, J.; Bouchaud, J.-P.

2013-09-01

Motivated by empirical data, we develop a statistical description of the queue dynamics for large tick assets based on a two-dimensional Fokker-Planck (diffusion) equation. Our description explicitly includes state dependence, i.e., the fact that the drift and diffusion depend on the volume present on both sides of the spread. “Jump” events, corresponding to sudden changes of the best limit price, must also be included as birth-death terms in the Fokker-Planck equation. All quantities involved in the equation can be calibrated using high-frequency data on the best quotes. One of our central findings is that the dynamical process is approximately scale invariant, i.e., the only relevant variable is the ratio of the current volume in the queue to its average value. While the latter shows intraday seasonalities and strong variability across stocks and time periods, the dynamics of the rescaled volumes is universal. In terms of rescaled volumes, we found that the drift has a complex two-dimensional structure, which is a sum of a gradient contribution and a rotational contribution, both stable across stocks and time. This drift term is entirely responsible for the dynamical correlations between the ask queue and the bid queue.

Approximations for the waiting time distribution in an M/G/c priority queue

NARCIS (Netherlands)

Al Hanbali, Ahmad; Alvarez, Elisa; van der Heijden, Matthijs C.

2013-01-01

We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/G/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the

Queue balancing of load and expedition service in a cement industry in Brazil

Directory of Open Access Journals (Sweden)

David Custódio de Sena

2013-11-01

Full Text Available The load and weight process in a cement industry is one of logistic step that shows the biggest time of occurrence, increasing the queues. This study aims to do a scenarios to solve this queue problem. This way, it pretends to find an better resources distribuition.

A robust and high-performance queue management controller for large round trip time networks

Science.gov (United States)

Khoshnevisan, Ladan; Salmasi, Farzad R.

2016-05-01

Congestion management for transmission control protocol is of utmost importance to prevent packet loss within a network. This necessitates strategies for active queue management. The most applied active queue management strategies have their inherent disadvantages which lead to suboptimal performance and even instability in the case of large round trip time and/or external disturbance. This paper presents an internal model control robust queue management scheme with two degrees of freedom in order to restrict the undesired effects of large and small round trip time and parameter variations in the queue management. Conventional approaches such as proportional integral and random early detection procedures lead to unstable behaviour due to large delay. Moreover, internal model control-Smith scheme suffers from large oscillations due to the large round trip time. On the other hand, other schemes such as internal model control-proportional integral and derivative show excessive sluggish performance for small round trip time values. To overcome these shortcomings, we introduce a system entailing two individual controllers for queue management and disturbance rejection, simultaneously. Simulation results based on Matlab/Simulink and also Network Simulator 2 (NS2) demonstrate the effectiveness of the procedure and verify the analytical approach.

Disk Storage Server

CERN Multimedia

This model was a disk storage server used in the Data Centre up until 2012. Each tray contains a hard disk drive (see the 5TB hard disk drive on the main disk display section - this actually fits into one of the trays). There are 16 trays in all per server. There are hundreds of these servers mounted on racks in the Data Centre, as can be seen.

Application of queueing models to multiprogrammed computer systems operating in a time-critical environment

Science.gov (United States)

Eckhardt, D. E., Jr.

1979-01-01

A model of a central processor (CPU) which services background applications in the presence of time critical activity is presented. The CPU is viewed as an M/M/1 queueing system subject to periodic interrupts by deterministic, time critical process. The Laplace transform of the distribution of service times for the background applications is developed. The use of state of the art queueing models for studying the background processing capability of time critical computer systems is discussed and the results of a model validation study which support this application of queueing models are presented.

Web server attack analyzer

OpenAIRE

Mižišin, Michal

2013-01-01

Web server attack analyzer - Abstract The goal of this work was to create prototype of analyzer of injection flaws attacks on web server. Proposed solution combines capabilities of web application firewall and web server log analyzer. Analysis is based on configurable signatures defined by regular expressions. This paper begins with summary of web attacks, followed by detection techniques analysis on web servers, description and justification of selected implementation. In the end are charact...

Queueing models for token and slotted ring networks. Thesis

Science.gov (United States)

Peden, Jeffery H.

1990-01-01

Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.

Implementing Citrix XenServer Quickstarter

CERN Document Server

Ahmed, Gohar

2013-01-01

Implementing Citrix XenServer Quick Starter is a practical, hands-on guide that will help you get started with the Citrix XenServer Virtualization technology with easy-to-follow instructions.Implementing Citrix XenServer Quick Starter is for system administrators who have little to no information on virtualization and specifically Citrix XenServer Virtualization. If you're managing a lot of physical servers and are tired of installing, deploying, updating, and managing physical machines on a daily basis over and over again, then you should probably explore your option of XenServer Virtualizati

Server virtualization solutions

OpenAIRE

Jonasts, Gusts

2012-01-01

Currently in the information technology sector that is responsible for a server infrastructure is a huge development in the field of server virtualization on x86 computer architecture. As a prerequisite for such a virtualization development is growth in server productivity and underutilization of available computing power. Several companies in the market are working on two virtualization architectures – hypervizor and hosting. In this paper several of virtualization products that use host...

Web Server Embedded System

Directory of Open Access Journals (Sweden)

Adharul Muttaqin

2014-07-01

Full Text Available Abstrak Embedded sistem saat ini menjadi perhatian khusus pada teknologi komputer, beberapa sistem operasi linux dan web server yang beraneka ragam juga sudah dipersiapkan untuk mendukung sistem embedded, salah satu aplikasi yang dapat digunakan dalam operasi pada sistem embedded adalah web server. Pemilihan web server pada lingkungan embedded saat ini masih jarang dilakukan, oleh karena itu penelitian ini dilakukan dengan menitik beratkan pada dua buah aplikasi web server yang tergolong memiliki fitur utama yang menawarkan “keringanan” pada konsumsi CPU maupun memori seperti Light HTTPD dan Tiny HTTPD. Dengan menggunakan parameter thread (users, ramp-up periods, dan loop count pada stress test embedded system, penelitian ini menawarkan solusi web server manakah diantara Light HTTPD dan Tiny HTTPD yang memiliki kecocokan fitur dalam penggunaan embedded sistem menggunakan beagleboard ditinjau dari konsumsi CPU dan memori. Hasil penelitian menunjukkan bahwa dalam hal konsumsi CPU pada beagleboard embedded system lebih disarankan penggunaan Light HTTPD dibandingkan dengan tiny HTTPD dikarenakan terdapat perbedaan CPU load yang sangat signifikan antar kedua layanan web tersebut Kata kunci: embedded system, web server Abstract Embedded systems are currently of particular concern in computer technology, some of the linux operating system and web server variegated also prepared to support the embedded system, one of the applications that can be used in embedded systems are operating on the web server. Selection of embedded web server on the environment is still rarely done, therefore this study was conducted with a focus on two web application servers belonging to the main features that offer a "lightness" to the CPU and memory consumption as Light HTTPD and Tiny HTTPD. By using the parameters of the thread (users, ramp-up periods, and loop count on a stress test embedded systems, this study offers a solution of web server which between the Light

Research on elastic resource management for multi-queue under cloud computing environment

Science.gov (United States)

CHENG, Zhenjing; LI, Haibo; HUANG, Qiulan; Cheng, Yaodong; CHEN, Gang

2017-10-01

As a new approach to manage computing resource, virtualization technology is more and more widely applied in the high-energy physics field. A virtual computing cluster based on Openstack was built at IHEP, using HTCondor as the job queue management system. In a traditional static cluster, a fixed number of virtual machines are pre-allocated to the job queue of different experiments. However this method cannot be well adapted to the volatility of computing resource requirements. To solve this problem, an elastic computing resource management system under cloud computing environment has been designed. This system performs unified management of virtual computing nodes on the basis of job queue in HTCondor based on dual resource thresholds as well as the quota service. A two-stage pool is designed to improve the efficiency of resource pool expansion. This paper will present several use cases of the elastic resource management system in IHEPCloud. The practical run shows virtual computing resource dynamically expanded or shrunk while computing requirements change. Additionally, the CPU utilization ratio of computing resource was significantly increased when compared with traditional resource management. The system also has good performance when there are multiple condor schedulers and multiple job queues.

Open problems in Gaussian fluid queueing theory

NARCIS (Netherlands)

Dȩbicki, K.; Mandjes, M.

2011-01-01

We present three challenging open problems that originate from the analysis of the asymptotic behavior of Gaussian fluid queueing models. In particular, we address the problem of characterizing the correlation structure of the stationary buffer content process, the speed of convergence to

A genetic algorithm for finding good balanced sequences in a customer assignment problem with no state information

NARCIS (Netherlands)

Hordijk, W.; Hordijk, A.; Heidergott, B.F.

2015-01-01

In this paper, we study the control problem of optimal assignment of tasks to servers in a multi-server queue with inhomogeneous servers. In order to improve the performance of the system, we use a periodic deterministic sequence of job assignments to servers called a billiard sequence. We then use

A Two-Stage Queue Model to Optimize Layout of Urban Drainage System considering Extreme Rainstorms

OpenAIRE

He, Xinhua; Hu, Wenfa

2017-01-01

Extreme rainstorm is a main factor to cause urban floods when urban drainage system cannot discharge stormwater successfully. This paper investigates distribution feature of rainstorms and draining process of urban drainage systems and uses a two-stage single-counter queue method M/M/1→M/D/1 to model urban drainage system. The model emphasizes randomness of extreme rainstorms, fuzziness of draining process, and construction and operation cost of drainage system. Its two objectives are total c...

PONGO: a web server for multiple predictions of all-alpha transmembrane proteins

DEFF Research Database (Denmark)

Amico, M.; Finelli, M.; Rossi, I.

2006-01-01

of the organism and more importantly with the same sequence profile for a given sequence when required. Here we present a new web server that incorporates the state-of-the-art topology predictors in a single framework, so that putative users can interactively compare and evaluate four predictions simultaneously...... for a given sequence. Together with the predicted topology, the server also displays a signal peptide prediction determined with SPEP. The PONGO web server is available at http://pongo.biocomp.unibo.it/pongo .......The annotation efforts of the BIOSAPIENS European Network of Excellence have generated several distributed annotation systems (DAS) with the aim of integrating Bioinformatics resources and annotating metazoan genomes ( http://www.biosapiens.info/ ). In this context, the PONGO DAS server ( http...

Professional SQL Server 2005 administration

CERN Document Server

Knight, Brian; Snyder, Wayne; Armand, Jean-Claude; LoForte, Ross; Ji, Haidong

2007-01-01

SQL Server 2005 is the largest leap forward for SQL Server since its inception. With this update comes new features that will challenge even the most experienced SQL Server DBAs. Written by a team of some of the best SQL Server experts in the industry, this comprehensive tutorial shows you how to navigate the vastly changed landscape of the SQL Server administration. Drawing on their own first-hand experiences to offer you best practices, unique tips and tricks, and useful workarounds, the authors help you handle even the most difficult SQL Server 2005 administration issues, including blockin

QlikView Server and Publisher

CERN Document Server

Redmond, Stephen

2014-01-01

This is a comprehensive guide with a step-by-step approach that enables you to host and manage servers using QlikView Server and QlikView Publisher.If you are a server administrator wanting to learn about how to deploy QlikView Server for server management,analysis and testing, and QlikView Publisher for publishing of business content then this is the perfect book for you. No prior experience with QlikView is expected.

Analisis Perbandingan Unjuk Kerja Sistem Penyeimbang Beban Web Server dengan HAProxy dan Pound Links

Directory of Open Access Journals (Sweden)

Dite Ardian

2013-04-01

Full Text Available The development of internet technology has many organizations that expanded service website. Initially used single web server that is accessible to everyone through the Internet, but when the number of users that access the web server is very much the traffic load to the web server and the web server anyway. It is necessary for the optimization of web servers to cope with the overload received by the web server when traffic is high. Methodology of this final project research include the study of literature, system design, and testing of the system. Methods from the literature reference books related as well as from several sources the internet. The design of this thesis uses Haproxy and Pound Links as a load balancing web server. The end of this reaserch is testing the network system, where the system will be tested this stage so as to create a web server system that is reliable and safe. The result is a web server system that can be accessed by many user simultaneously rapidly as load balancing Haproxy and Pound Links system which is set up as front-end web server performance so as to create a web server that has performance and high availability.

Labour costs and queueing theory in retailing

NARCIS (Netherlands)

J.B.G. Frenk (Hans); A.R. Thurik (Roy); C.A. Bout

1991-01-01

textabstractIn this paper approximation results for the M/G/s queueing model are used to derive an empirically verified shop type dependent non-homogeneous relation between labour volume and sales in retail trade. Moreover, we formulate the retailer's labour management as a formal minimization

Single Sign-on Solution for MYSEA Services

National Research Council Canada - National Science Library

Bui, Sonia

2005-01-01

.... A single sign-on solution for the MYSEA server federation is needed. After user authenticates once to a single MYSEA server, the user s credentials are used to sign on to the other MYSEA servers...

CentroidFold: a web server for RNA secondary structure prediction

OpenAIRE

Sato, Kengo; Hamada, Michiaki; Asai, Kiyoshi; Mituyama, Toutai

2009-01-01

The CentroidFold web server (http://www.ncrna.org/centroidfold/) is a web application for RNA secondary structure prediction powered by one of the most accurate prediction engine. The server accepts two kinds of sequence data: a single RNA sequence and a multiple alignment of RNA sequences. It responses with a prediction result shown as a popular base-pair notation and a graph representation. PDF version of the graph representation is also available. For a multiple alignment sequence, the ser...

SAM: Support Vector Machine Based Active Queue Management

International Nuclear Information System (INIS)

Shah, M.S.

2014-01-01

Recent years have seen an increasing interest in the design of AQM (Active Queue Management) controllers. The purpose of these controllers is to manage the network congestion under varying loads, link delays and bandwidth. In this paper, a new AQM controller is proposed which is trained by using the SVM (Support Vector Machine) with the RBF (Radial Basis Function) kernal. The proposed controller is called the support vector based AQM (SAM) controller. The performance of the proposed controller has been compared with three conventional AQM controllers, namely the Random Early Detection, Blue and Proportional Plus Integral Controller. The preliminary simulation studies show that the performance of the proposed controller is comparable to the conventional controllers. However, the proposed controller is more efficient in controlling the queue size than the conventional controllers. (author)

Studying the co-evolution of protein families with the Mirrortree web server.

Science.gov (United States)

Ochoa, David; Pazos, Florencio

2010-05-15

The Mirrortree server allows to graphically and interactively study the co-evolution of two protein families, and investigate their possible interactions and functional relationships in a taxonomic context. The server includes the possibility of starting from single sequences and hence it can be used by non-expert users. The web server is freely available at http://csbg.cnb.csic.es/mtserver. It was tested in the main web browsers. Adobe Flash Player is required at the client side to perform the interactive assessment of co-evolution. pazos@cnb.csic.es Supplementary data are available at Bioinformatics online.

The Effectiveness Analysis of Waiting Processes in the Different Branches of a Bank by Queue Model

Directory of Open Access Journals (Sweden)

Abdullah ÖZÇİL

2015-06-01

Full Text Available Despite the appreciable increase in the number of bank branches every year, nowadays queues for services don’t decrease and even become parts of our daily lives. By minimizing waiting processes the least, increasing customer satisfaction should be one of branch managers’ main goals. A quick and also customer oriented service with high quality is the most important factor for customer loyalty. In this study, Queueing theory, one of Operation Research techniques, is handled and in application, the data are obtained related to waiting in queue of customer in six different branches of two banks operating in Denizli and then they are analyzed by Queueing theory and also calculated the average effectiveness of the system. The study’s data are obtained by six branches of two banks called as A1, A2, A3, B1, B2 and B3. At the end of study it is presented to the company some advices that can bring benefits to the staff and customers. In this study, Queueing theory, one of Operation Research techniques, is handled and in application, the data are obtained related to waiting in queue of customer in three different branches of a bank operating in Denizli and then they are analyzed by Queueing theory and also calculated the average effectiveness of the system. The study’s data are obtained by three branches of the bank called A1, A2 and A3. At last it is presented to the company some advices that can bring more benefits to the staff and clients.

Active Queue Management in TCP Networks Based on Fuzzy-Pid Controller

Directory of Open Access Journals (Sweden)

Hossein ASHTIANI

2012-01-01

Full Text Available We introduce a novel and robust active queue management (AQM scheme based on a fuzzy controller, called hybrid fuzzy-PID controller. In the TCP network, AQM is important to regulate the queue length by passing or dropping the packets at the intermediate routers. RED, PI, and PID algorithms have been used for AQM. But these algorithms show weaknesses in the detection and control of congestion under dynamically changing network situations. In this paper a novel Fuzzy-based proportional-integral derivative (PID controller, which acts as an active queue manager (AQM for Internet routers, is proposed. These controllers are used to reduce packet loss and improve network utilization in TCP/IP networks. A new hybrid controller is proposed and compared with traditional RED based controller. Simulations are carried out to demonstrate the effectiveness of the proposed method and show that, the new hybrid fuzzy PID controller provides better performance than random early detection (RED and PID controllers

Worst-case efficient external-memory priority queues

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Katajainen, Jyrki

1998-01-01

A priority queue Q is a data structure that maintains a collection of elements, each element having an associated priority drawn from a totally ordered universe, under the operations Insert, which inserts an element into Q, and DeleteMin, which deletes an element with the minimum priority from Q....... In this paper a priority-queue implementation is given which is efficient with respect to the number of block transfers or I/Os performed between the internal and external memories of a computer. Let B and M denote the respective capacity of a block and the internal memory measured in elements. The developed...... data structure handles any intermixed sequence of Insert and DeleteMin operations such that in every disjoint interval of B consecutive priorityqueue operations at most clogM/B N/M I/Os are performed, for some positive constant c. These I/Os are divided evenly among the operations: if B ≥ clogM/B N...

Approximations for the waiting-time distribution in an M/P H/c priority queue

NARCIS (Netherlands)

Al Hanbali, Ahmad; Alvarez, Elisa; van der Heijden, Matthijs C.

2015-01-01

We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/PH/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate

Efficient Heuristics for the Simulation of Buffer Overflow in Series and Parallel Queueing Networks

NARCIS (Netherlands)

Nicola, V.F.; Zaburnenko, T.S.

2006-01-01

In this paper we propose state-dependent importance sampling heuristics to estimate the probability of population overflow in Markovian networks of series and parallel queues. These heuristics capture state-dependence along the boundaries (when one or more queues are empty) which is critical for

Adventures in the evolution of a high-bandwidth network for central servers

International Nuclear Information System (INIS)

Swartz, K.L.; Cottrell, L.; Dart, M.

1994-08-01

In a small network, clients and servers may all be connected to a single Ethernet without significant performance concerns. As the number of clients on a network grows, the necessity of splitting the network into multiple sub-networks, each with a manageable number of clients, becomes clear. Less obvious is what to do with the servers. Group file servers on subnets and multihomed servers offer only partial solutions -- many other types of servers do not lend themselves to a decentralized model, and tend to collect on another, well-connected but overloaded Ethernet. The higher speed of FDDI seems to offer an easy solution, but in practice both expense and interoperability problems render FDDI a poor choice. Ethernet switches appear to permit cheaper and more reliable networking to the servers while providing an aggregate network bandwidth greater than a simple Ethernet. This paper studies the evolution of the server networks at SLAC. Difficulties encountered in the deployment of FDDI are described, as are the tools and techniques used to characterize the traffic patterns on the server network. Performance of Ethernet, FDDI, and switched Ethernet networks is analyzed, as are reliability and maintainability issues for these alternatives. The motivations for re-designing the SLAC general server network to use a switched Ethernet instead of FDDI are described, as are the reasons for choosing FDDI for the farm and firewall networks at SLAC. Guidelines are developed which may help in making this choice for other networks

Design and analysis of a model predictive controller for active queue management.

Science.gov (United States)

Wang, Ping; Chen, Hong; Yang, Xiaoping; Ma, Yan

2012-01-01

Model predictive (MP) control as a novel active queue management (AQM) algorithm in dynamic computer networks is proposed. According to the predicted future queue length in the data buffer, early packets at the router are dropped reasonably by the MPAQM controller so that the queue length reaches the desired value with minimal tracking error. The drop probability is obtained by optimizing the network performance. Further, randomized algorithms are applied to analyze the robustness of MPAQM successfully, and also to provide the stability domain of systems with uncertain network parameters. The performances of MPAQM are evaluated through a series of simulations in NS2. The simulation results show that the MPAQM algorithm outperforms RED, PI, and REM algorithms in terms of stability, disturbance rejection, and robustness. Copyright © 2011 ISA. Published by Elsevier Ltd. All rights reserved.

Joint distribution of sojourn time and queue length in the M/G/1 queue with (in)finite capacity

NARCIS (Netherlands)

Boxma, O.J.

1984-01-01

For the M/G/1 queue we study the joint distribution of the number of customers x present immediately before an arrival epoch and of the residual service time ¿ of the customer in service at this epoch. The correlation coefficient (x, ¿) is shown to be positive (negative) when the service time

PENGUKURAN KINERJA ROUND-ROBIN SCHEDULER UNTUK LINUX VIRTUAL SERVER PADA KASUS WEB SERVER

Directory of Open Access Journals (Sweden)

Royyana Muslim Ijtihadie

2005-07-01

Full Text Available Normal 0 false false false IN X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Dengan meningkatnya perkembangan jumlah pengguna internet dan mulai diadopsinya penggunaan internet dalam kehidupan sehari-hari, maka lalulintas data di Internet telah meningkat secara signifikan. Sejalan dengan itu pula beban kerja server-server yang memberikan service di Internet juga mengalami kenaikan yang cukup signifikan. Hal tersebut dapat mengakibatkan suatu server mengalami kelebihan beban pada suatu saat. Untuk mengatasi hal tersebut maka diterapkan skema konfigurasi server cluster menggunakan konsep load balancing. Load balancing server menerapkan algoritma dalam melakukan pembagian tugas. Algoritma round robin telah digunakan pada Linux Virtual Server. Penelitian ini melakukan pengukuran kinerja terhadap Linux Virtual Server yang menggunakan algoritma round robin untuk melakukan penjadwalan pembagian beban terhadap server. Penelitian ini mengukur performa dari sisi client yang mencoba mengakses web server.performa yang diukur adalah jumlah request yang bisa diselesaikan perdetik (request per second, waktu untuk menyelesaikan per satu request, dan   throughput yang dihasilkan. Dari hasil percobaan didapatkan bahwa penggunaan LVS bisa meningkatkan performa, yaitu menaikkan jumlah request per detik

Mastering Microsoft Exchange Server 2010

CERN Document Server

McBee, Jim

2010-01-01

A top-selling guide to Exchange Server-now fully updated for Exchange Server 2010. Keep your Microsoft messaging system up to date and protected with the very newest version, Exchange Server 2010, and this comprehensive guide. Whether you're upgrading from Exchange Server 2007 SP1 or earlier, installing for the first time, or migrating from another system, this step-by-step guide provides the hands-on instruction, practical application, and real-world advice you need.: Explains Microsoft Exchange Server 2010, the latest release of Microsoft's messaging system that protects against spam and vir

ANALYSIS OF FUZZY QUEUES: PARAMETRIC PROGRAMMING APPROACH BASED ON RANDOMNESS - FUZZINESS CONSISTENCY PRINCIPLE

Directory of Open Access Journals (Sweden)

Dhruba Das

2015-04-01

Full Text Available In this article, based on Zadeh’s extension principle we have apply the parametric programming approach to construct the membership functions of the performance measures when the interarrival time and the service time are fuzzy numbers based on the Baruah’s Randomness- Fuzziness Consistency Principle. The Randomness-Fuzziness Consistency Principle leads to defining a normal law of fuzziness using two different laws of randomness. In this article, two fuzzy queues FM/M/1 and M/FM/1 has been studied and constructed their membership functions of the system characteristics based on the aforesaid principle. The former represents a queue with fuzzy exponential arrivals and exponential service rate while the latter represents a queue with exponential arrival rate and fuzzy exponential service rate.

Sojourn time asymptotics in processor-sharing queues

NARCIS (Netherlands)

Borst, S.C.; Núñez Queija, R.; Zwart, B.

2006-01-01

Over the past few decades, the Processor-Sharing (PS) discipline has attracted a great deal of attention in the queueing literature. While the PS paradigm emerged in the sixties as an idealization of round-robin scheduling in time-shared computer systems, it has recently captured renewed interest as

Adaptive Importance Sampling Simulation of Queueing Networks

NARCIS (Netherlands)

de Boer, Pieter-Tjerk; Nicola, V.F.; Rubinstein, N.; Rubinstein, Reuven Y.

2000-01-01

In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a

Optimal control of a server farm

NARCIS (Netherlands)

Adan, I.J.B.F.; Kulkarni, V.G.; Wijk, van A.C.C.

2013-01-01

We consider a server farm consisting of ample exponential servers, that serve a Poisson stream of arriving customers. Each server can be either busy, idle or off. An arriving customer will immediately occupy an idle server, if there is one, and otherwise, an off server will be turned on and start

NEOS Server 4.0 Administrative Guide

OpenAIRE

Dolan, Elizabeth D.

2001-01-01

The NEOS Server 4.0 provides a general Internet-based client/server as a link between users and software applications. The administrative guide covers the fundamental principals behind the operation of the NEOS Server, installation and trouble-shooting of the Server software, and implementation details of potential interest to a NEOS Server administrator. The guide also discusses making new software applications available through the Server, including areas of concern to remote solver adminis...

On the Modelling of the Mobile WiMAX (IEEE 802.16e Uplink Scheduler

Directory of Open Access Journals (Sweden)

Darmawaty Mohd Ali

2010-01-01

Full Text Available Packet scheduling has drawn a great deal of attention in the field of wireless networks as it plays an important role in distributing shared resources in a network. The process involves allocating the bandwidth among users and determining their transmission order. In this paper an uplink (UL scheduling algorithm for the Mobile Worldwide Interoperability for Microwave Access (WiMAX network based on the cyclic polling model is proposed. The model in this study consists of five queues (UGS, ertPS, rtPS, nrtPS, and BE visited by a single server. A threshold policy is imposed to the nrtPS queue to ensure that the delay constraint of real time traffic (UGS, ertPS, and rtPS is not violated making this approach original in comparison to the existing contributions. A mathematical model is formulated for the weighted sum of the mean waiting time of each individual queues based on the pseudo-conservation law. The results of the analysis are useful in obtaining or testing approximation for individual mean waiting time especially when queues are asymmetric (where each queue may have different stochastic characteristic such as arrival rate and service time distribution and when their number is large (more than 2 queues.

DROP TAIL AND RED QUEUE MANAGEMENT WITH SMALL BUFFERS:STABILITY AND HOPF BIFURCATION

Directory of Open Access Journals (Sweden)

Ganesh Patil

2011-06-01

Full Text Available There are many factors that are important in the design of queue management schemes for routers in the Internet: for example, queuing delay, link utilization, packet loss, energy consumption and the impact of router buffer size. By considering a fluid model for the congestion avoidance phase of Additive Increase Multiplicative Decrease (AIMD TCP, in a small buffer regime, we argue that stability should also be a desirable feature for network performance. The queue management schemes we study are Drop Tail and Random Early Detection (RED. For Drop Tail, the analytical arguments are based on local stability and bifurcation theory. As the buffer size acts as a bifurcation parameter, variations in it can readily lead to the emergence of limit cycles. We then present NS2 simulations to study the effect of changing buffer size on queue dynamics, utilization, window size and packet loss for three different flow scenarios. The simulations corroborate the analysis which highlights that performance is coupled with the notion of stability. Our work suggests that, in a small buffer regime, a simple Drop Tail queue management serves to enhance stability and appears preferable to the much studied RED scheme.

An Evaluation of Concurrent Priority Queue Algorithms

Science.gov (United States)

1991-02-01

path pronlem are testedi A! -S7 ?o An Evaluation of Concurrent Priority Queue Algorithms bv Qin Huang BS. Uiversity - of Science andi Technology of China...who have always supported me through my entire career and made my life more enjoyable. This research was supported in part by the Advanced Research

Microsoft SQL Server 2012 bible

CERN Document Server

Jorgensen, Adam; LeBlanc, Patrick; Cherry, Denny; Nelson, Aaron

2012-01-01

Harness the powerful new SQL Server 2012 Microsoft SQL Server 2012 is the most significant update to this product since 2005, and it may change how database administrators and developers perform many aspects of their jobs. If you're a database administrator or developer, Microsoft SQL Server 2012 Bible teaches you everything you need to take full advantage of this major release. This detailed guide not only covers all the new features of SQL Server 2012, it also shows you step by step how to develop top-notch SQL Server databases and new data connections and keep your databases performing at p

Windows Home Server users guide

CERN Document Server

Edney, Andrew

2008-01-01

Windows Home Server brings the idea of centralized storage, backup and computer management out of the enterprise and into the home. Windows Home Server is built for people with multiple computers at home and helps to synchronize them, keep them updated, stream media between them, and back them up centrally. Built on a similar foundation as the Microsoft server operating products, it's essentially Small Business Server for the home.This book details how to install, configure, and use Windows Home Server and explains how to connect to and manage different clients such as Windows XP, Windows Vist

Rtools: a web server for various secondary structural analyses on single RNA sequences.

Science.gov (United States)

Hamada, Michiaki; Ono, Yukiteru; Kiryu, Hisanori; Sato, Kengo; Kato, Yuki; Fukunaga, Tsukasa; Mori, Ryota; Asai, Kiyoshi

2016-07-08

The secondary structures, as well as the nucleotide sequences, are the important features of RNA molecules to characterize their functions. According to the thermodynamic model, however, the probability of any secondary structure is very small. As a consequence, any tool to predict the secondary structures of RNAs has limited accuracy. On the other hand, there are a few tools to compensate the imperfect predictions by calculating and visualizing the secondary structural information from RNA sequences. It is desirable to obtain the rich information from those tools through a friendly interface. We implemented a web server of the tools to predict secondary structures and to calculate various structural features based on the energy models of secondary structures. By just giving an RNA sequence to the web server, the user can get the different types of solutions of the secondary structures, the marginal probabilities such as base-paring probabilities, loop probabilities and accessibilities of the local bases, the energy changes by arbitrary base mutations as well as the measures for validations of the predicted secondary structures. The web server is available at http://rtools.cbrc.jp, which integrates software tools, CentroidFold, CentroidHomfold, IPKnot, CapR, Raccess, Rchange and RintD. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

SciServer Compute brings Analysis to Big Data in the Cloud

Science.gov (United States)

Raddick, Jordan; Medvedev, Dmitry; Lemson, Gerard; Souter, Barbara

2016-06-01

SciServer Compute uses Jupyter Notebooks running within server-side Docker containers attached to big data collections to bring advanced analysis to big data "in the cloud." SciServer Compute is a component in the SciServer Big-Data ecosystem under development at JHU, which will provide a stable, reproducible, sharable virtual research environment.SciServer builds on the popular CasJobs and SkyServer systems that made the Sloan Digital Sky Survey (SDSS) archive one of the most-used astronomical instruments. SciServer extends those systems with server-side computational capabilities and very large scratch storage space, and further extends their functions to a range of other scientific disciplines.Although big datasets like SDSS have revolutionized astronomy research, for further analysis, users are still restricted to downloading the selected data sets locally - but increasing data sizes make this local approach impractical. Instead, researchers need online tools that are co-located with data in a virtual research environment, enabling them to bring their analysis to the data.SciServer supports this using the popular Jupyter notebooks, which allow users to write their own Python and R scripts and execute them on the server with the data (extensions to Matlab and other languages are planned). We have written special-purpose libraries that enable querying the databases and other persistent datasets. Intermediate results can be stored in large scratch space (hundreds of TBs) and analyzed directly from within Python or R with state-of-the-art visualization and machine learning libraries. Users can store science-ready results in their permanent allocation on SciDrive, a Dropbox-like system for sharing and publishing files. Communication between the various components of the SciServer system is managed through SciServer‘s new Single Sign-on Portal.We have created a number of demos to illustrate the capabilities of SciServer Compute, including Python and R scripts

Global and local asymptotics for the busy period of an M/G/1 queue

NARCIS (Netherlands)

Denisov, D.E.; Shneer, V.

2010-01-01

We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period. Our analysis relies on the explicit formula for the joint distribution for the number of customers and the length of the busy period of an M/G/1 queue.

Linux Server Security

CERN Document Server

Bauer, Michael D

2005-01-01

Linux consistently appears high up in the list of popular Internet servers, whether it's for the Web, anonymous FTP, or general services such as DNS and delivering mail. But security is the foremost concern of anyone providing such a service. Any server experiences casual probe attempts dozens of time a day, and serious break-in attempts with some frequency as well. This highly regarded book, originally titled Building Secure Servers with Linux, combines practical advice with a firm knowledge of the technical tools needed to ensure security. The book focuses on the most common use of Linux--

Open client/server computing and middleware

CERN Document Server

Simon, Alan R

2014-01-01

Open Client/Server Computing and Middleware provides a tutorial-oriented overview of open client/server development environments and how client/server computing is being done.This book analyzes an in-depth set of case studies about two different open client/server development environments-Microsoft Windows and UNIX, describing the architectures, various product components, and how these environments interrelate. Topics include the open systems and client/server computing, next-generation client/server architectures, principles of middleware, and overview of ProtoGen+. The ViewPaint environment

Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

Science.gov (United States)

Li, Lian-Hui; Mo, Rong

2015-01-01

The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC) is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS) improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

Windows server cookbook for Windows server 2003 and Windows 2000

CERN Document Server

Allen, Robbie

2005-01-01

This practical reference guide offers hundreds of useful tasks for managing Windows 2000 and Windows Server 2003, Microsoft's latest server. These concise, on-the-job solutions to common problems are certain to save you many hours of time searching through Microsoft documentation. Topics include files, event logs, security, DHCP, DNS, backup/restore, and more

Learning SQL Server Reporting Services 2012

CERN Document Server

Krishnaswamy, Jayaram

2013-01-01

The book is packed with clear instructions and plenty of screenshots, providing all the support and guidance you will need as you begin to generate reports with SQL Server 2012 Reporting Services.This book is for those who are new to SQL Server Reporting Services 2012 and aspiring to create and deploy cutting edge reports. This book is for report developers, report authors, ad-hoc report authors and model developers, and Report Server and SharePoint Server Integrated Report Server administrators. Minimal knowledge of SQL Server is assumed and SharePoint experience would be helpful.

The congestion control algorithm based on queue management of each node in mobile ad hoc networks

Science.gov (United States)

Wei, Yifei; Chang, Lin; Wang, Yali; Wang, Gaoping

2016-12-01

This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. As the network load increases, local congestion of mobile ad hoc network may lead to network performance degradation, hot node's energy consumption increase even failure. If small energy nodes congested because of forwarding data packets, then when it is used as the source node will cause a lot of packet loss. This paper proposes an active queue management mechanism, considering the node's own ability and its importance in the network to set the queue threshold. Controlling nodes buffer queue in different levels of congestion area probability by adjusting the upper limits and lower limits, thus nodes can adjust responsibility of forwarding data packets according to their own situation. The proposed algorithm will slow down the send rate hop by hop along the data package transmission direction from congestion node to source node so that to prevent further congestion from the source node. The simulation results show that, the algorithm can better play the data forwarding ability of strong nodes, protect the weak nodes, can effectively alleviate the network congestion situation.

7. Data Structures: Lists, Queues, Stacks and Arrays

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 6. Algorithms - Data Structures: Lists, Queues, Stacks and Arrays. R K Shyamasundar. Series Article Volume 2 Issue 6 June 1997 pp 39-46. Fulltext. Click here to view fulltext PDF. Permanent link:

Buffer Overflow Period in a MAP Queue

Directory of Open Access Journals (Sweden)

Andrzej Chydzinski

2007-01-01

Full Text Available The buffer overflow period in a queue with Markovian arrival process (MAP and general service time distribution is investigated. The results include distribution of the overflow period in transient and stationary regimes and the distribution of the number of cells lost during the overflow interval. All theorems are illustrated via numerical calculations.

WEB-server for search of a periodicity in amino acid and nucleotide sequences

Science.gov (United States)

E Frenkel, F.; Skryabin, K. G.; Korotkov, E. V.

2017-12-01

A new web server (http://victoria.biengi.ac.ru/splinter/login.php) was designed and developed to search for periodicity in nucleotide and amino acid sequences. The web server operation is based upon a new mathematical method of searching for multiple alignments, which is founded on the position weight matrices optimization, as well as on implementation of the two-dimensional dynamic programming. This approach allows the construction of multiple alignments of the indistinctly similar amino acid and nucleotide sequences that accumulated more than 1.5 substitutions per a single amino acid or a nucleotide without performing the sequences paired comparisons. The article examines the principles of the web server operation and two examples of studying amino acid and nucleotide sequences, as well as information that could be obtained using the web server.

Beginning Microsoft SQL Server 2012 Programming

CERN Document Server

Atkinson, Paul

2012-01-01

Get up to speed on the extensive changes to the newest release of Microsoft SQL Server The 2012 release of Microsoft SQL Server changes how you develop applications for SQL Server. With this comprehensive resource, SQL Server authority Robert Vieira presents the fundamentals of database design and SQL concepts, and then shows you how to apply these concepts using the updated SQL Server. Publishing time and date with the 2012 release, Beginning Microsoft SQL Server 2012 Programming begins with a quick overview of database design basics and the SQL query language and then quickly proceeds to sho

BOB-RED queue management for IEEE 802.15.4 wireless sensor networks

Directory of Open Access Journals (Sweden)

Wu Jean-Lien

2011-01-01

Full Text Available Abstract Multimedia services over resource constrained wireless sensor networks (WSNs face a performance bottleneck issue from the gateway node to the sink node. Therefore, the queue management at the gateway node is crucial for diversified messages conveyed from the front nodes to the sink node. In this article, beacon order-based random early detection (BOB-RED queue management is proposed. BOB-RED is a dynamic adaptation scheme based on adjusting beacon interval and superframe duration in the IEEE 802.15.4 MAC superframe accompanied with RED queue management scheme to increase the transmission efficiency of multimedia over WSNs. We focus on the performance improvement upon different traffic loads over WSNs. Evaluation metrics include end-to-end delay, packet delivery ratio, and energy consumption in IEEE 802.15.4 beacon enabled mode. Simulation results show that BOB-RED can effectively decrease end-to-end delay and energy consumption compared to the DropTail scheme.

Analysis of an M/G/1 queue with customer impatience and an adaptive arrival process

NARCIS (Netherlands)

Boxma, O.J.; Prabhu, B.J.

2009-01-01

We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival process changes according to whether an incoming customer is accepted or rejected. We analyse two different models for impatience : (i) based on workload, and (ii) based on queue length. For the

Model Integrating Fuzzy Argument with Neural Network Enhancing the Performance of Active Queue Management

Directory of Open Access Journals (Sweden)

Nguyen Kim Quoc

2015-08-01

Full Text Available The bottleneck control by active queue management mechanisms at network nodes is essential. In recent years, some researchers have used fuzzy argument to improve the active queue management mechanisms to enhance the network performance. However, the projects using the fuzzy controller depend heavily on professionals and their parameters cannot be updated according to changes in the network, so the effectiveness of this mechanism is not high. Therefore, we propose a model combining the fuzzy controller with neural network (FNN to overcome the limitations above. Results of the training of the neural networks will find the optimal parameters for the adaptive fuzzy controller well to changes of the network. This improves the operational efficiency of the active queue management mechanisms at network nodes.

SPEER-SERVER: a web server for prediction of protein specificity determining sites.

Science.gov (United States)

Chakraborty, Abhijit; Mandloi, Sapan; Lanczycki, Christopher J; Panchenko, Anna R; Chakrabarti, Saikat

2012-07-01

Sites that show specific conservation patterns within subsets of proteins in a protein family are likely to be involved in the development of functional specificity. These sites, generally termed specificity determining sites (SDS), might play a crucial role in binding to a specific substrate or proteins. Identification of SDS through experimental techniques is a slow, difficult and tedious job. Hence, it is very important to develop efficient computational methods that can more expediently identify SDS. Herein, we present Specificity prediction using amino acids' Properties, Entropy and Evolution Rate (SPEER)-SERVER, a web server that predicts SDS by analyzing quantitative measures of the conservation patterns of protein sites based on their physico-chemical properties and the heterogeneity of evolutionary changes between and within the protein subfamilies. This web server provides an improved representation of results, adds useful input and output options and integrates a wide range of analysis and data visualization tools when compared with the original standalone version of the SPEER algorithm. Extensive benchmarking finds that SPEER-SERVER exhibits sensitivity and precision performance that, on average, meets or exceeds that of other currently available methods. SPEER-SERVER is available at http://www.hpppi.iicb.res.in/ss/.

Mastering Microsoft Exchange Server 2013

CERN Document Server

Elfassy, David

2013-01-01

The bestselling guide to Exchange Server, fully updated for the newest version Microsoft Exchange Server 2013 is touted as a solution for lowering the total cost of ownership, whether deployed on-premises or in the cloud. Like the earlier editions, this comprehensive guide covers every aspect of installing, configuring, and managing this multifaceted collaboration system. It offers Windows systems administrators and consultants a complete tutorial and reference, ideal for anyone installing Exchange Server for the first time or those migrating from an earlier Exchange Server version.Microsoft

Semigroup Method on a MX/G/1 Queueing Model

Directory of Open Access Journals (Sweden)

Alim Mijit

2013-01-01

Full Text Available By using the Hille-Yosida theorem, Phillips theorem, and Fattorini theorem in functional analysis we prove that the MX/G/1 queueing model with vacation times has a unique nonnegative time-dependent solution.

Production Task Queue Optimization Based on Multi-Attribute Evaluation for Complex Product Assembly Workshop.

Directory of Open Access Journals (Sweden)

Lian-Hui Li

Full Text Available The production task queue has a great significance for manufacturing resource allocation and scheduling decision. Man-made qualitative queue optimization method has a poor effect and makes the application difficult. A production task queue optimization method is proposed based on multi-attribute evaluation. According to the task attributes, the hierarchical multi-attribute model is established and the indicator quantization methods are given. To calculate the objective indicator weight, criteria importance through intercriteria correlation (CRITIC is selected from three usual methods. To calculate the subjective indicator weight, BP neural network is used to determine the judge importance degree, and then the trapezoid fuzzy scale-rough AHP considering the judge importance degree is put forward. The balanced weight, which integrates the objective weight and the subjective weight, is calculated base on multi-weight contribution balance model. The technique for order preference by similarity to an ideal solution (TOPSIS improved by replacing Euclidean distance with relative entropy distance is used to sequence the tasks and optimize the queue by the weighted indicator value. A case study is given to illustrate its correctness and feasibility.

Customer-oriented finite perturbation analysis for queueing networks

NARCIS (Netherlands)

Heidergott, B.F.

2000-01-01

We consider queueing networks for which the performance measureJ ( ) depends on a parameter , which can be a service time parameter or a buffer size, and we are interested in sensitivity analysis of J ( ) with respect to . We introduce a new method, called customer-oriented finite perturbation

Efficient Simulation of Population Overflow in Parallel Queues

NARCIS (Netherlands)

Nicola, V.F.; Zaburnenko, T.S.

2006-01-01

In this paper we propose a state-dependent importance sampling heuristic to estimate the probability of population overflow in networks of parallel queues. This heuristic approximates the “optimal��? state-dependent change of measure without the need for dif��?cult mathematical analysis or costly

Remote Sensing Data Analytics for Planetary Science with PlanetServer/EarthServer

Science.gov (United States)

Rossi, Angelo Pio; Figuera, Ramiro Marco; Flahaut, Jessica; Martinot, Melissa; Misev, Dimitar; Baumann, Peter; Pham Huu, Bang; Besse, Sebastien

2016-04-01

Planetary Science datasets, beyond the change in the last two decades from physical volumes to internet-accessible archives, still face the problem of large-scale processing and analytics (e.g. Rossi et al., 2014, Gaddis and Hare, 2015). PlanetServer, the Planetary Science Data Service of the EC-funded EarthServer-2 project (#654367) tackles the planetary Big Data analytics problem with an array database approach (Baumann et al., 2014). It is developed to serve a large amount of calibrated, map-projected planetary data online, mainly through Open Geospatial Consortium (OGC) Web Coverage Processing Service (WCPS) (e.g. Rossi et al., 2014; Oosthoek et al., 2013; Cantini et al., 2014). The focus of the H2020 evolution of PlanetServer is still on complex multidimensional data, particularly hyperspectral imaging and topographic cubes and imagery. In addition to hyperspectral and topographic from Mars (Rossi et al., 2014), the use of WCPS is applied to diverse datasets on the Moon, as well as Mercury. Other Solar System Bodies are going to be progressively available. Derived parameters such as summary products and indices can be produced through WCPS queries, as well as derived imagery colour combination products, dynamically generated and accessed also through OGC Web Coverage Service (WCS). Scientific questions translated into queries can be posed to a large number of individual coverages (data products), locally, regionally or globally. The new PlanetServer system uses the the Open Source Nasa WorldWind (e.g. Hogan, 2011) virtual globe as visualisation engine, and the array database Rasdaman Community Edition as core server component. Analytical tools and client components of relevance for multiple communities and disciplines are shared across service such as the Earth Observation and Marine Data Services of EarthServer. The Planetary Science Data Service of EarthServer is accessible on http://planetserver.eu. All its code base is going to be available on GitHub, on

Exam 70-411 administering Windows Server 2012

CERN Document Server

Course, Microsoft Official Academic

2014-01-01

Microsoft Windows Server is a multi-purpose server designed to increase reliability and flexibility of  a network infrastructure. Windows Server is the paramount tool used by enterprises in their datacenter and desktop strategy. The most recent versions of Windows Server also provide both server and client virtualization. Its ubiquity in the enterprise results in the need for networking professionals who know how to plan, design, implement, operate, and troubleshoot networks relying on Windows Server. Microsoft Learning is preparing the next round of its Windows Server Certification program

A System with a Choice of Highest-Bidder-First and FIFO Services

Directory of Open Access Journals (Sweden)

Tejas Bodas

2015-02-01

Full Text Available Service systems using a highest-bidder-first (HBF policy have been studied in queueing literature for various applications and in economics literature to model corruption. Such systems have applications in modern problems like scheduling jobs in cloud computing scenarios or placement of ads on web pages. However, using a HBF service is like using a spot market and may not be preferred by many users. For such users, it may be good to provide a simple scheduler, e.g., a FIFO service. Further, in some situations it may even be necessary that a free service queue operates alongside a HBF queue. Motivated by such a scenario, we propose and analyze a service system with a FIFO server and a HBF server in parallel. Arriving customers are from a heterogeneous population with different valuations of their delay costs. They strategically choose between FIFO and HBF service; if HBF is chosen, they also choose the bid value to optimize an individual cost. We characterize the Wardrop equilibrium in such a system and analyze the revenue to the server. We see that when the total capacity is fixed and is shared between the FIFO and HBF servers, revenue is maximised when the FIFO capacity is non zero. However, if the FIFO server is added to an HBF server, then the revenue decreases with increasing FIFO capacity. We also discuss the case when customers are allowed to balk.

The Effect of Queueing Strategy on Network Traffic

International Nuclear Information System (INIS)

Zhang Xue-Jun; Guan Xiang-Min; Sun Deng-Feng; Tang Shao-Ting

2013-01-01

In recent years, the transportation system has been faced by increasing challenge in congestion and inefficiency, and research in traffic network has become a significant area of interest. In this paper, we introduce a dynamic-information-based (DIB) queueing strategy into network traffic model under the efficient routing strategy. DIB makes a packet with higher priority to be delivered if there are less packets travelling along its path from the current node to the destination. It is found that, compared with the traditional first-in-first-out (FIFO) queueing strategy, DIB can effectively balance the traffic load of the system via delaying packets to be delivered to congested nodes. Although the network capacity has no obvious changes, some other indexes which reflect transportation efficiency are efficiently improved in the congestion state. Besides, extensive simulation results and discussions are provided to explain the phenomena. The results may provide novel insights for research on traffic systems. (condensed matter: structural, mechanical, and thermal properties)

DelPhiPKa web server: predicting pKa of proteins, RNAs and DNAs.

Science.gov (United States)

Wang, Lin; Zhang, Min; Alexov, Emil

2016-02-15

A new pKa prediction web server is released, which implements DelPhi Gaussian dielectric function to calculate electrostatic potentials generated by charges of biomolecules. Topology parameters are extended to include atomic information of nucleotides of RNA and DNA, which extends the capability of pKa calculations beyond proteins. The web server allows the end-user to protonate the biomolecule at particular pH based on calculated pKa values and provides the downloadable file in PQR format. Several tests are performed to benchmark the accuracy and speed of the protocol. The web server follows a client-server architecture built on PHP and HTML and utilizes DelPhiPKa program. The computation is performed on the Palmetto supercomputer cluster and results/download links are given back to the end-user via http protocol. The web server takes advantage of MPI parallel implementation in DelPhiPKa and can run a single job on up to 24 CPUs. The DelPhiPKa web server is available at http://compbio.clemson.edu/pka_webserver. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

A spectral approach to compute the mean performance measures of the queue with low-order BMAP input

Directory of Open Access Journals (Sweden)

Ho Woo Lee

2003-01-01

Full Text Available This paper targets engineers and practitioners who want a simple procedure to compute the mean performance measures of the Batch Markovian Arrival process (BMAP/G/1 queueing system when the parameter matrices order is very low. We develop a set of system equations and derive the vector generating function of the queue length. Starting from the generating function, we propose a spectral approach that can be understandable to those who have basic knowledge of M/G/1 queues and eigenvalue algebra.

Self-Interested Routing in Queueing Networks

OpenAIRE

Ali K. Parlaktürk; Sunil Kumar

2004-01-01

We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two-station multiclass queueing network in which the system manager chooses the scheduling rule and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a nontrivial scheduling rule that negates the performance degradation resulting from s...

A queueing model for error control of partial buffer sharing in ATM

Directory of Open Access Journals (Sweden)

Ahn Boo Yong

1999-01-01

Full Text Available We model the error control of the partial buffer sharing of ATM by a queueing system M 1 , M 2 / G / 1 / K + 1 with threshold and instantaneous Bernoulli feedback. We first derive the system equations and develop a recursive method to compute the loss probabilities at an arbitrary time epoch. We then build an approximation scheme to compute the mean waiting time of each class of cells. An algorithm is developed for finding the optimal threshold and queue capacity for a given quality of service.

ModFOLD6: an accurate web server for the global and local quality estimation of 3D protein models.

Science.gov (United States)

Maghrabi, Ali H A; McGuffin, Liam J

2017-07-03

Methods that reliably estimate the likely similarity between the predicted and native structures of proteins have become essential for driving the acceptance and adoption of three-dimensional protein models by life scientists. ModFOLD6 is the latest version of our leading resource for Estimates of Model Accuracy (EMA), which uses a pioneering hybrid quasi-single model approach. The ModFOLD6 server integrates scores from three pure-single model methods and three quasi-single model methods using a neural network to estimate local quality scores. Additionally, the server provides three options for producing global score estimates, depending on the requirements of the user: (i) ModFOLD6_rank, which is optimized for ranking/selection, (ii) ModFOLD6_cor, which is optimized for correlations of predicted and observed scores and (iii) ModFOLD6 global for balanced performance. The ModFOLD6 methods rank among the top few for EMA, according to independent blind testing by the CASP12 assessors. The ModFOLD6 server is also continuously automatically evaluated as part of the CAMEO project, where significant performance gains have been observed compared to our previous server and other publicly available servers. The ModFOLD6 server is freely available at: http://www.reading.ac.uk/bioinf/ModFOLD/. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.

On the calculation of steady-state loss probabilities in the GI/G/2/0 queue

Directory of Open Access Journals (Sweden)

Igor N. Kovalenko

1994-01-01

Full Text Available This paper considers methods for calculating the steady-state loss probability in the GI/G/2/0 queue. A previous study analyzed this queue in discrete time and this led to an efficient, numerical approximation scheme for continuous-time systems. The primary aim of the present work is to provide an alternative approach by analyzing the GI/ME/2/0 queue; i.e., assuming that the service time can be represented by a matrix-exponential distribution. An efficient computational scheme based on this method is developed and some numerical examples are studied. Some comparisons are made with the discrete-time approach, and the two methods are seen to be complementary.

Genonets server-a web server for the construction, analysis and visualization of genotype networks.

Science.gov (United States)

Khalid, Fahad; Aguilar-Rodríguez, José; Wagner, Andreas; Payne, Joshua L

2016-07-08

A genotype network is a graph in which vertices represent genotypes that have the same phenotype. Edges connect vertices if their corresponding genotypes differ in a single small mutation. Genotype networks are used to study the organization of genotype spaces. They have shed light on the relationship between robustness and evolvability in biological systems as different as RNA macromolecules and transcriptional regulatory circuits. Despite the importance of genotype networks, no tool exists for their automatic construction, analysis and visualization. Here we fill this gap by presenting the Genonets Server, a tool that provides the following features: (i) the construction of genotype networks for categorical and univariate phenotypes from DNA, RNA, amino acid or binary sequences; (ii) analyses of genotype network topology and how it relates to robustness and evolvability, as well as analyses of genotype network topography and how it relates to the navigability of a genotype network via mutation and natural selection; (iii) multiple interactive visualizations that facilitate exploratory research and education. The Genonets Server is freely available at http://ieu-genonets.uzh.ch. © The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.

A GA-based PID active queue management control design for TCP/IP networks

Energy Technology Data Exchange (ETDEWEB)

Kuo, H-H; Chen, C-K; Liao, T-L [Department of Engineering Science, National Cheng Kung University, Tainan 701, Taiwan (China); Yan, J-J [Department of Computer and Communication, Shu-Te University, Kaohsiung 824, Taiwan (China)], E-mail: tlliao@mail.ncku.edu.tw

2008-02-15

In this paper, a genetic algorithm-based (GA-based) proportional-integral-derivative (PID) controller as an active queue manager for Internet routers is proposed to reduce packet loss and improve network utilization in TCP/IP networks. Based on the window-based nonlinear dynamics, the TCP network was modeled as a time-delayed system with a saturated input due to the limitations of packet-dropping probability and the effects of propagation delays in TCP networks. An improved genetic algorithm is employed to derive optimal or near optimal PID control gains such that a performance index of integrated-absolute error (IAE) in terms of the error between the router queue length and the desired queue length is minimized. The performance of the proposed control scheme was evaluated in various network scenarios via a series of numerical simulations. The simulation results confirm that the proposed scheme outperforms other AQM schemes.

A GA-based PID active queue management control design for TCP/IP networks

International Nuclear Information System (INIS)

Kuo, H-H; Chen, C-K; Liao, T-L; Yan, J-J

2008-01-01

In this paper, a genetic algorithm-based (GA-based) proportional-integral-derivative (PID) controller as an active queue manager for Internet routers is proposed to reduce packet loss and improve network utilization in TCP/IP networks. Based on the window-based nonlinear dynamics, the TCP network was modeled as a time-delayed system with a saturated input due to the limitations of packet-dropping probability and the effects of propagation delays in TCP networks. An improved genetic algorithm is employed to derive optimal or near optimal PID control gains such that a performance index of integrated-absolute error (IAE) in terms of the error between the router queue length and the desired queue length is minimized. The performance of the proposed control scheme was evaluated in various network scenarios via a series of numerical simulations. The simulation results confirm that the proposed scheme outperforms other AQM schemes

Mac OS X Lion Server For Dummies

CERN Document Server

Rizzo, John

2011-01-01

The perfect guide to help administrators set up Apple's Mac OS X Lion Server With the overwhelming popularity of the iPhone and iPad, more Macs are appearing in corporate settings. The newest version of Mac Server is the ideal way to administer a Mac network. This friendly guide explains to both Windows and Mac administrators how to set up and configure the server, including services such as iCal Server, Podcast Producer, Wiki Server, Spotlight Server, iChat Server, File Sharing, Mail Services, and support for iPhone and iPad. It explains how to secure, administer, and troubleshoot the networ

On Lévy-driven vacation models with correlated busy periods and service interruptions

NARCIS (Netherlands)

Kella, O.; Boxma, O.; Mandjes, M.

2010-01-01

This paper considers queues with server vacations, but departs from the traditional setting in two ways: (i) the queueing model is driven by Lévy processes rather than just compound Poisson processes; (ii) the vacation lengths depend on the length of the server’s preceding busy period. Regarding the

Learning Zimbra Server essentials

CERN Document Server

Kouka, Abdelmonam

2013-01-01

A standard tutorial approach which will guide the readers on all of the intricacies of the Zimbra Server.If you are any kind of Zimbra user, this book will be useful for you, from newbies to experts who would like to learn how to setup a Zimbra server. If you are an IT administrator or consultant who is exploring the idea of adopting, or have already adopted Zimbra as your mail server, then this book is for you. No prior knowledge of Zimbra is required.

Microsoft Windows Server Administration Essentials

CERN Document Server

Carpenter, Tom

2011-01-01

The core concepts and technologies you need to administer a Windows Server OS Administering a Windows operating system (OS) can be a difficult topic to grasp, particularly if you are new to the field of IT. This full-color resource serves as an approachable introduction to understanding how to install a server, the various roles of a server, and how server performance and maintenance impacts a network. With a special focus placed on the new Microsoft Technology Associate (MTA) certificate, the straightforward, easy-to-understand tone is ideal for anyone new to computer administration looking t

GeoServer: il server geospaziale Open Source novità della nuova versione 2.3.0

Directory of Open Access Journals (Sweden)

Simone Giannecchini

2013-04-01

Full Text Available GeoServer è un server geospaziale Open Source sviluppato con tecnologia Java Enterprise per la gestione e l’editing di dati geospaziali secondo gli standard OGC e ISO Technical Committee 211. Esso fornisce le funzionalità di base per creareinfrastrutture spaziali di dati (SDI ed è progettato per essere interoperabile potendo pubblicare dati provenienti da ogni tipo di fonte spaziale utilizzando standard aperti.Open Source GeoSpatial server developed with Java Enterprise technology for managing, sharing and editing geospatial data according to the OGC and ISO TC 211 standards. GeoServer provides the basic functionalities to create spatial data infrastructures (SDI.GeoServer is designed for interoperability, it publishes data from any major spatial data source using open standards: it is the reference implementation of the Open Geospatial Consortium (OGC Web Feature Service (WFS and Web Coverage Service (WCS standards, as well as a highperformance certified compliant Web Map Service (WMS. GeoServer forms a core component of the Geospatial Web.

Performance analysis of manufacturing systems : queueing approximations and algorithms

NARCIS (Netherlands)

Vuuren, van M.

2007-01-01

Performance Analysis of Manufacturing Systems Queueing Approximations and Algorithms This thesis is concerned with the performance analysis of manufacturing systems. Manufacturing is the application of tools and a processing medium to the transformation of raw materials into finished goods for sale.

Some performance measures for vacation models with a batch Markovian arrival process

Directory of Open Access Journals (Sweden)

Sadrac K. Matendo

1994-01-01

Full Text Available We consider a single server infinite capacity queueing system, where the arrival process is a batch Markovian arrival process (BMAP. Particular BMAPs are the batch Poisson arrival process, the Markovian arrival process (MAP, many batch arrival processes with correlated interarrival times and batch sizes, and superpositions of these processes. We note that the MAP includes phase-type (PH renewal processes and non-renewal processes such as the Markov modulated Poisson process (MMPP.

Dynamic Performance Optimization for Cloud Computing Using M/M/m Queueing System

Directory of Open Access Journals (Sweden)

Lizheng Guo

2014-01-01

Full Text Available Successful development of cloud computing has attracted more and more people and enterprises to use it. On one hand, using cloud computing reduces the cost; on the other hand, using cloud computing improves the efficiency. As the users are largely concerned about the Quality of Services (QoS, performance optimization of the cloud computing has become critical to its successful application. In order to optimize the performance of multiple requesters and services in cloud computing, by means of queueing theory, we analyze and conduct the equation of each parameter of the services in the data center. Then, through analyzing the performance parameters of the queueing system, we propose the synthesis optimization mode, function, and strategy. Lastly, we set up the simulation based on the synthesis optimization mode; we also compare and analyze the simulation results to the classical optimization methods (short service time first and first in, first out method, which show that the proposed model can optimize the average wait time, average queue length, and the number of customer.

Fluid queues driven by a birth and death process with alternating flow rates

OpenAIRE

P. R. Parthasarathy; K. V. Vijayashree; R. B. Lenin

2004-01-01

Fluid queue driven by a birth and death process (BDP) with only one negative effective input rate has been considered in the literature. As an alternative, here we consider a fluid queue in which the input is characterized by a BDP with alternating positive and negative flow rates on a finite state space. Also, the BDP has two alternating arrival rates and two alternating service rates. Explicit expression for the distribution function of the buffer occupancy is obtained. The case where the s...

Professional Microsoft SQL Server 2012 Administration

CERN Document Server

Jorgensen, Adam; LoForte, Ross; Knight, Brian

2012-01-01

An essential how-to guide for experienced DBAs on the most significant product release since 2005! Microsoft SQL Server 2012 will have major changes throughout the SQL Server and will impact how DBAs administer the database. With this book, a team of well-known SQL Server experts introduces the many new features of the most recent version of SQL Server and deciphers how these changes will affect the methods that administrators have been using for years. Loaded with unique tips, tricks, and workarounds for handling the most difficult SQL Server admin issues, this how-to guide deciphers topics s

Fast concurrent array-based stacks, queues and deques using fetch-and-increment-bounded, fetch-and-decrement-bounded and store-on-twin synchronization primitives

Science.gov (United States)

Chen, Dong; Gara, Alana; Heidelberger, Philip; Kumar, Sameer; Ohmacht, Martin; Steinmacher-Burow, Burkhard; Wisniewski, Robert

2014-09-16

Implementation primitives for concurrent array-based stacks, queues, double-ended queues (deques) and wrapped deques are provided. In one aspect, each element of the stack, queue, deque or wrapped deque data structure has its own ticket lock, allowing multiple threads to concurrently use multiple elements of the data structure and thus achieving high performance. In another aspect, new synchronization primitives FetchAndIncrementBounded (Counter, Bound) and FetchAndDecrementBounded (Counter, Bound) are implemented. These primitives can be implemented in hardware and thus promise a very fast throughput for queues, stacks and double-ended queues.

Polling models : from theory to traffic intersections

NARCIS (Netherlands)

Boon, M.A.A.

2011-01-01

The subject of the present monograph is the study of polling models, which are queueing models consisting of multiple queues, cyclically attended by one server. Polling models originated in the late 1950s, but did not receive much attention until the 1980s when an abundance of new applications arose

LDAP: a web server for lncRNA-disease association prediction.

Science.gov (United States)

Lan, Wei; Li, Min; Zhao, Kaijie; Liu, Jin; Wu, Fang-Xiang; Pan, Yi; Wang, Jianxin

2017-02-01

Increasing evidences have demonstrated that long noncoding RNAs (lncRNAs) play important roles in many human diseases. Therefore, predicting novel lncRNA-disease associations would contribute to dissect the complex mechanisms of disease pathogenesis. Some computational methods have been developed to infer lncRNA-disease associations. However, most of these methods infer lncRNA-disease associations only based on single data resource. In this paper, we propose a new computational method to predict lncRNA-disease associations by integrating multiple biological data resources. Then, we implement this method as a web server for lncRNA-disease association prediction (LDAP). The input of the LDAP server is the lncRNA sequence. The LDAP predicts potential lncRNA-disease associations by using a bagging SVM classifier based on lncRNA similarity and disease similarity. The web server is available at http://bioinformatics.csu.edu.cn/ldap jxwang@mail.csu.edu.cn. Supplementary data are available at Bioinformatics online.

Application of Queueing Theory to the Analysis of Changes in Outpatients' Waiting Times in Hospitals Introducing EMR.

Science.gov (United States)

Cho, Kyoung Won; Kim, Seong Min; Chae, Young Moon; Song, Yong Uk

2017-01-01

This research used queueing theory to analyze changes in outpatients' waiting times before and after the introduction of Electronic Medical Record (EMR) systems. We focused on the exact drawing of two fundamental parameters for queueing analysis, arrival rate (λ) and service rate (µ), from digital data to apply queueing theory to the analysis of outpatients' waiting times. We used outpatients' reception times and consultation finish times to calculate the arrival and service rates, respectively. Using queueing theory, we could calculate waiting time excluding distorted values from the digital data and distortion factors, such as arrival before the hospital open time, which occurs frequently in the initial stage of a queueing system. We analyzed changes in outpatients' waiting times before and after the introduction of EMR using the methodology proposed in this paper, and found that the outpatients' waiting time decreases after the introduction of EMR. More specifically, the outpatients' waiting times in the target public hospitals have decreased by rates in the range between 44% and 78%. It is possible to analyze waiting times while minimizing input errors and limitations influencing consultation procedures if we use digital data and apply the queueing theory. Our results verify that the introduction of EMR contributes to the improvement of patient services by decreasing outpatients' waiting time, or by increasing efficiency. It is also expected that our methodology or its expansion could contribute to the improvement of hospital service by assisting the identification and resolution of bottlenecks in the outpatient consultation process.

Essential Mac OS X panther server administration integrating Mac OS X server into heterogeneous networks

CERN Document Server

Bartosh, Michael

2004-01-01

If you've ever wondered how to safely manipulate Mac OS X Panther Server's many underlying configuration files or needed to explain AFP permission mapping--this book's for you. From the command line to Apple's graphical tools, the book provides insight into this powerful server software. Topics covered include installation, deployment, server management, web application services, data gathering, and more

Modeling and Optimization of M/G/1-Type Queueing Networks: An Efficient Sensitivity Analysis Approach

Directory of Open Access Journals (Sweden)

Liang Tang

2010-01-01

Full Text Available A mathematical model for M/G/1-type queueing networks with multiple user applications and limited resources is established. The goal is to develop a dynamic distributed algorithm for this model, which supports all data traffic as efficiently as possible and makes optimally fair decisions about how to minimize the network performance cost. An online policy gradient optimization algorithm based on a single sample path is provided to avoid suffering from a “curse of dimensionality”. The asymptotic convergence properties of this algorithm are proved. Numerical examples provide valuable insights for bridging mathematical theory with engineering practice.

Report on dynamic speed harmonization and queue warning algorithm design.

Science.gov (United States)

2014-02-01

This report provides a detailed description of the algorithms that will be used to generate harmonized recommended speeds : and queue warning information in the proposed Intelligent Network Flow Optimization (INFLO) prototype. This document : describ...

Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations

Directory of Open Access Journals (Sweden)

Florin-Catalin ENACHE

2015-10-01

Full Text Available The growing character of the cloud business has manifested exponentially in the last 5 years. The capacity managers need to concentrate on a practical way to simulate the random demands a cloud infrastructure could face, even if there are not too many mathematical tools to simulate such demands.This paper presents an introduction into the most important stochastic processes and queueing theory concepts used for modeling computer performance. Moreover, it shows the cases where such concepts are applicable and when not, using clear programming examples on how to simulate a queue, and how to use and validate a simulation, when there are no mathematical concepts to back it up.

Terminal Appointment System Design by Non-stationary M(t)/Ek/c(t) Queueing Model and Genetic Algorithm

DEFF Research Database (Denmark)

Chen, Gang; Govindan, Kannan; Yang, Zhong-Zhen

2013-01-01

Long truck queue is a common problem at big marine container terminals, where the resources and equipment are usually scheduled to serve ships prior to trucks. To reduce truck queues, some container terminals adopt terminal appointment system (TAS) to manage truck arrivals. This paper addresses two...

Analysis of Cloud-Based Database Systems

Science.gov (United States)

2015-06-01

deploying the VM, we installed SQL Server 2014 relational database management software (RDBMS) and restored a copy of the PYTHON database onto the server ...management views within SQL Server , we retrieved lists of the most commonly executed queries, the percentage of reads versus writes, as well as...Monitor. This gave us data regarding resource utilization and queueing. The second tool we used was the SQL Server Profiler provided by Microsoft

A scheme for evaluating a local queue warning system.

NARCIS (Netherlands)

Botma, H. & Oei, H.-L.

2018-01-01

This article outlines a method of evaluating a 'local queue warning system', in principle intended only to warn drivers of unexpected congestion at known discontinuities of the road geomctry (bottleneck) and give them advisory speed indications. A prerequisite for installing this system is therefore

The truncated Hyper-Poisson queues: Hk/Ma,b/C/N with balking, reneging and general bulk service rule

Directory of Open Access Journals (Sweden)

Shawky A.I.

2008-01-01

Full Text Available The aim of this paper is to derive the analytical solution of the queue: Hk/Ma,b/C/N with balking and reneging in which (I units arrive according to a hyper-Poisson distribution with k independent branches, (II the queue discipline is FIFO; and (III the units are served in batches according to a general bulk service rule. The steady-state probabilities, recurrence relations connecting various probabilities introduced are found and the expected number of units in the queue is derived in an explicit form. Also, some special cases are obtained. .

The M/M/1 queue with inventory, lost sale and general lead times

DEFF Research Database (Denmark)

Saffari, Mohammad; Asmussen, Søren; Haji, Rasoul

We consider an M/M/1 queueing system with inventory under the (r,Q) policy and with lost sales, in which demands occur according to a Poisson process and service times are exponentially distributed. All arriving customers during stockout are lost. We derive the stationary distributions of the joint...... queue length (number of customers in the system) and on-hand inventory when lead times are random variables and can take various distributions. The derived stationary distributions are used to formulate long-run average performance measures and cost functions in some numerical examples....

Server for experimental data from LHD

International Nuclear Information System (INIS)

Emoto, M.; Ohdachi, S.; Watanabe, K.; Sudo, S.; Nagayama, Y.

2006-01-01

In order to unify various types of data, the Kaiseki Server was developed. This server provides physical experimental data of large helical device (LHD) experiments. Many types of data acquisition systems currently exist in operation, and they produce files of various formats. Therefore, it has been difficult to analyze different types of acquisition data at the same time because the data of each system should be read in a particular manner. To facilitate the usage of this data by researchers, the authors have developed a new server system, which provides a unified data format and a unique data retrieval interface. Although the Kaiseki Server satisfied the initial demand, new requests arose from researchers, one of which was the remote usage of the server. The current system cannot be used remotely because of security issues. Another request was group ownership, i.e., users belonging to the same group should have equal access to data. To satisfy these demands, the authors modified the server. However, since other requests may arise in the future, the new system must be flexible so that it can satisfy future demands. Therefore, the authors decided to develop a new server using a three-tier structure

Windows Server 2012 R2 administrator cookbook

CERN Document Server

Krause, Jordan

2015-01-01

This book is intended for system administrators and IT professionals with experience in Windows Server 2008 or Windows Server 2012 environments who are looking to acquire the skills and knowledge necessary to manage and maintain the core infrastructure required for a Windows Server 2012 and Windows Server 2012 R2 environment.

NRSAS: Nuclear Receptor Structure Analysis Servers.

NARCIS (Netherlands)

Bettler, E.J.M.; Krause, R.; Horn, F.; Vriend, G.

2003-01-01

We present a coherent series of servers that can perform a large number of structure analyses on nuclear hormone receptors. These servers are part of the NucleaRDB project, which provides a powerful information system for nuclear hormone receptors. The computations performed by the servers include

A spatiotemporal model for the LTE uplink: Spatially interacting tandem queues approach

KAUST Repository

Gharbieh, Mohammad

2017-07-31

With the proliferation of the Internet-of-things (IoT), there is an undeniable consensus that cellular LTE networks will have to support a dramatically larger number of uplink connections. This is true since most of the devices to be added incur machine-type communications which is dominantly upstream. Can current LTE network withstand this challenge? To answer this question, the joint performance of random access process and the uplink data transmission should be investigated. These two problems have been classically treated in the literature in a disjoint fashion. In this paper, they are jointly analyzed as an inseparable couple. To do that, a tandem queuing model is adopted whereby devices are represented as spatially interacting queues. The interaction between queues is governed by the mutual inter-cell and intra-cell interference. To that end, a joint stochastic geometry and queueing theory model is exploited to study this problem and a spatiotemporal analytical model is developed accordingly. Network stability and scalability are two prime performance criteria for performance assessment. In light of these two criteria, the developed model is poised to offer valuable insights into efficient access and resource allocation strategies.

Adaptive Queue Management with Restraint on Non-Responsive Flows

Directory of Open Access Journals (Sweden)

Lan Li

2003-12-01

Full Text Available This paper proposes an adaptive queue management scheme (adaptive RED to improve Random Early Detection (RED on restraining non-responsive flows. Due to a lack of flow control mechanism, non-responsive flows can starve responsive flows for buffer and bandwidth at the gateway. In order to solve the disproportionate resource problem, RED framework is modified in this way: on detecting when the non-responsive flows starve the queue, packet-drop intensity (Max_p in RED can be adaptively adjusted to curb non-responsive flows for resource fair-sharing, such as buffer and bandwidth fair-sharing. Based on detection of traffic behaviors, intentionally restraining nonresponsive flows is to increase the throughput and decrease the drop rate of responsive flows. Our experimental results based on adaptive RED shows that the enhancement of responsive traffic and the better sharing of buffer and bandwidth can be achieved under a variety of traffic scenarios.

An MX/GI/1/N queue with close-down and vacation times

Directory of Open Access Journals (Sweden)

Andreas Frey

1999-01-01

Full Text Available An MX/GI/1/N finite capacity queue with close-down time, vacation time and exhaustive service discipline is considered under the partial batch acceptance strategy as well as under the whole batch acceptance strategy. Applying the supplementary variable technique the queue length distribution at an arbitrary instant and at a departure epoch is obtained under both strategies, where no assumption on the batch size distribution is made. The loss probabilities and the Laplace-Stieltjes transforms of the waiting time distribution of the first customer and of an arbitrary customer of a batch are also given. Numerical examples give some insight into the behavior of the system.

Queueing network model for obstetric patient flow in a hospital.

Science.gov (United States)

Takagi, Hideaki; Kanai, Yuta; Misue, Kazuo

2016-03-03

A queueing network is used to model the flow of patients in a hospital using the observed admission rate of patients and the histogram for the length of stay for patients in each ward. A complete log of orders for every movement of all patients from room to room covering two years was provided to us by the Medical Information Department of the University of Tsukuba Hospital in Japan. We focused on obstetric patients, who are generally hospitalized at random times throughout the year, and we analyzed the patient flow probabilistically. On admission, each obstetric patient is assigned to a bed in one of the two wards: one for normal delivery and the other for high-risk delivery. Then, the patient may be transferred between the two wards before discharge. We confirm Little's law of queueing theory for the patient flow in each ward. Next, we propose a new network model of M/G/ ∞ and M/M/ m queues to represent the flow of these patients, which is used to predict the probability distribution for the number of patients staying in each ward at the nightly census time. Although our model is a very rough and simplistic approximation of the real patient flow, the predicted probability distribution shows good agreement with the observed data. The proposed method can be used for capacity planning of hospital wards to predict future patient load in each ward.

QUEUING ANALYSIS OF CAR SERVICING CUSTOMERS USED SINGLE CHANNEL MODEL AND KENDALL'S NOTATION IN PT. ARMADA MOBIL PURWOKERTO

Directory of Open Access Journals (Sweden)

Tugiyono

2013-04-01

Full Text Available This study aims to identify the customer’s problem queue, specify the model queue, the arrival and customer service frequency distributions at PT. Armada Mobil Purwokerto. Methods of the research conducted by observing and measuring directly the research object, the data from the study was calculated according to the theory of queues. The result appropriate to single channel queuing model Poisson distribution of the arrivals, exponential distribution of the time service. The characteristized of Kendall’s notation is M/M/3/3/571.

ANALISIS SISTEM ANTREAN DENGAN DISIPLIN PELAYANAN PREEMPTIVE

Directory of Open Access Journals (Sweden)

Nur Indra Istiani

2017-11-01

ANALYSIS OF QUEUE SYSTEM WITH PREEMPTIVE SERVICE DISCIPLINE Preemptive service discipline is one of rules in the queue system where the server serves customers based on the order of priority. The purpose of this paper is to analyze the queueing model using Preemptive service discipline, to obtain its effective measurements and to compare it towards the general service discipline. The balance equation in this paper are obtained by assuming that Preemptive service discipline has two services priority and the queueing process follows Quasi Birth and Date Process. Next, using probability generating function (PGF method, we obtain the measurement of effectiveness.

Mastering Windows Server 2008 Networking Foundations

CERN Document Server

Minasi, Mark; Mueller, John Paul

2011-01-01

Find in-depth coverage of general networking concepts and basic instruction on Windows Server 2008 installation and management including active directory, DNS, Windows storage, and TCP/IP and IPv4 networking basics in Mastering Windows Server 2008 Networking Foundations. One of three new books by best-selling author Mark Minasi, this guide explains what servers do, how basic networking works (IP basics and DNS/WINS basics), and the fundamentals of the under-the-hood technologies that support staff must understand. Learn how to install Windows Server 2008 and build a simple network, security co

National Medical Terminology Server in Korea

Science.gov (United States)

Lee, Sungin; Song, Seung-Jae; Koh, Soonjeong; Lee, Soo Kyoung; Kim, Hong-Gee

Interoperable EHR (Electronic Health Record) necessitates at least the use of standardized medical terminologies. This paper describes a medical terminology server, LexCare Suite, which houses terminology management applications, such as a terminology editor, and a terminology repository populated with international standard terminology systems such as Systematized Nomenclature of Medicine (SNOMED). The server is to satisfy the needs of quality terminology systems to local primary to tertiary hospitals. Our partner general hospitals have used the server to test its applicability. This paper describes the server and the results of the applicability test.

A cooperative approach to queue allocation of indivisible objects

NARCIS (Netherlands)

Hamers, H.J.M.; Klijn, F.; Slikker, M.; Velzen, van B.

2009-01-01

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining stable

Transient analysis of one-sided Lévy-driven queues

NARCIS (Netherlands)

Starreveld, N.J.; Bekker, R.; Mandjes, M.

2016-01-01

In this article, we analyze the transient behavior of the workload process in a Lévy-driven queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of spectrally

Transient analysis of one-sided Lévy-driven queues

NARCIS (Netherlands)

Starreveld, N.J.; R. Bekker (Rene); M.R.H. Mandjes (Michel)

2016-01-01

textabstractIn this article, we analyze the transient behavior of the workload process in a Lévy-driven queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of

The Jackson Queueing Network Model Built Using Poisson Measures. Application To A Bank Model

Directory of Open Access Journals (Sweden)

Ciuiu Daniel

2014-07-01

Full Text Available In this paper we will build a bank model using Poisson measures and Jackson queueing networks. We take into account the relationship between the Poisson and the exponential distributions, and we consider for each credit/deposit type a node where shocks are modeled as the compound Poisson processes. The transmissions of the shocks are modeled as moving between nodes in Jackson queueing networks, the external shocks are modeled as external arrivals, and the absorption of shocks as departures from the network.

Chaotic queue-based genetic algorithm for design of a self-tuning fuzzy logic controller

Science.gov (United States)

Saini, Sanju; Saini, J. S.

2012-11-01

This paper employs a chaotic queue-based method using logistic equation in a non-canonical genetic algorithm for optimizing the performance of a self-tuning Fuzzy Logic Controller, used for controlling a nonlinear double-coupled system. A comparison has been made with a standard canonical genetic algorithm implemented on the same plant. It has been shown that chaotic queue-method brings an improvement in the performance of the FLC for wide range of set point changes by a more profound initial population spread in the search space.

Optimization of Signal Timing of Intersections by Internal Metering of Queue Time Ratio of Vehicles in Network Scale

Directory of Open Access Journals (Sweden)

Mina Ghanbarikarekani

2016-06-01

Full Text Available Optimization of signal timing in urban network is usually done by minimizing the delay times or queue lengths. Sincethe effect of each intersection on the whole network is not considered in the mentioned methods, traffic congestion may occur in network links. Therefore, this paper has aimed to provide a timing optimization algorithm for traffic signals using internal timing policy based on balancing queue time ratio of vehicles in network links. In the proposed algorithm, the difference between the real queue time ratio and the optimum one for each link of intersection was minimized. To evaluate the efficiency of the proposed algorithm on traffic performance, the proposed algorithm was applied in a hypothetical network. By comparing the simulating software outputs, before and after implementing the algorithm, it was concluded that the queue time ratio algorithm has improved the traffic parameters by increasing the flow as well as reducing the delay time and density of the network.

Decomposability queueing and computer system applications

CERN Document Server

Courtois, P J

1977-01-01

Decomposability: Queueing and Computer System Applications presents a set of powerful methods for systems analysis. This 10-chapter text covers the theory of nearly completely decomposable systems upon which specific analytic methods are based.The first chapters deal with some of the basic elements of a theory of nearly completely decomposable stochastic matrices, including the Simon-Ando theorems and the perturbation theory. The succeeding chapters are devoted to the analysis of stochastic queuing networks that appear as a type of key model. These chapters also discuss congestion problems in

Cost Comparison of B-1B Non-Mission-Capable Drivers Using Finite Source Queueing with Spares

Science.gov (United States)

2012-09-06

COMPARISON OF B-1B NON-MISSION-CAPABLE DRIVERS USING FINITE SOURCE QUEUEING WITH SPARES GRADUATE RESEARCH PAPER Presented to the Faculty...step into the lineup making large-number approximations unusable. Instead, a finite source queueing model including spares is incorporated...were reported as flying time accrued since last occurrence. Service time was given in both start-stop format and MX man-hours utilized. Service time was

CheD: chemical database compilation tool, Internet server, and client for SQL servers.

Science.gov (United States)

Trepalin, S V; Yarkov, A V

2001-01-01

An efficient program, which runs on a personal computer, for the storage, retrieval, and processing of chemical information, is presented, The program can work both as a stand-alone application or in conjunction with a specifically written Web server application or with some standard SQL servers, e.g., Oracle, Interbase, and MS SQL. New types of data fields are introduced, e.g., arrays for spectral information storage, HTML and database links, and user-defined functions. CheD has an open architecture; thus, custom data types, controls, and services may be added. A WWW server application for chemical data retrieval features an easy and user-friendly installation on Windows NT or 95 platforms.

NExT server

CERN Document Server

1989-01-01

The first website at CERN - and in the world - was dedicated to the World Wide Web project itself and was hosted on Berners-Lee's NeXT computer. The website described the basic features of the web; how to access other people's documents and how to set up your own server. This NeXT machine - the original web server - is still at CERN. As part of the project to restore the first website, in 2013 CERN reinstated the world's first website to its original address.

Arrival first queueing networks with applications in kanban production systems

NARCIS (Netherlands)

Boucherie, R.J.; Chao, X.; Miyazawa, M.

2001-01-01

In this paper we introduce a new class of queueing networks called {\\it arrival first networks}. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production

Arrival first queueing networks with applications in kanban production systems

NARCIS (Netherlands)

Boucherie, Richardus J.; Chao, X.; Miyazawa, M.

2003-01-01

In this paper, we introduce a new class of queueing networks called arrival first networks. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production

Transient analysis of one-sided Lévy-driven queues

NARCIS (Netherlands)

Starreveld, N.; Bekker, R.; Mandjes, M.R.H.

2015-01-01

In this paper we analyze the transient behavior of the workload process in a Lévy input queue. We are interested in the value of the workload process at a random epoch; this epoch is distributed as the sum of independent exponential random variables. We consider both cases of spectrally one-sided

Python for Scientific Computing Education: Modeling of Queueing Systems

Directory of Open Access Journals (Sweden)

Vladimiras Dolgopolovas

2014-01-01

Full Text Available In this paper, we present the methodology for the introduction to scientific computing based on model-centered learning. We propose multiphase queueing systems as a basis for learning objects. We use Python and parallel programming for implementing the models and present the computer code and results of stochastic simulations.

CORAL Server and CORAL Server Proxy: Scalable Access to Relational Databases from CORAL Applications

CERN Document Server

Valassi, A; Kalkhof, A; Salnikov, A; Wache, M

2011-01-01

The CORAL software is widely used at CERN for accessing the data stored by the LHC experiments using relational database technologies. CORAL provides a C++ abstraction layer that supports data persistency for several backends and deployment models, including local access to SQLite files, direct client access to Oracle and MySQL servers, and read-only access to Oracle through the FroNTier web server and cache. Two new components have recently been added to CORAL to implement a model involving a middle tier "CORAL server" deployed close to the database and a tree of "CORAL server proxy" instances, with data caching and multiplexing functionalities, deployed close to the client. The new components are meant to provide advantages for read-only and read-write data access, in both offline and online use cases, in the areas of scalability and performance (multiplexing for several incoming connections, optional data caching) and security (authentication via proxy certificates). A first implementation of the two new c...

Freeway Traffic Density and On-Ramp Queue Control via ILC Approach

Directory of Open Access Journals (Sweden)

Ronghu Chi

2014-01-01

Full Text Available A new queue length information fused iterative learning control approach (QLIF-ILC is presented for freeway traffic ramp metering to achieve a better performance by utilizing the error information of the on-ramp queue length. The QLIF-ILC consists of two parts, where the iterative feedforward part updates the control input signal by learning from the past control data in previous trials, and the current feedback part utilizes the tracking error of the current learning iteration to stabilize the controlled plant. These two parts are combined in a complementary manner to enhance the robustness of the proposed QLIF-ILC. A systematic approach is developed to analyze the convergence and robustness of the proposed learning scheme. The simulation results are further given to demonstrate the effectiveness of the proposed QLIF-ILC.

Predictive functional control for active queue management in congested TCP/IP networks.

Science.gov (United States)

Bigdeli, N; Haeri, M

2009-01-01

Predictive functional control (PFC) as a new active queue management (AQM) method in dynamic TCP networks supporting explicit congestion notification (ECN) is proposed. The ability of the controller in handling system delay along with its simplicity and low computational load makes PFC a privileged AQM method in the high speed networks. Besides, considering the disturbance term (which represents model/process mismatches, external disturbances, and existing noise) in the control formulation adds some level of robustness into the PFC-AQM controller. This is an important and desired property in the control of dynamically-varying computer networks. In this paper, the controller is designed based on a small signal linearized fluid-flow model of the TCP/AQM networks. Then, closed-loop transfer function representation of the system is derived to analyze the robustness with respect to the network and controller parameters. The analytical as well as the packet-level ns-2 simulation results show the out-performance of the developed controller for both queue regulation and resource utilization. Fast response, low queue fluctuations (and consequently low delay jitter), high link utilization, good disturbance rejection, scalability, and low packet marking probability are other features of the developed method with respect to other well-known AQM methods such as RED, PI, and REM which are also simulated for comparison.

Mastering Microsoft Windows Server 2008 R2

CERN Document Server

Minasi, Mark; Finn, Aidan

2010-01-01

The one book you absolutely need to get up and running with Windows Server 2008 R2. One of the world's leading Windows authorities and top-selling author Mark Minasi explores every nook and cranny of the latest version of Microsoft's flagship network operating system, Windows Server 2008 R2, giving you the most in-depth coverage in any book on the market.: Focuses on Windows Windows Server 2008 R2, the newest version of Microsoft's Windows' server line of operating system, and the ideal server for new Windows 7 clients; Author Mark Minasi is one of the world's leading Windows authorities and h

Mastering Windows Server 2012 R2

CERN Document Server

Minasi, Mark; Booth, Christian; Butler, Robert; McCabe, John; Panek, Robert; Rice, Michael; Roth, Stefan

2013-01-01

Check out the new Hyper-V, find new and easier ways to remotely connect back into the office, or learn all about Storage Spaces-these are just a few of the features in Windows Server 2012 R2 that are explained in this updated edition from Windows authority Mark Minasi and a team of Windows Server experts led by Kevin Greene. This book gets you up to speed on all of the new features and functions of Windows Server, and includes real-world scenarios to put them in perspective. If you're a system administrator upgrading to, migrating to, or managing Windows Server 2012 R2, find what you need to

An analytical study of various telecomminication networks using Markov models

International Nuclear Information System (INIS)

Ramakrishnan, M; Jayamani, E; Ezhumalai, P

2015-01-01

The main aim of this paper is to examine issues relating to the performance of various Telecommunication networks, and applied queuing theory for better design and improved efficiency. Firstly, giving an analytical study of queues deals with quantifying the phenomenon of waiting lines using representative measures of performances, such as average queue length (on average number of customers in the queue), average waiting time in queue (on average time to wait) and average facility utilization (proportion of time the service facility is in use). In the second, using Matlab simulator, summarizes the finding of the investigations, from which and where we obtain results and describing methodology for a) compare the waiting time and average number of messages in the queue in M/M/1 and M/M/2 queues b) Compare the performance of M/M/1 and M/D/1 queues and study the effect of increasing the number of servers on the blocking probability M/M/k/k queue model. (paper)

CABS-flex 2.0: a web server for fast simulations of flexibility of protein structures.

Science.gov (United States)

Kuriata, Aleksander; Gierut, Aleksandra Maria; Oleniecki, Tymoteusz; Ciemny, Maciej Pawel; Kolinski, Andrzej; Kurcinski, Mateusz; Kmiecik, Sebastian

2018-05-14

Classical simulations of protein flexibility remain computationally expensive, especially for large proteins. A few years ago, we developed a fast method for predicting protein structure fluctuations that uses a single protein model as the input. The method has been made available as the CABS-flex web server and applied in numerous studies of protein structure-function relationships. Here, we present a major update of the CABS-flex web server to version 2.0. The new features include: extension of the method to significantly larger and multimeric proteins, customizable distance restraints and simulation parameters, contact maps and a new, enhanced web server interface. CABS-flex 2.0 is freely available at http://biocomp.chem.uw.edu.pl/CABSflex2.

Folding Proteins at 500 ns/hour with Work Queue.

Science.gov (United States)

Abdul-Wahid, Badi'; Yu, Li; Rajan, Dinesh; Feng, Haoyun; Darve, Eric; Thain, Douglas; Izaguirre, Jesús A

2012-10-01

Molecular modeling is a field that traditionally has large computational costs. Until recently, most simulation techniques relied on long trajectories, which inherently have poor scalability. A new class of methods is proposed that requires only a large number of short calculations, and for which minimal communication between computer nodes is required. We considered one of the more accurate variants called Accelerated Weighted Ensemble Dynamics (AWE) and for which distributed computing can be made efficient. We implemented AWE using the Work Queue framework for task management and applied it to an all atom protein model (Fip35 WW domain). We can run with excellent scalability by simultaneously utilizing heterogeneous resources from multiple computing platforms such as clouds (Amazon EC2, Microsoft Azure), dedicated clusters, grids, on multiple architectures (CPU/GPU, 32/64bit), and in a dynamic environment in which processes are regularly added or removed from the pool. This has allowed us to achieve an aggregate sampling rate of over 500 ns/hour. As a comparison, a single process typically achieves 0.1 ns/hour.

Fast distributed strategic learning for global optima in queueing access games

KAUST Repository

Tembine, Hamidou

2014-01-01

In this paper we examine combined fully distributed payoff and strategy learning (CODIPAS) in a queue-aware access game over a graph. The classical strategic learning analysis relies on vanishing or small learning rate and uses stochastic

An energy-efficient MAC protocol using dynamic queue management for delay-tolerant mobile sensor networks.

Science.gov (United States)

Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua

2011-01-01

Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

An Energy-Efficient MAC Protocol Using Dynamic Queue Management for Delay-Tolerant Mobile Sensor Networks

Directory of Open Access Journals (Sweden)

Yugui Qu

2011-02-01

Full Text Available Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

Simple product-form bounds for queueing networks with finite clusters

NARCIS (Netherlands)

van Dijk, N.M.; van der Sluis, E.

2001-01-01

Queueing networks are studied with finite capacity constraints for clusters of stations. First, by an instructive tandem cluster example it is shown how a product-form modification method for networks with finite stations can be extended to networks with finite clusters. Next, a general result is

Estimation of the workload correlation in a Markov fluid queue

NARCIS (Netherlands)

Kaynar, B.; Mandjes, M.R.H.

2013-01-01

This paper considers a Markov fluid queue, focusing on the correlation function of the stationary workload process. A simulation-based computation technique is proposed, which relies on a coupling idea. Then an upper bound on the variance of the resulting estimator is given, which reveals how the

The priority queue as an example of hardware/software codesign

DEFF Research Database (Denmark)

Høeg, Flemming; Mellergaard, Niels; Staunstrup, Jørgen

1994-01-01

The paper identifies a number of issues that are believed to be important for hardware/software codesign. The issues are illustrated by a small comprehensible example: a priority queue. Based on simulations of a real application, we suggest a combined hardware/software realization of the priority...

Waiting time distribution in M/D/1 queueing systems

DEFF Research Database (Denmark)

Iversen, Villy Bæk; Staalhagen, Lars

1999-01-01

The well-known formula for the waiting time distribution of M/D/1 queueing systems is numerically unsuitable when the load is close to 1.0 and/or the results for a large waiting time are required. An algorithm for any load and waiting time is presented, based on the state probabilities of M/D/1...

Upper Bound for Queue length in Regulated Burst Service Scheduling

Directory of Open Access Journals (Sweden)

Mahmood Daneshvar Farzanegan

2016-01-01

Full Text Available Quality of Service (QoS provisioning is very important in next computer/communication networks because of increasing multimedia services. Hence, very investigations are performed in this area. Scheduling algorithms effect QoS provisioning. Lately, a scheduling algorithm called Regulated Burst Service Scheduling (RBSS suggested by author in [1] to provide a better service to bursty and delay sensitive services such as video. One of the most significant feature in RBSS is considering burstiness of arrival traffic in scheduling algorithm. In this paper, an upper bound of queue length or buffer size and service curve are calculated by Network Calculus analysis for RBSS. Because in RBSS queue length is a parameter that is considered in scheduling arbitrator, analysis results a differential inequality to obtain service curve. To simplify, arrival traffic is assumed to be linear that is defined in the paper clearly. This paper help to analysis delay in RBSS for different traffic with different specifications. Therefore, QoS provisioning will be evaluated.

Elements of queueing theory palm martingale calculus and stochastic recurrences

CERN Document Server

Baccelli, François

2003-01-01

The Palm theory and the Loynes theory of stationary systems are the two pillars of the modern approach to queuing. This book, presenting the mathematical foundations of the theory of stationary queuing systems, contains a thorough treatment of both of these. This approach helps to clarify the picture, in that it separates the task of obtaining the key system formulas from that of proving convergence to a stationary state and computing its law. The theory is constantly illustrated by classical results and models: Pollaczek-Khintchin and Tacacs formulas, Jackson and Gordon-Newell networks, multiserver queues, blocking queues, loss systems etc., but it also contains recent and significant examples, where the tools developed turn out to be indispensable. Several other mathematical tools which are useful within this approach are also presented, such as the martingale calculus for point processes, or stochastic ordering for stationary recurrences. This thoroughly revised second edition contains substantial addition...

JAFA: a protein function annotation meta-server

DEFF Research Database (Denmark)

Friedberg, Iddo; Harder, Tim; Godzik, Adam

2006-01-01

Annotations, or JAFA server. JAFA queries several function prediction servers with a protein sequence and assembles the returned predictions in a legible, non-redundant format. In this manner, JAFA combines the predictions of several servers to provide a comprehensive view of what are the predicted functions...

A polling model with an autonomous server

NARCIS (Netherlands)

de Haan, Roland; Boucherie, Richardus J.; van Ommeren, Jan C.W.

Polling models are used as an analytical performance tool in several application areas. In these models, the focus often is on controlling the operation of the server as to optimize some performance measure. For several applications, controlling the server is not an issue as the server moves

Passive Detection of Misbehaving Name Servers

Science.gov (United States)

2013-10-01

name servers that changed IP address five or more times in a month. Solid red line indicates those servers possibly linked to pharmaceutical scams . 12...malicious and stated that fast-flux hosting “is considered one of the most serious threats to online activities today” [ICANN 2008, p. 2]. The...that time, apparently independent of filters on name-server flux, a large number of pharmaceutical scams1 were taken down. These scams apparently

Asymptotic inference for waiting times and patiences in queues with abandonment

DEFF Research Database (Denmark)

Gorst-Rasmussen, Anders; Hansen, Martin Bøgsted

2009-01-01

Motivated by applications in call center management, we propose a framework based on empirical process techniques for inference about waiting time and patience distributions in multiserver queues with abandonment. The framework rigorises heuristics based on survival analysis of independent...

Simple approximations for the batch-arrival MX/G/1 queue

NARCIS (Netherlands)

van Ommeren, Jan C.W.

1990-01-01

In this paper we consider the MX/G/I queueing system with batch arrivals. We give simple approximations for the waiting-time probabilities of individual customers. These approximations are checked numerically and they are found to perform very well for a wide variety of batch-size and service-timed

Asymptotic inference for waiting times and patiences in queues with abandonment

DEFF Research Database (Denmark)

Gorst-Rasmussen, Anders; Hansen, Martin Bøgsted

Motivated by applications in call center management, we propose a framework based on empirical process techniques for inference about the waiting time and patience distribution in multiserver queues with abandonment. The framework rigorises heuristics based on survival analysis of independent...

Mastering Microsoft Windows Small Business Server 2008

CERN Document Server

Johnson, Steven

2010-01-01

A complete, winning approach to the number one small business solution. Do you have 75 or fewer users or devices on your small-business network? Find out how to integrate everything you need for your mini-enterprise with Microsoft's new Windows Server 2008 Small Business Server, a custom collection of server and management technologies designed to help small operations run smoothly without a giant IT department. This comprehensive guide shows you how to master all SBS components as well as handle integration with other Microsoft technologies.: Focuses on Windows Server 2008 Small Business Serv

Microsoft Windows Server 2012 administration instant reference

CERN Document Server

Hester, Matthew

2013-01-01

Fast, accurate answers for common Windows Server questions Serving as a perfect companion to all Windows Server books, this reference provides you with quick and easily searchable solutions to day-to-day challenges of Microsoft's newest version of Windows Server. Using helpful design features such as thumb tabs, tables of contents, and special heading treatments, this resource boasts a smooth and seamless approach to finding information. Plus, quick-reference tables and lists provide additional on-the-spot answers. Covers such key topics as server roles and functionality, u

Server-side Statistics Scripting in PHP

Directory of Open Access Journals (Sweden)

Jan de Leeuw

1997-06-01

Full Text Available On the UCLA Statistics WWW server there are a large number of demos and calculators that can be used in statistics teaching and research. Some of these demos require substantial amounts of computation, others mainly use graphics. These calculators and demos are implemented in various different ways, reflecting developments in WWW based computing. As usual, one of the main choices is between doing the work on the client-side (i.e. in the browser or on the server-side (i.e. on our WWW server. Obviously, client-side computation puts fewer demands on the server. On the other hand, it requires that the client downloads Java applets, or installs plugins and/or helpers. If JavaScript is used, client-side computations will generally be slow. We also have to assume that the client is installed properly, and has the required capabilities. Requiring too much on the client-side has caused browsing machines such as Netscape Communicator to grow beyond all reasonable bounds, both in size and RAM requirements. Moreover requiring Java and JavaScript rules out such excellent browsers as Lynx or Emacs W3. For server-side computing, we can configure the server and its resources ourselves, and we need not worry about browser capabilities and configuration. Nothing needs to be downloaded, except the usual HTML pages and graphics. In the same way as on the client side, there is a scripting solution, where code is interpreted, or a ob ject-code solution using compiled code. For the server-side scripting, we use embedded languages, such as PHP/FI. The scripts in the HTML pages are interpreted by a CGI program, and the output of the CGI program is send to the clients. Of course the CGI program is compiled, but the statistics procedures will usually be interpreted, because PHP/FI does not have the appropriate functions in its scripting language. This will tend to be slow, because embedded languages do not deal efficiently with loops and similar constructs. Thus a first

ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT

Directory of Open Access Journals (Sweden)

M. Usha

2014-09-01

Full Text Available Design of an Active Queue Management scheme at the Access Point to address the problem of congestion control, packet delay variation and packet loss rate is discussed. The proposed mechanism calculates and adjusts redundancy rate adaptively at the access point by considering both network traffic load and wireless channel condition. Real-time applications such as Mobile learning and smart learning need the special treatment and require differentiated QoS to satisfy the client who is ready to pay more than others. Maintaining the jitter value of the multimedia packets below the threshold is essential to guarantee the desirable quality of the video at the receiver. The work initially concentrates on minimizing the packet loss of such priority flows and they have to be given place in the queue even at the time of buffer overflow. Thus the proposed work uses push-out policy to provide differentiated services to the multimedia flow which achieves considerable improvement in the video quality at the receiver. The considerable decrease in packet loss rate and special treatment in the queue of the access point lowers the packet delay variation of the multimedia flow. The results show that the AQM used at the access point effectively achieves low packet loss, low jitter using differentiated FEC rate calculation without generating congestion in the wireless network.

The asymptotic variance of departures in critically loaded queues

NARCIS (Netherlands)

Al Hanbali, Ahmad; Mandjes, M.R.H.; Nazarathy, Y.; Whitt, W.

2011-01-01

We consider the asymptotic variance of the departure counting process D(t) of the GI/G/1 queue; D(t) denotes the number of departures up to time t. We focus on the case where the system load ϱ equals 1, and prove that the asymptotic variance rate satisfies limt→∞varD(t) / t = λ(1 - 2 / π)(ca2 +

On the control of queueing systems with aging state information

NARCIS (Netherlands)

Onderwater, M.; Bhulai, S.; van der Mei, R.D.

2015-01-01

We investigate control of a queueing system in which a component of the state space is subject to aging. The controller can choose to forward incoming queries to the system (where it needs time for processing), or respond with a previously generated response (incurring a penalty for not providing a

Empirical Analysis of Priority on a FCFS Queue Discipline In ...

African Journals Online (AJOL)

Queues are virtually unavoidable phenomenon in Nigerian banking system. While banks stride to meet customers services' satisfaction, customers who do not go immediately into service must wait in line (if any). The queuing discipline in banks has been first-come-first-served (FCFS). What happen to the waiting time ...

Improved diagonal queue medical image steganography using Chaos theory, LFSR, and Rabin cryptosystem.