Consider the following simple communication channel model: an error-free bit pipe leading to a buffer modeled by a single-server queue whose “packets” or “customers” are single bits. If the service rate is p bits/sec, common wisdom would indicate that the Shannon capacity of this communication link is p bits/sec. As we show in this paper, that intuition is wrong: the answer is actually higher t...

We consider a basic model of a risk-neutral principal incentivizing a risk neutral agent to exert effort in order to raise the arrival rate of a Poisson process. The effort is costly to the agent, unobservable to the principal, and affects the instantaneous arrival rate. Each arrival yields a constant revenue to the principal. The principal, therefore, devises a mechanism involving payments and...

Name: YUE WANGDate of Degree: July, 2005Institution: Oklahoma State UniversityLocation: Stillwater, OklahomaTitle of Study: QUEUE LENGTH ANALYSIS OF END-TO-END DIFFERENTIATEDSERVICE NETWORKS WITH SELF-SIMILAR TRAFFICPages in Study: 74Candidate for the Degree of Master of ScienceMajor Field: Computer ScienceScope and Method of Study: This thesis focuses on...

The purpose of this research paper was to propose a method which can be utilized to determine the different types of performance measures on the basis of the crisp values for the fuzzy queuing model which has an unreliable server and where the rate of arrival, the rate of service, the rate of breakdown and the rate of repair are all expressed as the fuzzy numbers. In this case the inter arrival...

Consider a single server fixed batch service queueing system under multiple vacation with a possibility of negative arrival in which the arrival rate λ follows a Poisson process, the service time follows an exponential distribution with parameter μ. Further we assume a negative arrival rate occur at the rate of ν which follows a Poisson process and the length of time the server in vacation foll...

We review a recent approach to the mean-field limits in neural networks that takes into account the stochastic nature of input current and the uncertainty in synaptic coupling. This approach was proved to be a rigorous limit of the network equations in a general setting, and we express here the results in a more customary and simpler framework. We propose a heuristic argument to derive these eq...

The M/M/s queueing model assumes arrival rates, service rates, and number of servers to be constant in time. It is straightforward to extend the model to allow a time-varying arrival rate and a time-varying service rate, and the resulting models can be solved numerically using standard solvers for ordinary differential equations. The extension to a time-varying number of servers requires consid...

Companies and governments often rely on call centers to provide service to their customers. The call center industry is of great economic interest; It is rapidly expanding, in terms of workforce and economic scope [1]. Because of its importance a lot of studies have been, and are still being, conducted on modelling call centers. These models are being developed to help understand the performanc...

A study of failure rates of a web service that is deployed in a service-oriented architecture is presented. The study focuses on the HTTP requests that are rejected by the application server. The rejections may be caused by system overloading or mismanagement of configuration parameters. An analytical model and a Stochastic Activity Network (SAN) model are developed to predict the number of suc...

Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge in designing efficient scheduling policies in these networks is the lack of reliable estimates of system parameters, and an attractive approach for addressing this challenge is to design robust policies, i.e., polici...