6,631 research outputs found
The Performance of Multi-Path TCP with Overlapping Paths
Turning the Internet into a multi-path environment could solve many difficulties network operators are facing today. There are already solutions to configure an IP network to offer multiple partially disjoint paths towards the destination. In this demo, we focus on the
performance of how MPTCP can distribute the traffic along these paths. When the routes are not fully disjoint their throughput could be limited by some bottleneck links. Because of this dependency finding the maximal throughput in MPTCP may call for solving a complex maximization problem. Through constructing an example network as an illustrative model of real network conditions, we show, how complicated the underlying optimization problem MPTCP may face, and through measurements, demonstrate how the various congestion mechanisms deal with finding a solution
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
Merlin: A Language for Provisioning Network Resources
This paper presents Merlin, a new framework for managing resources in
software-defined networks. With Merlin, administrators express high-level
policies using programs in a declarative language. The language includes
logical predicates to identify sets of packets, regular expressions to encode
forwarding paths, and arithmetic formulas to specify bandwidth constraints. The
Merlin compiler uses a combination of advanced techniques to translate these
policies into code that can be executed on network elements including a
constraint solver that allocates bandwidth using parameterizable heuristics. To
facilitate dynamic adaptation, Merlin provides mechanisms for delegating
control of sub-policies and for verifying that modifications made to
sub-policies do not violate global constraints. Experiments demonstrate the
expressiveness and scalability of Merlin on real-world topologies and
applications. Overall, Merlin simplifies network administration by providing
high-level abstractions for specifying network policies and scalable
infrastructure for enforcing them
Efficient Multi-way Theta-Join Processing Using MapReduce
Multi-way Theta-join queries are powerful in describing complex relations and
therefore widely employed in real practices. However, existing solutions from
traditional distributed and parallel databases for multi-way Theta-join queries
cannot be easily extended to fit a shared-nothing distributed computing
paradigm, which is proven to be able to support OLAP applications over immense
data volumes. In this work, we study the problem of efficient processing of
multi-way Theta-join queries using MapReduce from a cost-effective perspective.
Although there have been some works using the (key,value) pair-based
programming model to support join operations, efficient processing of multi-way
Theta-join queries has never been fully explored. The substantial challenge
lies in, given a number of processing units (that can run Map or Reduce tasks),
mapping a multi-way Theta-join query to a number of MapReduce jobs and having
them executed in a well scheduled sequence, such that the total processing time
span is minimized. Our solution mainly includes two parts: 1) cost metrics for
both single MapReduce job and a number of MapReduce jobs executed in a certain
order; 2) the efficient execution of a chain-typed Theta-join with only one
MapReduce job. Comparing with the query evaluation strategy proposed in [23]
and the widely adopted Pig Latin and Hive SQL solutions, our method achieves
significant improvement of the join processing efficiency.Comment: VLDB201
Performance of TCP/UDP under Ad Hoc IEEE802.11
TCP is the De facto standard for connection oriented transport layer
protocol, while UDP is the De facto standard for transport layer protocol,
which is used with real time traffic for audio and video. Although there have
been many attempts to measure and analyze the performance of the TCP protocol
in wireless networks, very few research was done on the UDP or the interaction
between TCP and UDP traffic over the wireless link. In this paper, we tudy the
performance of TCP and UDP over IEEE802.11 ad hoc network. We used two
topologies, a string and a mesh topology. Our work indicates that IEEE802.11 as
a ad-hoc network is not very suitable for bulk transfer using TCP. It also
indicates that it is much better for real-time audio. Although one has to be
careful here since real-time audio does require much less bandwidth than the
wireless link bandwidth. Careful and detailed studies are needed to further
clarify that issue.Comment: 9 pages, 5 figures, ICT 2003 (10th International Conference on
Telecommunication
The Quest for Bandwidth Estimation Techniques for large-scale Distributed Systems
In recent years the research community has developed many techniques to estimate the end-to-end available bandwidth of an Internet path. This important metric has been proposed for use in several distributed systems and, more recently, has even been considered to improve the congestion control mechanism of TCP. Thus, it has been suggested that some existing estimation techniques could be used for this purpose. However, existing tools were not designed for large-scale deployments and were mostly validated in controlled settings, considering only one measurement running at a time. In this paper, we argue that current tools, while offering good estimates when used alone, might not work in large-scale systems where several estimations severely interfere with each other. We analyze the properties of the measurement paradigms employed today and discuss their functioning, study their overhead and analyze their interference. Our testbed results show that current techniques are insufficient as they are. Finally, we will discuss and propose some principles that should be taken into account for including available bandwidth measurements in large-scale distributed systems. 1
- …