Optimal call admission control on a single link with a GPS scheduler
The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimizati...
Gespeichert in:
| Veröffentlicht in: | IEEE/ACM transactions on networking 2004-10, Vol.12 (5), p.865-878 |
|---|---|
| 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 | 878 |
|---|---|
| container_issue | 5 |
| container_start_page | 865 |
| container_title | IEEE/ACM transactions on networking |
| container_volume | 12 |
| creator | Panagakis, A. Dukkipati, N. Stavrakakis, I. Kuri, J. |
| description | The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process, a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme. |
| doi_str_mv | 10.1109/TNET.2004.836133 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_1344009</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1344009</ieee_id><sourcerecordid>29006559</sourcerecordid><originalsourceid>FETCH-LOGICAL-c455t-e21086b1d0dc45b0c29885e894711d26642e978eb4682700f1dc130b4258e6fa3</originalsourceid><addsrcrecordid>eNqNkU1Lw0AQhoMoWKt3wUvwoKfU2a_J7lFqrUKxgvW85GNjU7dJzSaI_94NEQQP6mmG4ZlheJ8gOCUwIQTU1ephtppQAD6RDAlje8GICCEjKhD3fQ_IIkRFD4Mj5zYAhAHFUXCz3LXlNrFhllgbJvm2dK6sqzCrq7apbejbJHRl9WJNaMvqNXwv27UfzR-fQpetTd5Z0xwHB0VinTn5quPg-Xa2mt5Fi-X8fnq9iDIuRBsZSkBiSnLI_SCFjCophZGKx4TkFJFTo2JpUo6SxgAFyTP_ZsqpkAaLhI2Dy-HurqnfOuNa7d_NjLVJZerOaQUEkQkWe_LiV5IqABRC_QsUQvC_QSkYAu3B8x_gpu6ayueiKY196nGMHoIBypraucYUetd4Dc2HJqB7n7r3qXufevDpV86GldIY840zzgEU-wQc4Zg8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>227302776</pqid></control><display><type>article</type><title>Optimal call admission control on a single link with a GPS scheduler</title><source>IEEE Electronic Library (IEL)</source><creator>Panagakis, A. ; Dukkipati, N. ; Stavrakakis, I. ; Kuri, J.</creator><creatorcontrib>Panagakis, A. ; Dukkipati, N. ; Stavrakakis, I. ; Kuri, J.</creatorcontrib><description>The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process, a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2004.836133</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Admission control ; Algorithms ; Bandwidth ; Call admission control ; Communications networks ; Delay ; Global Positioning System ; Mathematical models ; Optimization ; Optimization techniques ; Processor scheduling ; Quality of service ; Resource management ; Satellite navigation systems ; Stochastic processes ; Studies ; Telecommunication traffic ; Traffic control ; Traffic engineering ; Traffic flow</subject><ispartof>IEEE/ACM transactions on networking, 2004-10, Vol.12 (5), p.865-878</ispartof><rights>Copyright Association for Computing Machinery Oct 2004</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c455t-e21086b1d0dc45b0c29885e894711d26642e978eb4682700f1dc130b4258e6fa3</citedby><cites>FETCH-LOGICAL-c455t-e21086b1d0dc45b0c29885e894711d26642e978eb4682700f1dc130b4258e6fa3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1344009$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1344009$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Panagakis, A.</creatorcontrib><creatorcontrib>Dukkipati, N.</creatorcontrib><creatorcontrib>Stavrakakis, I.</creatorcontrib><creatorcontrib>Kuri, J.</creatorcontrib><title>Optimal call admission control on a single link with a GPS scheduler</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process, a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme.</description><subject>Admission control</subject><subject>Algorithms</subject><subject>Bandwidth</subject><subject>Call admission control</subject><subject>Communications networks</subject><subject>Delay</subject><subject>Global Positioning System</subject><subject>Mathematical models</subject><subject>Optimization</subject><subject>Optimization techniques</subject><subject>Processor scheduling</subject><subject>Quality of service</subject><subject>Resource management</subject><subject>Satellite navigation systems</subject><subject>Stochastic processes</subject><subject>Studies</subject><subject>Telecommunication traffic</subject><subject>Traffic control</subject><subject>Traffic engineering</subject><subject>Traffic flow</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqNkU1Lw0AQhoMoWKt3wUvwoKfU2a_J7lFqrUKxgvW85GNjU7dJzSaI_94NEQQP6mmG4ZlheJ8gOCUwIQTU1ephtppQAD6RDAlje8GICCEjKhD3fQ_IIkRFD4Mj5zYAhAHFUXCz3LXlNrFhllgbJvm2dK6sqzCrq7apbejbJHRl9WJNaMvqNXwv27UfzR-fQpetTd5Z0xwHB0VinTn5quPg-Xa2mt5Fi-X8fnq9iDIuRBsZSkBiSnLI_SCFjCophZGKx4TkFJFTo2JpUo6SxgAFyTP_ZsqpkAaLhI2Dy-HurqnfOuNa7d_NjLVJZerOaQUEkQkWe_LiV5IqABRC_QsUQvC_QSkYAu3B8x_gpu6ayueiKY196nGMHoIBypraucYUetd4Dc2HJqB7n7r3qXufevDpV86GldIY840zzgEU-wQc4Zg8</recordid><startdate>20041001</startdate><enddate>20041001</enddate><creator>Panagakis, A.</creator><creator>Dukkipati, N.</creator><creator>Stavrakakis, I.</creator><creator>Kuri, J.</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>H8D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20041001</creationdate><title>Optimal call admission control on a single link with a GPS scheduler</title><author>Panagakis, A. ; Dukkipati, N. ; Stavrakakis, I. ; Kuri, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c455t-e21086b1d0dc45b0c29885e894711d26642e978eb4682700f1dc130b4258e6fa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Admission control</topic><topic>Algorithms</topic><topic>Bandwidth</topic><topic>Call admission control</topic><topic>Communications networks</topic><topic>Delay</topic><topic>Global Positioning System</topic><topic>Mathematical models</topic><topic>Optimization</topic><topic>Optimization techniques</topic><topic>Processor scheduling</topic><topic>Quality of service</topic><topic>Resource management</topic><topic>Satellite navigation systems</topic><topic>Stochastic processes</topic><topic>Studies</topic><topic>Telecommunication traffic</topic><topic>Traffic control</topic><topic>Traffic engineering</topic><topic>Traffic flow</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Panagakis, A.</creatorcontrib><creatorcontrib>Dukkipati, N.</creatorcontrib><creatorcontrib>Stavrakakis, I.</creatorcontrib><creatorcontrib>Kuri, J.</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>Aerospace Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Panagakis, A.</au><au>Dukkipati, N.</au><au>Stavrakakis, I.</au><au>Kuri, J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal call admission control on a single link with a GPS scheduler</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2004-10-01</date><risdate>2004</risdate><volume>12</volume><issue>5</issue><spage>865</spage><epage>878</epage><pages>865-878</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process, a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2004.836133</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6692 |
| ispartof | IEEE/ACM transactions on networking, 2004-10, Vol.12 (5), p.865-878 |
| issn | 1063-6692 1558-2566 |
| language | eng |
| recordid | cdi_ieee_primary_1344009 |
| source | IEEE Electronic Library (IEL) |
| subjects | Admission control Algorithms Bandwidth Call admission control Communications networks Delay Global Positioning System Mathematical models Optimization Optimization techniques Processor scheduling Quality of service Resource management Satellite navigation systems Stochastic processes Studies Telecommunication traffic Traffic control Traffic engineering Traffic flow |
| title | Optimal call admission control on a single link with a GPS scheduler |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T00%3A28%3A15IST&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=Optimal%20call%20admission%20control%20on%20a%20single%20link%20with%20a%20GPS%20scheduler&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Panagakis,%20A.&rft.date=2004-10-01&rft.volume=12&rft.issue=5&rft.spage=865&rft.epage=878&rft.pages=865-878&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2004.836133&rft_dat=%3Cproquest_RIE%3E29006559%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=227302776&rft_id=info:pmid/&rft_ieee_id=1344009&rfr_iscdi=true |