BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR97-315
ENTRY:: May 30, 1997
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Admission Control Policies for Internet File Transfer Protocols
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Holmes a Court, Simon 
DATE:: May 1997
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: Compressed Postscript at http://www.cs.dartmouth.edu/reports/TR97-315.ps.Z
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR97-315.pdf
ABSTRACT:: 
	Server congestion is a major cause of frustration with the
Internet. It is not uncommon for a server with a new release of
popular software to be swamped by many times more clients than it can
possibly handle. Current Internet file transfer protocols, namely FTP
and HTTP, do not have any policy to regulate client admission.
	In this thesis we are concerned with server admission policies
that will improve clients' experience with servers under heavy
load. Using a purpose-built network simulator, we compare the
prevalent protocols with two new protocols that include policies taken
from processor scheduling.  
	By applying more intelligent client admission policies it is
hoped that the quality of service on the Internet can be improved.
NOTE:: 
Senior Honors Thesis.  Advisor: John M. Danskin.
END:: ncstrl.dartmouthcs//TR97-315