| Record ID | marc_columbia/Columbia-extract-20221130-002.mrc:110113715:1492 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-002.mrc:110113715:1492?format=raw |
LEADER: 01492cam a2200373 a 4500
001 589472
005 20220525203836.0
008 870820t19871987mdua b 001 0 eng
010 $a 86046275
020 $a0801834546 (alk. paper)
035 $a(OCoLC)15018421
035 $a(OCoLC)ocm15018421
035 $a(CStRLIN)NYCG87-B69131
035 $9ACP3659CU
035 $a(NNC)589472
035 $a589472
050 00 $aT57.9$b.D57 1987
082 0 $a519.8/2$219
090 $aT57.9$b.D57 1987
100 1 $aDisney, Ralph L.,$d1928-$0http://id.loc.gov/authorities/names/n84074039
245 10 $aTraffic processes in queueing networks :$ba Markov renewal approach /$cRalph L. Disney and Peter C. Kiessler.
260 $aBaltimore :$bJohns Hopkins University Press,$c[1987], ©1987.
300 $axix, 251 pages :$billustrations ;$c24 cm.
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$2rdacarrier
490 1 $aJohns Hopkins series in the mathematical sciences ;$v4
504 $aBibliography: p. 241-243.
500 $aIncludes index.
650 0 $aQueuing theory.$0http://id.loc.gov/authorities/subjects/sh85109832
650 0 $aMarkov processes.$0http://id.loc.gov/authorities/subjects/sh85081369
700 1 $aKiessler, Peter C.,$d1955-$0http://id.loc.gov/authorities/names/n85274967
830 0 $aJohns Hopkins series in the mathematical sciences ;$v4.$0http://id.loc.gov/authorities/names/n83708258
852 00 $boff,eng$hT57.9$i.D57 1987