Loading…
Congestion in large balanced multirate links
In this paper we obtain approximations for various performance measures in a multirate link sharing bandwidth under an insensitive sharing mechanism called balanced fairness. Balanced fairness can be viewed as the large system limit of proportional fairness. For a large system, we obtain closed form...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference Proceeding |
| Language: | English |
| Subjects: | |
| Online Access: | Request full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | |
|---|---|
| cites | |
| container_end_page | 189 |
| container_issue | |
| container_start_page | 182 |
| container_title | |
| container_volume | |
| creator | Bonald, Thomas Haddad, Jean-Paul Mazumdar, Ravi R. |
| description | In this paper we obtain approximations for various performance measures in a multirate link sharing bandwidth under an insensitive sharing mechanism called balanced fairness. Balanced fairness can be viewed as the large system limit of proportional fairness. For a large system, we obtain closed form expressions for the calculation of long run fraction of time that the system is congested, the probability that an arriving flow will not obtain its maximum bit rate and the average fraction of time that an arriving flow is not allocated its maximum bit rate while in the system. The techniques are based on local limit theorems for convolution measures. |
| doi_str_mv | 10.5555/2043468.2043498 |
| format | conference_proceeding |
| fullrecord | <record><control><sourceid>acm_6IE</sourceid><recordid>TN_cdi_ieee_primary_6038480</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6038480</ieee_id><sourcerecordid>acm_books_10_5555_2043468_2043498</sourcerecordid><originalsourceid>FETCH-LOGICAL-a162t-357125bda42a50931d8de8b5605e8ca638abbe38d599096ad0da6d898edcf44c3</originalsourceid><addsrcrecordid>eNqNkDtPxDAQhI0QEnBcTUGTkoKEdRybdYkiDpBOooHaWsebk7k8UBIK_j2BS0HJNKPZ0WzxCXEpIdOzbnMoVGEw-3WLR-IcLCqTowI4_htOxXoc3wFASoXz-UzclH2343GKfZfELmlo2HHiqaGu4pC0n80UB5o4aWK3Hy_ESU3NyOvFV-Jt8_BaPqXbl8fn8n6bkjT5lCp9J3PtAxU5abBKBgyMXhvQjBUZheQ9KwzaWrCGAgQyAS1yqOqiqNRKXB3-RmZ2H0NsafhyBhQWCHObHVqqWuf7fj86Ce4HhFtAuAWE80Pkeh5c_3OgvgE491rR</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Congestion in large balanced multirate links</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bonald, Thomas ; Haddad, Jean-Paul ; Mazumdar, Ravi R.</creator><creatorcontrib>Bonald, Thomas ; Haddad, Jean-Paul ; Mazumdar, Ravi R.</creatorcontrib><description>In this paper we obtain approximations for various performance measures in a multirate link sharing bandwidth under an insensitive sharing mechanism called balanced fairness. Balanced fairness can be viewed as the large system limit of proportional fairness. For a large system, we obtain closed form expressions for the calculation of long run fraction of time that the system is congested, the probability that an arriving flow will not obtain its maximum bit rate and the average fraction of time that an arriving flow is not allocated its maximum bit rate while in the system. The techniques are based on local limit theorems for convolution measures.</description><identifier>ISBN: 0983628300</identifier><identifier>ISBN: 9780983628309</identifier><identifier>ISBN: 1457711877</identifier><identifier>ISBN: 9781457711879</identifier><identifier>EISBN: 0983628300</identifier><identifier>EISBN: 9780983628309</identifier><identifier>DOI: 10.5555/2043468.2043498</identifier><language>eng</language><publisher>International Teletraffic Congress</publisher><subject>balanced fairness ; Bandwidth ; Bismuth ; Bit rate ; Computer systems organization -- Dependable and fault-tolerant systems and networks ; congestion ; Context ; Electronic mail ; flow-level models ; General and reference -- Cross-computing tools and techniques -- Performance ; Hardware -- Communication hardware, interfaces and storage ; insensitivity ; large system scaling ; Multirate systems ; Networks ; Networks -- Network performance evaluation ; Networks -- Network services ; Probability</subject><ispartof>2011 23rd International Teletraffic Congress (ITC), 2011, p.182-189</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6038480$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6038480$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bonald, Thomas</creatorcontrib><creatorcontrib>Haddad, Jean-Paul</creatorcontrib><creatorcontrib>Mazumdar, Ravi R.</creatorcontrib><title>Congestion in large balanced multirate links</title><title>2011 23rd International Teletraffic Congress (ITC)</title><addtitle>ITC</addtitle><description>In this paper we obtain approximations for various performance measures in a multirate link sharing bandwidth under an insensitive sharing mechanism called balanced fairness. Balanced fairness can be viewed as the large system limit of proportional fairness. For a large system, we obtain closed form expressions for the calculation of long run fraction of time that the system is congested, the probability that an arriving flow will not obtain its maximum bit rate and the average fraction of time that an arriving flow is not allocated its maximum bit rate while in the system. The techniques are based on local limit theorems for convolution measures.</description><subject>balanced fairness</subject><subject>Bandwidth</subject><subject>Bismuth</subject><subject>Bit rate</subject><subject>Computer systems organization -- Dependable and fault-tolerant systems and networks</subject><subject>congestion</subject><subject>Context</subject><subject>Electronic mail</subject><subject>flow-level models</subject><subject>General and reference -- Cross-computing tools and techniques -- Performance</subject><subject>Hardware -- Communication hardware, interfaces and storage</subject><subject>insensitivity</subject><subject>large system scaling</subject><subject>Multirate systems</subject><subject>Networks</subject><subject>Networks -- Network performance evaluation</subject><subject>Networks -- Network services</subject><subject>Probability</subject><isbn>0983628300</isbn><isbn>9780983628309</isbn><isbn>1457711877</isbn><isbn>9781457711879</isbn><isbn>0983628300</isbn><isbn>9780983628309</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNqNkDtPxDAQhI0QEnBcTUGTkoKEdRybdYkiDpBOooHaWsebk7k8UBIK_j2BS0HJNKPZ0WzxCXEpIdOzbnMoVGEw-3WLR-IcLCqTowI4_htOxXoc3wFASoXz-UzclH2343GKfZfELmlo2HHiqaGu4pC0n80UB5o4aWK3Hy_ESU3NyOvFV-Jt8_BaPqXbl8fn8n6bkjT5lCp9J3PtAxU5abBKBgyMXhvQjBUZheQ9KwzaWrCGAgQyAS1yqOqiqNRKXB3-RmZ2H0NsafhyBhQWCHObHVqqWuf7fj86Ce4HhFtAuAWE80Pkeh5c_3OgvgE491rR</recordid><startdate>20110906</startdate><enddate>20110906</enddate><creator>Bonald, Thomas</creator><creator>Haddad, Jean-Paul</creator><creator>Mazumdar, Ravi R.</creator><general>International Teletraffic Congress</general><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20110906</creationdate><title>Congestion in large balanced multirate links</title><author>Bonald, Thomas ; Haddad, Jean-Paul ; Mazumdar, Ravi R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a162t-357125bda42a50931d8de8b5605e8ca638abbe38d599096ad0da6d898edcf44c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>balanced fairness</topic><topic>Bandwidth</topic><topic>Bismuth</topic><topic>Bit rate</topic><topic>Computer systems organization -- Dependable and fault-tolerant systems and networks</topic><topic>congestion</topic><topic>Context</topic><topic>Electronic mail</topic><topic>flow-level models</topic><topic>General and reference -- Cross-computing tools and techniques -- Performance</topic><topic>Hardware -- Communication hardware, interfaces and storage</topic><topic>insensitivity</topic><topic>large system scaling</topic><topic>Multirate systems</topic><topic>Networks</topic><topic>Networks -- Network performance evaluation</topic><topic>Networks -- Network services</topic><topic>Probability</topic><toplevel>online_resources</toplevel><creatorcontrib>Bonald, Thomas</creatorcontrib><creatorcontrib>Haddad, Jean-Paul</creatorcontrib><creatorcontrib>Mazumdar, Ravi R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bonald, Thomas</au><au>Haddad, Jean-Paul</au><au>Mazumdar, Ravi R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Congestion in large balanced multirate links</atitle><btitle>2011 23rd International Teletraffic Congress (ITC)</btitle><stitle>ITC</stitle><date>2011-09-06</date><risdate>2011</risdate><spage>182</spage><epage>189</epage><pages>182-189</pages><isbn>0983628300</isbn><isbn>9780983628309</isbn><isbn>1457711877</isbn><isbn>9781457711879</isbn><eisbn>0983628300</eisbn><eisbn>9780983628309</eisbn><abstract>In this paper we obtain approximations for various performance measures in a multirate link sharing bandwidth under an insensitive sharing mechanism called balanced fairness. Balanced fairness can be viewed as the large system limit of proportional fairness. For a large system, we obtain closed form expressions for the calculation of long run fraction of time that the system is congested, the probability that an arriving flow will not obtain its maximum bit rate and the average fraction of time that an arriving flow is not allocated its maximum bit rate while in the system. The techniques are based on local limit theorems for convolution measures.</abstract><pub>International Teletraffic Congress</pub><doi>10.5555/2043468.2043498</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0983628300 |
| ispartof | 2011 23rd International Teletraffic Congress (ITC), 2011, p.182-189 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_6038480 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | balanced fairness Bandwidth Bismuth Bit rate Computer systems organization -- Dependable and fault-tolerant systems and networks congestion Context Electronic mail flow-level models General and reference -- Cross-computing tools and techniques -- Performance Hardware -- Communication hardware, interfaces and storage insensitivity large system scaling Multirate systems Networks Networks -- Network performance evaluation Networks -- Network services Probability |
| title | Congestion in large balanced multirate links |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T12%3A28%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Congestion%20in%20large%20balanced%20multirate%20links&rft.btitle=2011%2023rd%20International%20Teletraffic%20Congress%20(ITC)&rft.au=Bonald,%20Thomas&rft.date=2011-09-06&rft.spage=182&rft.epage=189&rft.pages=182-189&rft.isbn=0983628300&rft.isbn_list=9780983628309&rft.isbn_list=1457711877&rft.isbn_list=9781457711879&rft_id=info:doi/10.5555/2043468.2043498&rft.eisbn=0983628300&rft.eisbn_list=9780983628309&rft_dat=%3Cacm_6IE%3Eacm_books_10_5555_2043468_2043498%3C/acm_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a162t-357125bda42a50931d8de8b5605e8ca638abbe38d599096ad0da6d898edcf44c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6038480&rfr_iscdi=true |