In this paper we describe an analytical approach to estimate the performance of greedy and short-livedTCPconnections, assuming that only the primitive network parameters are known, and deriving from them round trip time, loss probability and throughput of TCP connections, as well as average completion times in the case of short-lived TCP flows. It exploits the queuing network paradigm to develo...

In this paper, we present a summary of the research work done by the Daedalus group at the University of California at Berkeley to improve TCP performance in a variety of situations, including lossy wireless networks, asymmetric networks, and Web traffic workload. To improve the performance of TCP over cellular wireless networks, we have implemented a TCP-aware link layer protocol called the sn...

We describe a variant of TCP (Tahoe, Vegas), TCP is most widely used transport protocol in both wired and wireless networks. In mobile ad hoc networks, the topology changes frequently due to mobile nodes, this leads to significant packet losses and network throughput degradation. This is due to the fact that TCP fails to distinguish the path failure and network congestion. In this paper, the pe...

Improving TCP performance has long been the focus of many research efforts in mobile ad hoc networks (MANET). In this paper, we address one aspect of this endeavor: how to properly set TCP’s congestion window limit (CWL) to achieve optimal performance. Past research has shown that using a small CWL improves TCP performance in certain scenarios [1], [2], however, no comprehensive study has been ...

Scale-free structure is one of the most notable properties of the Internet as a complex network. Many researchers have investigated the end-to-end performance (e.g., throughput, packet loss probability, and round-trip time between source/destination nodes) of TCP congestion control mechanisms, but the impact of the scale-free structure on the TCP performance has not been fully understood. In th...

Many applications want to use TCP congestion control to regulate the transmission rate of a data packet stream. A natural way to achieve this goal is to transport the data packet stream on a TCP connection. However, because TCP implements both congestion and error control, transporting a data packet stream directly using a TCP connection forces the data packet stream to be subject to TCP’s othe...

Bandwidth-delay product (BDP) and its upper bound (BDP-UB) have been well-understood in wireline networks such as the Internet. However, they have not been carefully studied in the multi-hop wireless ad hoc network (MANET) domain. In this paper, we show that the most significant difference of computing BDP and BDP-UB in MANET is the coupling of bandwidth and delay over a wireless link, where on...

Datacenter environments are increasingly layered, with multicore parallelism, OS virtualisation and NUMA memory all introducing variable latency and throughput for data transmission. For a programmer deploying applications in such a shifting environment, it is unclear how best to use venerable interfaces such as the sockets layer. Kernel hackers realise there is some performance hit to all the ...

In this paper, we show how multiple-path in the transport layer could be used to increase performance and anonymity of the Tor network. The balance between anonymity and performance when creating circuit is a key to improve the situation regarding the well-known problem of end-to-end traffic correlation attack by relay adversaries. We show that the current Tor path selection algorithm heavily b...

This paper proposes translucent caching as an alternative to transparent caches Translucent caches use the fact that network routing forwards a request for an object along the best path from the client to the object s home server Along this best path routers direct the request toward a cache chosen among a collection of nearby translucent caches Unlike transparent caching which relies on router...