Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2003. / Thesis advisor(s): George W. Dinolt, Gurminder Singh. Includes bibliographical references (p. 75-78). Also available online.

Thesis (Ph.D.)--Auburn University, 2005. / Abstract. Vita. Includes bibliographic references (ℓ. 98-99)

Thesis (M.App.Sc.) - Carleton University, 2003. / Includes bibliographical references (p. 90-92). Also available in electronic format on the Internet.

Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2009. / Full text also available online. Scroll down for electronic link.

Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisors: Brian L. Evans and Gustavo de Veciana. Vita. Includes bibliographical references.

Approved for public release; distribution is unlimited / Special Forces are crucial in specific military operations. They usually operate in hostile territory where communications are difficult to establish and preserve, since the operations are often carried out in a remote environment and the communications need to be highly mobile. The delivery of information about the geographical parameters of the area can be crucial for the completion of their mission. But in that highly mobile environment, the connectivity of the established wireless networks (LANs) can be unstable and intermittently unavailable. Existing content transfer protocols are not adaptive to volatile network connectivity. If a physical connection is lost, any information or part of a file already retrieved is discarded and the same information must be retransmitted again after the reestablishment of the lost session. The intention of this Thesis is to develop a protocol in the application layer that preserves the already transmitted part of the file, and when the session is reestablished, the information server can continue sending the rest of the file to the requesting host. Further, if the same content is available from another server through a better route, the new server should be able to continue to serve the content, starting from where the session with the previous server ended. / Lieutenant, Hellenic Navy

Thesis (M.S. in Computer Science)--Naval Postgraduate School, March 2005. / Thesis Advisor(s): Su Wen, Arijit Das. Includes bibliographical references (p. 149 p.). Also available online.

Thesis (M.S.)--University of Delaware, 2005. / Principal faculty adviser: Paul D. Amer, Dept. of Computer & Information Sciences. Includes bibliographical references.

Please read the abstract in the section 00front of this document / Dissertation (MSc (Computer Science))--University of Pretoria, 2006. / Computer Science / unrestricted

The Transmission Control Protocol (TCP) has been designed for reliable data transport over the Internet. The performance of TCP is strongly influenced by its congestion control algorithms that limit the amount of traffic a sender can transmit based on end-to-end available capacity estimations. These algorithms proved successful in environments where applications rate requirements can be easily anticipated, as is the case for traditional bulk data transfer or interactive applications. However, an important new class of Internet applications has emerged that exhibit significant variations of transmission rate over time. Variable-rate traffic poses a new challenge for congestion control, especially for applications that need to share the limited capacity of a bottleneck over a long delay Internet path (e.g., paths that include satellite links). This thesis first analyses TCP performance of bursty applications that do not send data continuously, but generate data in bursts separated by periods in which little or no data is sent. Simulation analysis shows that standard TCP methods do not provide efficient support for bursty applications that produce variable-rate traffic, especially over long delay paths. Although alternative forms of congestion control like TCP-Friendly Rate Control and the Datagram Congestion Control Protocol have been proposed, they did not achieve widespread deployment. Therefore many current applications that rely upon User Datagram Protocol are not congestion controlled. The use of non-standard or proprietary methods decreases the effectiveness of Internet congestion control and poses a threat to the Internet stability. Solutions are therefore needed to allow bursty applications to use TCP. Chapter three evaluates Congestion Window Validation (CWV), an IETF experimental specification that was proposed to improve support for bursty applications over TCP. It concluded that CWV is too conservative to support many bursty applications and does not provide an incentive to encourage use by application designers. Instead, application designers often avoid generating variable-rate traffic by padding idle periods, which has been shown to waste network resources. CWV is therefore shown to not provide an acceptable solution for variable-rate traffic. In response to this shortfall, a new modification to TCP, TCP-JAGO, is proposed. This allows variable-rate traffic to restart quickly after an inactive (i.e., idle) period and to effectively utilise available network resources while sending at a lower rate than the available rate (i.e., during an application-limited period). The analysis in Chapter five shows that JAGO provides faster convergence to a steady-state rate and improves throughput by more efficiently utilising the network. TCP-JAGO is also shown to provide an appropriate response when congestion is experienced after restart. Variable-rate TCP traffic can also be impacted by the Initial Window algorithm at the start or during the restart of a session. Chapter six considers this problem, where TCP has no prior indication of the network state. A recent proposal for a larger initial window is analysed. Issues and advantages of using a large IW over a range of scenarios are discussed. The thesis concludes by presenting recommendations to improve TCP support for bursty applications. This also provides an incentive for application designers to choose TCP for variable-rate traffic.