ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hits 1 - 4 | 4 hits

Sorting

Electronic Resource

Editorial introduction (1998)

Dai, J.G. “Jim”

Springer

Queueing systems 30 (1998), S. 1-3

add to mindlist on the mindlist

Details

ISSN: 1572-9443

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1023/A:1019104718804

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

Electronic Resource

A heavy traffic limit theorem for a class of open queueing networks with finite buffers (1999)

Dai, J.G. ; Dai, W.

Springer

Queueing systems 32 (1999), S. 5-40

add to mindlist on the mindlist

Details

ISSN: 1572-9443

Keywords: finite capacity network ; blocking probabilities ; loss network ; semimartingale reflecting Brownian motion ; RBM ; heavy traffic ; limit theorems ; oscillation estimates

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science

Notes: Abstract We consider a queueing network of d single server stations. Each station has a finite capacity waiting buffer, and all customers served at a station are homogeneous in terms of service requirements and routing. The routing is assumed to be deterministic and hence feedforward. A server stops working when the downstream buffer is full. We show that a properly normalized d-dimensional queue length process converges in distribution to a fd-dimensional semimartingale reflecting Brownian motion (RBM) in a d-dimensional box under a heavy traffic condition. The conventional continuous mapping approach does not apply here because the solution to our Skorohod problem may not be unique. Our proof relies heavily on a uniform oscillation result for solutions to a family of Skorohod problems. The oscillation result is proved in a general form that may be of independent interest. It has the potential to be used as an important ingredient in establishing heavy traffic limit theorems for general finite buffer networks.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1023/A:1019178802391

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

Electronic Resource

Stability of a three‐station fluid network (1999)

Dai, J.G. ; Hasenbein, J.J. ; Vande Vate, J.H.

Springer

Queueing systems 33 (1999), S. 293-325

add to mindlist on the mindlist

Details

ISSN: 1572-9443

Keywords: stability ; fluid models ; multiclass queueing networks ; piecewise linear Lyapunov functions ; linear Lyapunov functions ; monotone global stability ; static buffer priority disciplines

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science

Notes: Abstract This paper studies the stability of a three‐station fluid network. We show that, unlike the two‐station networks in Dai and Vande Vate [18], the global stability region of our three‐station network is not the intersection of its stability regions under static buffer priority disciplines. Thus, the “worst” or extremal disciplines are not static buffer priority disciplines. We also prove that the global stability region of our three‐station network is not monotone in the service times and so, we may move a service time vector out of the global stability region by reducing the service time for a class. We introduce the monotone global stability region and show that a linear program (LP) related to a piecewise linear Lyapunov function characterizes this largest monotone subset of the global stability region for our three‐station network. We also show that the LP proposed by Bertsimas et al. [1] does not characterize either the global stability region or even the monotone global stability region of our three‐station network. Further, we demonstrate that the LP related to the linear Lyapunov function proposed by Chen and Zhang [11] does not characterize the stability region of our three‐station network under a static buffer priority discipline.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1023/A:1019184331042

Permalink