Lower Bound of Network Throughput and Validity of HW Conjectures for Irreducible Closed Markovian Queueing Network
碩士 === 東海大學 === 數學系 === 87 === For an irreducible closed Markovian network with N customers, Jin, Ou, and Kumar (1997) obtained pointwise bounds of the network throughput for any fixed integer N by solving linear programs ■ and ■. They also obtained other two linear programs ■ and ■ that...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/16951459551419532664 |