| Record ID | ia:trafficprocesses0000disn |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/trafficprocesses0000disn/trafficprocesses0000disn_marc.xml |
| Download MARC binary | https://www.archive.org/download/trafficprocesses0000disn/trafficprocesses0000disn_meta.mrc |
LEADER: 00815pam a2200241 a 4500
001 86046275
003 DLC
005 19870731000000.0
008 861211s1987 mdua b 00110 eng
010 $a 86046275
020 $a0801834546 (alk. paper)
050 0 $aT57.9$b.D57 1987
082 0 $a519.8/2$219
100 10 $aDisney, Ralph L.,$d1928-
245 10 $aTraffic processes in queueing networks :$ba Markov renewal approach /$cRalph L. Disney and Peter C. Kiessler.
260 0 $aBaltimore :$bJohns Hopkins University Press,$cc1987.
300 $axix, 251 p. :$bill. ;$c24 cm.
440 0 $aJohns Hopkins series in the mathematical sciences ;$v4
504 $aBibliography: p. 241-243.
500 $aIncludes index.
650 0 $aQueuing theory.
650 0 $aMarkov processes.
700 10 $aKiessler, Peter C.,$d1955-