The M/M/∞Service System with Ranked Servers in Heavy Traffic:
We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1984
|
| Ausgabe: | 1st ed. 1984 |
| Schriftenreihe: | Lecture Notes in Economics and Mathematical Systems
231 |
| Schlagworte: | |
| Online-Zugang: | BTU01 URL des Erstveröffentlichers |
| Zusammenfassung: | We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant |
| Beschreibung: | 1 Online-Ressource (XII, 129 p) |
| ISBN: | 9783642455766 |
| DOI: | 10.1007/978-3-642-45576-6 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046871377 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s1984 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642455766 |9 978-3-642-45576-6 | ||
| 024 | 7 | |a 10.1007/978-3-642-45576-6 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-3-642-45576-6 | ||
| 035 | |a (OCoLC)863916110 | ||
| 035 | |a (DE-599)BVBBV046871377 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 658.40301 |2 23 | |
| 084 | |a QH 400 |0 (DE-625)141571: |2 rvk | ||
| 084 | |a SI 853 |0 (DE-625)143200: |2 rvk | ||
| 084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
| 100 | 1 | |a Newell, G.F. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The M/M/∞Service System with Ranked Servers in Heavy Traffic |c by G.F. Newell |
| 250 | |a 1st ed. 1984 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1984 | |
| 300 | |a 1 Online-Ressource (XII, 129 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Lecture Notes in Economics and Mathematical Systems |v 231 | |
| 520 | |a We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant | ||
| 650 | 4 | |a Operations Research/Decision Theory | |
| 650 | 4 | |a R & D/Technology Policy | |
| 650 | 4 | |a Economic Theory/Quantitative Economics/Mathematical Methods | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Decision making | |
| 650 | 4 | |a Economic policy | |
| 650 | 4 | |a Economic theory | |
| 650 | 0 | 7 | |a Fernsprechverkehr |0 (DE-588)4154088-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Gleichgewichtstheorie |0 (DE-588)4071876-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematisches Modell |0 (DE-588)4114528-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Fernsprechverkehr |0 (DE-588)4154088-8 |D s |
| 689 | 0 | 1 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Gleichgewichtstheorie |0 (DE-588)4071876-1 |D s |
| 689 | 1 | 1 | |a Mathematisches Modell |0 (DE-588)4114528-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540133773 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642455773 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-45576-6 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SBE |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SBE_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032281508 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-45576-6 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181719096492032 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Newell, G.F |
| author_facet | Newell, G.F |
| author_role | aut |
| author_sort | Newell, G.F |
| author_variant | g n gn |
| building | Verbundindex |
| bvnumber | BV046871377 |
| classification_rvk | QH 400 SI 853 SK 820 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-3-642-45576-6 (OCoLC)863916110 (DE-599)BVBBV046871377 |
| dewey-full | 658.40301 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.40301 |
| dewey-search | 658.40301 |
| dewey-sort | 3658.40301 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-3-642-45576-6 |
| edition | 1st ed. 1984 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03660nmm a2200637zcb4500</leader><controlfield tag="001">BV046871377</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s1984 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642455766</subfield><subfield code="9">978-3-642-45576-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-45576-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-3-642-45576-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863916110</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046871377</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.40301</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 853</subfield><subfield code="0">(DE-625)143200:</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">Newell, G.F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The M/M/∞Service System with Ranked Servers in Heavy Traffic</subfield><subfield code="c">by G.F. Newell</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 1984</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1984</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 129 p)</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">Lecture Notes in Economics and Mathematical Systems</subfield><subfield code="v">231</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">R & D/Technology Policy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economic Theory/Quantitative Economics/Mathematical Methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economic policy</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economic theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fernsprechverkehr</subfield><subfield code="0">(DE-588)4154088-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gleichgewichtstheorie</subfield><subfield code="0">(DE-588)4071876-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Fernsprechverkehr</subfield><subfield code="0">(DE-588)4154088-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Gleichgewichtstheorie</subfield><subfield code="0">(DE-588)4071876-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540133773</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642455773</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-45576-6</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-2-SBE</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SBE_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032281508</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-45576-6</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SBE</subfield><subfield code="q">ZDB-2-SBE_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046871377 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:35Z |
| indexdate | 2024-07-10T08:56:07Z |
| institution | BVB |
| isbn | 9783642455766 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032281508 |
| oclc_num | 863916110 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (XII, 129 p) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 1984 |
| publishDateSearch | 1984 |
| publishDateSort | 1984 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Lecture Notes in Economics and Mathematical Systems |
| spelling | Newell, G.F. Verfasser aut The M/M/∞Service System with Ranked Servers in Heavy Traffic by G.F. Newell 1st ed. 1984 Berlin, Heidelberg Springer Berlin Heidelberg 1984 1 Online-Ressource (XII, 129 p) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Economics and Mathematical Systems 231 We are concerned here with a service facility consisting of a large (- finite) number of servers in parallel. The service times for all servers are identical, but there is a preferential ordering of the servers. Each newly arriving customer enters the lowest ranked available server and remains there until his service is completed. It is assumed that customers arrive according to a Poisson process of rate A , that all servers have exponentially distributed service times with rate ~ and that a = A/~ is large compared with 1. Generally, we are concerned with the stochastic properties of the random function N(s ,t) describing the number of busy servers among the first s ordered servers at time t. Most of the analysis is motivated by special applications of this model to telephone traffic. If one has a brunk line with s primary channels, but a large number (00) of secondary (overflow) channels, each newly arriving customer is assigned to one of the primary channels if any are free; otherwise, he is assigned to a secondary channel. The primary and secondary channels themselves could have a preferential ordering. For some purposes, it is convenient to imagine that they did even if an ordering is irrelevant Operations Research/Decision Theory R & D/Technology Policy Economic Theory/Quantitative Economics/Mathematical Methods Operations research Decision making Economic policy Economic theory Fernsprechverkehr (DE-588)4154088-8 gnd rswk-swf Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Gleichgewichtstheorie (DE-588)4071876-1 gnd rswk-swf Mathematisches Modell (DE-588)4114528-8 gnd rswk-swf Fernsprechverkehr (DE-588)4154088-8 s Warteschlangentheorie (DE-588)4255044-0 s DE-604 Gleichgewichtstheorie (DE-588)4071876-1 s Mathematisches Modell (DE-588)4114528-8 s Erscheint auch als Druck-Ausgabe 9783540133773 Erscheint auch als Druck-Ausgabe 9783642455773 https://doi.org/10.1007/978-3-642-45576-6 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Newell, G.F The M/M/∞Service System with Ranked Servers in Heavy Traffic Operations Research/Decision Theory R & D/Technology Policy Economic Theory/Quantitative Economics/Mathematical Methods Operations research Decision making Economic policy Economic theory Fernsprechverkehr (DE-588)4154088-8 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Gleichgewichtstheorie (DE-588)4071876-1 gnd Mathematisches Modell (DE-588)4114528-8 gnd |
| subject_GND | (DE-588)4154088-8 (DE-588)4255044-0 (DE-588)4071876-1 (DE-588)4114528-8 |
| title | The M/M/∞Service System with Ranked Servers in Heavy Traffic |
| title_auth | The M/M/∞Service System with Ranked Servers in Heavy Traffic |
| title_exact_search | The M/M/∞Service System with Ranked Servers in Heavy Traffic |
| title_exact_search_txtP | The M/M/∞Service System with Ranked Servers in Heavy Traffic |
| title_full | The M/M/∞Service System with Ranked Servers in Heavy Traffic by G.F. Newell |
| title_fullStr | The M/M/∞Service System with Ranked Servers in Heavy Traffic by G.F. Newell |
| title_full_unstemmed | The M/M/∞Service System with Ranked Servers in Heavy Traffic by G.F. Newell |
| title_short | The M/M/∞Service System with Ranked Servers in Heavy Traffic |
| title_sort | the m m ∞service system with ranked servers in heavy traffic |
| topic | Operations Research/Decision Theory R & D/Technology Policy Economic Theory/Quantitative Economics/Mathematical Methods Operations research Decision making Economic policy Economic theory Fernsprechverkehr (DE-588)4154088-8 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Gleichgewichtstheorie (DE-588)4071876-1 gnd Mathematisches Modell (DE-588)4114528-8 gnd |
| topic_facet | Operations Research/Decision Theory R & D/Technology Policy Economic Theory/Quantitative Economics/Mathematical Methods Operations research Decision making Economic policy Economic theory Fernsprechverkehr Warteschlangentheorie Gleichgewichtstheorie Mathematisches Modell |
| url | https://doi.org/10.1007/978-3-642-45576-6 |
| work_keys_str_mv | AT newellgf themmservicesystemwithrankedserversinheavytraffic |