International Journal in IT & Engineering
  • Year: 2017
  • Volume: 5
  • Issue: 6

Solving closed jackson queueing network problem

  • Author:
  • Aman Kumar Sinha1, S.P. Varma2
  • Total Page Count: 5
  • Page Number: 26 to 30

1Research Scholar in I.T., B. R. A. Bihar University, Muzaffarpur. Email: sinha.aman8624@gmail.com

2Ex-Associate Professor, P.G Department of Mathematics, B. R. A. Bihar University, Muzaffarpur

Online published on 21 March, 2018.

Abstract

In the study of queueing networks, closed queueing networks had a major role in the performance analysis of computer systems, communication networks and other related systems. Computer communications and manufacturing system are major areas where queueing theory plays an important role. In this article, we propose to concentrate on closed Jackson network.

In what follows, we proceed to study closed Jackson network that satisfies normalizing condition. The normalizing condition that the sum of all possible states (k1, k2…………,kn) that satisfy the conditionj-1NK with (0 ≤ kj ≥ K) must be 1.

Keywords

Queueing Networks, closed Jackson network, normalizing condition