Bound computation of dependability and performance measures
We propose a new method to obtain bounds of dependability, performance or performability measures concerning complex systems modeled by a large Markov model. It extends previously published techniques mainly designed to the analysis of dependability measures only and working under more restrictive c...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computers 2001-05, Vol.50 (5), p.399-413 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 413 |
|---|---|
| container_issue | 5 |
| container_start_page | 399 |
| container_title | IEEE transactions on computers |
| container_volume | 50 |
| creator | Mahevas, S. Rubino, G. |
| description | We propose a new method to obtain bounds of dependability, performance or performability measures concerning complex systems modeled by a large Markov model. It extends previously published techniques mainly designed to the analysis of dependability measures only and working under more restrictive conditions. Our approach allows us to obtain tight bounds of performance measures on certain cases and, in particular, on models having an infinite state space. We illustrate the method with some analytically intractable open queuing networks, as well as with large dependability models. |
| doi_str_mv | 10.1109/12.926156 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_926156</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>926156</ieee_id><sourcerecordid>2433207351</sourcerecordid><originalsourceid>FETCH-LOGICAL-c402t-58329989b9c1a0ed22daddc748256a328fc17ae19803e823dca67831e0d926743</originalsourceid><addsrcrecordid>eNqF0b9LxDAUwPEgCp6ng6tTcVAceuYlTZrgpIe_4MBF55JLXqHHtalJO9x_b6SHg4NOb3gfHnx5hJwDXQBQfQtsoZkEIQ_IDIQoc62FPCQzSkHlmhf0mJzEuKGUSkb1jNw9-LFzmfVtPw5maHyX-Tpz2GPnzLrZNsMuMwn0GGofWtNZzFo0cQwYT8lRbbYRz_ZzTj6eHt-XL_nq7fl1eb_KbUHZkAvFmdZKr7UFQ9Ex5oxztiwUE9JwpmoLpUHQinJUjDtrZKk4IHUppSz4nFxPd_vgP0eMQ9U20eJ2azr0Y6w0LVOkKHiSV39KpkCA1Pp_KCUXClSCl7_gxo-hS7mVUqlA8pIldDMhG3yMAeuqD01rwq4CWn2_pQJWTW9J9mKyDSL-uP3yC2XchXg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884826372</pqid></control><display><type>article</type><title>Bound computation of dependability and performance measures</title><source>IEEE Electronic Library (IEL)</source><creator>Mahevas, S. ; Rubino, G.</creator><creatorcontrib>Mahevas, S. ; Rubino, G.</creatorcontrib><description>We propose a new method to obtain bounds of dependability, performance or performability measures concerning complex systems modeled by a large Markov model. It extends previously published techniques mainly designed to the analysis of dependability measures only and working under more restrictive conditions. Our approach allows us to obtain tight bounds of performance measures on certain cases and, in particular, on models having an infinite state space. We illustrate the method with some analytically intractable open queuing networks, as well as with large dependability models.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/12.926156</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Complex systems ; Computation ; Computer simulation ; Markov models ; Mathematical analysis ; Mathematical model ; Mathematical models ; Networks ; Numerical analysis ; Particle measurements ; Performance evaluation ; Petri nets ; Power system modeling ; Queueing analysis ; Queues ; Space technology ; State-space methods ; Stochastic processes</subject><ispartof>IEEE transactions on computers, 2001-05, Vol.50 (5), p.399-413</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2001</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c402t-58329989b9c1a0ed22daddc748256a328fc17ae19803e823dca67831e0d926743</citedby><cites>FETCH-LOGICAL-c402t-58329989b9c1a0ed22daddc748256a328fc17ae19803e823dca67831e0d926743</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/926156$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/926156$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mahevas, S.</creatorcontrib><creatorcontrib>Rubino, G.</creatorcontrib><title>Bound computation of dependability and performance measures</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>We propose a new method to obtain bounds of dependability, performance or performability measures concerning complex systems modeled by a large Markov model. It extends previously published techniques mainly designed to the analysis of dependability measures only and working under more restrictive conditions. Our approach allows us to obtain tight bounds of performance measures on certain cases and, in particular, on models having an infinite state space. We illustrate the method with some analytically intractable open queuing networks, as well as with large dependability models.</description><subject>Complex systems</subject><subject>Computation</subject><subject>Computer simulation</subject><subject>Markov models</subject><subject>Mathematical analysis</subject><subject>Mathematical model</subject><subject>Mathematical models</subject><subject>Networks</subject><subject>Numerical analysis</subject><subject>Particle measurements</subject><subject>Performance evaluation</subject><subject>Petri nets</subject><subject>Power system modeling</subject><subject>Queueing analysis</subject><subject>Queues</subject><subject>Space technology</subject><subject>State-space methods</subject><subject>Stochastic processes</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqF0b9LxDAUwPEgCp6ng6tTcVAceuYlTZrgpIe_4MBF55JLXqHHtalJO9x_b6SHg4NOb3gfHnx5hJwDXQBQfQtsoZkEIQ_IDIQoc62FPCQzSkHlmhf0mJzEuKGUSkb1jNw9-LFzmfVtPw5maHyX-Tpz2GPnzLrZNsMuMwn0GGofWtNZzFo0cQwYT8lRbbYRz_ZzTj6eHt-XL_nq7fl1eb_KbUHZkAvFmdZKr7UFQ9Ex5oxztiwUE9JwpmoLpUHQinJUjDtrZKk4IHUppSz4nFxPd_vgP0eMQ9U20eJ2azr0Y6w0LVOkKHiSV39KpkCA1Pp_KCUXClSCl7_gxo-hS7mVUqlA8pIldDMhG3yMAeuqD01rwq4CWn2_pQJWTW9J9mKyDSL-uP3yC2XchXg</recordid><startdate>20010501</startdate><enddate>20010501</enddate><creator>Mahevas, S.</creator><creator>Rubino, G.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20010501</creationdate><title>Bound computation of dependability and performance measures</title><author>Mahevas, S. ; Rubino, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c402t-58329989b9c1a0ed22daddc748256a328fc17ae19803e823dca67831e0d926743</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Complex systems</topic><topic>Computation</topic><topic>Computer simulation</topic><topic>Markov models</topic><topic>Mathematical analysis</topic><topic>Mathematical model</topic><topic>Mathematical models</topic><topic>Networks</topic><topic>Numerical analysis</topic><topic>Particle measurements</topic><topic>Performance evaluation</topic><topic>Petri nets</topic><topic>Power system modeling</topic><topic>Queueing analysis</topic><topic>Queues</topic><topic>Space technology</topic><topic>State-space methods</topic><topic>Stochastic processes</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mahevas, S.</creatorcontrib><creatorcontrib>Rubino, G.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mahevas, S.</au><au>Rubino, G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bound computation of dependability and performance measures</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>2001-05-01</date><risdate>2001</risdate><volume>50</volume><issue>5</issue><spage>399</spage><epage>413</epage><pages>399-413</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>We propose a new method to obtain bounds of dependability, performance or performability measures concerning complex systems modeled by a large Markov model. It extends previously published techniques mainly designed to the analysis of dependability measures only and working under more restrictive conditions. Our approach allows us to obtain tight bounds of performance measures on certain cases and, in particular, on models having an infinite state space. We illustrate the method with some analytically intractable open queuing networks, as well as with large dependability models.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/12.926156</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9340 |
| ispartof | IEEE transactions on computers, 2001-05, Vol.50 (5), p.399-413 |
| issn | 0018-9340 1557-9956 |
| language | eng |
| recordid | cdi_ieee_primary_926156 |
| source | IEEE Electronic Library (IEL) |
| subjects | Complex systems Computation Computer simulation Markov models Mathematical analysis Mathematical model Mathematical models Networks Numerical analysis Particle measurements Performance evaluation Petri nets Power system modeling Queueing analysis Queues Space technology State-space methods Stochastic processes |
| title | Bound computation of dependability and performance measures |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T07%3A00%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Bound%20computation%20of%20dependability%20and%20performance%20measures&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Mahevas,%20S.&rft.date=2001-05-01&rft.volume=50&rft.issue=5&rft.spage=399&rft.epage=413&rft.pages=399-413&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/12.926156&rft_dat=%3Cproquest_RIE%3E2433207351%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884826372&rft_id=info:pmid/&rft_ieee_id=926156&rfr_iscdi=true |