Penyelesaian masalah jaringan antrian dengan jaringan jackson

Abstract

Jackson Queueing Network is the answer for problem of queueing network to count arrival rate in each service facility before. Jackson Queueing Network is used to derive steady — state probability of queueing network in state n. Jackson's Theorem can applicated in LAN technology with establish computer as node and packet as customer. To count steady — state probability used programming language to guarantee product with exactly. Implementation of the answer Jackson Queueing Network to do with giving procedures in a program. 1Ir _ This document is Undip Institutior711r—Dository Collection. The autiXor(s) or copyright owner(s) agree that UNDIP-IR may, withoLit chenging the content, translate the submission to any medium or format for the purpose of preservation. The author(s) or copyright over(s) also agree that UNDIP-IR may keep more than one copy of this submission for purpose of security, back-u and reservation: