Large deviations of Markovian polling models with applications to admission control
Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/of...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Feng, Wei [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2006 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science + Business Media, LLC 2006 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Springer US, 1984, 146(2006), 1 vom: 27. Juni, Seite 169-188 |
|---|---|
| Übergeordnetes Werk: |
volume:146 ; year:2006 ; number:1 ; day:27 ; month:06 ; pages:169-188 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10479-006-0054-3 |
|---|
| Katalog-ID: |
OLC2111136476 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2111136476 | ||
| 003 | DE-627 | ||
| 005 | 20230502202610.0 | ||
| 007 | tu | ||
| 008 | 230502s2006 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10479-006-0054-3 |2 doi | |
| 035 | |a (DE-627)OLC2111136476 | ||
| 035 | |a (DE-He213)s10479-006-0054-3-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Feng, Wei |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Large deviations of Markovian polling models with applications to admission control |
| 264 | 1 | |c 2006 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science + Business Media, LLC 2006 | ||
| 520 | |a Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. | ||
| 650 | 4 | |a Polling systems | |
| 650 | 4 | |a Bernoulli service schedule | |
| 650 | 4 | |a Effective bandwidths | |
| 650 | 4 | |a Quality of service | |
| 650 | 4 | |a Large deviations | |
| 650 | 4 | |a Admission control | |
| 700 | 1 | |a Ohi, Fumio |4 aut | |
| 700 | 1 | |a Kowada, Masashi |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Springer US, 1984 |g 146(2006), 1 vom: 27. Juni, Seite 169-188 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
| 773 | 1 | 8 | |g volume:146 |g year:2006 |g number:1 |g day:27 |g month:06 |g pages:169-188 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10479-006-0054-3 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_4029 | ||
| 951 | |a AR | ||
| 952 | |d 146 |j 2006 |e 1 |b 27 |c 06 |h 169-188 | ||
| author_variant |
w f wf f o fo m k mk |
|---|---|
| matchkey_str |
article:02545330:2006----::agdvainomroinolnmdlwtapiain |
| hierarchy_sort_str |
2006 |
| publishDate |
2006 |
| allfields |
10.1007/s10479-006-0054-3 doi (DE-627)OLC2111136476 (DE-He213)s10479-006-0054-3-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Feng, Wei verfasserin aut Large deviations of Markovian polling models with applications to admission control 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. Polling systems Bernoulli service schedule Effective bandwidths Quality of service Large deviations Admission control Ohi, Fumio aut Kowada, Masashi aut Enthalten in Annals of operations research Springer US, 1984 146(2006), 1 vom: 27. Juni, Seite 169-188 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:146 year:2006 number:1 day:27 month:06 pages:169-188 https://doi.org/10.1007/s10479-006-0054-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 146 2006 1 27 06 169-188 |
| spelling |
10.1007/s10479-006-0054-3 doi (DE-627)OLC2111136476 (DE-He213)s10479-006-0054-3-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Feng, Wei verfasserin aut Large deviations of Markovian polling models with applications to admission control 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. Polling systems Bernoulli service schedule Effective bandwidths Quality of service Large deviations Admission control Ohi, Fumio aut Kowada, Masashi aut Enthalten in Annals of operations research Springer US, 1984 146(2006), 1 vom: 27. Juni, Seite 169-188 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:146 year:2006 number:1 day:27 month:06 pages:169-188 https://doi.org/10.1007/s10479-006-0054-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 146 2006 1 27 06 169-188 |
| allfields_unstemmed |
10.1007/s10479-006-0054-3 doi (DE-627)OLC2111136476 (DE-He213)s10479-006-0054-3-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Feng, Wei verfasserin aut Large deviations of Markovian polling models with applications to admission control 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. Polling systems Bernoulli service schedule Effective bandwidths Quality of service Large deviations Admission control Ohi, Fumio aut Kowada, Masashi aut Enthalten in Annals of operations research Springer US, 1984 146(2006), 1 vom: 27. Juni, Seite 169-188 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:146 year:2006 number:1 day:27 month:06 pages:169-188 https://doi.org/10.1007/s10479-006-0054-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 146 2006 1 27 06 169-188 |
| allfieldsGer |
10.1007/s10479-006-0054-3 doi (DE-627)OLC2111136476 (DE-He213)s10479-006-0054-3-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Feng, Wei verfasserin aut Large deviations of Markovian polling models with applications to admission control 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. Polling systems Bernoulli service schedule Effective bandwidths Quality of service Large deviations Admission control Ohi, Fumio aut Kowada, Masashi aut Enthalten in Annals of operations research Springer US, 1984 146(2006), 1 vom: 27. Juni, Seite 169-188 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:146 year:2006 number:1 day:27 month:06 pages:169-188 https://doi.org/10.1007/s10479-006-0054-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 146 2006 1 27 06 169-188 |
| allfieldsSound |
10.1007/s10479-006-0054-3 doi (DE-627)OLC2111136476 (DE-He213)s10479-006-0054-3-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Feng, Wei verfasserin aut Large deviations of Markovian polling models with applications to admission control 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. Polling systems Bernoulli service schedule Effective bandwidths Quality of service Large deviations Admission control Ohi, Fumio aut Kowada, Masashi aut Enthalten in Annals of operations research Springer US, 1984 146(2006), 1 vom: 27. Juni, Seite 169-188 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:146 year:2006 number:1 day:27 month:06 pages:169-188 https://doi.org/10.1007/s10479-006-0054-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 146 2006 1 27 06 169-188 |
| language |
English |
| source |
Enthalten in Annals of operations research 146(2006), 1 vom: 27. Juni, Seite 169-188 volume:146 year:2006 number:1 day:27 month:06 pages:169-188 |
| sourceStr |
Enthalten in Annals of operations research 146(2006), 1 vom: 27. Juni, Seite 169-188 volume:146 year:2006 number:1 day:27 month:06 pages:169-188 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Polling systems Bernoulli service schedule Effective bandwidths Quality of service Large deviations Admission control |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Annals of operations research |
| authorswithroles_txt_mv |
Feng, Wei @@aut@@ Ohi, Fumio @@aut@@ Kowada, Masashi @@aut@@ |
| publishDateDaySort_date |
2006-06-27T00:00:00Z |
| hierarchy_top_id |
12964370X |
| dewey-sort |
14 |
| id |
OLC2111136476 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111136476</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202610.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-006-0054-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111136476</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-006-0054-3-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feng, Wei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Large deviations of Markovian polling models with applications to admission control</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science + Business Media, LLC 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polling systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bernoulli service schedule</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Effective bandwidths</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Quality of service</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Large deviations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Admission control</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ohi, Fumio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kowada, Masashi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Springer US, 1984</subfield><subfield code="g">146(2006), 1 vom: 27. Juni, Seite 169-188</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:146</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:1</subfield><subfield code="g">day:27</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:169-188</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-006-0054-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">146</subfield><subfield code="j">2006</subfield><subfield code="e">1</subfield><subfield code="b">27</subfield><subfield code="c">06</subfield><subfield code="h">169-188</subfield></datafield></record></collection>
|
| author |
Feng, Wei |
| spellingShingle |
Feng, Wei ddc 004 ssgn 3,2 misc Polling systems misc Bernoulli service schedule misc Effective bandwidths misc Quality of service misc Large deviations misc Admission control Large deviations of Markovian polling models with applications to admission control |
| authorStr |
Feng, Wei |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12964370X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0254-5330 |
| topic_title |
004 VZ 3,2 ssgn Large deviations of Markovian polling models with applications to admission control Polling systems Bernoulli service schedule Effective bandwidths Quality of service Large deviations Admission control |
| topic |
ddc 004 ssgn 3,2 misc Polling systems misc Bernoulli service schedule misc Effective bandwidths misc Quality of service misc Large deviations misc Admission control |
| topic_unstemmed |
ddc 004 ssgn 3,2 misc Polling systems misc Bernoulli service schedule misc Effective bandwidths misc Quality of service misc Large deviations misc Admission control |
| topic_browse |
ddc 004 ssgn 3,2 misc Polling systems misc Bernoulli service schedule misc Effective bandwidths misc Quality of service misc Large deviations misc Admission control |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Annals of operations research |
| hierarchy_parent_id |
12964370X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of operations research |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 |
| title |
Large deviations of Markovian polling models with applications to admission control |
| ctrlnum |
(DE-627)OLC2111136476 (DE-He213)s10479-006-0054-3-p |
| title_full |
Large deviations of Markovian polling models with applications to admission control |
| author_sort |
Feng, Wei |
| journal |
Annals of operations research |
| journalStr |
Annals of operations research |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2006 |
| contenttype_str_mv |
txt |
| container_start_page |
169 |
| author_browse |
Feng, Wei Ohi, Fumio Kowada, Masashi |
| container_volume |
146 |
| class |
004 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Feng, Wei |
| doi_str_mv |
10.1007/s10479-006-0054-3 |
| dewey-full |
004 |
| title_sort |
large deviations of markovian polling models with applications to admission control |
| title_auth |
Large deviations of Markovian polling models with applications to admission control |
| abstract |
Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. © Springer Science + Business Media, LLC 2006 |
| abstractGer |
Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. © Springer Science + Business Media, LLC 2006 |
| abstract_unstemmed |
Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed. © Springer Science + Business Media, LLC 2006 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 |
| container_issue |
1 |
| title_short |
Large deviations of Markovian polling models with applications to admission control |
| url |
https://doi.org/10.1007/s10479-006-0054-3 |
| remote_bool |
false |
| author2 |
Ohi, Fumio Kowada, Masashi |
| author2Str |
Ohi, Fumio Kowada, Masashi |
| ppnlink |
12964370X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10479-006-0054-3 |
| up_date |
2024-07-04T08:48:55.947Z |
| _version_ |
1803637684650901504 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2111136476</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202610.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-006-0054-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111136476</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-006-0054-3-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Feng, Wei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Large deviations of Markovian polling models with applications to admission control</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science + Business Media, LLC 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polling systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bernoulli service schedule</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Effective bandwidths</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Quality of service</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Large deviations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Admission control</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ohi, Fumio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kowada, Masashi</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Springer US, 1984</subfield><subfield code="g">146(2006), 1 vom: 27. Juni, Seite 169-188</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:146</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:1</subfield><subfield code="g">day:27</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:169-188</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-006-0054-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">146</subfield><subfield code="j">2006</subfield><subfield code="e">1</subfield><subfield code="b">27</subfield><subfield code="c">06</subfield><subfield code="h">169-188</subfield></datafield></record></collection>
|
| score |
7.399646 |