Traffic processes in queueing networks a Markov renewal approach

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Disney, Ralph L. (VerfasserIn)
Format: Buch
Sprache:Undetermined
Veröffentlicht: Baltimore, Md. <<[u.a.]>> Johns Hopkins Univ. Pr. 1987
Schriftenreihe:Johns Hopkins series in the mathematical sciences 4
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 cb4500
001 BV024631473
003 DE-604
005 20090910
007 t
008 090924s1987 d||| |||| 00||| und d
020 |a 0801834546  |9 0-8018-3454-6 
035 |a (OCoLC)246506998 
035 |a (DE-599)BVBBV024631473 
040 |a DE-604  |b ger  |e rakwb 
041 |a und 
049 |a DE-83 
084 |a SK 820  |0 (DE-625)143258:  |2 rvk 
100 1 |a Disney, Ralph L.  |e Verfasser  |4 aut 
245 1 0 |a Traffic processes in queueing networks  |b a Markov renewal approach  |c Ralph L. Disney and Peter C. Kiessler 
264 1 |a Baltimore, Md. <<[u.a.]>>  |b Johns Hopkins Univ. Pr.  |c 1987 
300 |a XIX, 251 S.  |b graph. Darst. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
490 1 |a Johns Hopkins series in the mathematical sciences  |v 4 
650 0 7 |a Warteschlangennetz  |0 (DE-588)4225823-6  |2 gnd  |9 rswk-swf 
650 0 7 |a Erneuerungsprozess  |0 (DE-588)4152833-5  |2 gnd  |9 rswk-swf 
650 0 7 |a Wartesystem  |0 (DE-588)4251734-5  |2 gnd  |9 rswk-swf 
650 0 7 |a Markov-Prozess  |0 (DE-588)4134948-9  |2 gnd  |9 rswk-swf 
689 0 0 |a Wartesystem  |0 (DE-588)4251734-5  |D s 
689 0 1 |a Erneuerungsprozess  |0 (DE-588)4152833-5  |D s 
689 0 |8 1\p  |5 DE-604 
689 1 0 |a Markov-Prozess  |0 (DE-588)4134948-9  |D s 
689 1 1 |a Warteschlangennetz  |0 (DE-588)4225823-6  |D s 
689 1 |8 2\p  |5 DE-604 
700 1 |a Kiessler, Peter C.  |e Sonstige  |4 oth 
830 0 |a Johns Hopkins series in the mathematical sciences  |v 4  |w (DE-604)BV000016231  |9 4 
999 |a oai:aleph.bib-bvb.de:BVB01-018043869 
883 1 |8 1\p  |a cgwrk  |d 20201028  |q DE-101  |u https://d-nb.info/provenance/plan#cgwrk 
883 1 |8 2\p  |a cgwrk  |d 20201028  |q DE-101  |u https://d-nb.info/provenance/plan#cgwrk 

Datensatz im Suchindex

_version_ 1804140046429716480
any_adam_object
author Disney, Ralph L.
author_facet Disney, Ralph L.
author_role aut
author_sort Disney, Ralph L.
author_variant r l d rl rld
building Verbundindex
bvnumber BV024631473
classification_rvk SK 820
ctrlnum (OCoLC)246506998
(DE-599)BVBBV024631473
discipline Mathematik
format Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01753nam a2200445 cb4500</leader><controlfield tag="001">BV024631473</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090910 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090924s1987 d||| |||| 00||| und d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0801834546</subfield><subfield code="9">0-8018-3454-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)246506998</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV024631473</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 820</subfield><subfield code="0">(DE-625)143258:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Disney, Ralph L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Traffic processes in queueing networks</subfield><subfield code="b">a Markov renewal approach</subfield><subfield code="c">Ralph L. Disney and Peter C. Kiessler</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Baltimore, Md. &lt;&lt;[u.a.]&gt;&gt;</subfield><subfield code="b">Johns Hopkins Univ. Pr.</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 251 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Johns Hopkins series in the mathematical sciences</subfield><subfield code="v">4</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erneuerungsprozess</subfield><subfield code="0">(DE-588)4152833-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wartesystem</subfield><subfield code="0">(DE-588)4251734-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Markov-Prozess</subfield><subfield code="0">(DE-588)4134948-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Wartesystem</subfield><subfield code="0">(DE-588)4251734-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Erneuerungsprozess</subfield><subfield code="0">(DE-588)4152833-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Markov-Prozess</subfield><subfield code="0">(DE-588)4134948-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kiessler, Peter C.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Johns Hopkins series in the mathematical sciences</subfield><subfield code="v">4</subfield><subfield code="w">(DE-604)BV000016231</subfield><subfield code="9">4</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018043869</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection>
id DE-604.BV024631473
illustrated Illustrated
indexdate 2024-07-09T21:53:45Z
institution BVB
isbn 0801834546
language Undetermined
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-018043869
oclc_num 246506998
open_access_boolean
owner DE-83
owner_facet DE-83
physical XIX, 251 S. graph. Darst.
publishDate 1987
publishDateSearch 1987
publishDateSort 1987
publisher Johns Hopkins Univ. Pr.
record_format marc
series Johns Hopkins series in the mathematical sciences
series2 Johns Hopkins series in the mathematical sciences
spelling Disney, Ralph L. Verfasser aut
Traffic processes in queueing networks a Markov renewal approach Ralph L. Disney and Peter C. Kiessler
Baltimore, Md. <<[u.a.]>> Johns Hopkins Univ. Pr. 1987
XIX, 251 S. graph. Darst.
txt rdacontent
n rdamedia
nc rdacarrier
Johns Hopkins series in the mathematical sciences 4
Warteschlangennetz (DE-588)4225823-6 gnd rswk-swf
Erneuerungsprozess (DE-588)4152833-5 gnd rswk-swf
Wartesystem (DE-588)4251734-5 gnd rswk-swf
Markov-Prozess (DE-588)4134948-9 gnd rswk-swf
Wartesystem (DE-588)4251734-5 s
Erneuerungsprozess (DE-588)4152833-5 s
1\p DE-604
Markov-Prozess (DE-588)4134948-9 s
Warteschlangennetz (DE-588)4225823-6 s
2\p DE-604
Kiessler, Peter C. Sonstige oth
Johns Hopkins series in the mathematical sciences 4 (DE-604)BV000016231 4
1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle Disney, Ralph L.
Traffic processes in queueing networks a Markov renewal approach
Johns Hopkins series in the mathematical sciences
Warteschlangennetz (DE-588)4225823-6 gnd
Erneuerungsprozess (DE-588)4152833-5 gnd
Wartesystem (DE-588)4251734-5 gnd
Markov-Prozess (DE-588)4134948-9 gnd
subject_GND (DE-588)4225823-6
(DE-588)4152833-5
(DE-588)4251734-5
(DE-588)4134948-9
title Traffic processes in queueing networks a Markov renewal approach
title_auth Traffic processes in queueing networks a Markov renewal approach
title_exact_search Traffic processes in queueing networks a Markov renewal approach
title_full Traffic processes in queueing networks a Markov renewal approach Ralph L. Disney and Peter C. Kiessler
title_fullStr Traffic processes in queueing networks a Markov renewal approach Ralph L. Disney and Peter C. Kiessler
title_full_unstemmed Traffic processes in queueing networks a Markov renewal approach Ralph L. Disney and Peter C. Kiessler
title_short Traffic processes in queueing networks
title_sort traffic processes in queueing networks a markov renewal approach
title_sub a Markov renewal approach
topic Warteschlangennetz (DE-588)4225823-6 gnd
Erneuerungsprozess (DE-588)4152833-5 gnd
Wartesystem (DE-588)4251734-5 gnd
Markov-Prozess (DE-588)4134948-9 gnd
topic_facet Warteschlangennetz
Erneuerungsprozess
Wartesystem
Markov-Prozess
volume_link (DE-604)BV000016231
work_keys_str_mv AT disneyralphl trafficprocessesinqueueingnetworksamarkovrenewalapproach
AT kiesslerpeterc trafficprocessesinqueueingnetworksamarkovrenewalapproach