Refine
Year of publication
Document Type
- Article (18)
- ZIB-Report (17)
- In Proceedings (3)
Language
- English (38)
Is part of the Bibliography
- no (38) (remove)
Keywords
- sojourn time (5)
- state-dependent processor sharing (4)
- waiting time (3)
- M/GI/m-PS (2)
- busy period (2)
- factorial moments (2)
- freed carried traffic (2)
- impatient customers (2)
- moments (2)
- occupancy distribution (2)
- overflow traffic (2)
- peakedness (2)
- permanent customers (2)
- two-moment method (2)
- $M(n)/M(n)/s+GI (1)
- G/D/1 (1)
- G/G/1 (1)
- G/GI/1 (1)
- G/M/1 (1)
- GI/M/C/0 system (1)
- M(n)/M(n)/s+GI system (1)
- M/D/2-PS (1)
- M/M/m-PS (1)
- Poisson arrivals (1)
- abandon probability (1)
- approximate system (1)
- approximations (1)
- asymptotic (1)
- batch arrivals (1)
- blocking- (1)
- bounds (1)
- carried arrival process (1)
- circuit switching network (1)
- difference (1)
- exponential service times (1)
- finite buffer (1)
- first come first served (1)
- general input (1)
- generalized processor sharing (1)
- head of the line processor sharing (1)
- impatience (1)
- impatience rates (1)
- infinite-server (1)
- limited waiting times (1)
- locally exponential service time (1)
- many queues (1)
- many server (1)
- many servers (1)
- many-server (1)
- marked point p (1)
- preemptive resume (1)
- processor sharing (1)
- random environment (1)
- sample path (1)
- server reservation (1)
- sojourn t (1)
- sojourn times (1)
- thread pools (1)
- time transformation (1)
- trunk reservation (1)
- two queues (1)
- two-class priority M/M/1 system (1)
- two-moment ap (1)
- virtual waiting times (1)
- waiting time dependent service (1)
- waiting time distribution (1)
- workload (1)
Institute
- Mathematical Optimization (26)
- ZIB Allgemein (12)
In this paper a unified approach to central and decentral approximations of the distribution function $F(x,n)$ of the sum of $n$ iid random variables with compact support in $I\!\!R_+$ is given. This approach yields direct Edgeworth expansion (especially the Central limit theorem) and indirect Edgeworth expansion (Theorem of Bahadur-Rao, large deviation results) within a unified framework. An approximative inversion of the LST of $F(x,n)$ (approximation of the complex inversion integral over a line by an integral over a proper bounded arc with a proper integrand) allows to get these approximations and moreover explicit error bounds.
We consider a system with Poisson arrivals and i.i.d. service times. The requests are served according to the state-dependent processor sharing discipline, where each request receives a service capacity which depends on the actual number of requests in the system. The linear systems of PDEs describing the residual and attained sojourn times coincide for this system, which provides time reversibility including sojourn times for this system, and their minimal non negative solution gives the LST of the sojourn time $V(\tau)$ of a request with required service time $\tau$. For the case that the service time distribution is exponential in a neighborhood of zero, we derive a linear system of ODEs, whose minimal non negative solution gives the LST of $V(\tau)$, and which yields linear systems of ODEs for the moments of $V(\tau)$ in the considered neighborhood of zero. Numerical results are presented for the variance of $V(\tau)$. In case of an M/GI/2-PS system, the LST of $V(\tau)$ is given in terms of the solution of a convolution equation in the considered neighborhood of zero. For bounded from below service times, surprisingly simple expressions for the LST and variance of $V(\tau)$ in this neighborhood of zero are derived, which yield in particular the LST and variance of $V(\tau)$ in M/D/2-PS.
We deal with an infinite-server system where the service speed is governed by a stationary and ergodic process with countably many states. Applying a random time transformation such that the service speed becomes one, the sojourn time of a class of virtual requests with given required service time is equal in distribution to an additive functional defined via a stationary version of the time-changed process. Thus bounds for the expectation of functions of additive functionals yield bounds for the expectation of functions of virtual sojourn times, in particular bounds for fractional moments and the distribution function. Interpreting the $GI(n)/GI(n)/\infty$ system or equivalently the $GI(n)/GI$ system under state-dependent processor sharing as an infinite-server system with random states given by the number $n$ of requests in the system provides results for sojourn times of virtual requests. In case of $M(n)/GI(n)/\infty$, the sojourn times of arriving and added requests are equal in distribution to sojourn times of virtual requests in modified systems, which yields many results for the sojourn times of arriving and added requests. In case of integer moments, the bounds generalize earlier results for $M/GI(n)/\infty$. In particular, the mean sojourn times of arriving and added requests in $M(n)/GI(n)/\infty$ are proportional to the required service time, generalizing Cohen's famous result for $M/GI(n)/\infty$.
We deal with an infinite-server system where the
service speed is governed by a stationary and ergodic
process with countably many states. Applying a random
time transformation such that the service speed
becomes one, the sojourn time of a class of virtual
requests with given required service time is equal
in distribution to an additive functional defined
via a stationary version of the time-changed process.
Thus bounds for the expectation of functions of additive
functionals yield bounds for the expectation
of functions of virtual sojourn times, in particular
bounds for fractional moments and the distribution
function. Interpreting the $GI(n)/GI(n)/\infty$ system or
equivalently the $GI(n)/GI$ system under state-dependent
processor sharing as an infinite-server system with
random states given by the number $n$ of requests
in the system provides results for sojourn times
of virtual requests. In case of $M(n)/GI(n)/\infty$,
the sojourn times of arriving and added requests are
equal in distribution to sojourn times of virtual
requests in modified systems, which yields many results
for the sojourn times of arriving and added requests.
In case of integer moments, the bounds generalize
earlier results for $M/GI(n)/\infty$. In particular,
the mean sojourn times of arriving and added requests
in $M(n)/GI(n)/\infty$ are proportional to the required
service time, generalizing Cohen's famous result
for $M/GI(n)/\infty$.