نتایج جستجو برای: arrivals

تعداد نتایج: 4481  

2009
Jose Angelo Divino Michael McAleer Marli Divino

Peru is a South American country that is divided into two parts by the Andes Mountains. The rich historical, cultural and geographic diversity has led to the inclusion of ten Peruvian sites on UNESCO’s World Heritage List. For the potential negative impacts of mass tourism on the environment, and hence on future international tourism demand, to be managed appropriately require modelling growth ...

2003
P. J. Sánchez D. Ferrin Lars Mönch Ilka Habenicht

In this paper, we investigate the performance of different dispatching and scheduling heuristics for batching tools in a semiconductor wafer fabrication facility (wafer fab) by means of discrete event simulation. Because the processing times of lots on batching tools are quite large compared to those of other processes, careful batching decisions may have a great impact on the performance of th...

2016
Jamol Pender Richard H. Rand Elizabeth Wesson

Understanding how delayed information impacts queueing systems is an important area of research. However, much of the current literature neglects one important feature of many queueing systems, namely non-stationary arrivals. Non-stationary arrivals model the fact that customers tend to access services during certain times of the day and not at a constant rate. In this paper, we analyze two two...

2000
Ken’ichi KAWANISHI Yoshitaka TAKAHASHI Toyofumi TAKENAKA

A multi-server system with trunk reservation is studied. The system is offered by two types of customers (class-1 and class-2). They arrive in independent batch Poisson streams and have an exponentially distributed service time. Class-1 customers will be lost or rejected if they find all S servers busy on their arrivals. Class-2 customers will use at most S′ = S − R servers and enter a queue wi...

2011
M.V.Rama Sundari

Communication network models play a predominant role in performance evaluation of many communication systems. The packet arrival processes for data networks are not matching with the Poisson processes due to the nature of bursty and time dependent arrivals. In this paper, a three node communication network model with non homogeneous Poisson arrivals having dynamic bandwidth allocation under mod...

2011
Lakshmi Anantharamu Bogdan S. Chlebus Dariusz R. Kowalski Mariusz A. Rokicki

We study broadcasting on multiple access channels with dynamic packet arrivals and jamming. The presented protocols are for the medium-access-control layer. The mechanisms of timing of packet arrivals and determination of which rounds are jammed are represented by adversarial models. Packet arrivals are constrained by the average rate of injections and the number of packets that can arrive in o...

2004
Khushboo Shah Stephan Bohacek Andre Broido

We examine the cause of the tail of the distribution of the number of packet and byte arrivals at backbone routers. One possible cause is that sometimes there are a large number of active connections resulting in a large number of arrivals in a short period of time. Another possibility is that the tail is due to one or a few very fast connections. By examining time-stamped packet headers from s...

2015
Alexander Zeifman Anna Korotysheva Sergey Frenkel Andrey Gorshenin Michael Levykin Victor Piskovski Antonina Timonina

Consideration is given to long-term staffing problem in highlevel telecommunication service systems in which rates of processes that govern their behaviour depend on time. We assume that except for arrivals of requests and their respective service there happen periodic breakdowns when system drops all active requests. The staffing objective is “immediate service of a given percentage of incomin...

Journal: :4OR 2010
Dieter Claeys Joris Walraevens Koenraad Laevens Herwig Bruneel

Abstract In this paper, we compute the probability generating functions (PGF’s) of the customer delay for two batch-service queueing models with batch arrivals. In the first model, the available server starts a new service whenever the system is not empty (without waiting to fill the capacity), while the server waits until he can serve at full capacity in the second model. Moments can then be o...

Journal: :Queueing Syst. 2005
Konstantin Avrachenkov Urtzi Ayesta Patrick Brown

We analyze a Processor-Sharing queue with Batch arrivals. Our analysis is based on the integral equation derived by Kleinrock, Muntz and Rodemich. Using the contraction mapping principle, we demonstrate the existence and uniqueness of a solution to the integral equation. Then we provide asymptotical analysis as well as tight bounds for the expected response time conditioned on the service time....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید