Text

MEAN VALUE ANALYSIS OF A CLOSED QUEUEING NETWORK MODEL

We consider a closed queueing network with a fixed number of jobs K cycling between two nodes A and B. From A to B, jobs are routed through a fast server with probability p or through a slow server with probability 1-p. From B to A there is a server available for each job. Job processing time at A and B are exponentially distributed. This network is modeled by a closed queueing network model and we will use mean value analysis to determine the network throughput for different value of p, to find the value of p that gives maximum network throughput and to indicate the network bottleneck. For certain chosen values of parameters involved in this model, we found that the maximum network throughput is 288.1 for p =0.67. The network bottleneck is the fast server. For p>0.67 the fast server is also the network bottleneck, but when p < 0.67, the network bottleneck is the slow server.

Ketersediaan

Informasi Detail

Judul Seri

INTEGRAL; Vol.5 No.1 APRIL 2000

No. Panggil

-

Penerbit

: Fakultas Matematika dan Ilmu Pengetahuan Alam - Unpar.,

Deskripsi Fisik

p.1-5

Bahasa

Indonesia

ISBN/ISSN

-

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

-

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Julius Dharma Lesmono

Versi lain/terkait

Lampiran Berkas

Komentar