Next: About this document ...
Up: TCP Nice: A Mechanism
Previous: Conclusions
- 1
-
Anurag Acharya and Joel Saltz.
A study of internet round-trip delay.
Technical Report CS-TR-3736, University of Maryland, 1996.
- 2
-
Akamai, Inc.
https://www.akamai.com.
- 3
-
D. Andersen, D. Bansal, D. Curtis, S. Seshan, and H. Balakrishnan.
System support for bandwidth management and content adaptation in
internet applications.
In OSDI, pages 213-226, 2000.
- 4
-
D. Bansal and H. Balakrishnan.
Binomial Congestion Control Algorithms.
In Infocom, 2001.
- 5
-
S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss.
An architecture for differentiated services, 1998.
- 6
-
T. Bonald.
Comparision of TCP Reno and TCP Vegas via fluid approximation.
INRIA Research Report 3563, Nov 1998.
- 7
-
Lawrence S. Brakmo and Larry L. Peterson.
TCP vegas: End to end congestion avoidance on a global internet.
IEEE Journal on Selected Areas in Communications,
13(8):1465-1480, 1995.
- 8
-
L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker.
Web caching and zipf-like distributions: Evidence and implications.
In Infocom, 1999.
- 9
-
B. Chandra.
Web workloads influencing disconnected service access.
Master's thesis, University of Texas at Austin, May 2001.
- 10
-
B. Chandra, M. Dahlin, L. Gao, A. Khoja, A. Razzaq, and A. Sewani.
Resource management for scalable disconnected access to web services.
In WWW10, May 2001.
- 11
-
B. Chandra, M. Dahlin, L. Gao, and A. Nayate.
End-to-end WAN Service Availability.
In USITS, 2001.
- 12
-
Chiu and Jain.
Analysis of increase and decrease algorithms for congestion avoidance
in computer networks.
Journal of Computer networks and ISDN, 17(1):1-14, June
1989.
- 13
-
J. Cho and H. Garcia-Molina.
Synchronizing a database to improve freshness.
In SIGMOD, 2000.
- 14
-
J. Cleary and I. Witten.
Data compression using adaptive coding and partial string matching.
IEEE Transactions on Communications, 1984.
- 15
-
M. Crovella and P. Barford.
The network effects of prefetching.
In Infocom, 1998.
- 16
-
F. Dabek, F. Kaashoek, D. Karger, R. Morris, and I. Stoica.
Wide-area cooperative storage with CFS.
In SOSP, 2001.
- 17
-
M. Dahlin.
https://www.cs.utexas.edu/users/dahlin/
techTrends/data/diskPrices/data, Jan
2002.
- 18
-
D. Duchamp.
Prefetching Hyperlinks.
In USITS, 1999.
- 19
-
S. Dykes and K. A. Robbins.
A viability analysis of cooperative proxy caching.
In Infocom, 2001.
- 20
-
Tivoli Data Exchange.
https://www.tivoli.com/prod
ucts/documents/datasheets/data_exchange_ds.pdf.
- 21
-
R. Fielding, J. Gettys, J. Mogul, H. Frystyk, L. Masinter, P. Leach, and
T. Berners-Lee.
Hypertext transfer protocol - http/1.1, June 1999.
- 22
-
S. Floyd, M. Handley, J. Padhye, and J. Widmer.
Equation-based congestion control for unicast applications: the
extended version.
Technical Report TR-00-003, ICSI, March 2000.
- 23
-
Sally Floyd and Van Jacobson.
Random early detection gateways for congestion avoidance.
IEEEACM Transactions on Networking, 1(4):397-413,
August 1993.
- 24
-
P. Goyal, X. Guo, and H.M. Vin.
A hierarchical cpu scheduler for multimedia operating systems.
In OSDI, pages 107-122, October 1996.
- 25
-
J. Gray and P. Shenoy.
Rules of thumb in data engineering.
In "Proc. 16th Internat. Conference on Data Engineering", pages
3-12, 2000.
- 26
-
J. Griffioen and R. Appleton.
Automatic Prefetching in a WAN.
In IEEE Workshop on Advances in Parallel and Distributed
Systems, October 1993.
- 27
-
J. S. Gwertzman and M. Seltzer.
The case for geographical push-caching.
In HotOS, 1995.
- 28
-
J. Howard, M. Kazar, S. Menees, D. Nichols, M. Satyanarayanan, R. Sidebotham,
and M. West.
Scale and Performance in a Distributed File System.
ACM Transactions on Computer Systems, 6(1):51-81, February
1988.
- 29
-
N. Hutchison, S. Manley, M. Federwisch, G. Harris, D. Hitz, S. Kleiman, and
S. O'Malley.
Logical vs. physical file system backup.
In OSDI, 1999.
- 30
-
V. Jacobson.
Congestion avoidance and control.
In SIGCOMM, 1988.
- 31
-
R. Kokku, P. Yalagandula, A. Venkataramani, and M. Dahlin.
A non-interfering deployable web prefetching system.
Technical Report TR-02-51, Computer Sciences, UT Austin, May 2002.
- 32
-
T. M. Kroeger, D. E. Long, and J. C. Mogul.
Exploring the bounds of web latency reduction from caching and
prefetching.
In USITS, 1997.
- 33
-
C. Lumb, J. Schindler, G. Ganger, D. Nagle, and E. Riedel.
Towards higher disk head utilization: Extracting free bandwidth from
busy disk drives.
In OSDI, 2000.
- 34
-
C. Maltzahn, K. Richardson, D. Grunwald, and J. Martin.
On bandwidth smoothing.
In 4th International Web Caching Workshop, 1999.
- 35
-
R. Morris.
Tcp behavior with many flows.
In International Conference on Network Protocols, 1997.
- 36
-
The network simulator - ns-2.
https://www.isi.edu/
nsnam/ns.
- 37
-
A. Odlyzko.
Internet growth: Myth and reality, use and abuse.
Journal of Computer Resource Management, pages 23-27, 2001.
- 38
-
V. N. Padmanabhan and J. C. Mogul.
Using predictive prefetching to improve World-Wide Web latency.
In SIGCOMM, 1996.
- 39
-
R. Hugo Patterson, Garth A. Gibson, Eka Ginting, Daniel Stodolsky, and Jim
Zelenka.
Informed prefetching and caching.
In SOSP, 1995.
- 40
-
V. Paxson.
End-to-end Routing Behavior in the Internet.
In SIGCOMM, 1996.
- 41
-
G. Popek, R. Guy, T. Page, and J. Heidemann.
Replication in the Ficus Distributed File System.
In Workshop on the Management of Replicated Data, pages
5-10, November 1990.
- 42
-
R. Rejaie, M. Handley, and D. Estrin.
RAP: An end-to-end rate-based congestion control mechanism for
realtime streams in the internet.
In Infocom, 1999.
- 43
-
A. Rowstron and P. Druschel.
Storage management and caching in PAST, a large-scale, persistent
peer-to-peer storage utility.
In SOSP, 2001.
- 44
-
Dheeraj Sanghi, Ashok K. Agrawala, Olafur Gudmundsson, and Bijendra N. Jain.
Experimental assessment of end-to-end behavior on internet.
In Infocom (2), pages 867-874, 1993.
- 45
-
P. Shenoy and H. Vin.
Cello: A disk scheduling framework for next-generation operating
systems.
In SIGMETRICS, 1998.
- 46
-
Neil T. Spring, Maureen Chesire, Mark Berryman, Vivek Sahasranaman, Thomas
Anderson, and Brian N. Bershad.
Receiver based management of low bandwidth access links.
In Infocom, 2000.
- 47
-
D. Terry, M. Theimer, K. Petersen, A. Demers, M. Spreitzer, and C. Hauser.
Managing Update Conflicts in Bayou, a Weakly Connected Replicated
Storage System.
In SOSP, 1995.
- 48
-
A. Venkataramani, M. Dahlin, and P. Weidmann.
Bandwidth constrained placement in a WAN.
In PODC, 2001.
- 49
-
A. Venkataramani, R. Kokku, and M. Dahlin.
System support for background replication.
Technical Report TR-02-30, Computer Sciences, UT Austin, May 2002.
- 50
-
A. Venkataramani, P. Yalagandula, R. Kokku, S. Sharif, and M. Dahlin.
Potential costs and benefits of long-term prefetching for
content-distribution.
Computer Communications Journal, 25(4):367-375, 2002.
- 51
-
D. Wessels.
Squid Internet object cache.
https://squid.nlanr.net/Squid, Jan 1998.
- 52
-
Y. Yang and S. Lam.
General AIMD Congestion Control.
In ICNP, 2000.
- 53
-
H. Yu and A. Vahdat.
The costs and limits of availability for replicated services.
In SOSP, 2001.
- 54
-
Y. Zhang, V. Paxson, and S. Shenkar.
The Stationarity of Internet Path Properties: Routing, Loss, and
Throughput.
Technical report, ICSI Center for Internet Research, May 2000.
Arun Venkataramani
2002-10-08