3,213 research outputs found
TCP in 5G mmWave Networks: Link Level Retransmissions and MP-TCP
MmWave communications, one of the cornerstones of future 5G mobile networks,
are characterized at the same time by a potential multi-gigabit capacity and by
a very dynamic channel, sensitive to blockage, wide fluctuations in the
received signal quality, and possibly also sudden link disruption. While the
performance of physical and MAC layer schemes that address these issues has
been thoroughly investigated in the literature, the complex interactions
between mmWave links and transport layer protocols such as TCP are still
relatively unexplored. This paper uses the ns-3 mmWave module, with its channel
model based on real measurements in New York City, to analyze the performance
of the Linux TCP/IP stack (i) with and without link-layer retransmissions,
showing that they are fundamental to reach a high TCP throughput on mmWave
links and (ii) with Multipath TCP (MP-TCP) over multiple LTE and mmWave links,
illustrating which are the throughput-optimal combinations of secondary paths
and congestion control algorithms in different conditions.Comment: 6 pages, 11 figures, accepted for presentation at the 2017 IEEE
Conference on Computer Communications Workshops (INFOCOM WKSHPS
STAIR: Practical AIMD Multirate Congestion Control
Existing approaches for multirate multicast congestion control are either friendly to TCP only over large time scales or introduce unfortunate side effects, such as significant control traffic, wasted bandwidth, or the need for modifications to existing routers. We advocate a layered multicast approach in which steady-state receiver reception rates emulate the classical TCP sawtooth derived from additive-increase, multiplicative decrease (AIMD) principles. Our approach introduces the concept of dynamic stair layers to simulate various rates of additive increase for receivers with heterogeneous round-trip times (RTTs), facilitated by a minimal amount of IGMP control traffic. We employ a mix of cumulative and non-cumulative layering to minimize the amount of excess bandwidth consumed by receivers operating asynchronously behind a shared bottleneck. We integrate these techniques together into a congestion control scheme called STAIR which is amenable to those multicast applications which can make effective use of arbitrary and time-varying subscription levels.National Science Foundation (CAREER ANI-0093296, ANI-9986397
Recommended from our members
A novel technique to enhance throughput and fairness over wireless mesh networks
This extended abstract was submitted to and published in the ReSCon '12 Book of Abstracts. The fifth SED Research Student Conference (ReSCon2012) was hosted over three days, 18-20 June 2012, in the Hamilton Centre at Brunel University
Agile-SD: A Linux-based TCP Congestion Control Algorithm for Supporting High-speed and Short-distance Networks
Recently, high-speed and short-distance networks are widely deployed and
their necessity is rapidly increasing everyday. This type of networks is used
in several network applications; such as Local Area Networks (LAN) and Data
Center Networks (DCN). In LANs and DCNs, high-speed and short-distance networks
are commonly deployed to connect between computing and storage elements in
order to provide rapid services. Indeed, the overall performance of such
networks is significantly influenced by the Congestion Control Algorithm (CCA)
which suffers from the problem of bandwidth under-utilization, especially if
the applied buffer regime is very small. In this paper, a novel loss-based CCA
tailored for high-speed and Short-Distance (SD) networks, namely Agile-SD, has
been proposed. The main contribution of the proposed CCA is to implement the
mechanism of agility factor. Further, intensive simulation experiments have
been carried out to evaluate the performance of Agile-SD compared to Compound
and Cubic which are the default CCAs of the most commonly used operating
systems. The results of the simulation experiments show that the proposed CCA
outperforms the compared CCAs in terms of average throughput, loss ratio and
fairness, especially when a small buffer is applied. Moreover, Agile-SD shows
lower sensitivity to the buffer size change and packet error rate variation
which increases its efficiency.Comment: 12 Page
- …