Performance analysis of test scheduling schemes for a multi-access communications network
Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Rubin, Izhak [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1990 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© J.C. Baltzer A.G. Scientific Publishing Company 1990 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Queueing systems - Kluwer Academic Publishers, 1986, 7(1990), 3-4 vom: Sept., Seite 307-324 |
|---|---|
| Übergeordnetes Werk: |
volume:7 ; year:1990 ; number:3-4 ; month:09 ; pages:307-324 |
| Links: |
|---|
| DOI / URN: |
10.1007/BF01154548 |
|---|
| Katalog-ID: |
OLC2058603516 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2058603516 | ||
| 003 | DE-627 | ||
| 005 | 20230504015709.0 | ||
| 007 | tu | ||
| 008 | 200820s1990 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/BF01154548 |2 doi | |
| 035 | |a (DE-627)OLC2058603516 | ||
| 035 | |a (DE-He213)BF01154548-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 11 |2 ssgn | ||
| 100 | 1 | |a Rubin, Izhak |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Performance analysis of test scheduling schemes for a multi-access communications network |
| 264 | 1 | |c 1990 | |
| 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 © J.C. Baltzer A.G. Scientific Publishing Company 1990 | ||
| 520 | |a Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. | ||
| 650 | 4 | |a Test scheduling schemes | |
| 650 | 4 | |a retransmission | |
| 650 | 4 | |a queueing analysis | |
| 700 | 1 | |a Zhang, Zhensheng |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Queueing systems |d Kluwer Academic Publishers, 1986 |g 7(1990), 3-4 vom: Sept., Seite 307-324 |w (DE-627)129219673 |w (DE-600)56281-6 |w (DE-576)034178309 |x 0257-0130 |7 nnns |
| 773 | 1 | 8 | |g volume:7 |g year:1990 |g number:3-4 |g month:09 |g pages:307-324 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/BF01154548 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2005 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4193 | ||
| 912 | |a GBV_ILN_4306 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4311 | ||
| 951 | |a AR | ||
| 952 | |d 7 |j 1990 |e 3-4 |c 09 |h 307-324 | ||
| author_variant |
i r ir z z zz |
|---|---|
| matchkey_str |
article:02570130:1990----::efracaayiotsshdlnshmsoautacs |
| hierarchy_sort_str |
1990 |
| publishDate |
1990 |
| allfields |
10.1007/BF01154548 doi (DE-627)OLC2058603516 (DE-He213)BF01154548-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Rubin, Izhak verfasserin aut Performance analysis of test scheduling schemes for a multi-access communications network 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1990 Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. Test scheduling schemes retransmission queueing analysis Zhang, Zhensheng aut Enthalten in Queueing systems Kluwer Academic Publishers, 1986 7(1990), 3-4 vom: Sept., Seite 307-324 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:7 year:1990 number:3-4 month:09 pages:307-324 https://doi.org/10.1007/BF01154548 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4311 AR 7 1990 3-4 09 307-324 |
| spelling |
10.1007/BF01154548 doi (DE-627)OLC2058603516 (DE-He213)BF01154548-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Rubin, Izhak verfasserin aut Performance analysis of test scheduling schemes for a multi-access communications network 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1990 Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. Test scheduling schemes retransmission queueing analysis Zhang, Zhensheng aut Enthalten in Queueing systems Kluwer Academic Publishers, 1986 7(1990), 3-4 vom: Sept., Seite 307-324 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:7 year:1990 number:3-4 month:09 pages:307-324 https://doi.org/10.1007/BF01154548 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4311 AR 7 1990 3-4 09 307-324 |
| allfields_unstemmed |
10.1007/BF01154548 doi (DE-627)OLC2058603516 (DE-He213)BF01154548-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Rubin, Izhak verfasserin aut Performance analysis of test scheduling schemes for a multi-access communications network 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1990 Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. Test scheduling schemes retransmission queueing analysis Zhang, Zhensheng aut Enthalten in Queueing systems Kluwer Academic Publishers, 1986 7(1990), 3-4 vom: Sept., Seite 307-324 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:7 year:1990 number:3-4 month:09 pages:307-324 https://doi.org/10.1007/BF01154548 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4311 AR 7 1990 3-4 09 307-324 |
| allfieldsGer |
10.1007/BF01154548 doi (DE-627)OLC2058603516 (DE-He213)BF01154548-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Rubin, Izhak verfasserin aut Performance analysis of test scheduling schemes for a multi-access communications network 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1990 Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. Test scheduling schemes retransmission queueing analysis Zhang, Zhensheng aut Enthalten in Queueing systems Kluwer Academic Publishers, 1986 7(1990), 3-4 vom: Sept., Seite 307-324 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:7 year:1990 number:3-4 month:09 pages:307-324 https://doi.org/10.1007/BF01154548 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4311 AR 7 1990 3-4 09 307-324 |
| allfieldsSound |
10.1007/BF01154548 doi (DE-627)OLC2058603516 (DE-He213)BF01154548-p DE-627 ger DE-627 rakwb eng 004 VZ 11 ssgn Rubin, Izhak verfasserin aut Performance analysis of test scheduling schemes for a multi-access communications network 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © J.C. Baltzer A.G. Scientific Publishing Company 1990 Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. Test scheduling schemes retransmission queueing analysis Zhang, Zhensheng aut Enthalten in Queueing systems Kluwer Academic Publishers, 1986 7(1990), 3-4 vom: Sept., Seite 307-324 (DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 0257-0130 nnns volume:7 year:1990 number:3-4 month:09 pages:307-324 https://doi.org/10.1007/BF01154548 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4311 AR 7 1990 3-4 09 307-324 |
| language |
English |
| source |
Enthalten in Queueing systems 7(1990), 3-4 vom: Sept., Seite 307-324 volume:7 year:1990 number:3-4 month:09 pages:307-324 |
| sourceStr |
Enthalten in Queueing systems 7(1990), 3-4 vom: Sept., Seite 307-324 volume:7 year:1990 number:3-4 month:09 pages:307-324 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Test scheduling schemes retransmission queueing analysis |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Queueing systems |
| authorswithroles_txt_mv |
Rubin, Izhak @@aut@@ Zhang, Zhensheng @@aut@@ |
| publishDateDaySort_date |
1990-09-01T00:00:00Z |
| hierarchy_top_id |
129219673 |
| dewey-sort |
14 |
| id |
OLC2058603516 |
| 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">OLC2058603516</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504015709.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s1990 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01154548</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2058603516</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01154548-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">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rubin, Izhak</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance analysis of test scheduling schemes for a multi-access communications network</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1990</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">© J.C. Baltzer A.G. Scientific Publishing Company 1990</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Test scheduling schemes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">retransmission</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">queueing analysis</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Zhensheng</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Queueing systems</subfield><subfield code="d">Kluwer Academic Publishers, 1986</subfield><subfield code="g">7(1990), 3-4 vom: Sept., Seite 307-324</subfield><subfield code="w">(DE-627)129219673</subfield><subfield code="w">(DE-600)56281-6</subfield><subfield code="w">(DE-576)034178309</subfield><subfield code="x">0257-0130</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:1990</subfield><subfield code="g">number:3-4</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:307-324</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01154548</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_30</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</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_4193</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_4311</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">1990</subfield><subfield code="e">3-4</subfield><subfield code="c">09</subfield><subfield code="h">307-324</subfield></datafield></record></collection>
|
| author |
Rubin, Izhak |
| spellingShingle |
Rubin, Izhak ddc 004 ssgn 11 misc Test scheduling schemes misc retransmission misc queueing analysis Performance analysis of test scheduling schemes for a multi-access communications network |
| authorStr |
Rubin, Izhak |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129219673 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0257-0130 |
| topic_title |
004 VZ 11 ssgn Performance analysis of test scheduling schemes for a multi-access communications network Test scheduling schemes retransmission queueing analysis |
| topic |
ddc 004 ssgn 11 misc Test scheduling schemes misc retransmission misc queueing analysis |
| topic_unstemmed |
ddc 004 ssgn 11 misc Test scheduling schemes misc retransmission misc queueing analysis |
| topic_browse |
ddc 004 ssgn 11 misc Test scheduling schemes misc retransmission misc queueing analysis |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Queueing systems |
| hierarchy_parent_id |
129219673 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Queueing systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129219673 (DE-600)56281-6 (DE-576)034178309 |
| title |
Performance analysis of test scheduling schemes for a multi-access communications network |
| ctrlnum |
(DE-627)OLC2058603516 (DE-He213)BF01154548-p |
| title_full |
Performance analysis of test scheduling schemes for a multi-access communications network |
| author_sort |
Rubin, Izhak |
| journal |
Queueing systems |
| journalStr |
Queueing systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
1990 |
| contenttype_str_mv |
txt |
| container_start_page |
307 |
| author_browse |
Rubin, Izhak Zhang, Zhensheng |
| container_volume |
7 |
| class |
004 VZ 11 ssgn |
| format_se |
Aufsätze |
| author-letter |
Rubin, Izhak |
| doi_str_mv |
10.1007/BF01154548 |
| dewey-full |
004 |
| title_sort |
performance analysis of test scheduling schemes for a multi-access communications network |
| title_auth |
Performance analysis of test scheduling schemes for a multi-access communications network |
| abstract |
Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. © J.C. Baltzer A.G. Scientific Publishing Company 1990 |
| abstractGer |
Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. © J.C. Baltzer A.G. Scientific Publishing Company 1990 |
| abstract_unstemmed |
Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue. © J.C. Baltzer A.G. Scientific Publishing Company 1990 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_2005 GBV_ILN_2088 GBV_ILN_4012 GBV_ILN_4193 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4311 |
| container_issue |
3-4 |
| title_short |
Performance analysis of test scheduling schemes for a multi-access communications network |
| url |
https://doi.org/10.1007/BF01154548 |
| remote_bool |
false |
| author2 |
Zhang, Zhensheng |
| author2Str |
Zhang, Zhensheng |
| ppnlink |
129219673 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/BF01154548 |
| up_date |
2024-07-03T19:26:22.848Z |
| _version_ |
1803587192462770176 |
| 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">OLC2058603516</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504015709.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s1990 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01154548</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2058603516</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01154548-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">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rubin, Izhak</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance analysis of test scheduling schemes for a multi-access communications network</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1990</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">© J.C. Baltzer A.G. Scientific Publishing Company 1990</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we investigate the performance of two implementable test scheduling schemes for a multi-access communication channel whose components are subject to failure or malfunction. We relate the reliability of the system design, as reflected by system failure rate parameters, and the frequency at which the system (or nodal subsystem) is tested for failure detection, to the underlying key message delay and throughput performance. We derive queue-size distribution results for a discreteGeom(X)/D/1 system, representing the operation of the multi-access channel, or of a network node operating as a communications or queueing processor, which is maintained by a periodic or near periodic test scheduling scheme. Explicit formulas are presented for the system behavior as exhibited by the generating functions of the system queue-size distributions. The mean message delay is then calculated. The mean delay (or mean system size/workload performance index) can then be optimized by selecting the proper scheme parameters, under specified system (and component) failure conditions, noting that performing a test at too high a rate leads to inefficient system bandwidth utilization, while if tests are not carried out often enough, excessive message (or task) retransmissions and delays ensue.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Test scheduling schemes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">retransmission</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">queueing analysis</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Zhensheng</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Queueing systems</subfield><subfield code="d">Kluwer Academic Publishers, 1986</subfield><subfield code="g">7(1990), 3-4 vom: Sept., Seite 307-324</subfield><subfield code="w">(DE-627)129219673</subfield><subfield code="w">(DE-600)56281-6</subfield><subfield code="w">(DE-576)034178309</subfield><subfield code="x">0257-0130</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:1990</subfield><subfield code="g">number:3-4</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:307-324</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01154548</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_30</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</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_4193</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_4311</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">1990</subfield><subfield code="e">3-4</subfield><subfield code="c">09</subfield><subfield code="h">307-324</subfield></datafield></record></collection>
|
| score |
7.398575 |