A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems
The workload loss ratio (WLR) is a key quantity from the point of Quality of Service (QoS) provisioning in packet-based communication, hence it’s estimation is an important issue. The existing results in the area of WLR approximation usually interpret the workload loss as a product of some well asse...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buchkapitel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 729 |
---|---|
container_issue | |
container_start_page | 718 |
container_title | |
container_volume | |
creator | Bíró, József J. Gulyás, András Heszberger, Zalán |
description | The workload loss ratio (WLR) is a key quantity from the point of Quality of Service (QoS) provisioning in packet-based communication, hence it’s estimation is an important issue. The existing results in the area of WLR approximation usually interpret the workload loss as a product of some well assessable quantities. We call this approach as the indirect approximation of the WLR. The drawback of this approach is that each estimation has an error and the product of these errors could result in a highly inaccurate bound. This work deals with the upper approximation of the workload loss ratio based on it’s original definition and proposes a new direct bound on the WLR applicable in general service curve network element. Extensive and systematic performance analysis of the formulae have been done, in which we found that the direct approach gives more accurate bound in several cases. We illustrate this analysis through some numerical examples. |
doi_str_mv | 10.1007/11422778_58 |
format | Book Chapter |
fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16895212</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16895212</sourcerecordid><originalsourceid>FETCH-LOGICAL-p256t-e704f4dd6f9706c771efbfa855c9df5c6686f9428a49981e20f8c7cc47c92a733</originalsourceid><addsrcrecordid>eNpNkD1PwzAYhM2XRFQ68Qe8MDAE_PojtsdSoCBVIAGFMXIdG4WmcWQHRP89qYoQt9zwnE6nQ-gUyAUQIi8BOKVSqlKoPTTWUjHBCaMEJNtHGRQAOWNcH_wxKhTR_BBlhBGaa8nZMRqn9EEGMdDAaIZeJ_ghfLkGX9fR2R4vus5FPOm6GL7rtenr0GIfIn4LcdUEU-F5SAk_bQGuWzxzrYumwVef3rvoKvy8Sb1bpxN05E2T3PjXR2hxe_Myvcvnj7P76WSed1QUfe4k4Z5XVeG1JIWVEpxfeqOEsLrywhaFGhCnynCtFThKvLLSWi6tpkYyNkJnu97OJGsaH01r61R2cdgeNyUUSgsKdMid73JpQO27i-UyhFUqgZTbb8t_37IftP9ljA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems</title><source>Springer Books</source><creator>Bíró, József J. ; Gulyás, András ; Heszberger, Zalán</creator><contributor>Boutaba, Raouf ; Black, James P. ; Almeroth, Kevin ; Puigjaner, Ramon ; Shen, Sherman</contributor><creatorcontrib>Bíró, József J. ; Gulyás, András ; Heszberger, Zalán ; Boutaba, Raouf ; Black, James P. ; Almeroth, Kevin ; Puigjaner, Ramon ; Shen, Sherman</creatorcontrib><description>The workload loss ratio (WLR) is a key quantity from the point of Quality of Service (QoS) provisioning in packet-based communication, hence it’s estimation is an important issue. The existing results in the area of WLR approximation usually interpret the workload loss as a product of some well assessable quantities. We call this approach as the indirect approximation of the WLR. The drawback of this approach is that each estimation has an error and the product of these errors could result in a highly inaccurate bound. This work deals with the upper approximation of the workload loss ratio based on it’s original definition and proposes a new direct bound on the WLR applicable in general service curve network element. Extensive and systematic performance analysis of the formulae have been done, in which we found that the direct approach gives more accurate bound in several cases. We illustrate this analysis through some numerical examples.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540258094</identifier><identifier>ISBN: 3540258094</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540320173</identifier><identifier>EISBN: 3540320172</identifier><identifier>DOI: 10.1007/11422778_58</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; resource estimation ; Scheduling ; Software ; statistical multiplexing</subject><ispartof>Lecture notes in computer science, 2005, p.718-729</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11422778_58$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11422778_58$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16895212$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Boutaba, Raouf</contributor><contributor>Black, James P.</contributor><contributor>Almeroth, Kevin</contributor><contributor>Puigjaner, Ramon</contributor><contributor>Shen, Sherman</contributor><creatorcontrib>Bíró, József J.</creatorcontrib><creatorcontrib>Gulyás, András</creatorcontrib><creatorcontrib>Heszberger, Zalán</creatorcontrib><title>A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems</title><title>Lecture notes in computer science</title><description>The workload loss ratio (WLR) is a key quantity from the point of Quality of Service (QoS) provisioning in packet-based communication, hence it’s estimation is an important issue. The existing results in the area of WLR approximation usually interpret the workload loss as a product of some well assessable quantities. We call this approach as the indirect approximation of the WLR. The drawback of this approach is that each estimation has an error and the product of these errors could result in a highly inaccurate bound. This work deals with the upper approximation of the workload loss ratio based on it’s original definition and proposes a new direct bound on the WLR applicable in general service curve network element. Extensive and systematic performance analysis of the formulae have been done, in which we found that the direct approach gives more accurate bound in several cases. We illustrate this analysis through some numerical examples.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>resource estimation</subject><subject>Scheduling</subject><subject>Software</subject><subject>statistical multiplexing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540258094</isbn><isbn>3540258094</isbn><isbn>9783540320173</isbn><isbn>3540320172</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNpNkD1PwzAYhM2XRFQ68Qe8MDAE_PojtsdSoCBVIAGFMXIdG4WmcWQHRP89qYoQt9zwnE6nQ-gUyAUQIi8BOKVSqlKoPTTWUjHBCaMEJNtHGRQAOWNcH_wxKhTR_BBlhBGaa8nZMRqn9EEGMdDAaIZeJ_ghfLkGX9fR2R4vus5FPOm6GL7rtenr0GIfIn4LcdUEU-F5SAk_bQGuWzxzrYumwVef3rvoKvy8Sb1bpxN05E2T3PjXR2hxe_Myvcvnj7P76WSed1QUfe4k4Z5XVeG1JIWVEpxfeqOEsLrywhaFGhCnynCtFThKvLLSWi6tpkYyNkJnu97OJGsaH01r61R2cdgeNyUUSgsKdMid73JpQO27i-UyhFUqgZTbb8t_37IftP9ljA</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Bíró, József J.</creator><creator>Gulyás, András</creator><creator>Heszberger, Zalán</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems</title><author>Bíró, József J. ; Gulyás, András ; Heszberger, Zalán</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p256t-e704f4dd6f9706c771efbfa855c9df5c6686f9428a49981e20f8c7cc47c92a733</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>resource estimation</topic><topic>Scheduling</topic><topic>Software</topic><topic>statistical multiplexing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bíró, József J.</creatorcontrib><creatorcontrib>Gulyás, András</creatorcontrib><creatorcontrib>Heszberger, Zalán</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bíró, József J.</au><au>Gulyás, András</au><au>Heszberger, Zalán</au><au>Boutaba, Raouf</au><au>Black, James P.</au><au>Almeroth, Kevin</au><au>Puigjaner, Ramon</au><au>Shen, Sherman</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>718</spage><epage>729</epage><pages>718-729</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540258094</isbn><isbn>3540258094</isbn><eisbn>9783540320173</eisbn><eisbn>3540320172</eisbn><abstract>The workload loss ratio (WLR) is a key quantity from the point of Quality of Service (QoS) provisioning in packet-based communication, hence it’s estimation is an important issue. The existing results in the area of WLR approximation usually interpret the workload loss as a product of some well assessable quantities. We call this approach as the indirect approximation of the WLR. The drawback of this approach is that each estimation has an error and the product of these errors could result in a highly inaccurate bound. This work deals with the upper approximation of the workload loss ratio based on it’s original definition and proposes a new direct bound on the WLR applicable in general service curve network element. Extensive and systematic performance analysis of the formulae have been done, in which we found that the direct approach gives more accurate bound in several cases. We illustrate this analysis through some numerical examples.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11422778_58</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Lecture notes in computer science, 2005, p.718-729 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_16895212 |
source | Springer Books |
subjects | Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology resource estimation Scheduling Software statistical multiplexing |
title | A Novel Direct Upper Approximation for Workload Loss Ratio in General Buffered Systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-15T17%3A25%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=A%20Novel%20Direct%20Upper%20Approximation%20for%20Workload%20Loss%20Ratio%20in%20General%20Buffered%20Systems&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=B%C3%ADr%C3%B3,%20J%C3%B3zsef%20J.&rft.date=2005&rft.spage=718&rft.epage=729&rft.pages=718-729&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540258094&rft.isbn_list=3540258094&rft_id=info:doi/10.1007/11422778_58&rft_dat=%3Cpascalfrancis_sprin%3E16895212%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540320173&rft.eisbn_list=3540320172&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |