Stochastic networks:
Communication networks underpin our modern world, and provide fascinating and challenging examples of large-scale stochastic systems. Randomness arises in communication systems at many levels: for example, the initiation and termination times of calls in a telephone network, or the statistical struc...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
2014
|
| Series: | Institute of Mathematical Statistics textbooks
2 |
| Subjects: | |
| Online Access: | BSB01 FHN01 Volltext |
| Summary: | Communication networks underpin our modern world, and provide fascinating and challenging examples of large-scale stochastic systems. Randomness arises in communication systems at many levels: for example, the initiation and termination times of calls in a telephone network, or the statistical structure of the arrival streams of packets at routers in the Internet. How can routing, flow control and connection acceptance algorithms be designed to work well in uncertain and random environments? This compact introduction illustrates how stochastic models can be used to shed light on important issues in the design and control of communication networks. It will appeal to readers with a mathematical background wishing to understand this important area of application, and to those with an engineering background who want to grasp the underlying mathematical theory. Each chapter ends with exercises and suggestions for further reading |
| Item Description: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Physical Description: | 1 online resource (x, 222 pages) |
| ISBN: | 9781139565363 |
| DOI: | 10.1017/CBO9781139565363 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043940746 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2014 |||| o||u| ||||||eng d | ||
| 020 | |a 9781139565363 |c Online |9 978-1-139-56536-3 | ||
| 024 | 7 | |a 10.1017/CBO9781139565363 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781139565363 | ||
| 035 | |a (OCoLC)992827298 | ||
| 035 | |a (DE-599)BVBBV043940746 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 384.0151922 |2 23 | |
| 084 | |a QH 237 |0 (DE-625)141552: |2 rvk | ||
| 084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
| 100 | 1 | |a Kelly, Frank |d 1950- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Stochastic networks |c Frank Kelly, University of Cambridge, Elena Yudovina, University of Michigan, Ann Arbor |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2014 | |
| 300 | |a 1 online resource (x, 222 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Institute of Mathematical Statistics textbooks |v 2 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a Machine generated contents note: Queueing and loss networks -- Decentralized optimization -- Random access networks -- Broadband networks -- Internet modelling -- Part I -- 1.Markov chains -- 1.1.Definitions and notation -- 1.2.Time reversal -- 1.3.Erlang's formula -- 1.4.Further reading -- 2.Queueing networks -- 2.1.An M/M/1 queue -- 2.2.A series of M/M//1 queues -- 2.3.Closed migration processes -- 2.4.Open migration processes -- 2.5.Little's law -- 2.6.Linear migration processes -- 2.7.Generalizations -- 2.8.Further reading -- 3.Loss networks -- 3.1.Network model -- 3.2.Approximation procedure -- 3.3.Truncating reversible processes -- 3.4.Maximum probability -- 3.5.A central limit theorem -- 3.6.Erlang fixed point -- 3.7.Diverse routing -- 3.8.Further reading -- Part II -- 4.Decentralized optimization -- 4.1.An electrical network -- 4.2.Road traffic models -- 4.3.Optimization of queueing and loss networks -- 4.4.Further reading -- 5.Random access networks -- | |
| 505 | 8 | |a Contents note continued: 5.1.The ALOHA protocol -- 5.2.Estimating backlog -- 5.3.Acknowledgement-based schemes -- 5.4.Distributed random access -- 5.5.Further reading -- 6.Effective bandwidth -- 6.1.Chernoff bound and Cramer's theorem -- 6.2.Effective bandwidth -- 6.3.Large deviations for a queue with many sources -- 6.4.Further reading -- Part III -- 7.Internet congestion control -- 7.1.Control of elastic network flows -- 7.2.Notions of fairness -- 7.3.A primal algorithm -- 7.4.Modelling TCP -- 7.5.What is being optimized? -- 7.6.A dual algorithm -- 7.7.Time delays -- 7.8.Modelling a switch -- 7.9.Further reading -- 8.Flow level Internet models -- 8.1.Evolution of flows -- 8.2.[alpha]-fair rate allocations -- 8.3.Stability of [alpha]-fair rate allocations -- 8.4.What can go wrong? -- 8.5.Linear network with proportional fairness -- 8.6.Further reading | |
| 520 | |a Communication networks underpin our modern world, and provide fascinating and challenging examples of large-scale stochastic systems. Randomness arises in communication systems at many levels: for example, the initiation and termination times of calls in a telephone network, or the statistical structure of the arrival streams of packets at routers in the Internet. How can routing, flow control and connection acceptance algorithms be designed to work well in uncertain and random environments? This compact introduction illustrates how stochastic models can be used to shed light on important issues in the design and control of communication networks. It will appeal to readers with a mathematical background wishing to understand this important area of application, and to those with an engineering background who want to grasp the underlying mathematical theory. Each chapter ends with exercises and suggestions for further reading | ||
| 650 | 4 | |a Telecommunication systems / Statistical methods | |
| 650 | 4 | |a Stochastic models | |
| 650 | 0 | 7 | |a Stochastisches Modell |0 (DE-588)4057633-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangennetz |0 (DE-588)4225823-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Stochastischer Prozess |0 (DE-588)4057630-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |y 1993 |z Minneapolis Minn. |2 gnd-content | |
| 655 | 7 | |8 2\p |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Warteschlangennetz |0 (DE-588)4225823-6 |D s |
| 689 | 0 | 1 | |a Stochastischer Prozess |0 (DE-588)4057630-9 |D s |
| 689 | 0 | |8 3\p |5 DE-604 | |
| 689 | 1 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 1 | 1 | |a Stochastisches Modell |0 (DE-588)4057633-4 |D s |
| 689 | 1 | |8 4\p |5 DE-604 | |
| 700 | 1 | |a Yudovina, Elena |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-03577-5 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-69170-4 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781139565363 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029349716 | ||
| 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 | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139565363 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139565363 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804176881650499584 |
|---|---|
| any_adam_object | |
| author | Kelly, Frank 1950- |
| author_facet | Kelly, Frank 1950- |
| author_role | aut |
| author_sort | Kelly, Frank 1950- |
| author_variant | f k fk |
| building | Verbundindex |
| bvnumber | BV043940746 |
| classification_rvk | QH 237 SK 820 |
| collection | ZDB-20-CBO |
| contents | Machine generated contents note: Queueing and loss networks -- Decentralized optimization -- Random access networks -- Broadband networks -- Internet modelling -- Part I -- 1.Markov chains -- 1.1.Definitions and notation -- 1.2.Time reversal -- 1.3.Erlang's formula -- 1.4.Further reading -- 2.Queueing networks -- 2.1.An M/M/1 queue -- 2.2.A series of M/M//1 queues -- 2.3.Closed migration processes -- 2.4.Open migration processes -- 2.5.Little's law -- 2.6.Linear migration processes -- 2.7.Generalizations -- 2.8.Further reading -- 3.Loss networks -- 3.1.Network model -- 3.2.Approximation procedure -- 3.3.Truncating reversible processes -- 3.4.Maximum probability -- 3.5.A central limit theorem -- 3.6.Erlang fixed point -- 3.7.Diverse routing -- 3.8.Further reading -- Part II -- 4.Decentralized optimization -- 4.1.An electrical network -- 4.2.Road traffic models -- 4.3.Optimization of queueing and loss networks -- 4.4.Further reading -- 5.Random access networks -- Contents note continued: 5.1.The ALOHA protocol -- 5.2.Estimating backlog -- 5.3.Acknowledgement-based schemes -- 5.4.Distributed random access -- 5.5.Further reading -- 6.Effective bandwidth -- 6.1.Chernoff bound and Cramer's theorem -- 6.2.Effective bandwidth -- 6.3.Large deviations for a queue with many sources -- 6.4.Further reading -- Part III -- 7.Internet congestion control -- 7.1.Control of elastic network flows -- 7.2.Notions of fairness -- 7.3.A primal algorithm -- 7.4.Modelling TCP -- 7.5.What is being optimized? -- 7.6.A dual algorithm -- 7.7.Time delays -- 7.8.Modelling a switch -- 7.9.Further reading -- 8.Flow level Internet models -- 8.1.Evolution of flows -- 8.2.[alpha]-fair rate allocations -- 8.3.Stability of [alpha]-fair rate allocations -- 8.4.What can go wrong? -- 8.5.Linear network with proportional fairness -- 8.6.Further reading |
| ctrlnum | (ZDB-20-CBO)CR9781139565363 (OCoLC)992827298 (DE-599)BVBBV043940746 |
| dewey-full | 384.0151922 |
| dewey-hundreds | 300 - Social sciences |
| dewey-ones | 384 - Communications |
| dewey-raw | 384.0151922 |
| dewey-search | 384.0151922 |
| dewey-sort | 3384.0151922 |
| dewey-tens | 380 - Commerce, communications, transportation |
| discipline | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1017/CBO9781139565363 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05698nmm a2200673zcb4500</leader><controlfield tag="001">BV043940746</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2014 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139565363</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-139-56536-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781139565363</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781139565363</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)992827298</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043940746</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">384.0151922</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 237</subfield><subfield code="0">(DE-625)141552:</subfield><subfield code="2">rvk</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">Kelly, Frank</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stochastic networks</subfield><subfield code="c">Frank Kelly, University of Cambridge, Elena Yudovina, University of Michigan, Ann Arbor</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 222 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Institute of Mathematical Statistics textbooks</subfield><subfield code="v">2</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Machine generated contents note: Queueing and loss networks -- Decentralized optimization -- Random access networks -- Broadband networks -- Internet modelling -- Part I -- 1.Markov chains -- 1.1.Definitions and notation -- 1.2.Time reversal -- 1.3.Erlang's formula -- 1.4.Further reading -- 2.Queueing networks -- 2.1.An M/M/1 queue -- 2.2.A series of M/M//1 queues -- 2.3.Closed migration processes -- 2.4.Open migration processes -- 2.5.Little's law -- 2.6.Linear migration processes -- 2.7.Generalizations -- 2.8.Further reading -- 3.Loss networks -- 3.1.Network model -- 3.2.Approximation procedure -- 3.3.Truncating reversible processes -- 3.4.Maximum probability -- 3.5.A central limit theorem -- 3.6.Erlang fixed point -- 3.7.Diverse routing -- 3.8.Further reading -- Part II -- 4.Decentralized optimization -- 4.1.An electrical network -- 4.2.Road traffic models -- 4.3.Optimization of queueing and loss networks -- 4.4.Further reading -- 5.Random access networks --</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Contents note continued: 5.1.The ALOHA protocol -- 5.2.Estimating backlog -- 5.3.Acknowledgement-based schemes -- 5.4.Distributed random access -- 5.5.Further reading -- 6.Effective bandwidth -- 6.1.Chernoff bound and Cramer's theorem -- 6.2.Effective bandwidth -- 6.3.Large deviations for a queue with many sources -- 6.4.Further reading -- Part III -- 7.Internet congestion control -- 7.1.Control of elastic network flows -- 7.2.Notions of fairness -- 7.3.A primal algorithm -- 7.4.Modelling TCP -- 7.5.What is being optimized? -- 7.6.A dual algorithm -- 7.7.Time delays -- 7.8.Modelling a switch -- 7.9.Further reading -- 8.Flow level Internet models -- 8.1.Evolution of flows -- 8.2.[alpha]-fair rate allocations -- 8.3.Stability of [alpha]-fair rate allocations -- 8.4.What can go wrong? -- 8.5.Linear network with proportional fairness -- 8.6.Further reading</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Communication networks underpin our modern world, and provide fascinating and challenging examples of large-scale stochastic systems. Randomness arises in communication systems at many levels: for example, the initiation and termination times of calls in a telephone network, or the statistical structure of the arrival streams of packets at routers in the Internet. How can routing, flow control and connection acceptance algorithms be designed to work well in uncertain and random environments? This compact introduction illustrates how stochastic models can be used to shed light on important issues in the design and control of communication networks. It will appeal to readers with a mathematical background wishing to understand this important area of application, and to those with an engineering background who want to grasp the underlying mathematical theory. Each chapter ends with exercises and suggestions for further reading</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Telecommunication systems / Statistical methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic models</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Stochastisches Modell</subfield><subfield code="0">(DE-588)4057633-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Stochastischer Prozess</subfield><subfield code="0">(DE-588)4057630-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1993</subfield><subfield code="z">Minneapolis Minn.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">2\p</subfield><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Stochastischer Prozess</subfield><subfield code="0">(DE-588)4057630-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Stochastisches Modell</subfield><subfield code="0">(DE-588)4057633-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yudovina, Elena</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-03577-5</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-69170-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781139565363</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029349716</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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">4\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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139565363</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139565363</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)1071861417 Konferenzschrift 1993 Minneapolis Minn. gnd-content 2\p (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Konferenzschrift 1993 Minneapolis Minn. Lehrbuch |
| id | DE-604.BV043940746 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:14Z |
| institution | BVB |
| isbn | 9781139565363 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029349716 |
| oclc_num | 992827298 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (x, 222 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Institute of Mathematical Statistics textbooks |
| spelling | Kelly, Frank 1950- Verfasser aut Stochastic networks Frank Kelly, University of Cambridge, Elena Yudovina, University of Michigan, Ann Arbor Cambridge Cambridge University Press 2014 1 online resource (x, 222 pages) txt rdacontent c rdamedia cr rdacarrier Institute of Mathematical Statistics textbooks 2 Title from publisher's bibliographic system (viewed on 05 Oct 2015) Machine generated contents note: Queueing and loss networks -- Decentralized optimization -- Random access networks -- Broadband networks -- Internet modelling -- Part I -- 1.Markov chains -- 1.1.Definitions and notation -- 1.2.Time reversal -- 1.3.Erlang's formula -- 1.4.Further reading -- 2.Queueing networks -- 2.1.An M/M/1 queue -- 2.2.A series of M/M//1 queues -- 2.3.Closed migration processes -- 2.4.Open migration processes -- 2.5.Little's law -- 2.6.Linear migration processes -- 2.7.Generalizations -- 2.8.Further reading -- 3.Loss networks -- 3.1.Network model -- 3.2.Approximation procedure -- 3.3.Truncating reversible processes -- 3.4.Maximum probability -- 3.5.A central limit theorem -- 3.6.Erlang fixed point -- 3.7.Diverse routing -- 3.8.Further reading -- Part II -- 4.Decentralized optimization -- 4.1.An electrical network -- 4.2.Road traffic models -- 4.3.Optimization of queueing and loss networks -- 4.4.Further reading -- 5.Random access networks -- Contents note continued: 5.1.The ALOHA protocol -- 5.2.Estimating backlog -- 5.3.Acknowledgement-based schemes -- 5.4.Distributed random access -- 5.5.Further reading -- 6.Effective bandwidth -- 6.1.Chernoff bound and Cramer's theorem -- 6.2.Effective bandwidth -- 6.3.Large deviations for a queue with many sources -- 6.4.Further reading -- Part III -- 7.Internet congestion control -- 7.1.Control of elastic network flows -- 7.2.Notions of fairness -- 7.3.A primal algorithm -- 7.4.Modelling TCP -- 7.5.What is being optimized? -- 7.6.A dual algorithm -- 7.7.Time delays -- 7.8.Modelling a switch -- 7.9.Further reading -- 8.Flow level Internet models -- 8.1.Evolution of flows -- 8.2.[alpha]-fair rate allocations -- 8.3.Stability of [alpha]-fair rate allocations -- 8.4.What can go wrong? -- 8.5.Linear network with proportional fairness -- 8.6.Further reading Communication networks underpin our modern world, and provide fascinating and challenging examples of large-scale stochastic systems. Randomness arises in communication systems at many levels: for example, the initiation and termination times of calls in a telephone network, or the statistical structure of the arrival streams of packets at routers in the Internet. How can routing, flow control and connection acceptance algorithms be designed to work well in uncertain and random environments? This compact introduction illustrates how stochastic models can be used to shed light on important issues in the design and control of communication networks. It will appeal to readers with a mathematical background wishing to understand this important area of application, and to those with an engineering background who want to grasp the underlying mathematical theory. Each chapter ends with exercises and suggestions for further reading Telecommunication systems / Statistical methods Stochastic models Stochastisches Modell (DE-588)4057633-4 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Warteschlangennetz (DE-588)4225823-6 gnd rswk-swf Stochastischer Prozess (DE-588)4057630-9 gnd rswk-swf 1\p (DE-588)1071861417 Konferenzschrift 1993 Minneapolis Minn. gnd-content 2\p (DE-588)4123623-3 Lehrbuch gnd-content Warteschlangennetz (DE-588)4225823-6 s Stochastischer Prozess (DE-588)4057630-9 s 3\p DE-604 Rechnernetz (DE-588)4070085-9 s Stochastisches Modell (DE-588)4057633-4 s 4\p DE-604 Yudovina, Elena Sonstige oth Erscheint auch als Druckausgabe 978-1-107-03577-5 Erscheint auch als Druckausgabe 978-1-107-69170-4 https://doi.org/10.1017/CBO9781139565363 Verlag URL des Erstveröffentlichers Volltext 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 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Kelly, Frank 1950- Stochastic networks Machine generated contents note: Queueing and loss networks -- Decentralized optimization -- Random access networks -- Broadband networks -- Internet modelling -- Part I -- 1.Markov chains -- 1.1.Definitions and notation -- 1.2.Time reversal -- 1.3.Erlang's formula -- 1.4.Further reading -- 2.Queueing networks -- 2.1.An M/M/1 queue -- 2.2.A series of M/M//1 queues -- 2.3.Closed migration processes -- 2.4.Open migration processes -- 2.5.Little's law -- 2.6.Linear migration processes -- 2.7.Generalizations -- 2.8.Further reading -- 3.Loss networks -- 3.1.Network model -- 3.2.Approximation procedure -- 3.3.Truncating reversible processes -- 3.4.Maximum probability -- 3.5.A central limit theorem -- 3.6.Erlang fixed point -- 3.7.Diverse routing -- 3.8.Further reading -- Part II -- 4.Decentralized optimization -- 4.1.An electrical network -- 4.2.Road traffic models -- 4.3.Optimization of queueing and loss networks -- 4.4.Further reading -- 5.Random access networks -- Contents note continued: 5.1.The ALOHA protocol -- 5.2.Estimating backlog -- 5.3.Acknowledgement-based schemes -- 5.4.Distributed random access -- 5.5.Further reading -- 6.Effective bandwidth -- 6.1.Chernoff bound and Cramer's theorem -- 6.2.Effective bandwidth -- 6.3.Large deviations for a queue with many sources -- 6.4.Further reading -- Part III -- 7.Internet congestion control -- 7.1.Control of elastic network flows -- 7.2.Notions of fairness -- 7.3.A primal algorithm -- 7.4.Modelling TCP -- 7.5.What is being optimized? -- 7.6.A dual algorithm -- 7.7.Time delays -- 7.8.Modelling a switch -- 7.9.Further reading -- 8.Flow level Internet models -- 8.1.Evolution of flows -- 8.2.[alpha]-fair rate allocations -- 8.3.Stability of [alpha]-fair rate allocations -- 8.4.What can go wrong? -- 8.5.Linear network with proportional fairness -- 8.6.Further reading Telecommunication systems / Statistical methods Stochastic models Stochastisches Modell (DE-588)4057633-4 gnd Rechnernetz (DE-588)4070085-9 gnd Warteschlangennetz (DE-588)4225823-6 gnd Stochastischer Prozess (DE-588)4057630-9 gnd |
| subject_GND | (DE-588)4057633-4 (DE-588)4070085-9 (DE-588)4225823-6 (DE-588)4057630-9 (DE-588)1071861417 (DE-588)4123623-3 |
| title | Stochastic networks |
| title_auth | Stochastic networks |
| title_exact_search | Stochastic networks |
| title_full | Stochastic networks Frank Kelly, University of Cambridge, Elena Yudovina, University of Michigan, Ann Arbor |
| title_fullStr | Stochastic networks Frank Kelly, University of Cambridge, Elena Yudovina, University of Michigan, Ann Arbor |
| title_full_unstemmed | Stochastic networks Frank Kelly, University of Cambridge, Elena Yudovina, University of Michigan, Ann Arbor |
| title_short | Stochastic networks |
| title_sort | stochastic networks |
| topic | Telecommunication systems / Statistical methods Stochastic models Stochastisches Modell (DE-588)4057633-4 gnd Rechnernetz (DE-588)4070085-9 gnd Warteschlangennetz (DE-588)4225823-6 gnd Stochastischer Prozess (DE-588)4057630-9 gnd |
| topic_facet | Telecommunication systems / Statistical methods Stochastic models Stochastisches Modell Rechnernetz Warteschlangennetz Stochastischer Prozess Konferenzschrift 1993 Minneapolis Minn. Lehrbuch |
| url | https://doi.org/10.1017/CBO9781139565363 |
| work_keys_str_mv | AT kellyfrank stochasticnetworks AT yudovinaelena stochasticnetworks |