In this paper, we present an approximate model (with finite or infinite waiting room) for an integrated service system with three types of traffic: a first offered narrow-band traffic, an overflow narrow-band traffic and a wide-band traffic. A narrow-band call requires a single server, while the number of servers required to serve a wide-band call is N . The blocked narrow-band calls are lost w...

We consider the waiting time distribution of the Gl/Gl /1 queue where customers are served in random order; inter-arrival and service times may have finite or infinite variance. Our main result shows that the waiting time in heavy traffic can be written as a product of two random variables. Our proof is based on the intuitively appealing fact that in heavy traffic, the queue length stays consta...

In this paper, we develop an energy method to study finite speed of propagation and waiting time phenomena for the stochastic porous-media equation with linear multiplicative noise in up to three spatial dimensions. Based on a novel iteration technique and on stochastic counterparts of weighted integral estimates used in the deterministic setting, we formulate a sufficient criterion on the grow...

starting from two-dimensional (2d) equations of motion, discretized formulations for transient behavior of soil-structure interaction problems have been derived. two different dynamic infinite elements taking into account single and two-wave types are presented in transformed space. by coupling the infinite elements with standard finite elements, an ordinary finite element procedure is used for...

the aim of this note is to study the submajorization inequalities for $tau$-measurable operators in a semi-finite von neumann algebra on a hilbert space with a normal faithful semi-finite trace $tau$. the submajorization inequalities generalize some results due to zhang, furuichi and lin, etc..

In infrastructure-less highly dynamic networks, computing and performing even basic tasks (such as routing and broadcasting) is a very challenging activity due to the fact that connectivity does not necessarily hold, and the network may actually be disconnected at every time instant. Clearly the task of designing protocols for these networks is less difficult if the environment allows waiting (...

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...

This paper investigates optimal pricing policies for a service facility modeled as a queueing system. Arriving customers are accepted if they are willing to pay the price charged by the service provider and if there is room in the waiting area. Capacity of the waiting area can be either finite or infinite. We determine expressions for the optimal prices that maximize the service provider’s long...

In this paper, we study a finite capacity queue where the arrival process is special case of discrete time Markov modulated Poisson process, service times are generally distributed, and server takes repeated vacations when system empty. The buffer acceptance strategy based on generalized push-out scheme: full, an arriving customer pushes out Nth in queue, N values between 2 system, joins end qu...