Preferential Treatment for Short Flows to Reduce Web Latency. Chen, X. & Heidemann, J. Technical Report ISI-TR-548, USC/Information Sciences Institute, October, 2001. Technical report updated July 2002; published in Computer Networks 41(6), April 2003, pages 779–794
Preferential Treatment for Short Flows to Reduce Web Latency [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.
@TechReport{Chen01c,
	author = "Xuan Chen and John Heidemann",
	title = "Preferential Treatment for Short Flows to Reduce Web Latency",
	institution =  "USC/Information Sciences Institute",
	year = 	       2001,
	sortdate = 	       "2001-10-01", 
	project = "ant, saman, conser",
	jsubject =  "chronological",
	number =       "ISI-TR-548",
	month =	       oct,
	note = "Technical report updated July 2002; published in Computer Networks 41(6), April 2003,
                         pages 779--794",
	url =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.html",
	psurl =		"https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.ps.gz",
	pdfurl =	"https://ant.isi.edu/%7ejohnh/PAPERS/Chen01c.pdf",
	otherurl = 	"https://ant.isi.edu/%7exuanc/paper/sfd.pdf",
	copyrightholder = "authors",
	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