We study the dynamic assignment of cross-trained servers to stations in understaffed lines with finite buffers. Our objective is to maximize the production rate. We identify optimal server assignment policies for systems with three stations, two servers, different flexibility structures, and either deterministic service times and arbitrary buffers or exponential service times and small buffers....

this paper analyzes renewal input state dependent queue with $n$- policy wherein the server takes exactly one vacation. using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. various performance measures has been presented. finally, some numerical  computations in the form of graphs are presented to show the par...

This paper introduces the problem of optimally admitting a finite number of customers from an auxiliary buffer with a low holding cost into a single–server queue with a high holding cost without observing the status of the single-server queue. This paper formulates a static (off-line) optimization of the admission schedule for a finite number of customers, assuming that the single–server queue ...

In this work we develop simple inference models based on finite capacity single server queues for estimating the buffer size and the intensity of cross traffic at the bottleneck link of a path between two hosts. Several pairs of moment-based estimators are proposed to estimate these two quantities. The best scheme is then identified through simulation. Keywords—Queueing, measurement, monitoring...

We consider a set of N fluid On–Off flows that share a common server of capacity c and a finite buffer B. The server capacity is allocated using the generalized processor sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long-term average demand qi. The buffer sharing is unrestricted as long as there is available space. If the buffer is full, the nec...

We report our experience with formulating and analyzing in the probabilistic model checker PRISM various closely related web server performance models that were previously described in literature in terms of classical queuing theory. By our work various ambiguities and deficiencies (also errors) are revealed; in particular, the PRISM models which combine state machines descriptions with perform...

We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model in state variable form describes the time varying mean behaviour of Available Bit Rate (ABR) traffic, which competes with Guaranteed Traffic for network resources. Using nonlinear control we derive an integrated control...

Multimedia and multiservice broadband networks (e.g. Broadband-ISDN and ATM based LANs) will be implemented using Asynchronous Transfer Mode (ATM). In this paper we consider the combined control problem of flow rate and bandwidth (capacity, service rate) at the virtual path level in ATM based networks under nonstationary conditions. A fluid flow model in the state variable form is used to descr...

This paper presents a novel dynamic and scalable caching algorithm of proxy server with a finite storage size for multimedia objects. Among the multimedia such as text, image, audio and video, video is a dominant component in terms of the performance of proxy server due to its traffic characteristics. For the fast caching process, caching sequences for videos are obtained to decrease both the b...

The paper examines self-similar properties of real telecommunications network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. The algorithms for modeling fixed-length sequence generators that are used to simulate self-similar behavior of wireless IP ...