Non-convex optimization and rate control for multi-class services in the Internet
In this paper, we investigate the problem of distributively allocating transmission data rates to users in the Internet. We allow users to have concave as well as sigmoidal utility functions as appropriate for different applications. In the literature, for simplicity, most works have dealt only with...
Gespeichert in:
| Veröffentlicht in: | IEEE/ACM transactions on networking 2005-08, Vol.13 (4), p.827-840 |
|---|---|
| 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 | 840 |
|---|---|
| container_issue | 4 |
| container_start_page | 827 |
| container_title | IEEE/ACM transactions on networking |
| container_volume | 13 |
| creator | Lee, J.-W. Mazumdar, R.R. Shroff, N.B. |
| description | In this paper, we investigate the problem of distributively allocating transmission data rates to users in the Internet. We allow users to have concave as well as sigmoidal utility functions as appropriate for different applications. In the literature, for simplicity, most works have dealt only with the concave utility function. However, we show that applying rate control algorithms developed for concave utility functions in a more realistic setting (with both concave and sigmoidal types of utility functions) could lead to instability and high network congestion. We show that a pricing-based mechanism that solves the dual formulation can be developed based on the theory of subdifferentials with the property that the prices "self-regulate" the users to access the resources based on the net utility. We discuss convergence issues and show that an algorithm can be developed that is efficient in the sense of achieving the global optimum when there are many users. |
| doi_str_mv | 10.1109/TNET.2005.852876 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_227292701</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1498818</ieee_id><sourcerecordid>28065482</sourcerecordid><originalsourceid>FETCH-LOGICAL-c480t-7b70b5ce3e56f733130487687beebce1b76eeae7aad183d469b8efa77bab0d9e3</originalsourceid><addsrcrecordid>eNqNkcFLwzAUxoMoOKd3wUvw4K0zSdskPcqYOhgTYZ5D2r5iRpfMJB3qX29LBcHTTu_B-733Pr4PoWtKZpSS4n6zXmxmjJB8JnMmBT9BE5rnMmE556d9T3iacF6wc3QRwpYQmhLGJ-h17WxSOXuAT-z20ezMt47GWaxtjb2OgPth9K7FjfN417XRJFWrQ8AB_MFUELCxOL4DXtoI3kK8RGeNbgNc_dYpentcbObPyerlaTl_WCVVJklMRClImVeQQs4bkaa9nqyXLUUJUFZAS8EBNAitayrTOuNFKaHRQpS6JHUB6RTdjXf33n10EKLamVBB22oLrguKyUIQnmdHgEKKjNIjwF6eJOwIcHgsB_D2H7h1nbe9LYoxwQomyPCWjFDlXQgeGrX3Zqf9l6JEDdmqIVs1ZKvGbPuVm3HFAMAfnhVS9mb9AGlPoEw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>227292701</pqid></control><display><type>article</type><title>Non-convex optimization and rate control for multi-class services in the Internet</title><source>IEEE Electronic Library (IEL)</source><creator>Lee, J.-W. ; Mazumdar, R.R. ; Shroff, N.B.</creator><creatorcontrib>Lee, J.-W. ; Mazumdar, R.R. ; Shroff, N.B.</creatorcontrib><description>In this paper, we investigate the problem of distributively allocating transmission data rates to users in the Internet. We allow users to have concave as well as sigmoidal utility functions as appropriate for different applications. In the literature, for simplicity, most works have dealt only with the concave utility function. However, we show that applying rate control algorithms developed for concave utility functions in a more realistic setting (with both concave and sigmoidal types of utility functions) could lead to instability and high network congestion. We show that a pricing-based mechanism that solves the dual formulation can be developed based on the theory of subdifferentials with the property that the prices "self-regulate" the users to access the resources based on the net utility. We discuss convergence issues and show that an algorithm can be developed that is efficient in the sense of achieving the global optimum when there are many users.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2005.852876</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Control algorithms ; Convergence ; Degradation ; Delay ; Elasticity ; Internet ; IP networks ; Mechanical factors ; non-concave utility function ; non-convex optimization ; Optimization ; Quality of service ; Rate control ; Shape ; Streaming media ; Studies ; Utility functions ; Web and internet services</subject><ispartof>IEEE/ACM transactions on networking, 2005-08, Vol.13 (4), p.827-840</ispartof><rights>Copyright Association for Computing Machinery Aug 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c480t-7b70b5ce3e56f733130487687beebce1b76eeae7aad183d469b8efa77bab0d9e3</citedby><cites>FETCH-LOGICAL-c480t-7b70b5ce3e56f733130487687beebce1b76eeae7aad183d469b8efa77bab0d9e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1498818$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1498818$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lee, J.-W.</creatorcontrib><creatorcontrib>Mazumdar, R.R.</creatorcontrib><creatorcontrib>Shroff, N.B.</creatorcontrib><title>Non-convex optimization and rate control for multi-class services in the Internet</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>In this paper, we investigate the problem of distributively allocating transmission data rates to users in the Internet. We allow users to have concave as well as sigmoidal utility functions as appropriate for different applications. In the literature, for simplicity, most works have dealt only with the concave utility function. However, we show that applying rate control algorithms developed for concave utility functions in a more realistic setting (with both concave and sigmoidal types of utility functions) could lead to instability and high network congestion. We show that a pricing-based mechanism that solves the dual formulation can be developed based on the theory of subdifferentials with the property that the prices "self-regulate" the users to access the resources based on the net utility. We discuss convergence issues and show that an algorithm can be developed that is efficient in the sense of achieving the global optimum when there are many users.</description><subject>Algorithms</subject><subject>Control algorithms</subject><subject>Convergence</subject><subject>Degradation</subject><subject>Delay</subject><subject>Elasticity</subject><subject>Internet</subject><subject>IP networks</subject><subject>Mechanical factors</subject><subject>non-concave utility function</subject><subject>non-convex optimization</subject><subject>Optimization</subject><subject>Quality of service</subject><subject>Rate control</subject><subject>Shape</subject><subject>Streaming media</subject><subject>Studies</subject><subject>Utility functions</subject><subject>Web and internet services</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqNkcFLwzAUxoMoOKd3wUvw4K0zSdskPcqYOhgTYZ5D2r5iRpfMJB3qX29LBcHTTu_B-733Pr4PoWtKZpSS4n6zXmxmjJB8JnMmBT9BE5rnMmE556d9T3iacF6wc3QRwpYQmhLGJ-h17WxSOXuAT-z20ezMt47GWaxtjb2OgPth9K7FjfN417XRJFWrQ8AB_MFUELCxOL4DXtoI3kK8RGeNbgNc_dYpentcbObPyerlaTl_WCVVJklMRClImVeQQs4bkaa9nqyXLUUJUFZAS8EBNAitayrTOuNFKaHRQpS6JHUB6RTdjXf33n10EKLamVBB22oLrguKyUIQnmdHgEKKjNIjwF6eJOwIcHgsB_D2H7h1nbe9LYoxwQomyPCWjFDlXQgeGrX3Zqf9l6JEDdmqIVs1ZKvGbPuVm3HFAMAfnhVS9mb9AGlPoEw</recordid><startdate>200508</startdate><enddate>200508</enddate><creator>Lee, J.-W.</creator><creator>Mazumdar, R.R.</creator><creator>Shroff, N.B.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><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></search><sort><creationdate>200508</creationdate><title>Non-convex optimization and rate control for multi-class services in the Internet</title><author>Lee, J.-W. ; Mazumdar, R.R. ; Shroff, N.B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c480t-7b70b5ce3e56f733130487687beebce1b76eeae7aad183d469b8efa77bab0d9e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithms</topic><topic>Control algorithms</topic><topic>Convergence</topic><topic>Degradation</topic><topic>Delay</topic><topic>Elasticity</topic><topic>Internet</topic><topic>IP networks</topic><topic>Mechanical factors</topic><topic>non-concave utility function</topic><topic>non-convex optimization</topic><topic>Optimization</topic><topic>Quality of service</topic><topic>Rate control</topic><topic>Shape</topic><topic>Streaming media</topic><topic>Studies</topic><topic>Utility functions</topic><topic>Web and internet services</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lee, J.-W.</creatorcontrib><creatorcontrib>Mazumdar, R.R.</creatorcontrib><creatorcontrib>Shroff, N.B.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><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><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lee, J.-W.</au><au>Mazumdar, R.R.</au><au>Shroff, N.B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Non-convex optimization and rate control for multi-class services in the Internet</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2005-08</date><risdate>2005</risdate><volume>13</volume><issue>4</issue><spage>827</spage><epage>840</epage><pages>827-840</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>In this paper, we investigate the problem of distributively allocating transmission data rates to users in the Internet. We allow users to have concave as well as sigmoidal utility functions as appropriate for different applications. In the literature, for simplicity, most works have dealt only with the concave utility function. However, we show that applying rate control algorithms developed for concave utility functions in a more realistic setting (with both concave and sigmoidal types of utility functions) could lead to instability and high network congestion. We show that a pricing-based mechanism that solves the dual formulation can be developed based on the theory of subdifferentials with the property that the prices "self-regulate" the users to access the resources based on the net utility. We discuss convergence issues and show that an algorithm can be developed that is efficient in the sense of achieving the global optimum when there are many users.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2005.852876</doi><tpages>14</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1063-6692 |
| ispartof | IEEE/ACM transactions on networking, 2005-08, Vol.13 (4), p.827-840 |
| issn | 1063-6692 1558-2566 |
| language | eng |
| recordid | cdi_proquest_journals_227292701 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Control algorithms Convergence Degradation Delay Elasticity Internet IP networks Mechanical factors non-concave utility function non-convex optimization Optimization Quality of service Rate control Shape Streaming media Studies Utility functions Web and internet services |
| title | Non-convex optimization and rate control for multi-class services in the Internet |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T15%3A27%3A05IST&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=Non-convex%20optimization%20and%20rate%20control%20for%20multi-class%20services%20in%20the%20Internet&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Lee,%20J.-W.&rft.date=2005-08&rft.volume=13&rft.issue=4&rft.spage=827&rft.epage=840&rft.pages=827-840&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2005.852876&rft_dat=%3Cproquest_RIE%3E28065482%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=227292701&rft_id=info:pmid/&rft_ieee_id=1498818&rfr_iscdi=true |