Semi-Markov Modeling for Bandwidth Sharing of TCP Connections with Asymmetric AIMD Congestion Control

This paper presents a semi-Markov model that evaluates the performance of TCP connections with asymmetric Additive Increase and Multiplicative Decrease (AIMD) congestion control settings involved in sharing of a common drop-tail router. We study the fairness of the connections and their individual b...

Full description

Saved in:
Bibliographic Details
Main Authors: Cheng Peng Fu, Chuan Heng Foh, Chiew Tong Lau, Zhihong Man, Bu Sung Lee
Format: Conference Proceeding
Language:English
Subjects:
Analytical models
Bandwidth
Communications Society
Computer network management
Distributed algorithms
Numerical models
Propagation losses
Stochastic processes
Transport protocols
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 2018
container_issue
container_start_page 2014
container_title
container_volume
creator Cheng Peng Fu
Chuan Heng Foh
Chiew Tong Lau
Zhihong Man
Bu Sung Lee
description This paper presents a semi-Markov model that evaluates the performance of TCP connections with asymmetric Additive Increase and Multiplicative Decrease (AIMD) congestion control settings involved in sharing of a common drop-tail router. We study the fairness of the connections and their individual bandwidth utilizations as well as packet loss rates. We confirm that certain asymmetric AIMD settings may achieve fairness in bandwidth sharing. We also found that while connections with asymmetric AIMD settings operate at different bandwidth utilizations, they generally experience similar packet loss rate.
doi_str_mv 10.1109/GLOCOM.2007.386
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4411296</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4411296</ieee_id><sourcerecordid>4411296</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-e68b2f861de79454891dfdf6136c2e03648a85a8c1e043c01f9681af0343e7e13</originalsourceid><addsrcrecordid>eNpFkM1OwzAQhM2fRFs4c-DiF0jx2o5jH0sKpVKjIrVIvVUmWbeGJkFORNW3JxFInGY182m1O4TcARsDMPMwWyzTZTbmjCVjodUZGYLkUgKTQp2TAY8TFSVKbi7-A64vyQCMYFHMzeaaDJvmg7FY6hgGBFdY-iiz4bP-plld4MFXO-rqQB9tVRx90e7pam9D79aOrtNXmtZVhXnr66qhR9_lk-ZUltgGn9PJPJv2wA6bHujHNtSHG3Ll7KHB2z8dkbfnp3X6Ei2Ws3k6WUQekriNUOl37rSCAhMjuwsNFK5wCoTKOTKhpLY6tjoH7P7NGTijNFjHhBSYIIgRuf_d6xFx-xV8acNp27UA3CjxA8MlWRA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Semi-Markov Modeling for Bandwidth Sharing of TCP Connections with Asymmetric AIMD Congestion Control</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Cheng Peng Fu ; Chuan Heng Foh ; Chiew Tong Lau ; Zhihong Man ; Bu Sung Lee</creator><creatorcontrib>Cheng Peng Fu ; Chuan Heng Foh ; Chiew Tong Lau ; Zhihong Man ; Bu Sung Lee</creatorcontrib><description>This paper presents a semi-Markov model that evaluates the performance of TCP connections with asymmetric Additive Increase and Multiplicative Decrease (AIMD) congestion control settings involved in sharing of a common drop-tail router. We study the fairness of the connections and their individual bandwidth utilizations as well as packet loss rates. We confirm that certain asymmetric AIMD settings may achieve fairness in bandwidth sharing. We also found that while connections with asymmetric AIMD settings operate at different bandwidth utilizations, they generally experience similar packet loss rate.</description><identifier>ISSN: 1930-529X</identifier><identifier>ISBN: 1424410428</identifier><identifier>ISBN: 9781424410422</identifier><identifier>EISSN: 2576-764X</identifier><identifier>EISBN: 1424410436</identifier><identifier>EISBN: 9781424410439</identifier><identifier>DOI: 10.1109/GLOCOM.2007.386</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analytical models ; Bandwidth ; Communications Society ; Computer network management ; Distributed algorithms ; Numerical models ; Propagation losses ; Stochastic processes ; Transport protocols</subject><ispartof>IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference, 2007, p.2014-2018</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/4411296$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4411296$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Cheng Peng Fu</creatorcontrib><creatorcontrib>Chuan Heng Foh</creatorcontrib><creatorcontrib>Chiew Tong Lau</creatorcontrib><creatorcontrib>Zhihong Man</creatorcontrib><creatorcontrib>Bu Sung Lee</creatorcontrib><title>Semi-Markov Modeling for Bandwidth Sharing of TCP Connections with Asymmetric AIMD Congestion Control</title><title>IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference</title><addtitle>GLOCOM</addtitle><description>This paper presents a semi-Markov model that evaluates the performance of TCP connections with asymmetric Additive Increase and Multiplicative Decrease (AIMD) congestion control settings involved in sharing of a common drop-tail router. We study the fairness of the connections and their individual bandwidth utilizations as well as packet loss rates. We confirm that certain asymmetric AIMD settings may achieve fairness in bandwidth sharing. We also found that while connections with asymmetric AIMD settings operate at different bandwidth utilizations, they generally experience similar packet loss rate.</description><subject>Analytical models</subject><subject>Bandwidth</subject><subject>Communications Society</subject><subject>Computer network management</subject><subject>Distributed algorithms</subject><subject>Numerical models</subject><subject>Propagation losses</subject><subject>Stochastic processes</subject><subject>Transport protocols</subject><issn>1930-529X</issn><issn>2576-764X</issn><isbn>1424410428</isbn><isbn>9781424410422</isbn><isbn>1424410436</isbn><isbn>9781424410439</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpFkM1OwzAQhM2fRFs4c-DiF0jx2o5jH0sKpVKjIrVIvVUmWbeGJkFORNW3JxFInGY182m1O4TcARsDMPMwWyzTZTbmjCVjodUZGYLkUgKTQp2TAY8TFSVKbi7-A64vyQCMYFHMzeaaDJvmg7FY6hgGBFdY-iiz4bP-plld4MFXO-rqQB9tVRx90e7pam9D79aOrtNXmtZVhXnr66qhR9_lk-ZUltgGn9PJPJv2wA6bHujHNtSHG3Ll7KHB2z8dkbfnp3X6Ei2Ws3k6WUQekriNUOl37rSCAhMjuwsNFK5wCoTKOTKhpLY6tjoH7P7NGTijNFjHhBSYIIgRuf_d6xFx-xV8acNp27UA3CjxA8MlWRA</recordid><startdate>200711</startdate><enddate>200711</enddate><creator>Cheng Peng Fu</creator><creator>Chuan Heng Foh</creator><creator>Chiew Tong Lau</creator><creator>Zhihong Man</creator><creator>Bu Sung Lee</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200711</creationdate><title>Semi-Markov Modeling for Bandwidth Sharing of TCP Connections with Asymmetric AIMD Congestion Control</title><author>Cheng Peng Fu ; Chuan Heng Foh ; Chiew Tong Lau ; Zhihong Man ; Bu Sung Lee</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-e68b2f861de79454891dfdf6136c2e03648a85a8c1e043c01f9681af0343e7e13</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Analytical models</topic><topic>Bandwidth</topic><topic>Communications Society</topic><topic>Computer network management</topic><topic>Distributed algorithms</topic><topic>Numerical models</topic><topic>Propagation losses</topic><topic>Stochastic processes</topic><topic>Transport protocols</topic><toplevel>online_resources</toplevel><creatorcontrib>Cheng Peng Fu</creatorcontrib><creatorcontrib>Chuan Heng Foh</creatorcontrib><creatorcontrib>Chiew Tong Lau</creatorcontrib><creatorcontrib>Zhihong Man</creatorcontrib><creatorcontrib>Bu Sung Lee</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cheng Peng Fu</au><au>Chuan Heng Foh</au><au>Chiew Tong Lau</au><au>Zhihong Man</au><au>Bu Sung Lee</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Semi-Markov Modeling for Bandwidth Sharing of TCP Connections with Asymmetric AIMD Congestion Control</atitle><btitle>IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference</btitle><stitle>GLOCOM</stitle><date>2007-11</date><risdate>2007</risdate><spage>2014</spage><epage>2018</epage><pages>2014-2018</pages><issn>1930-529X</issn><eissn>2576-764X</eissn><isbn>1424410428</isbn><isbn>9781424410422</isbn><eisbn>1424410436</eisbn><eisbn>9781424410439</eisbn><abstract>This paper presents a semi-Markov model that evaluates the performance of TCP connections with asymmetric Additive Increase and Multiplicative Decrease (AIMD) congestion control settings involved in sharing of a common drop-tail router. We study the fairness of the connections and their individual bandwidth utilizations as well as packet loss rates. We confirm that certain asymmetric AIMD settings may achieve fairness in bandwidth sharing. We also found that while connections with asymmetric AIMD settings operate at different bandwidth utilizations, they generally experience similar packet loss rate.</abstract><pub>IEEE</pub><doi>10.1109/GLOCOM.2007.386</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1930-529X
ispartof IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference, 2007, p.2014-2018
issn 1930-529X
2576-764X
language eng
recordid cdi_ieee_primary_4411296
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Analytical models
Bandwidth
Communications Society
Computer network management
Distributed algorithms
Numerical models
Propagation losses
Stochastic processes
Transport protocols
title Semi-Markov Modeling for Bandwidth Sharing of TCP Connections with Asymmetric AIMD Congestion Control
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T01%3A21%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Semi-Markov%20Modeling%20for%20Bandwidth%20Sharing%20of%20TCP%20Connections%20with%20Asymmetric%20AIMD%20Congestion%20Control&rft.btitle=IEEE%20GLOBECOM%202007%20-%20IEEE%20Global%20Telecommunications%20Conference&rft.au=Cheng%20Peng%20Fu&rft.date=2007-11&rft.spage=2014&rft.epage=2018&rft.pages=2014-2018&rft.issn=1930-529X&rft.eissn=2576-764X&rft.isbn=1424410428&rft.isbn_list=9781424410422&rft_id=info:doi/10.1109/GLOCOM.2007.386&rft.eisbn=1424410436&rft.eisbn_list=9781424410439&rft_dat=%3Cieee_6IE%3E4411296%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-e68b2f861de79454891dfdf6136c2e03648a85a8c1e043c01f9681af0343e7e13%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=4411296&rfr_iscdi=true