Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls

In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate l...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Ioannis D. Moscholios [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2021

Schlagwörter:	call blocking retry threshold loss Poisson recursive

Übergeordnetes Werk:	In: Telecom - MDPI AG, 2020, 2(2021), 1, Seite 28-41
Übergeordnetes Werk:	volume:2 ; year:2021 ; number:1 ; pages:28-41

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.3390/telecom2010003

Katalog-ID:	DOAJ058876294

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ058876294
003	DE-627
005	20240414071206.0
007	cr uuu---uuuuu
008	230228s2021 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.3390/telecom2010003 \|2 doi
035			\|a (DE-627)DOAJ058876294
035			\|a (DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK7885-7895
050		0	\|a QA75.5-76.95
100	0		\|a Ioannis D. Moscholios \|e verfasserin \|4 aut
245	1	0	\|a Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls
264		1	\|c 2021
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.
650		4	\|a call blocking
650		4	\|a retry
650		4	\|a threshold
650		4	\|a loss
650		4	\|a Poisson
650		4	\|a recursive
653		0	\|a Computer engineering. Computer hardware
653		0	\|a Electronic computers. Computer science
773	0	8	\|i In \|t Telecom \|d MDPI AG, 2020 \|g 2(2021), 1, Seite 28-41 \|w (DE-627)1696034000 \|x 26734001 \|7 nnns
773	1	8	\|g volume:2 \|g year:2021 \|g number:1 \|g pages:28-41
856	4	0	\|u https://doi.org/10.3390/telecom2010003 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e \|z kostenfrei
856	4	0	\|u https://www.mdpi.com/2673-4001/2/1/3 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2673-4001 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 2 \|j 2021 \|e 1 \|h 28-41

Indexfelder

author_variant	i d m idm
matchkey_str	article:26734001:2021----::rbblsirtyntrsodutrtlsmdl
hierarchy_sort_str	2021
callnumber-subject-code	TK
publishDate	2021
allfields	10.3390/telecom2010003 doi (DE-627)DOAJ058876294 (DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e DE-627 ger DE-627 rakwb eng TK7885-7895 QA75.5-76.95 Ioannis D. Moscholios verfasserin aut Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation. call blocking retry threshold loss Poisson recursive Computer engineering. Computer hardware Electronic computers. Computer science In Telecom MDPI AG, 2020 2(2021), 1, Seite 28-41 (DE-627)1696034000 26734001 nnns volume:2 year:2021 number:1 pages:28-41 https://doi.org/10.3390/telecom2010003 kostenfrei https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e kostenfrei https://www.mdpi.com/2673-4001/2/1/3 kostenfrei https://doaj.org/toc/2673-4001 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2 2021 1 28-41
spelling	10.3390/telecom2010003 doi (DE-627)DOAJ058876294 (DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e DE-627 ger DE-627 rakwb eng TK7885-7895 QA75.5-76.95 Ioannis D. Moscholios verfasserin aut Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation. call blocking retry threshold loss Poisson recursive Computer engineering. Computer hardware Electronic computers. Computer science In Telecom MDPI AG, 2020 2(2021), 1, Seite 28-41 (DE-627)1696034000 26734001 nnns volume:2 year:2021 number:1 pages:28-41 https://doi.org/10.3390/telecom2010003 kostenfrei https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e kostenfrei https://www.mdpi.com/2673-4001/2/1/3 kostenfrei https://doaj.org/toc/2673-4001 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2 2021 1 28-41
allfields_unstemmed	10.3390/telecom2010003 doi (DE-627)DOAJ058876294 (DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e DE-627 ger DE-627 rakwb eng TK7885-7895 QA75.5-76.95 Ioannis D. Moscholios verfasserin aut Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation. call blocking retry threshold loss Poisson recursive Computer engineering. Computer hardware Electronic computers. Computer science In Telecom MDPI AG, 2020 2(2021), 1, Seite 28-41 (DE-627)1696034000 26734001 nnns volume:2 year:2021 number:1 pages:28-41 https://doi.org/10.3390/telecom2010003 kostenfrei https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e kostenfrei https://www.mdpi.com/2673-4001/2/1/3 kostenfrei https://doaj.org/toc/2673-4001 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2 2021 1 28-41
allfieldsGer	10.3390/telecom2010003 doi (DE-627)DOAJ058876294 (DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e DE-627 ger DE-627 rakwb eng TK7885-7895 QA75.5-76.95 Ioannis D. Moscholios verfasserin aut Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation. call blocking retry threshold loss Poisson recursive Computer engineering. Computer hardware Electronic computers. Computer science In Telecom MDPI AG, 2020 2(2021), 1, Seite 28-41 (DE-627)1696034000 26734001 nnns volume:2 year:2021 number:1 pages:28-41 https://doi.org/10.3390/telecom2010003 kostenfrei https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e kostenfrei https://www.mdpi.com/2673-4001/2/1/3 kostenfrei https://doaj.org/toc/2673-4001 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2 2021 1 28-41
allfieldsSound	10.3390/telecom2010003 doi (DE-627)DOAJ058876294 (DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e DE-627 ger DE-627 rakwb eng TK7885-7895 QA75.5-76.95 Ioannis D. Moscholios verfasserin aut Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation. call blocking retry threshold loss Poisson recursive Computer engineering. Computer hardware Electronic computers. Computer science In Telecom MDPI AG, 2020 2(2021), 1, Seite 28-41 (DE-627)1696034000 26734001 nnns volume:2 year:2021 number:1 pages:28-41 https://doi.org/10.3390/telecom2010003 kostenfrei https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e kostenfrei https://www.mdpi.com/2673-4001/2/1/3 kostenfrei https://doaj.org/toc/2673-4001 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2 2021 1 28-41
language	English
source	In Telecom 2(2021), 1, Seite 28-41 volume:2 year:2021 number:1 pages:28-41
sourceStr	In Telecom 2(2021), 1, Seite 28-41 volume:2 year:2021 number:1 pages:28-41
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	call blocking retry threshold loss Poisson recursive Computer engineering. Computer hardware Electronic computers. Computer science
isfreeaccess_bool	true
container_title	Telecom
authorswithroles_txt_mv	Ioannis D. Moscholios @@aut@@
publishDateDaySort_date	2021-01-01T00:00:00Z
hierarchy_top_id	1696034000
id	DOAJ058876294
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ058876294</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414071206.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230228s2021 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/telecom2010003</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ058876294</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e</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="050" ind1=" " ind2="0"><subfield code="a">TK7885-7895</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75.5-76.95</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Ioannis D. Moscholios</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">call blocking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">retry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">threshold</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">loss</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Poisson</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">recursive</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer engineering. Computer hardware</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronic computers. Computer science</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Telecom</subfield><subfield code="d">MDPI AG, 2020</subfield><subfield code="g">2(2021), 1, Seite 28-41</subfield><subfield code="w">(DE-627)1696034000</subfield><subfield code="x">26734001</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:2</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:28-41</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/telecom2010003</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/2673-4001/2/1/3</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2673-4001</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</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_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">2</subfield><subfield code="j">2021</subfield><subfield code="e">1</subfield><subfield code="h">28-41</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Ioannis D. Moscholios
spellingShingle	Ioannis D. Moscholios misc TK7885-7895 misc QA75.5-76.95 misc call blocking misc retry misc threshold misc loss misc Poisson misc recursive misc Computer engineering. Computer hardware misc Electronic computers. Computer science Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls
authorStr	Ioannis D. Moscholios
ppnlink_with_tag_str_mv	@@773@@(DE-627)1696034000
format	electronic Article
delete_txt_mv	keep
author_role	aut
collection	DOAJ
remote_str	true
callnumber-label	TK7885-7895
illustrated	Not Illustrated
issn	26734001
topic_title	TK7885-7895 QA75.5-76.95 Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls call blocking retry threshold loss Poisson recursive
topic	misc TK7885-7895 misc QA75.5-76.95 misc call blocking misc retry misc threshold misc loss misc Poisson misc recursive misc Computer engineering. Computer hardware misc Electronic computers. Computer science
topic_unstemmed	misc TK7885-7895 misc QA75.5-76.95 misc call blocking misc retry misc threshold misc loss misc Poisson misc recursive misc Computer engineering. Computer hardware misc Electronic computers. Computer science
topic_browse	misc TK7885-7895 misc QA75.5-76.95 misc call blocking misc retry misc threshold misc loss misc Poisson misc recursive misc Computer engineering. Computer hardware misc Electronic computers. Computer science
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Telecom
hierarchy_parent_id	1696034000
hierarchy_top_title	Telecom
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)1696034000
title	Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls
ctrlnum	(DE-627)DOAJ058876294 (DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e
title_full	Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls
author_sort	Ioannis D. Moscholios
journal	Telecom
journalStr	Telecom
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2021
contenttype_str_mv	txt
container_start_page	28
author_browse	Ioannis D. Moscholios
container_volume	2
class	TK7885-7895 QA75.5-76.95
format_se	Elektronische Aufsätze
author-letter	Ioannis D. Moscholios
doi_str_mv	10.3390/telecom2010003
title_sort	probabilistic retry and threshold multirate loss models for impatient calls
callnumber	TK7885-7895
title_auth	Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls
abstract	In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.
abstractGer	In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.
abstract_unstemmed	In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	1
title_short	Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls
url	https://doi.org/10.3390/telecom2010003 https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e https://www.mdpi.com/2673-4001/2/1/3 https://doaj.org/toc/2673-4001
remote_bool	true
ppnlink	1696034000
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.3390/telecom2010003
callnumber-a	TK7885-7895
up_date	2024-07-03T20:33:25.481Z
_version_	1803591410503385088
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ058876294</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414071206.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230228s2021 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/telecom2010003</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ058876294</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJc0b5fc9839414e20b3b8c166efcc6d1e</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="050" ind1=" " ind2="0"><subfield code="a">TK7885-7895</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA75.5-76.95</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Ioannis D. Moscholios</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">call blocking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">retry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">threshold</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">loss</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Poisson</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">recursive</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer engineering. Computer hardware</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electronic computers. Computer science</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Telecom</subfield><subfield code="d">MDPI AG, 2020</subfield><subfield code="g">2(2021), 1, Seite 28-41</subfield><subfield code="w">(DE-627)1696034000</subfield><subfield code="x">26734001</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:2</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:28-41</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/telecom2010003</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/c0b5fc9839414e20b3b8c166efcc6d1e</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/2673-4001/2/1/3</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2673-4001</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</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_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">2</subfield><subfield code="j">2021</subfield><subfield code="e">1</subfield><subfield code="h">28-41</subfield></datafield></record></collection>
score	7.402815

Nicht das Richtige dabei?

Schreiben Sie uns!

Probabilistic Retry and Threshold Multirate Loss Models for Impatient Calls

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?