Preferential Treatment for Short Flows to Reduce Web Latency. Chen, X. & Heidemann, J. Computer Networks, 41(6):779–794, April, 2003. ![Preferential Treatment for Short Flows to Reduce Web Latency [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex In this paper, we propose SFD algorithm to reduce the user-perceived web response time (i.e. web latency). This algorithm gives short flows preferential treatment and penalizes long flows. We implement SFD algorithm as a simple differentiated services policy and evaluate its performance in simulation. We find that the transmission latency of short flows and the response time to retrieve representative web pages are both reduced by about 30%. Using web traces we demonstrate that 99% web pages would be transferred faster. SFD also bounds the penalty to long flows. We further evaluate how different schemes trade-off the performance between short and long flows.
@Article{Chen03a,
author = "Xuan Chen and John Heidemann",
title = "Preferential Treatment for Short Flows to Reduce Web Latency",
journal = "Computer Networks",
year = 2003,
sortdate = "2003-04-01",
project = "ant, saman, conser",
jsubject = "www",
volume = 41,
number = 6,
month = apr,
pages = "779--794",
jlocation = "johnh: folder: xxx",
jlocation = "johnh: pafile",
url = "https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.html",
externalurl = "http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VRG-47DM0WC-2&_user=10&_handle=W-WA-A-A-AW-MsSAYVA-UUA-AUVYCWUCYY-ZZACDVYAA-AW-U&_fmt=summary&_coverDate=04%2F22%2F2003&_rdoc=7&_orig=browse&_srch=%23toc%236234%232003%23999589993%23398718!&_cdi=6234&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=6c7e742608f9849149ede82b9c6eead9",
privatepdfurl = "https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.pdf",
availability = {
Copies for personal use can be obtained by an <a href="mailto:johnh@ficus.cs.ucla.edu">e-mail request to the authors</a>
or by contacting <a href="http://www.sciencedirect.com/">Elsiver</a>.
If you are unable to do either of those, an earlier draft of the paper
is available as a <a href="https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.html>USC technical report</a>.
},
copyrightholder = "Elsevier Science Publishing Co., Inc.",
copyrightterms = "Single photocopies of single articles may be made for personal use as allowed by national copyright laws. Permission of the Publisher and payment of a fee is required for all other photocopying, including multiple or systematic copying, copying for advertising or promotional purposes, resale, and all forms of document delivery. Special rates are available for educational institutions that wish to make photocopies for non-profit educational classroom use. Permissions may be sought directly from: Elsevier Global Rights Department / P.O. Box 800 / Oxford OX5 1DX, UK / phone: (+44) 1865 843830 / fax: (+44) 1865 853333 / e-mail: permissions@elsevier.co.uk ",
myorganization = "USC/Information Sciences Institute",
abstract = "
In this paper, we propose SFD algorithm to reduce the user-perceived
web response time (i.e. web latency). This algorithm gives short flows
preferential treatment and penalizes long flows. We implement SFD
algorithm as a simple differentiated services policy and evaluate its
performance in simulation. We find that the transmission latency of
short flows and the response time to retrieve representative web pages
are both reduced by about 30\%. Using web traces we demonstrate that
99\% web pages would be transferred faster. SFD also bounds the
penalty to long flows. We further evaluate how different schemes
trade-off the performance between short and long flows.
",
}
Downloads: 0
{"_id":"9sgs2i2PEQsojpYTh","bibbaseid":"chen-heidemann-preferentialtreatmentforshortflowstoreduceweblatency-2003","author_short":["Chen, X.","Heidemann, J."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Xuan"],"propositions":[],"lastnames":["Chen"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]}],"title":"Preferential Treatment for Short Flows to Reduce Web Latency","journal":"Computer Networks","year":"2003","sortdate":"2003-04-01","project":"ant, saman, conser","jsubject":"www","volume":"41","number":"6","month":"April","pages":"779–794","jlocation":"johnh: pafile","url":"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.html","externalurl":"http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VRG-47DM0WC-2&_user=10&_handle=W-WA-A-A-AW-MsSAYVA-UUA-AUVYCWUCYY-ZZACDVYAA-AW-U&_fmt=summary&_coverDate=04%2F22%2F2003&_rdoc=7&_orig=browse&_srch=%23toc%236234%232003%23999589993%23398718!&_cdi=6234&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=6c7e742608f9849149ede82b9c6eead9","privatepdfurl":"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.pdf","availability":"Copies for personal use can be obtained by an <a href=\"mailto:johnh@ficus.cs.ucla.edu\">e-mail request to the authors</a> or by contacting <a href=\"http://www.sciencedirect.com/\">Elsiver</a>. If you are unable to do either of those, an earlier draft of the paper is available as a <a href=\"https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.html>USC technical report</a>. ","copyrightholder":"Elsevier Science Publishing Co., Inc.","copyrightterms":"Single photocopies of single articles may be made for personal use as allowed by national copyright laws. Permission of the Publisher and payment of a fee is required for all other photocopying, including multiple or systematic copying, copying for advertising or promotional purposes, resale, and all forms of document delivery. Special rates are available for educational institutions that wish to make photocopies for non-profit educational classroom use. Permissions may be sought directly from: Elsevier Global Rights Department / P.O. Box 800 / Oxford OX5 1DX, UK / phone: (+44) 1865 843830 / fax: (+44) 1865 853333 / e-mail: permissions@elsevier.co.uk ","myorganization":"USC/Information Sciences Institute","abstract":"In this paper, we propose SFD algorithm to reduce the user-perceived web response time (i.e. web latency). This algorithm gives short flows preferential treatment and penalizes long flows. We implement SFD algorithm as a simple differentiated services policy and evaluate its performance in simulation. We find that the transmission latency of short flows and the response time to retrieve representative web pages are both reduced by about 30%. Using web traces we demonstrate that 99% web pages would be transferred faster. SFD also bounds the penalty to long flows. We further evaluate how different schemes trade-off the performance between short and long flows. ","bibtex":"@Article{Chen03a,\n\tauthor = \t\"Xuan Chen and John Heidemann\",\n\ttitle = \t\"Preferential Treatment for Short Flows to Reduce Web Latency\",\n\tjournal = \t\"Computer Networks\",\n\tyear = \t\t2003,\n\tsortdate = \t\t\"2003-04-01\",\n\tproject = \"ant, saman, conser\",\n\tjsubject = \"www\",\n\tvolume =\t41,\n\tnumber =\t6,\n\tmonth =\t\tapr,\n\tpages =\t\t\"779--794\",\n\tjlocation =\t\"johnh: folder: xxx\",\n\tjlocation =\t\"johnh: pafile\",\n\turl =\t\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.html\",\n\texternalurl =\t\t\"http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VRG-47DM0WC-2&_user=10&_handle=W-WA-A-A-AW-MsSAYVA-UUA-AUVYCWUCYY-ZZACDVYAA-AW-U&_fmt=summary&_coverDate=04%2F22%2F2003&_rdoc=7&_orig=browse&_srch=%23toc%236234%232003%23999589993%23398718!&_cdi=6234&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=6c7e742608f9849149ede82b9c6eead9\",\n\tprivatepdfurl =\t\"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.pdf\",\n\tavailability = {\nCopies for personal use can be obtained by an <a href=\"mailto:johnh@ficus.cs.ucla.edu\">e-mail request to the authors</a>\nor by contacting <a href=\"http://www.sciencedirect.com/\">Elsiver</a>.\nIf you are unable to do either of those, an earlier draft of the paper\nis available as a <a href=\"https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.html>USC technical report</a>.\n},\n\tcopyrightholder = \"Elsevier Science Publishing Co., Inc.\",\n\tcopyrightterms = \t\"Single photocopies of single articles \tmay be made for personal use as allowed by national copyright \tlaws. Permission of the Publisher and payment of a fee is required for \tall other photocopying, including multiple or systematic copying, \tcopying for advertising or promotional purposes, resale, and all forms \tof document delivery. Special rates are available for educational \tinstitutions that wish to make photocopies for non-profit educational \tclassroom use. Permissions may be sought directly from: Elsevier \tGlobal Rights Department / P.O. Box 800 / Oxford OX5 1DX, UK / \tphone: (+44) 1865 843830 / \tfax: (+44) 1865 853333 / \te-mail: permissions@elsevier.co.uk \",\n\tmyorganization =\t\"USC/Information Sciences Institute\",\n\tabstract = \"\nIn this paper, we propose SFD algorithm to reduce the user-perceived\nweb response time (i.e. web latency). This algorithm gives short flows\npreferential treatment and penalizes long flows. We implement SFD\nalgorithm as a simple differentiated services policy and evaluate its\nperformance in simulation. We find that the transmission latency of\nshort flows and the response time to retrieve representative web pages\nare both reduced by about 30\\%. Using web traces we demonstrate that\n99\\% web pages would be transferred faster. SFD also bounds the\npenalty to long flows. We further evaluate how different schemes\ntrade-off the performance between short and long flows.\n\",\n}\n\n","author_short":["Chen, X.","Heidemann, J."],"bibbaseid":"chen-heidemann-preferentialtreatmentforshortflowstoreduceweblatency-2003","role":"author","urls":{"Paper":"https://ant.isi.edu/%7ejohnh/PAPERS/Chen03a.html"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":[],"search_terms":["preferential","treatment","short","flows","reduce","web","latency","chen","heidemann"],"title":"Preferential Treatment for Short Flows to Reduce Web Latency","year":2003}