Admission control for statistical QoS: theory and practice
In networks that support quality of service, an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks because it determi...
Gespeichert in:
Veröffentlicht in: | IEEE network 1999-03, Vol.13 (2), p.20-29 |
---|---|
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 | 29 |
---|---|
container_issue | 2 |
container_start_page | 20 |
container_title | IEEE network |
container_volume | 13 |
creator | Knightly, E.W. Shroff, N.B. |
description | In networks that support quality of service, an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks because it determines the extent to which network resources are utilized and whether the promised QoS parameters are actually delivered. The goals in this article are threefold. First, we describe and classify a broad set of proposed admission control algorithms. Second, we evaluate the accuracy of these algorithms via experiments using both on-off sources and long traces of compressed video; we compare the admissible regions and QoS parameters predicted by our implementations of the algorithms with those obtained from trace-driven simulations. Finally, we identify the key aspects of an admission control algorithm necessary for achieving a high degree of accuracy and hence a high statistical multiplexing gain. |
doi_str_mv | 10.1109/65.768485 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_65_768485</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>768485</ieee_id><sourcerecordid>26911521</sourcerecordid><originalsourceid>FETCH-LOGICAL-c462t-ac7d206a8e05b3cd1379f3a44fff745819985e0d26381dd38e97e07926b7befa3</originalsourceid><addsrcrecordid>eNqF0b9LAzEUB_AgCtbq4Op0OCgOV_PyO91K8RcURFRwC2kuh1eul5pch_73prQ4OOj0hvfhy_uB0DngEQDWt4KPpFBM8QM0AM5VCVx8HKIBVhqXCjN2jE5SWmAMjFMyQONJtWxSakJXuND1MbRFHWKRets3qW-cbYuX8Dou-k8f4qawXVWsonW540_RUW3b5M_2dYje7-_epo_l7PnhaTqZlY4J0pfWyYpgYZXHfE5dBVTqmlrG6rqWjCvQWnGPKyKogqqiymvpsdREzOXc15YO0fUudxXD19qn3uSJnW9b2_mwTkbnBMAEaJZXf0qipCKg4H8oNAAnW3j5Cy7COnZ5XUMI5fnSlGR0s0MuhpSir80qNksbNwaw2X7FCG52X8n2Ymcb7_2P2ze_AeLehUk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>223568432</pqid></control><display><type>article</type><title>Admission control for statistical QoS: theory and practice</title><source>IEEE Electronic Library (IEL)</source><creator>Knightly, E.W. ; Shroff, N.B.</creator><creatorcontrib>Knightly, E.W. ; Shroff, N.B.</creatorcontrib><description>In networks that support quality of service, an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks because it determines the extent to which network resources are utilized and whether the promised QoS parameters are actually delivered. The goals in this article are threefold. First, we describe and classify a broad set of proposed admission control algorithms. Second, we evaluate the accuracy of these algorithms via experiments using both on-off sources and long traces of compressed video; we compare the admissible regions and QoS parameters predicted by our implementations of the algorithms with those obtained from trace-driven simulations. Finally, we identify the key aspects of an admission control algorithm necessary for achieving a high degree of accuracy and hence a high statistical multiplexing gain.</description><identifier>ISSN: 0890-8044</identifier><identifier>EISSN: 1558-156X</identifier><identifier>DOI: 10.1109/65.768485</identifier><identifier>CODEN: IENEET</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Admission control ; Algorithm design and analysis ; Algorithms ; Bandwidth ; Classification ; Communication system traffic control ; Compressed ; Computer networks ; Computer simulation ; Delay effects ; Gain ; Multiplexing ; Networks ; Predictive models ; Probability ; Quality of service ; Statistical analysis ; Traffic control</subject><ispartof>IEEE network, 1999-03, Vol.13 (2), p.20-29</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 1999</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c462t-ac7d206a8e05b3cd1379f3a44fff745819985e0d26381dd38e97e07926b7befa3</citedby><cites>FETCH-LOGICAL-c462t-ac7d206a8e05b3cd1379f3a44fff745819985e0d26381dd38e97e07926b7befa3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/768485$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/768485$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Knightly, E.W.</creatorcontrib><creatorcontrib>Shroff, N.B.</creatorcontrib><title>Admission control for statistical QoS: theory and practice</title><title>IEEE network</title><addtitle>NET-M</addtitle><description>In networks that support quality of service, an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks because it determines the extent to which network resources are utilized and whether the promised QoS parameters are actually delivered. The goals in this article are threefold. First, we describe and classify a broad set of proposed admission control algorithms. Second, we evaluate the accuracy of these algorithms via experiments using both on-off sources and long traces of compressed video; we compare the admissible regions and QoS parameters predicted by our implementations of the algorithms with those obtained from trace-driven simulations. Finally, we identify the key aspects of an admission control algorithm necessary for achieving a high degree of accuracy and hence a high statistical multiplexing gain.</description><subject>Admission control</subject><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Bandwidth</subject><subject>Classification</subject><subject>Communication system traffic control</subject><subject>Compressed</subject><subject>Computer networks</subject><subject>Computer simulation</subject><subject>Delay effects</subject><subject>Gain</subject><subject>Multiplexing</subject><subject>Networks</subject><subject>Predictive models</subject><subject>Probability</subject><subject>Quality of service</subject><subject>Statistical analysis</subject><subject>Traffic control</subject><issn>0890-8044</issn><issn>1558-156X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqF0b9LAzEUB_AgCtbq4Op0OCgOV_PyO91K8RcURFRwC2kuh1eul5pch_73prQ4OOj0hvfhy_uB0DngEQDWt4KPpFBM8QM0AM5VCVx8HKIBVhqXCjN2jE5SWmAMjFMyQONJtWxSakJXuND1MbRFHWKRets3qW-cbYuX8Dou-k8f4qawXVWsonW540_RUW3b5M_2dYje7-_epo_l7PnhaTqZlY4J0pfWyYpgYZXHfE5dBVTqmlrG6rqWjCvQWnGPKyKogqqiymvpsdREzOXc15YO0fUudxXD19qn3uSJnW9b2_mwTkbnBMAEaJZXf0qipCKg4H8oNAAnW3j5Cy7COnZ5XUMI5fnSlGR0s0MuhpSir80qNksbNwaw2X7FCG52X8n2Ymcb7_2P2ze_AeLehUk</recordid><startdate>19990301</startdate><enddate>19990301</enddate><creator>Knightly, E.W.</creator><creator>Shroff, N.B.</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>19990301</creationdate><title>Admission control for statistical QoS: theory and practice</title><author>Knightly, E.W. ; Shroff, N.B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c462t-ac7d206a8e05b3cd1379f3a44fff745819985e0d26381dd38e97e07926b7befa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Admission control</topic><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Bandwidth</topic><topic>Classification</topic><topic>Communication system traffic control</topic><topic>Compressed</topic><topic>Computer networks</topic><topic>Computer simulation</topic><topic>Delay effects</topic><topic>Gain</topic><topic>Multiplexing</topic><topic>Networks</topic><topic>Predictive models</topic><topic>Probability</topic><topic>Quality of service</topic><topic>Statistical analysis</topic><topic>Traffic control</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Knightly, E.W.</creatorcontrib><creatorcontrib>Shroff, N.B.</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 network</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Knightly, E.W.</au><au>Shroff, N.B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Admission control for statistical QoS: theory and practice</atitle><jtitle>IEEE network</jtitle><stitle>NET-M</stitle><date>1999-03-01</date><risdate>1999</risdate><volume>13</volume><issue>2</issue><spage>20</spage><epage>29</epage><pages>20-29</pages><issn>0890-8044</issn><eissn>1558-156X</eissn><coden>IENEET</coden><abstract>In networks that support quality of service, an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks because it determines the extent to which network resources are utilized and whether the promised QoS parameters are actually delivered. The goals in this article are threefold. First, we describe and classify a broad set of proposed admission control algorithms. Second, we evaluate the accuracy of these algorithms via experiments using both on-off sources and long traces of compressed video; we compare the admissible regions and QoS parameters predicted by our implementations of the algorithms with those obtained from trace-driven simulations. Finally, we identify the key aspects of an admission control algorithm necessary for achieving a high degree of accuracy and hence a high statistical multiplexing gain.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/65.768485</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0890-8044 |
ispartof | IEEE network, 1999-03, Vol.13 (2), p.20-29 |
issn | 0890-8044 1558-156X |
language | eng |
recordid | cdi_crossref_primary_10_1109_65_768485 |
source | IEEE Electronic Library (IEL) |
subjects | Admission control Algorithm design and analysis Algorithms Bandwidth Classification Communication system traffic control Compressed Computer networks Computer simulation Delay effects Gain Multiplexing Networks Predictive models Probability Quality of service Statistical analysis Traffic control |
title | Admission control for statistical QoS: theory and practice |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T16%3A55%3A21IST&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=Admission%20control%20for%20statistical%20QoS:%20theory%20and%20practice&rft.jtitle=IEEE%20network&rft.au=Knightly,%20E.W.&rft.date=1999-03-01&rft.volume=13&rft.issue=2&rft.spage=20&rft.epage=29&rft.pages=20-29&rft.issn=0890-8044&rft.eissn=1558-156X&rft.coden=IENEET&rft_id=info:doi/10.1109/65.768485&rft_dat=%3Cproquest_RIE%3E26911521%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=223568432&rft_id=info:pmid/&rft_ieee_id=768485&rfr_iscdi=true |