25th IEEE International Conference on Network Protocols, ICNP 2017, Toronto, ON, Canada, October 10-13, 2017. IEEE Computer Society 【DBLP Link】
【Paper Link】 【Pages】:1-6
【Authors】: Thomas Kunz ; Karpakamurthy Muthukumar
【Abstract】: SDN technology has been applied to a range of different networks, ranging from Ethernet services to large cloud environments. More recently, interest has turned towards extending programmability of Optical Transport Networks (OTN). In the SDN architecture, SBIs are used to communicate between the SDN controller and the switches or routers in the network. In this paper, we deploy OpenFlow and NETCONF as SBIs in managing BoD across interconnected data centers over OTN. More specifically, we use these protocols to communicate between an OpenDayLight controller and two BTI7800 network elements that interconnect the data centers. We present experimental results for both BTI's YANG-based NETCONF implementation and our port of OpenFlow for a number of use cases. Our results show that NETCONF is faster and requires fewer control message. However, OpenFlow offers better bandwidth utilization over the interconnecting link.
【Keywords】: SDN; SBI; OpenFlow; NETCONF; data centers; Bandwidth-on-Demand
【Paper Link】 【Pages】:1-10
【Authors】: Yingjie Bi ; Ao Tang
【Abstract】: This paper studies routing performance loss due to traffic split ratio granularity constraints. For any given fineness of traffic splitting capability, we provide upper bounds on the loss of performance. Based on tight convex relaxation, we further develop an efficient approximation algorithm to compute a good routing solution that satisfies given constraints on traffic splitting. The results can be useful for network operators to trade-off between attainable performance and implementation overhead. Some of the mathematical techniques developed here can be of independent interest for studying other similar nonconvex optimization problems.
【Keywords】: Routing; Optimization; Upper bound; Throughput; Aggregates; Approximation algorithms; Computer networks
【Paper Link】 【Pages】:1-2
【Authors】: Tongguang Zhang ; Shuai Zhao ; Bingfei Ren ; Yulong Shi ; Bo Cheng ; Junliang Chen
【Abstract】: In some special circumstances, e.g. tsunamis, floods, battlefields, earthquakes, etc., communication infrastructures are damaged or non-existent, as well as unmanned aerial vehicle (UAV) cluster. For the communication between people or UAVs, UAVs or mobile smart devices (MSDs) can be used to construct Mobile Ad Hoc Networks (MANETs), and Multipath TCP (MPTCP) can be used to simultaneously transmit in one TCP connection via multiple interfaces of MSDs. However the original MPTCP subpaths creating algorithm can establish multiple subpaths between two adjacent nodes, thus cannot achieve true concurrent data transmission. To solve this issue, we research and improve both the algorithm of adding routing table entries and the algorithm of establishing subpaths to offer more efficient use of multiple subpaths and better network traffic load balancing. The main works are as follows: (1) improve multi-hop routing protocol; (2) run MPTCP on UAVs or MSDs; (3) improve MPTCP subpaths establishment algorithm. The results show that our algorithms have better performance than the original MPTCP in achieving higher data throughput.
【Keywords】: Routing; Mobile computing; Ad hoc networks; Androids; Humanoid robots; Algorithm design and analysis; Routing protocols
【Paper Link】 【Pages】:1-6
【Authors】: Mu He ; Patrick Kalmbach ; Andreas Blenk ; Wolfgang Kellerer ; Stefan Schmid
【Abstract】: This paper is motivated by the emerging vision of an automated and data-driven optimization of communication networks, making it possible to fully exploit the flexibilities offered by modern network technologies and heralding an era of fast and self-adjusting networks. We build upon our recent study of machine-learning approaches to (statically) optimize resource allocations based on the data produced by network algorithms in the past. We take our study a crucial step further by considering dynamic scenarios: scenarios where communication patterns can change over time. In particular, we investigate network algorithms which learn from the traffic distribution (the feature vector), in order to predict global network allocations (a multi-label problem). As a case study, we consider a well-studied fc-median problem arising in Software-Defined Networks, and aim to imitate and speedup existing heuristics as well as to predict good initial solutions for local search algorithms. We compare different machine learning algorithms by simulation and find that neural network can provide the best abstraction, saving up to two-thirds of the algorithm runtime.
【Keywords】: Heuristic algorithms; Machine learning algorithms; Communication networks; Prediction algorithms; Control systems; Resource management; Optimization
【Paper Link】 【Pages】:1-6
【Authors】: Ali A. Haghighi ; Shahram Shah-Heydari ; Shahram ShahbazPanahi
【Abstract】: In this paper a Markov decision process (MDP) model for virtualized content delivery networks is proposed. We use stochastic optimization to assign cloud site resources to each user group. We propose how quality of experience (QoE) can be included in the modeling and optimization. We then present an optimal solution for a constraint-free version of the problem, and show the improvement in accumulated revenue when our optimization model is used. A sub-optimal algorithm is proposed that would reduce the complexity of the problem. Simulation results are presented to support merits of the proposed algorithm.
【Keywords】: Optimization; Cloud computing; Bandwidth; Stochastic processes; Indexes; Complexity theory
【Paper Link】 【Pages】:1-10
【Authors】: Huikang Li ; Yi Gao ; Wei Dong ; Chun Chen
【Abstract】: Inferring fine-grained link metrics by using aggregated path measurements, known as network tomography, is essential for various network operations, such as network monitoring, load balancing, and failure diagnosis. Given a set of interesting links and the changing topologies of a dynamic network, we study the problem of calculating the link metrics of these links by end-to-end cycle-free path measurements among selected monitors, i.e., preferential link tomography. We propose MAPLink, an algorithm that assigns a number of nodes as monitors to solve this tomography problem. As the first algorithm to solve the preferential link tomography problem in dynamic networks, MAPLink guarantees that the assigned monitors can calculate the link metrics of all interesting links for all topologies of the dynamic network. We formally prove the above property of MAPLink based on graph theory. We implement MAPLink and evaluate its performance using two real-world dynamic networks, including a vehicular network and a sensor network, both with changing topologies due to node mobility or wireless dynamics. Results show that MAPLink achieves significant better performance compared with three baseline methods in both of the two dynamic networks.
【Keywords】: Monitoring; Measurement; Network topology; Tomography; Heuristic algorithms; Topology; Vehicle dynamics
【Paper Link】 【Pages】:1-10
【Authors】: Kirill Kogan ; Danushka Menikkumbura ; Gustavo Petri ; Yangtae Noh ; Sergey I. Nikolenko ; Alexander Sirotkin ; Patrick Eugster
【Abstract】: Buffering architectures and policies for their efficient management constitute one of the core ingredients of a network architecture. However, despite strong incentives to experiment with, and deploy, new policies, the opportunities for alterating anything beyond minor elements of such policies are limited. In this work we introduce a new specification language, OpenQueue, that allows users to specify entire buffering architectures and policies conveniently through several comparators and simple functions. We show examples of buffer management policies in OpenQueue and empirically demonstrate its direct impact on performance in various settings.
【Keywords】: Admission control; Process control; Optimized production technology; Ports (Computers); Boundary conditions; Data structures
【Paper Link】 【Pages】:1-10
【Authors】: Fabien Duchene ; Olivier Bonaventure
【Abstract】: Multipath TCP is a recent TCP extension that enables the utilization of different paths for a single connection. This provides various benefits including bandwidth aggregation and fast handovers on mobiles. A Multipath TCP connection starts with a single TCP connection called subflow and other subflows are added later to increase bandwidth or support failover. One drawback of Multipath TCP is that it is not currently compatible with stateless load balancers which rely on the five-tuple for their forwarding decision. This hinders the deployment of Multipath TCP. We show that this limitation can be circumvented with a small change to the handling of the initial subflow. Clients use this subflow to discover the load-balanced server and the additional Multipath TCP subflows are terminated at a unique address associated to each physical server. With this small change, Multipath TCP becomes compatible with existing stateless load balancers. Furthermore, we show that the same approach enables anycast Multipath TCP services, a major benefit given the difficulty of deploying anycast TCP services. We implement this modification in the Linux kernel and demonstrate its benefits with several micro benchmarks.
【Keywords】: Servers; Smart phones; Load management; Bandwidth; Wireless fidelity; Kernel; IP networks
【Paper Link】 【Pages】:1-10
【Authors】: Chengchen Hu ; Kaiyu Hou ; Hao Li ; Ruilong Wang ; Peng Zheng ; Peng Zhang ; Huanzhao Wang
【Abstract】: The reactive model of Software Defined Networking (SDN) invokes controller to dynamically determine the behaviors of a new flow without any pre-knowledge in the data plane. However, the reactive events raised by such flexible model meanwhile consume lots of the bottleneck resources of the fast memory in switch and bandwidth between controller and switches. To address this problem, we propose SoftRing with the motivation to mitigate the overhead to handle a reactive event. In fact, the reactive packets are not necessarily stored in the switch or sent to the controller; instead, they are forwarded to traverse a pre-defined loop path. The packets will finally leave the loop path after the switch rules related to the packet flow being updated to switches in the loop with fewer flow entries. We have implemented a SoftRing system that integrates the controller and software/hardware SDN switches. The results show that SoftRing can eliminate the fast memory requirement for reactive packets and reduce the control channel bandwidth consumption up to 80%, with the cost of less than 5% data plane bandwidth, an average of three extra flow entries in each switch, and minor extra latency for the flow forwarding.
【Keywords】: Switches; Iron; Bandwidth; Random access memory; Process control; Data models
【Paper Link】 【Pages】:1-10
【Authors】: Pavel Chuprikov ; Kirill Kogan ; Sergey I. Nikolenko
【Abstract】: Ternary Content-Addressable Memory (TCAM) is a powerful tool to represent network services with line-rate lookup time. There are various software-based approaches to represent multi-field packet classifiers. Unfortunately, all of them either require exponential memory or apply additional constraints on field representations (e.g, prefixes or exact values) to have line-rate lookup time. In this work, we propose alternatives to tcam and introduce a novel approach to represent packet classifiers based on ternary bit strings (without constraining field representation) on commodity longest-prefix-match (LPM) infrastructures. These representations are built on a novel property, prefix reorderability, that defines how to transform an ordered set of ternary bit strings to prefixes with lpm priorities in linear memory. Our results are supported by evaluations on large-scale packet classifiers with real parameters from ClassBench; moreover, we have developed a prototype in P4 to support these types of transformations.
【Keywords】: Transforms; Art; Sorting; Tools; Prototypes; Communication networks
【Paper Link】 【Pages】:1-10
【Authors】: Cheng Zhang ; Jun Bi ; Yu Zhou ; Jianping Wu ; Bingyang Liu ; Zhaogeng Li ; Abdul Basit Dogar ; Yangyang Wang
【Abstract】: While extending network programmability to a larger degree, P4 also raises the risks of incurring runtime bugs after the deployment of P4 programs. These runtime bugs, if not handled promptly and properly, can ruin the functionality and performance of networks. Unfortunately, the absence of runtime debuggers makes troubleshooting of P4 program bugs challenging and intricate for operators. This paper is devoted to the on-the-fly debugging of runtime bugs in P4-enabled networks. We propose P4DB, a general debugging platform that empowers operators to debug P4 programs in three levels of visibility by provisioning operator-friendly primitives. By P4DB, operators can use the watch primitive to quickly narrow the debugging scope from network level or device level to table level, then use the break and next primitives to decompose the match-action table into three steps and troubleshoot the runtime bugs step by step. We implemented a prototype of P4DB and evaluated the performance in terms of the data plane, control plane and control channel. On P4-specific programmable data plane, P4DB merely introduces a small throughput penalty (1.3%~13.8%) and imposes a little-increased delay (0.6%~11.9%).
【Keywords】: Debugging; Runtime; Computer bugs; Tools; Switches; Protocols
【Paper Link】 【Pages】:1-10
【Authors】: Adnan Ahmed ; Zubair Shafiq ; Harkeerat Bedi ; Amir R. Khakpour
【Abstract】: The economic aspects of peering and transit interconnections between ISPs have been extensively studied in prior literature. Prior research primarily focuses on the economic issues associated with establishing peering and transit connectivity among ISPs to model interconnection strategies. Performance analysis, on the other hand, while understood intuitively, has not been empirically quantified and incorporated in such models. To fill this gap, we conduct a large scale measurement based performance comparison of peering and transit interconnection strategies. We use JavaScript to conduct application layer latency measurements between 510K clients in 900 access ISPs and multi-homed CDN servers located at 33 IXPs around the world. Overall, we find that peering paths outperformed transit paths for 91% Autonomous Systems (ASes) in our data. Peering paths have smaller propagation delays as compared to transit paths for more than 95% ASes. Peering paths outperform transit paths in terms of propagation delay due to shorter path lengths. Peering paths also have smaller queueing delays as compared to transit paths for more than 50% ASes.
【Keywords】: Servers; Internet; IP networks; Propagation delay; Economics; Delays; Browsers
【Paper Link】 【Pages】:1-10
【Authors】: Mario Hock ; Roland Bless ; Martina Zitterbart
【Abstract】: BBR is a recently proposed congestion control. Instead of using packet loss as congestion signal, like many currently used congestion controls, it uses an estimate of the available bottleneck link bandwidth to determine its sending rate. BBR tries to provide high link utilization while avoiding to create queues in bottleneck buffers. The original publication of BBR shows that it can deliver superior performance compared to Cubic TCP in some environments. This paper provides an independent and extensive experimental evaluation of BBR at higher speeds. The experimental setup uses BBR's Linux kernel 4.9 implementation and typical data rates of 10Gbit/s and 1 Gbit/s at the bottleneck link. The experiments vary the flows' round-trip times, the number of flows, and buffer sizes at the bottleneck. The evaluation considers throughput, queuing delay, packet loss, and fairness. On the one hand, the intended behavior of BBR could be observed with our experiments. On the other hand, some severe inherent issues such as increased queuing delays, unfairness, and massive packet loss were also detected. The paper provides an in-depth discussion of BBR's behavior in different experiment setups.
【Keywords】: Delays; Bandwidth; Packet loss; Linux; Throughput; Internet
【Paper Link】 【Pages】:1-6
【Authors】: Philippos Isaia ; Lin Guan
【Abstract】: Distributed Mininet implementations have been extensively used in order to overcome Mininet's scalability issues. Even though they have achieved a high level of success, they still have problems and can face bottlenecks due to the insufficient placement techniques. This paper proposes a new placement algorithm for distributed Mininet emulations with optimisation for Fat-Tree topologies. The proposed algorithm overcomes possible bottlenecks that can appear in emulations due to uneven distribution of computing resources or physical links. In order to distribute the emulation experiment evenly, the proposed algorithm assigns weights to each available machine as well as the communication links depending on their capabilities. Also, it performs a code analysis and assigns weights to the emulated topology and then places them accordingly. Some noticeable results of the proposed algorithm are the decrease in packet losses and jitter by up to 86% and 68% respectively. Finally, it has achieved up to 87% reduction in the standard deviation between CPU usage readings of experimental workers.
【Keywords】: Topology; Emulation; Algorithm design and analysis; Switches; Network topology; Scalability; Clustering algorithms
【Paper Link】 【Pages】:1-10
【Authors】: Ye Yu ; Djamal Belazzougui ; Chen Qian ; Qin Zhang
【Abstract】: Forwarding information base (FIB) scalability and its lookup speed are fundamental problems of numerous network technologies that uses location-independent network names. In this paper we present a new network algorithm, Othello Hashing, and its application of a FIB design called Concise, which uses very little memory to support ultra-fast lookups of network names. Othello Hashing and Concise make use of minimal perfect hashing and relies on the programmable network framework to support dynamic updates. Our conceptual contribution of Concise is to optimize the memory efficiency and query speed in the data plane and move the relatively complex construction and update components to the resource-rich control plane. We implemented Concise on three platforms. Experimental results show that Concise uses significantly smaller memory to achieve much faster query speed compared to existing solutions of network name lookups.
【Keywords】: query processing; telecommunication network management
【Paper Link】 【Pages】:1-10
【Authors】: Yi Gao ; Xue Liu ; Wei Dong
【Abstract】: Dedicated Short Range Communications (DSRC), a promising vehicle-to-vehicle communication technology, has been under active research and large scale DSRC deployment is expected to start shortly. However, before all vehicles are deployed with DSRC, there will be a relatively long partial DSRC deployment period where DSRC-equipped vehicles and non-DSRC-equipped vehicles both exist on roads. More importantly, it is reported that the probability a DSRC-equipped vehicle will benefit from a safety application is only of 1% during the initial DSRC deployment. Therefore, we propose MVS, a Multiple Vehicle Sensing approach to improve the collision avoidance effectiveness under partial DSRC deployment. The design of MVS is based on the observation that vehicles are able to sense the kinematic states of its adjacent vehicles by using existing computer vision technologies and/or on-board radar technologies. Therefore, we focus on improving the efficiency of sharing these sensed kinematic states among DSRC-equipped vehicles. By using the sensed data from multiple adjacent vehicles, the kinematic states of a non-DSRC-equipped vehicle can be accurately estimated. MVS is implemented and evaluated through a trace-driven study based on two realistic vehicle mobility traces. Results show that MVS reduces the collision probability by 61.5% and 60.1% in the two traces.
【Keywords】: Kinematics; Sensors; Estimation; Safety; Collision avoidance; Broadcasting; Standards
【Paper Link】 【Pages】:1-10
【Authors】: Pengjin Xie ; Jingchao Feng ; Zhichao Cao ; Jiliang Wang
【Abstract】: Device-to-device (D2D) communication is widely used for mobile devices and Internet of Things (IoT). Authentication and key agreement are critical to build a secure channel between two devices. However, existing approaches often rely on a pre-built fingerprint database and suffer from low key generation rate. We present GeneWave, a fast device authentication and key agreement protocol for commodity mobile devices. GeneWave first achieves bidirectional initial authentication based on the physical response interval between two devices. To keep the accuracy of interval estimation, we eliminate time uncertainty on commodity devices through fast signal detection and redundancy time cancellation. Then we derive the initial acoustic channel response (ACR) for device authentication. We design a novel coding scheme for efficient key agreement while ensuring security. Therefore, two devices can authenticate each other and securely agree on a symmetric key. GeneWave requires neither special hardware nor pre-built fingerprint database, and thus it is easy-to-use on commercial mobile devices. We implement GeneWave on mobile devices (i.e., Nexus 5X and Nexus 6P) and evaluate its performance through extensive experiments. Experimental results show that GeneWave efficiently accomplish secure key agreement on commodity smartphones with a key generation rate 10x faster than the state-of-the-art approach.
【Keywords】: Authentication; Mobile handsets; Acoustics; Frequency-domain analysis; Hardware; Device-to-device communication; Encoding
【Paper Link】 【Pages】:1-10
【Authors】: Peng Zhang ; Cheng Zhang ; Chengchen Hu
【Abstract】: A key feature of Software Defined Network is the decoupling of control pane and data plane. Although delivering huge benefits, such a decoupling also brings a new risk: the data plane states (i.e., flow tables) may deviate from the control plane policies. Existing data plane testing tools like Monocle check the correctness of flow tables by injecting probes. However, they are limited in four aspects: (1) slow in generating probes due to solving SAT problems, (2) may raise false negatives when there are multiple missing rules, (3) do not support incremental probe update to work in dynamic networks, and (4) cannot test cascaded flow tables used by OpenFlow switches. To overcome these limitations, we present RuleChecker, a fast and complete data plane testing tool. In contrast to previous tools that generate each probe by solving an SAT problem, RuleChecker takes the flow table as whole and generates all probes through an iteration of simple set operations. By lever-aging Binary Decision Diagram (BDD) to encode sets, we make RuleChecker extremely fast: around 5 χ faster than Monocle (when detecting rule missing faults), and nearly 20 χ faster than RuleScope (when detecting both rule missing and priority faults), and can update probes in less than 2 ms for 90% of cases, based on the Stanford backbone rule set.
【Keywords】: Software Defined Network; Data plane faults; Probe generation; Binary Decision Diagram
【Paper Link】 【Pages】:1-10
【Authors】: Yidan Hu ; Rui Zhang
【Abstract】: Database-driven Dynamic Spectrum Sharing (DSS) is the de-facto technical paradigm adopted by Federal Communications Commission (FCC) for increasing spectrum efficiency. In such a system, a geo-location database administrator (DBA) maintains spectrum availability information over its service region whereby to determines whether a secondary user can access a licensed spectrum band at his desired location and time. To maintain spectrum availability in its service region, it is desirable for the DBA to periodically collect spectrum measurements whereby to construct and maintain a Radio Environment Map (REM), where the received signal strength at every location of interest is either directly measured or estimated via proper statistical spatial interpolation techniques. Crowdsourcing-based spectrum sensing is a promising approach for periodically collecting spectrum measurements over a large geographic area, which is, unfortunately, vulnerable to false spectrum measurements. How to construct an accurate REM in the presence of false measurements remains an open challenge. This paper introduces SecREM, a novel scheme for securely constructing a REM in the presence of false spectrum measurements. SecREM relies on a small number of trusted spectrum measurements whereby to evaluate the trustworthiness of the measurements from mobile users and gradually incorporate the most trustworthy ones to construct an accurate REM. Extensive simulation studies based on a real spectrum measurement dataset confirm the efficacy and efficiency of SecREM.
【Keywords】: Sensors; Interpolation; Mobile communication; Atmospheric measurements; Particle measurements; Databases; Distortion measurement
【Paper Link】 【Pages】:1-10
【Authors】: Rajarajan Sivaraj ; Mustafa Y. Arslan ; Karthikeyan Sundaresan ; Sampath Rangarajan ; Prasant Mohapatra
【Abstract】: Evolved-Multimedia Broadcast Multicast Services (eMBMS) is a set of features in LTE networks to deliver bandwidth-intensive multimedia content on a point-to-multipoint basis to subscribers. The notion of a Single Frequency Network (SFN) in eMBMS allows base stations to synchronize and transmit signals in a coordinated fashion across the same frequency-time radio resources using a common modulation rate. While SFN boosts the channel quality of users via transmit diversity gain, the use of a common rate across base stations results in reduced utilization for those that can individually support much higher data rates for their users, even without the notion of an SFN. Excluding such base stations from the SFN helps them utilize their resources better by not being constrained by the common rate, but creates additional inter-cell interference from their independent transmissions. Striking a balance between SFN cooperation and resource utilization is crucial for efficiently delivering broadcast content as well as other unicast flows. We design BoLTE, which carefully addresses this tradeoff and evaluate it using a prototype implementation over an SFN testbed, realized over a cloud-based radio access network system, as well as large-scale NS3 simulations. We show that BoLTE improves overall system throughput by around 40%.
【Keywords】: Long Term Evolution; Unicast; Diversity methods; Streaming media; Interference; Multiplexing; Resource management
【Paper Link】 【Pages】:1-10
【Authors】: Yifeng Cao ; Linghe Kong ; Liang He ; Guihai Chen ; Min-You Wu ; Tian He
【Abstract】: ZigBee is a widely used wireless technology in low-power and short-range scenarios such as Internet of Things (IoT), sensor networks, and industrial wireless networks. However, the standard ZigBee supports only one data rate, 250Kbps, which thoroughly limits ZigBee's efficiency in dynamic wireless channels. In this paper, we propose Mrs.Z, a novel physical layer design to enable multi-rate selection in ZigBee. The key idea is to change the single spectrum spreading length to multiple ones. Correspondingly, to gracefully adapt to the channel variations, we propose a BER-based rate selection scheme, dividing bit errors into two categories: errors caused by the exceeding despreading threshold, which can be discovered in the physical layer, and caused by incorrect despreading, which is not visible until cyclic redundancy check (CRC) in the media access control (MAC) layer. Then, the receiver selects the rate based on the underlying negative impacts incurred by them and feedbacks to the transceiver. We implement Mrs.Z on USRPs and evaluate its performance in different scenarios. Results demonstrate that Mrs.Z achieves an improvement of 20% and 80% compared to the classic SoftRate and the standard ZigBee.
【Keywords】: ZigBee; Throughput; Spread spectrum communication; Receivers; Physical layer; Transceivers; Standards
【Paper Link】 【Pages】:1-10
【Authors】: Xu Wang ; Zimu Zhou ; Zheng Yang ; Yunhao Liu ; Chunyi Peng
【Abstract】: Understanding and predicting cellular traffic at large-scale and fine-granularity is beneficial and valuable to mobile users, wireless carriers and city authorities. Predicting cellular traffic in modern metropolis is particularly challenging because of the tremendous temporal and spatial dynamics introduced by diverse user Internet behaviours and frequent user mobility citywide. In this paper, we characterize and investigate the root causes of such dynamics in cellular traffic through a big cellular usage dataset covering 1.5 million users and 5,929 cell towers in a major city of China. We reveal intensive spatio-temporal dependency even among distant cell towers, which is largely overlooked in previous works. To explicitly characterize and effectively model the spatio-temporal dependency of urban cellular traffic, we propose a novel decomposition of in-cell and inter-cell data traffic, and apply a graph-based deep learning approach to accurate cellular traffic prediction. Experimental results demonstrate that our method consistently outperforms the state-of-the-art time-series based approaches and we also show through an example study how the decomposition of cellular traffic can be used for event inference.
【Keywords】: Poles and towers; Mobile communication; Urban areas; Computer architecture; Monitoring; Predictive models; Mobile handsets
【Paper Link】 【Pages】:1-10
【Authors】: Ali Munir ; Zhiyun Qian ; Zubair Shafiq ; Alex Liu ; Franck Le
【Abstract】: Multipath TCP (MPTCP) is an IETF standardized suite of TCP extensions that allow two endpoints to simultaneously use multiple paths between them. In this paper, we report vulnerabilities in MPTCP that arise because of cross-path interactions between MPTCP subflows. First, an attacker eavesdropping one MPTCP subflow can infer throughput of other subflows. Second, an attacker can inject forged MPTCP packets to change priorities of any MPTCP subflow. We present two attacks to exploit these vulnerabilities. In the connection hijack attack, an attacker takes full control of the MPTCP connection by suspending the subflows he has no access to. In the traffic diversion attack, an attacker diverts traffic from one path to other paths. Proposed vulnerabilities fixes, changes to MPTCP specification, provide the guarantees that MPTCP is at least as secure as TCP and the original MPTCP. We validate attacks and prevention mechanism, using MPTCP Linux implementation (v0.91), on a real-network testbed.
【Keywords】: Throughput; Data transfer; Linux; Reliability; Wireless fidelity
【Paper Link】 【Pages】:1-10
【Authors】: Xing Liu ; Feng Qian ; Zhiyun Qian
【Abstract】: HTTPS has become a vital component of the WWW ecosystem. However, today's application-layer middleboxes in the cloud are largely “blind” to HTTPS traffic. We propose a novel system infrastructural solution, called CloudEye, that allows middleboxes to selectively manipulate HTTPS traffic. A key design philosophy of CloudEye is to hide all the complexity from client and server applications (thus being transparent to them) and to have middlebox-related functions managed by a dedicated OS service. CloudEye provides control of what information the middlebox can access through new techniques such as HTTPS tags and shadow connections, without changing the TLS/SSL or HTTP protocol. CloudEye is secure and easy to use. We implemented its prototype on Linux/Android, and demonstrated its low overhead and rich use cases on off-the-shelf mobile devices and cloud servers.
【Keywords】: Middleboxes; Servers; Protocols; Access control; Cloud computing; Encryption
【Paper Link】 【Pages】:1-10
【Authors】: Joohyun Lee ; Fang Liu ; Kyunghan Lee ; Ness B. Shroff
【Abstract】: Mobile applications that provide ever-changing information such as social media and news feeds applications are designed to consistently update their contents in the background. This operation, often called “prefetching”, provides the users with immediate access to up-to-date contents. However, such updates often result in the unwanted side-effect of draining the battery of mobile devices. It is considered as pure waste when updated contents are not accessed before being renewed. In this paper, we develop an optimal strategy to update the contents in the background under a given energy constraint. The key challenge is to predict when the user will access the contents in a probabilistic manner from the statistics of the accessed patterns in the past. We model our problem as a constrained Markov decision process (C-MDP) and propose to tackle its high complexity with a two-step solution that combines: (1) a threshold-based backward induction algorithm for the Lagrangian relaxation of our C-MDP, and (2) an iterative root finding algorithm, iMUTE (iterative Method for optimal UpdaTe policy with Energy constraint). We prove that iMUTE converges superlinearly to the optimal solution of the original C-MDP under a mild condition. We also experimentally verify that iMUTE outperforms the periodic policy as well as the additive and multiplicative increase policies that are adopted in the Doze mode of Android systems and HUSH, in terms of user experience and energy saving.
【Keywords】: Inspection; Batteries; Iterative methods; Facebook; Feeds; Markov processes; Androids
【Paper Link】 【Pages】:1-10
【Authors】: An Wang ; Yang Guo ; Songqing Chen ; Fang Hao ; T. V. Lakshman ; Doug Montgomery ; Kotikalapudi Sriram
【Abstract】: While being critical to the network management, the current state of the art in network measurement is inadequate, providing surprisingly little visibility into detailed network behaviors and often requiring high level of manual intervention to operate. Such a practice becomes increasingly ineffective as the networks grow both in size and complexity. In this paper, we propose vPROM, a vSwitch enhanced SDN programmable measurement framework that automates the measurement process, minimizes the measurement resource usage, and addresses several significant technical challenges faced by early works. vPROM leverages the SDN programmability and extends the Pyretic runtime system and OpenFlow network interface to achieve the measurement automation. The required measurement resources are minimized by only acquiring the necessary statistics, made possible with instrumented Open vSwitches1 with user defined monitoring capability. By decoupling monitoring from routing, vPROM reduces the interference between the measurement applications and other applications, and eliminates the frequent involvement of the controller. A vPROM prototype is implemented with DDoS and port-scan detection applications. The performance of vPROM is evaluated and the comparison results with other existing programmable measurement approaches are also presented.
【Keywords】: Monitoring; Instruments; Control systems; Computer languages; Current measurement; Pipelines; Instruction sets
【Paper Link】 【Pages】:1-6
【Authors】: Md Iftakharul Islam ; Javed I. Khan
【Abstract】: Interactive video streaming requires very low latency and high throughput. Traditional latency based congestion control algorithm performs poorly in fairness. This results in very poor video quality to adaptive video streaming. Software defined networks (SDN) enables us to solve the problem by designing a network controller in the routers. This paper presents a SDN-centric TCP where sending rate of the network is calculated from the network rather than the host. Routers along the path uses a proportional integral (PI) controller to calculate the sending rate in order to reduce the queuing delay. The routers also divide the available throughput fairly among the flows. The network based controller is found more effective than the sender/receiver based controller in reducing latency and providing fairness. NC-TCP has been designed for interactive video delivery network (VDN) where the interactive video flows compete among themselves. Such differentiated service obviates the need for TCP-friendliness. We have implemented NC-TCP in Linux kernel. We have evaluated NC-TCP in Mininet for an interactive video streaming application. Our experimental results shows that NC-TCP outperforms delay-based congestion control in an interactive VDN.
【Keywords】: Router-centric Congestion Control; SDN; Interactive Video Streaming; XCP; Linux Kernel Networking
【Paper Link】 【Pages】:1-10
【Authors】: Kazuya Sakai ; Min-Te Sun ; Wei-Shinn Ku ; Jie Wu
【Abstract】: Security and privacy issues are considered to be two of the most significant concerns to organizations and individuals using mobile applications. In this paper, we seek to address anonymous communications in delay tolerant networks (DTNs). While many different anonymous routing protocols have been proposed for ad hoc networks, to the best of our knowledge, only variants of onion-based routing have been tailored for DTNs. Since each type of anonymous routing protocol has its advantages and drawbacks, there is no single anonymous routing protocol for DTNs that can adapt to the different levels of security requirements. In this paper, we first design a set of anonymous routing protocols for DTNs, called anonymous Epidemic and zone-based anonymous routing, based on the original anonymous routing protocols for ad hoc networks. Then, we propose a framework of anonymous routing (FAR) for DTNs, which subsumes all the aforementioned protocols. By tuning its parameters, the proposed FAR is able to outperform onion-based, anonymous Epidemic, and zone-based routing. In addition, numerical analyses for the traceable rate and node anonymity models are built. Extensive simulations using randomly generated graphs as well as real traces are conducted to demonstrate that given appropriate parameter settings, our FAR outperforms all the existing anonymous routing protocols for DTNs.
【Keywords】: Delay tolerant networks; DTNs; anonymous routing
【Paper Link】 【Pages】:1-2
【Authors】: Garegin Grigoryan ; Yaoqing Liu
【Abstract】: The current Internet routing ecosystem is neither sustainable nor economical. More than 711K IPv4 routes and more than 41K IPv6 routes exist in current global Forwarding Information Base (FIBs) with growth rates increasing. This rapid growth has serious consequences, such as creating the need for costly FIB memory upgrades and increased potential for Internet service outages. And while FIB memories are power-hungry and prohibitively expensive, more than 70% of the routes in FIBs carry no traffic for long time periods, a wasteful use of these expensive resources. Taking advantage of the emerging concept of programmable data plane, we design a programmable FIB caching architecture to address the existing concerns. Our preliminary evaluation results show that the architecture can significantly mitigate the global routing scalability and poor FIB utilization issues.
【Keywords】: Random access memory; Routing; Hardware; Ecosystems; Web and internet services; Pipelines
【Paper Link】 【Pages】:1-2
【Authors】: Yutao Huang ; Xiaoqiang Ma ; Xiaoyi Fan ; Jiangchuan Liu ; Wei Gong
【Abstract】: The state-of-the-art cloud computing platforms are facing challenges, such as the high volume of crowdsourced data traffic and highly computational demands, involved in typical deep learning applications. More recently, Edge Computing has been recently proposed as an effective way to reduce the resource consumption. In this paper, we propose an edge learning framework by introducing the concept of edge computing and demonstrate the superiority of our framework on reducing the network traffic and running time.
【Keywords】: Servers; Cloud computing; Machine learning; Training data; Principal component analysis; Edge computing; Feature extraction
【Paper Link】 【Pages】:1-2
【Authors】: Yahui Li ; Zhiliang Wang ; Jiangyuan Yao ; Xia Yin ; Xingang Shi ; Jianping Wu
【Abstract】: Multiple SDN applications can make several harmful interferences unintentionally, although each individual application may be properly developed. This paper proposes a Multiple SDN Applications Interference Detector (MSAID). To bridge the gap between the source code of applications and the actual interferences, we leverage symbolic execution and constraint solving to obtain how the event handler handles the input messages. We then analyze the complex interaction of multiple applications and present novel methods to identify the interferences. Finally, we evaluate its correctness and prove its usefulness with a series of SDN applications.
【Keywords】: Interference; Switches; Concrete; Guidelines; Reliability; Testing; Servers
【Paper Link】 【Pages】:1-2
【Authors】: Max Engelhardt ; Arash Asadi
【Abstract】: Experimental setups for cellular communications have always been a rare commodity in academia. The advent of software-defined radios (SDRs) paved the way for researchers to prototype their ideas on real hardware. However, existing SDR platforms and their associated reference design codes mostly provide basic cellular functionality with limitations such as low numbers of users and computational capacity. In this demo, we demonstrate the first SDR-based testbed for inband D2D communications using LabVIEW Communications and the USRP hardware platform. Furthermore, we implement a light-weight quality-aware scheduler which adaptively switches communication links from D2D to cellular and vice versa.
【Keywords】: Device-to-device communication; Long Term Evolution; Computer architecture; Downlink; Uplink; 5G mobile communication; Hardware
【Paper Link】 【Pages】:1-10
【Authors】: Zhaogeng Li ; Jun Bi ; Yiran Zhang ; Abdul Basit Dogar ; Chengwei Qin
【Abstract】: There have been many traffic balancing solutions for datacenter networks. All of them require modifications to the network fabric or/and virtual machines. In this paper, we propose Virtual Multi-channel Scatter (VMS), a new traffic balancing solution in datacenter networks. VMS works in the virtual switches between the network fabric and virtual machines. It can be deployed by datacenter operators at a relatively low cost without extra restrictions to virtual machine users. VMS scatters packets in one TCP flow to several different forwarding paths. It employs an adaptive path selection based on the virtual window size of different paths. We implemented VMS based on OVS. Our evaluation demonstrates that VMS improves traffic balancing very well, and the performance of VMS is approximate to MPTCP in almost all the cases, while only modifies virtual switches. Further, the overhead of VMS is tolerable.
【Keywords】: Datacenter Network; Traffic Balancing; ECMP; MPTCP; VMS
【Paper Link】 【Pages】:1-2
【Authors】: Yao-Yu Li ; Chi-Yu Li ; Wei-Han Chen ; Chia-Jui Yeh ; Kuochen Wang
【Abstract】: WiGig enables wireless multi-gigabit communication over 60GHz band. However, its usage scenarios may be constrained by two major limitations: line-of-sight propagation and very short transmission range. We seek to boost the WiGig's usability by using WiFi to complement its limitations in tri-band (2.4/5/60GHz) wireless systems. Our goal is to let a tri-band client have multimedia services at the WiGig's very high speed without any hassle. When the WiGig link is down or performs bad, not only can the client temporarily handover to WiFi without service interruption, but its ongoing multimedia services can also adapt to the WiFi's slower link. Though the IEEE 802.11ad standard has proposed an FST (Fast Session Transfer) mechanism to support handover operations at the link layer, it does not satisfy our goal due to two reasons. First, it does not specify when to perform WiGig/WiFi handovers. Second, it is not application-aware to achieve the service adaptation. To this end, we design and implement an application-aware, seamless WiGig/WiFi handover solution above the network layer. It ensures timely handover trigger for the WiGig's abrupt link interruption, keeps service continuity during handovers, and adapts multimedia service qualities to different WiGig/WiFi links. Our demo confirms its viability. We show that a video streaming service at the client is not interrupted during WiGig/WiFi handovers, which are triggered by mobility or the WiGig's signal blockage, but smoothly switches between different resolutions according to different links.
【Keywords】: Handover; Wireless fidelity; Streaming media; Wireless communication; Multimedia communication; Throughput
【Paper Link】 【Pages】:1-6
【Authors】: David Koll ; Dieter Lechler ; Xiaoming Fu
【Abstract】: Today, Online Social Networks (OSNs) are ubiquitous means of communication. In order to prevent the misuse of personal user data by OSN providers, various research efforts have produced a multitude of approaches to decentralize OSNs in the past decade. The most critical challenge for these systems is to replace the infrastructure of centralized OSNs. That is, they need to handle the large amounts of data uploaded by users on one end, and requests towards that data on the other end. Typically, existing approaches instrumentalize cloud facilities or user devices for this task. Unfortunately, they introduce either a monetary cost for users or have limited success in making data highly available. In this work we propose SocialGate, the first prototype that makes use of home routers of users as the infrastructure backbone of the OSN to avoid these shortcomings. Measurements and experiments based on real-world data support the feasibility and practicability of our approach.
【Keywords】: Logic gates; Mirrors; Cryptography; Memory; Social network services; Servers; Time measurement
【Paper Link】 【Pages】:1-2
【Authors】: Shuo Wang ; Jiao Zhang ; Tao Huang ; Tian Pan ; Jiang Liu ; Yunjie Liu
【Abstract】: ECN thresholds have limited operational range and very strict scope. Lower thresholds exacerbate the queue underflow while higher thresholds increase the queueing delays. In this paper, an Adaptive ECN (A-ECN) marking scheme is proposed to enhance the performance of ECN. A-ECN can adaptively adjust ECN marking thresholds in different scenarios to achieve good generality. Therefore, network operators can directly deploy A-ECN in various environments regardless of underlying queue types and bandwidth.
【Keywords】: Datacenter network; DCTCP; ECN; Congestion control
【Paper Link】 【Pages】:1-10
【Authors】: Zicheng Chi ; Yan Li ; Yao Yao ; Ting Zhu
【Abstract】: The exponentially increasing number of Internet of things (IoT) devices introduces spectrum crisis to the widely used industrial, scientific, and medical (ISM) frequency band. Since IoT devices use heterogeneous radios with different bandwidths (e.g., 20 MHz for WiFi and 2 MHz for ZigBee), traditional interference avoidance methods, such as time-division multiple access (TDMA) and carrier-sense multiple access (CSMA), have very low spectrum utilization. This is because TDMA and CSMA allocate the packets at time domain, without considering the bandwidth difference of different IoT radios. To address this issue, we propose PMC, a novel communication system that enables parallel multi-protocol communication to heterogeneous IoT radios (i.e., WiFi and ZigBee) within a single WiFi channel. Our extensive evaluations show that PMC achieves the throughput of up to 121.02 kbit/s and 319.76 Mbit/s for parallel communication to ZigBee and WiFi, respectively. Compared with TDMA and CSMA, the spectrum utilization of PMC is increased by 2.3 and 1.8 times, respectively.
【Keywords】: ZigBee; Wireless fidelity; Quadrature amplitude modulation; Table lookup; Receivers; Spread spectrum communication
【Paper Link】 【Pages】:1-6
【Authors】: Aditya Dhakal ; K. K. Ramakrishnan
【Abstract】: Monitoring of residences and businesses can be effectively performed using machine learning algorithms. As sensors and devices used for monitoring become more complex, having humans process the information to detect intrusions would be expensive and difficult to scale. We propose an automated home/business monitoring system which resides on edge servers performing online learning on streaming data coming from homes and businesses in the neighborhood. The edge servers run Open-NetVM, a Network Function Virtualization (NFV) platform, and host multiple machine learning applications instantiated on demand. This enables us to serve a set of customers in the neighborhood on a timely basis, permitting customization and learning of the behavior of each home. We combine the results of the multiple classifiers, with each classifier examining a distinct feature related to a distinct sensor, to finally infer whether the entry is a normal one or an intrusion. Our results show that our system is able to classify intrusions better than basing the decision on a single classifier, thus reducing false alarms. We have also shown that our system can effectively scale and monitor thousands of homes.
【Keywords】: Sensors; Monitoring; Cameras; Servers; Business; Noise measurement; Image edge detection
【Paper Link】 【Pages】:1-10
【Authors】: Wei Gong ; Si Chen ; Jiangchuan Liu
【Abstract】: Recently backscatter networks have received booming interest because, they offer a battery-free communication paradigm using propagation radio waves as opposed to active radios in traditional sensor networks while providing comparable sensing functionalities, ranging from light and temperature sensors to recent microphones and cameras. While sensing data on backscatter nodes has been seen on a clear path to increase in both volume and variety, backscatter communication is not well prepared and optimized for transferring such continuous and high-volume data. To bridge this gap, we propose a high-throughput rate adaptation scheme for backscatter networks by exploring the unique characteristics of backscatter links and the design space of the ISO 18000-6C (C1G2) protocol. Our key insight is that while prior work has left the downlink unattended, we observe that the quality of downlink is affected significantly by multipath fading and thus can degrade the uplink and overall throughput considerably. Therefore, we introduce a novel rate mapping algorithm that chooses the best rate for both the downlink and uplink. Also, we design an efficient channel estimation method fully compatible with the C1G2 protocol and a reliable probing trigger, substantially saving probing overhead. Our scheme is prototyped using a COTS RFID reader and tags. The results show that we achieve up to 2.5x throughput gain over state-of-the-art approaches across various mobility, channel, and network-size conditions.
【Keywords】: Backscatter; Downlink; Uplink; Throughput; Protocols; Channel estimation; Sensors
【Paper Link】 【Pages】:1-6
【Authors】: Mohamad Darianian ; Carey Williamson ; Israat Haque
【Abstract】: Software-Defined Networking (SDN) can help simplify the management of today's complex networks and data centers. SDN provides a comprehensive view of the network, offering flexibility and easing automation. In SDN, traffic management functionality requires a high-performance and responsive controller. In this paper, we conduct an experimental evaluation of two open-source distributed OpenFlow controllers, namely ONOS and OpenDaylight. Specifically, we construct a testbed and use a standard benchmarking tool called Cbench to evaluate their performance. We benchmark the throughput, latency, and thread scalability of these two controllers in both physical and virtualized (OpenStack) environments. The experimental results show that ONOS provides higher throughput and lower latency than OpenDaylight, which suffers from performance problems on larger network models. Additional experiments demonstrate the effects of thread placement on the performance of these two controllers.
【Keywords】: Throughput; Instruction sets; Sockets; Servers; Message systems; Control systems; Market research
【Paper Link】 【Pages】:1-6
【Authors】: Yangming Zhao ; Shouxi Luo ; Yi Wang ; Sheng Wang
【Abstract】: Computing frameworks have been widely deployed to support global-scale services. A job typically has multiple sequential stages, where each stage is further divided into multiple parallel tasks. We call the set of all the tasks in a stage of a job a cotask. In this paper, we aim to minimize the average Cotask Completion Time (CCT) in cotask scheduling. To the best of our knowledge, there is no prior work on cotask scheduling for cloud computing. We propose the Cotask Scheduling Scheme (CSS), and take MapReduce as a representative of computing frameworks. CSS schedules cotasks following the Minimum Completion Time First (MCTF) policy, and we prove this problem is NP-hard. We formulate the model using the Integer Linear Programming (ILP), and solve it through an efficient heuristics based on ILP relaxation. Through real trace based simulations, we show that CSS is able to reduce the average CCT by up to 62.20% and 69.93% with traces from our testbed and from a large production cluster respectively.
【Keywords】: Cascading style sheets; Processor scheduling; Schedules; Computational modeling; Servers; Heuristic algorithms
【Paper Link】 【Pages】:1-10
【Authors】: Gongming Zhao ; Hongli Xu ; Shigang Chen ; Liusheng Huang ; Pengzhan Wang
【Abstract】: Software Defined Networking (SDN) separates the control plane from the data plane to ease network management and provide flexibility in packet routing. The control plane interacts with the data plane through the forwarding tables, usually including a flow table and a group table, at each switch. Due to high cost and power consumption of Ternary Content Addressable Memory (TCAM), commodity switches can only support flow/group tables of limited size, which presents serious challenge for SDN to scale to large networks. One promising approach to address the scalability problem is to deploy aggregate default paths specified by wildcard forwarding rules. However, the multi-dimensional interaction among numerous system parameters and performance/scalability considerations makes the problem of setting up the flow/group tables at all switches for optimal overall layout of default paths very challenging. This paper studies the joint optimization of flow/group tables in the complex setting of large-scale SDNs. We formulate this problem as an integer linear program, and prove its NP-Hardness. An efficient algorithm with bounded approximation factors is proposed to solve the problem. The properties of our algorithm are formally analyzed. We implement the proposed algorithm on an SDN testbed for experimental studies and use simulations for large-scale investigation. The experimental results and simulation results demonstrate high efficiency of our proposed algorithm.
【Keywords】: Software Defined Networks; Default Paths; Load Balancing; Flow Table; Group Table
【Paper Link】 【Pages】:1-6
【Authors】: Kais Elmurtadi Suleiman ; Otman Basir
【Abstract】: Utilizing vehicles for networking purposes has always been a challenge. This is mainly due to the minimum density of connected-vehicles required. The locations of these vehicles should be shareable and reasonably predictable for efficient position-based routing protocols to be implemented. Their Vehicle-to-Vehicle (V2V) communication cooperation should be well-incentivized for efficient networking to be realized. Regular vehicles struggle to have all of these properties. Public transportation vehicles, on the other hand, are well-positioned in this regard; their number is proportional to the number of city residents while being uniformly distributed throughout the day, their locations have no privacy concerns while being highly predictable and their V2V communication cooperation is easily enforceable by the single administration authority they usually have. With efficient networking, public transportation vehicles can become the reliable communication backbone for other vehicle categories. In order to investigate their networking potential, we present for the firs time, in this paper, a data analysis study of realistic public transportation mobility datasets representing the Grand River Transit bus service offered throughout the Region of Waterloo, Ontario, Canada. We show both the data preprocessing and processing phases. The processing phase is mainly based on discovering bus groups using hierarchical clustering. This is done while varying the minimum degree of intra-cluster connectivity and the maximum intra-cluster communication range. Based on this data analysis approach, we show the promising networking potential of public transportation vehicles and provide design guidelines for future networking solutions utilizing them.
【Keywords】: Public transportation; Mobility; Data analysis; Hierarchical clustering; Vehicular Networking
【Paper Link】 【Pages】:1-10
【Authors】: Muhammad Taqi Raza ; Dongho Kim ; Kyu-Han Kim ; Songwu Lu ; Mario Gerla
【Abstract】: LTE Network Function Virtualization (LTE-NFV) scales user services in a low cost fashion by transforming the centralized legacy LTE Core architecture to a distributed architecture. This distributed architecture makes multiple instances of LTE Network Functions (NFs) and virtualizes them on commodity data-center network. The functionality of LTE-NFV architecture breaks however, since the distributed NF instances connected via unreliable IP links delay the execution of critical events. The failure of time-critical events results in users' quality of service degradation and temporary service unavailability. In this paper, we propose a new way to virtualize LTE core network. We argue that logic-based NFs segregation should be done for NFV, instead of instance-based NFs segregation done in current NFV implementation. Our approach of `logic-based NFs segregation' combines the logic of an event into a single NF, thus localizing the execution of critical events to one virtual machine. This way, only the localized entities exchange signalling messages, and the events do not experience large delays. We further reduce the delays by exploiting the parallelism in LTE network protocols; and partition these protocols such that their signalling messages run in parallel. In addition, we eliminate unnecessary messages to reduce the signalling overhead. We build our system prototype over OpenEPC LTE core network in virtualized platform. Our results show that we can reduce event execution time and signalling overhead up to 50% and 40%, respectively.
【Keywords】: computer centres; computer network reliability; computer networks; IP networks; Long Term Evolution; mobility management (mobile radio); virtual machines; virtualisation
【Paper Link】 【Pages】:1-10
【Authors】: Mubashir Adnan Qureshi ; Ajay Mahimkar ; Lili Qiu ; Zihui Ge ; Max Zhang ; Ioannis Broustis
【Abstract】: Cellular service providers continuously upgrade their network software on base stations to introduce new service features, fix software bugs, enhance quality of experience to users, or patch security vulnerabilities. A software upgrade typically requires the network element to be taken out of service, which can potentially degrade the service to users. Thus, the new software is deployed across the network using a rolling upgrade model such that the service impact during the roll-out is minimized. A sequential roll-out guarantees minimal impact but increases the deployment time thereby incurring a significant human cost and time in monitoring the upgrade. A network-wide concurrent roll-out guarantees minimal deployment time but can result in a significant service impact. The goal is to strike a balance between deployment time and service impact during the upgrade. In this paper, we first present our findings from analyzing upgrades in operational networks and discussions with network operators and exposing the challenges in rolling software upgrades. We propose a new framework Concord to effectively coordinate software upgrades across the network that balances the deployment time and service impact. We evaluate Concord using real-world data collected from a large operational cellular network and demonstrate the benefits and tradeoffs. We also present a prototype deployment of Concord using a small-scale LTE testbed deployed indoors in a corporate building.
【Keywords】: Base stations; Software; Cellular networks; Schedules; Long Term Evolution; Monitoring; Urban areas
【Paper Link】 【Pages】:1-2
【Authors】: Huazhe Wang ; Xin Li ; Chen Qian
【Abstract】: Outsourcing middleboxes brings threats to the enterprise's private information including the trafflc and rules of middleboxes. We present a secure and dynamic middlebox outsourcing framework SICS, short for Secure In-Cloud Service. SICS encrypts each packet header and uses a label for in-cloud rule matching, which enables the cloud to perform its functionalities correctly with minimum header information leakage.
【Keywords】: Middleboxes; Silicon carbide; Cloud computing; Logic gates; Switches; Outsourcing; Cryptography
【Paper Link】 【Pages】:1-6
【Authors】: Dagang Li ; Zehua Zheng
【Abstract】: Disk-based large scale graph computation on a single machine has been attracting much attention, with GraphChi as one of the most well-accepted solutions. However, we find out that the performance of GraphChi becomes I/O-constrained when memory is moderately abundant, and from some point adding more memory does not help with the performance any more. In this work, a greedy caching algorithm GSC is proposed for GraphChi to make better use of the memory. It alleviates the I/O constraint by caching and delaying the write-backs of GraphChi shards that have already been loaded into the memory. Experimental results show that by minimizing unnecessary I/Os, GSC can be up to 4x faster during computation than standard GraphChi under memory constraint, and achieve about 3x performance gain when sufficient memory is available.
【Keywords】: Graph computaion; GraphChi; GSC
【Paper Link】 【Pages】:1-6
【Authors】: Xiaoye Steven Sun ; T. S. Eugene Ng
【Abstract】: Data multicast is an important data traffic pattern in today's data center running big data oriented applications. The physical layer multicast capability enabled by the emerging technologies used to build circuit switches exhibits huge benefit in transferring multicast data. This paper tackles the problem of scheduling multicast data transfer in high-bandwidth circuit switch. The scheduler aims at minimizing the average demand completion time to deliver the most benefit to the applications. Our algorithm exhibits up to 13.4× improvement comparing with the state-of-the-art solution.
【Keywords】: Switching circuits; Bandwidth; Servers; Ports (Computers); Scheduling algorithms; Receivers
【Paper Link】 【Pages】:1-10
【Authors】: Hanhua Chen ; Liangyi Liao ; Hai Jin ; Jie Wu
【Abstract】: The emergence of large-scale dynamic sets in real applications creates stringent requirements for approximate set representation structures: 1) the capacity of the set representation structures should support flexibly extending or reducing to cope with dynamically changing of set size; 2) the set representation structures should support reliable delete operation. Existing techniques for approximate set representation, e.g., the cuckoo filter, the Bloom filter and its variants cannot meet both the requirements of a dynamic set. To solve the problem, in this paper we propose the dynamic cuckoo filter (DCF) to support reliable delete operation and elastic capacity for dynamic set representation and membership testing. Two factors contribute to the efficiency of the DCF design. First, the data structure of a DCF is extendable, making the representation of a dynamic set space efficient. Second, a DCF utilizes a monopolistic fingerprint for representing an item and guarantees reliable delete operation. Experiment results show that compared to the existing state-of-the-art designs, DCF achieves 75% reduction in memory cost, 50% improvement in construction speed, and 80% improvement in speed of membership query. We implement a prototype file backup system and use DCF for data deduplication. Comprehensive experiment results demonstrate the efficiency of our DCF design compared to existing schemes.
【Keywords】: Dynamic set representation; set membership testing; cuckoo filter
【Paper Link】 【Pages】:1-10
【Authors】: Wooseung Nam ; Joohyun Lee ; Kyunghan Lee
【Abstract】: In this work, we raise a question on why the abundant information previously shared between a server and its client is not effectively utilized in the exchange of a new data which may be highly correlated with the shared data. We formulate this question as an encoding problem that is applicable to general data synchronization services including a wide range of Internet services such as cloud data synchronization, web browsing, messaging, and even data streaming. To this problem, we propose a new encoding technique, SyncCoding that maximally replaces subsets of the data to be transmitted with the coordinates pointing to the matching subsets included in the set of relevant shared data, called references. SyncCoding can be easily integrated into a transport layer protocol such as HTTP and enables significant reduction of network traffic. Our experimental evaluations of SyncCoding implemented in Linux shows that it outperforms existing popular encoding techniques, Brotli, LZMA, Deflate, and Deduplication in two practical use networking applications: cloud data sharing and web browsing. The gains of SyncCoding over Brotli, LZMA, Deflate, and Deduplication in the encoded size to be transmitted are shown to be about 12.4%, 20.1%, 29.9%, and 61.2% in the cloud data sharing and about 78.3%, 79.6%, 86.1%, and 92.9% in the web browsing, respectively. The gains of SyncCoding over Brotli, LZMA, and Deflate when Deduplication is applied in advance are about 7.4%, 10.6%, and 17.4% in the cloud data sharing and about 79.4%, 82.0%, and 83.2% in the web browsing, respectively.
【Keywords】: Synchronization; Cloud computing; Channel coding; Distributed databases; Indexes; Redundancy
【Paper Link】 【Pages】:1-10
【Authors】: Weiping Sun ; Jonghoe Koo ; Seongho Byeon ; Woojin Park ; Sangsoon Lim ; Daehyun Ban ; Sunghyun Choi
【Abstract】: Dense Wi-Fi and Bluetooth (BT) environments become increasingly common so that the coexistence issue between Wi-Fi and BT is imperative to solve. In this paper, we propose BlueCoDE, a coordination scheme for multiple neighboring BT piconets, to make them collision-free and less harmful to Wi-Fi. BlueCoDE reuses BT's existing PHY and MAC design, thus making it practically feasible. We implement a prototype of BlueCoDE on Ubertooth One platform and corroborate the performance gain via analysis, NS-3 simulations, and prototype-based experiments. Our experimental results show that with merely 10 legacy BT piconets, neighboring Wi-Fi network becomes useless achieving under 1 Mb/s throughput, while BlueCoDE enables the Wi-Fi throughput always remain above 12 Mb/s. We expect BlueCoDE to be a breakthrough solution for coexistence in dense Wi-Fi and BT environments.
【Keywords】: Wireless fidelity; Interference; Kernel; Bluetooth; Wireless communication; Synchronization
【Paper Link】 【Pages】:1-10
【Authors】: Hanhua Chen ; Fan Zhang ; Hai Jin
【Abstract】: Real-world stream data with skewed distribution raises unique challenges to distributed stream processing systems. Existing stream workload partitioning schemes usually use a “one size fits all” design, which leverage either a shuffle grouping or a key grouping strategy for partitioning the stream workloads among multiple processing units, leading to notable problems of unsatisfied system throughput and processing latency. In this paper, we show that the key grouping based schemes result in serious load imbalance and low computation efficiency in the presence of data skewness while the shuffle grouping schemes are not scalable in terms of memory space. We argue that the key to efficient stream scheduling is the popularity of the stream data. We propose and implement a differentiated distributed stream processing system, call DStream, which assigns the popular keys using shuffle grouping while assigns unpopular ones using key grouping. We design a novel efficient and light-weighted probabilistic counting scheme for identifying the current hot keys in dynamic real-time streams. Two factors contribute to the power of this design: 1) the probabilistic counting scheme is extremely computation and memory efficient, so that it can be well integrated in processing instances in the system; 2) the scheme can adapt to the popularity changes in the dynamic stream processing environment. We implement the DStream system on top of Apache Storm. Experiment results using large-scale traces from real-world systems show that DStream achieves a 2.3× improvement in terms of processing throughput and reduces the processing latency by 64% compared to state-of-the-art designs.
【Keywords】: distributed stream processing system; skewness; load balance
【Paper Link】 【Pages】:1-10
【Authors】: Zeqi Lai ; Yong Cui ; Yimin Jiang ; Xiaomeng Chen ; Y. Charlie Hu ; Kun Tan ; Minglong Dai ; Kai Zheng
【Abstract】: While the bandwidth and latency improvement of both WiFi and cellular data networks in the past decade are plenty evident, the extent of signal strength fluctuation and network disruptions (unexpected switching or disconnections) experienced by mobile users in today's network deployment remains less clear. This paper makes three contributions. First, we conduct the first extensive measurement of network disruptions and signal strength fluctuations (together denoted as instabilities) experienced by 2000 smartphones in the wild. Our results show that network disruptions and signal strength fluctuations remain prevalent as we moved into the 4G era. Second, we study how well popular mobile apps today handle such network instabilities. Our results show that even some of the most popular mobile apps do not implement any disruption-tolerant mechanisms. Third, we present JANUS, an intelligent interface management framework that exploits the multiple interfaces on a handset to transparently handle network disruptions and improve apps' QoE. We have implemented JANUS on Android and our evaluation using a set of popular apps shows that Janus can (1) transparently and efficiently handle network disruptions, (2) reduce video stalls by 2.9 times and increase 31% of the time of good voice quality compared to naive solutions.
【Keywords】: Wireless fidelity; Mobile communication; Mobile computing; Switches; Smart phones; Bandwidth
【Paper Link】 【Pages】:1-10
【Authors】: Zhuotao Liu ; Yushan Liu ; Philipp Winter ; Prateek Mittal ; Yih-Chun Hu
【Abstract】: Tor is the most widely used anonymity network, currently serving millions of users each day. However, there is no access control in place for all these users, leaving the network vulnerable to botnet abuse and attacks. For example, criminals frequently use exit relays as stepping stones for attacks, causing service providers to serve CAPTCHAs to exit relay IP addresses or blacklisting them altogether, which leads to severe usability issues for legitimate Tor users. To address this problem, we propose TorPolice, the first privacy-preserving access control framework for Tor. TorPolice enables abuse-plagued service providers such as Yelp to enforce access rules to police and throttle malicious requests coming from Tor while still providing service to legitimate Tor users. Further, TorPolice equips Tor with global access control for relays, enhancing Tor's resilience to botnet abuse. We show that TorPolice preserves the privacy of Tor users, implement a prototype of TorPolice, and perform extensive evaluations to validate our design goals.
【Keywords】: Relays; Access control; CAPTCHAs; IP networks; Privacy; Servers
【Paper Link】 【Pages】:1-10
【Authors】: João Luis Sobrinho ; David Fialho ; Paulo Mateus
【Abstract】: Despite years of research, the Internet still lacks a routing protocol with guaranteed termination. As is well-known, decentralization of routing decisions among the Autonomous Systems (ASes) that comprise the Internet may result in permanent oscillations of the state of its routing protocol - the Border Gateway Protocol (BGP). Some permanent oscillations are made from routing loops - the propagation of routing messages around the cycles of a network - that come back time and again. We discovered that the routing loop detection capability of BGP can be sharpened to predict which routing loops potentially recur and that the import policies can be adjusted to prevent the recurrence. The resulting protocol, named Self-Stable BGP (SS-BGP), is more stable than BGP. For the broad and common class of isotone routing policies, all permament oscillations are made from recurrent routing loops. For this class of routing policies, SS-BGP terminates. Our simulations with realistic Internet topologies and realistic variations of the Gao-Rexford (GR) inter-AS routing policies show that SS-BGP arrives at stable states at the expense of alterations in the import policies of only a handful of ASes.
【Keywords】: Routing; Peer-to-peer computing; Routing protocols; Oscillators; Business; Internet
【Paper Link】 【Pages】:1-6
【Authors】: Zhijie Zhu ; Qing Li ; Mingwei Xu ; Ziyan Song ; Shu-Tao Xia
【Abstract】: Among the schemes proposed for failure recovery in software-defined networks, installing backup paths in advance is considered to be an effective approach to reduce the recovery latency. However, the pre-installation poses undue storage overheads on flow tables. In this paper, we propose a customized and cost-efficient backup scheme, which achieves fast recovery from any single-link failure. We introduce an improved breadth first search algorithm to construct the customized backup paths of flows to accommodate their diverse routing demands. By analyzing the path characteristics carefully, we observe that non-conflicted backup paths can be aggregated with each other to reduce the number of backup rules. We formulate this backup path aggregation as an optimization problem. The challenge is how to aggregate the backup paths without causing routing ambiguity. To this end, we design a two-stage aggregation (2SA) algorithm. At its core, 2SA leverages conflict matrixes to guarantee the correctness of aggregation. We evaluate our scheme comprehensively with both the real-world topologies and generated topologies. Simulation results show that our scheme can pre-install the customized backup paths with much fewer, typically one order of magnitude, backup rules compared to the traditional flow-based protection without aggregation.
【Keywords】: Routing; Algorithm design and analysis; Aggregates; Optimization; Topology; Network topology; Delays
【Paper Link】 【Pages】:1-6
【Authors】: Danish Sattar ; Ashraf Matrawy
【Abstract】: Network virtualization offers flexibility by decoupling virtual network from the underlying physical network. Software-Defined Network (SDN) could utilize the virtual network. For example, in Software-Defined Networks, the entire network can be run on commodity hardware and operating systems that use virtual elements. However, this could present new challenges of data plane performance. In this paper, we present an empirical model of the packet processing delay of a widely used OpenFlow virtual switch, the Open vSwitch. In the empirical model, we analyze the effect of varying Random Access Memory (RAM) and network parameters on the performance of the Open vSwitch. Our empirical model captures the non-network processing delays, which could be used in enhancing the network modeling and simulation.
【Keywords】: Delays; Random access memory; Switches; Analytical models; Kernel; Hardware; Queueing analysis
【Paper Link】 【Pages】:1-2
【Authors】: Sibendu Paul ; Anand Seetharam ; Amitava Mukherjee ; Mrinal Kanti Naskar
【Abstract】: With the growth of Internet-of-Things, mobile data traffic is expected to increase exponentially. To support this rapid growth, heterogeneous cellular networks comprising of femtocells with storage capabilities along with macrocell base stations have been proposed. In this paper, we first investigate the performance impact of a simple randomized cache pollution attack, where the attacker pollutes the cache at the femtocell by requesting unpopular content. We then adopt a principled approach based on the characteristic time of a content in a cache to design an optimized attack strategy. Our experiments show that the proposed attack strategy outperforms the randomized attack with the same attack rate.
【Keywords】: Pollution; Femtocells; Macrocell networks; Delays
【Paper Link】 【Pages】:1-2
【Authors】: Han Zhang ; Xingang Shi ; Xia Yin ; Zhiliang Wang
【Abstract】: Recently, coflow has been proposed as a new abstraction to capture the communication patterns in a rich set of data parallel applications in data centers. Coflows effectively model the application-level semantics of network resource usage, so high-level optimization goals, such as reducing the transfer latency of applications, can be better achieved by taking coflows as the basic elements in network resource allocation or scheduling. Although efficient coflow scheduling methods have been studied, in this paper, we propose to schedule weighted coflows as a further step in this direction, where weights are used to express the emergences or priorities of different coflows or their corresponding applications. We design an information-agnostic online algorithm to dynamically schedule coflows according to their weights and the instantaneous network condition. Then We implement the algorithm in a scheduling system named Yosemite. Our evaluation results show that, compared to the latest information-agnostic coflow scheduling algorithms, Yosemite can reduce more than 40% of the WCCT (Weighted Coflow Completion Time), and more than 30% of the completion time for coflows with above-the-average level of emergence. It even outperforms the most efficient clairvoyant coflow scheduling method by reducing around 30% WCCT, and 25%~30% of the completion time for coflows with above-the-average emergence, respectively.
【Keywords】: Schedules; Processor scheduling; Heuristic algorithms; Bandwidth; Ports (Computers); Semantics
【Paper Link】 【Pages】:1-6
【Authors】: Cheng-Liang Hsieh ; Ning Weng
【Abstract】: Current Software-Defined Networking (SDN) switch examines many packet headers to support the flow-based packet forwarding. To support the application-based forwarding for a service function chaining (SFC), SDN switch requires packet header modifications to identify the processing status and multiple packet matchings to steer the network traffics to different VMs in a specific order. Both challenges require significant computation resources in a system and result in severe system performance degradation. To improve the system performance and keep the flexibility, this paper proposes NF-Switch to eliminate the requirement of packet modifications and to reduce the number of matchings for the application-based forwarding. Compared to the native implementation, our experimental results show that NF-Switch reduces the system processing latency to one quarter and increases the system throughput about 3 times for a SFC with 10 network functions (NFs). Moreover, the proposed solution maintains the content switching time to update the implemented SFC for a better system scalability regarding to the number of NFs in a SFC.
【Keywords】: System performance; Servers; Control systems; Middleboxes; Software; Noise measurement; Scalability
【Paper Link】 【Pages】:1-10
【Authors】: Adnan Ahmed ; Zubair Shafiq ; Harkeerat Bedi ; Amir R. Khakpour
【Abstract】: Fueled by increasing network bandwidth and decreasing costs, the popularity of over-the-top large-scale live video streaming has dramatically increased over the last few years. In this paper, we present a measurement study of adaptive bitrate video streaming for a large-scale live event. Using server-side logs from a commercial content delivery network, we study live video delivery for the annual Academy Awards event that was streamed by hundreds of thousands of viewers in the United States. We analyze the relationship between Quality-of-Experience (QoE) and user engagement. We first study the impact of buffering, average bitrate, and bitrate fluctuations on user engagement. To account for interdependencies among QoE metrics and other confounding factors, we use quasi-experiments to quantify the causal impact of different QoE metrics on user engagement. We further design and implement a Principal Component Analysis (PCA) based technique to detect live video QoE impairments in real-time. We then use Hampel filters to detect QoE impairments and report 92% accuracy with 20% improvement in true positive rate as compared to baselines. Our approach allows content providers to detect and mitigate QoE impairments on the fly instead of relying on post-hoc analysis.
【Keywords】: Streaming media; Bit rate; Internet; Servers; Bandwidth
【Paper Link】 【Pages】:1-6
【Authors】: Walid A. Y. Aljoby ; Tom Z. J. Fu ; Richard T. B. Ma
【Abstract】: We consider data intensive cloud-based stream analytics where data transmission through the underlying communication network is the cause of the performance bottleneck. Two key inter-related problems are investigated: task placement and bandwidth allocation. We seek to answer the following questions. How does task placement make impact on the application-level throughput? Does a careful bandwidth allocation among data flows traversing a bottleneck link results in better performance? In this paper, we address these questions by conducting measurement-driven analysis in a SDN-enabled computer cluster running stream processing applications on top of Apache Storm. The results reveal (i) how tasks are assigned to computing nodes make large difference in application level performance; (ii) under certain task placement, a proper bandwidth allocation helps further improve the performance as compared to the default TCP mechanism; and (iii) task placement and bandwidth allocation are collaboratively making effects in overall performance.
【Keywords】: Channel allocation; Topology; Bandwidth; Storms; Data communication; Throughput
【Paper Link】 【Pages】:1-10
【Authors】: Mubashir Adnan Qureshi ; Ajay Mahimkar ; Lili Qiu ; Zihui Ge ; Sarat C. Puthenpura ; Nabeel Mir ; Sanjeev Ahuja
【Abstract】: Cellular networks are constantly evolving due to frequent changes in radio access and end user equipment technologies, dynamic applications and associated trafflc mixes. Network upgrades should be performed with extreme caution since millions of users heavily depend on the cellular networks for a wide range of day to day tasks, including emergency and alert notifications. Before upgrading the entire network, it is important to conduct field evaluation of upgrades. Field evaluations are typically cumbersome and can be time consuming; however if done correctly they can help alleviate a lot of the deployment issues in terms of service quality degradation. The choice and number of field test locations have significant impacts on the time-to-market as well as confidence in how well various network upgrades will work out in the rest of the network. In this paper, we propose a novel approach - Reflection to automatically determine where to conduct the upgrade field tests in order to accurately identify important features that affect the upgrade. We demonstrate the effectiveness of Reflection using extensive evaluation based on real traces collected from a major US cellular network as well as synthetic traces.
【Keywords】: Planning; Cellular networks; Testing; Long Term Evolution; Degradation; Software; Feature extraction
【Paper Link】 【Pages】:1-2
【Authors】: Yoji Yamamoto ; Junji Takemasa ; Yuki Koizumi ; Toru Hasegawa
【Abstract】: On the one hand packet-level caching of Information-Centric Networking (ICN) is a key to accommodating Video on Demand (VoD) movies thanks to its fine granularity caching, but on the other hand it would cause degradation in cache hit probability because each of packets constituting a content object is dealt individually. This paper analytically reveals that caching large content objects by using packet-level caching degrades caching hit probability.
【Keywords】: Streaming media; Bit rate; Degradation; Motion pictures; Analytical models; TV; Object oriented modeling
【Paper Link】 【Pages】:1-10
【Authors】: Yi Yang ; Guohong Cao
【Abstract】: Smartwatches are quickly gaining popularity, but their limited battery life remains an important factor that adversely affects user satisfaction. To provide full functionality, smartwatches are usually connected to phones via Bluetooth. However, the Bluetooth power characteristics and the energy impact of Bluetooth data traffic have been rarely studied. To address this issue, we first establish the Bluetooth power model based on extensive measurements and a thorough examination of the Bluetooth implementation on Android smartwatches. Then we perform the first in-depth investigation of the background data transfers on smartwatches, and find that they are prevalent and consume a large amount of energy. For example, our experiments show that the smartwatch's battery life can be reduced to one third (or even worse) due to background data transfers. Such high energy cost is caused by many unnecessary data transfers and the energy inefficiency attributed to the adverse interaction between the data transfer pattern (i.e., frequently transferring small data) and the Bluetooth energy characteristics (i.e., the tail effect). Based on the identified causes, we propose four energy optimization techniques, which are fast dormancy, phone-initiated polling, two-stage sensor processing, and context-aware pushing. The first one aims to reduce tail energy for delay-tolerant data transfers. The latter three are designed for specific applications which are responsible for most background data transfers. Evaluation results show that jointly using these techniques can save 70.6% of the Bluetooth energy.
【Keywords】: Bluetooth; Data transfer; Smart phones; Protocols; Batteries; Energy consumption; Trade agreements
【Paper Link】 【Pages】:1-2
【Authors】: Pavel Chuprikov ; Alex Davydow ; Kirill Kogan ; Sergey I. Nikolenko ; Alexander V. Sirotkin
【Abstract】: Efficient representation of data aggregations is a fundamental problem in modern big data applications. We present a formalization of compute-aggregate planning parameterized by the aggregation function.
【Keywords】: Optimization; Data communication; Planning; Economics; Data aggregation; Big Data applications
【Paper Link】 【Pages】:1-10
【Authors】: Mostafa Uddin ; Sarit Mukherjee ; Hyunseok Chang ; T. V. Lakshman
【Abstract】: Bluetooth Low Energy (BLE) is a personal area wireless network technology that is of increasing importance for emerging Internet of Things (IoT) deployments. By design, BLE supports short-range, single-hop communication between a pair of BLE devices. As such, native BLE does not allow network-based policy control or in-network functions for service enhancement. These limitations are impediments to any large-scale BLE based IoT deployment (e.g., in hospital environments), where such sophisticated network-based visibility and control may be required. Relying on cloud-based solutions to meet these requirements has many known shortcomings. This paper proposes an SDN-based architecture for enabling wide area IoT deployments using BLE devices at the edge. We introduce a programmable BLE service switch (BLESS) that is transparently inserted between two communicating BLE devices. BLESS can be programmed at the service layer by a central controller to enable flexible, policy-based switching, as well as various in-network operations in BLE networks. We describe the design of BLESS, its implementation using P4 and OVS, and illustrate its utility through practical use cases.
【Keywords】: Medical services; Protocols; Monitoring; Biomedical monitoring; Cloud computing; Switches; Heart rate
【Paper Link】 【Pages】:1-2
【Authors】: Tongguang Zhang ; Shuai Zhao ; Yulong Shi ; Bingfei Ren ; Bo Cheng ; Junliang Chen
【Abstract】: In some special circumstances, e.g. tsunamis, floods, battlefields, earthquakes, etc., communication infrastructures are damaged or non-existent, as well as unmanned aerial vehicle (UAV) cluster. For the communication between people or UAVs, UAVs or mobile smart devices (MSDs) can be used to construct Mobile Ad Hoc Networks (MANETs), and Multipath TCP (MPTCP) can be used to simultaneously transmit in one TCP connection via multiple interfaces of MSDs. However the original MPTCP subpaths creating algorithm can establish multiple subpaths between two adjacent nodes, thus cannot achieve true concurrent data transmission. To solve this issue, we research and improve both the algorithm of adding routing table entries and the algorithm of establishing subpaths to offer more efficient use of multiple subpaths and better network traffic load balancing. The main works are as follows: (1) improve multi-hop routing protocol; (2) run MPTCP on UAVs or MSDs; (3) improve MPTCP subpaths establishment algorithm. The results show that our algorithms have better performance than the original MPTCP in achieving higher data throughput.
【Keywords】: Routing; Mobile computing; Ad hoc networks; Algorithm design and analysis; Routing protocols; Androids; Humanoid robots