<![CDATA[ IEEE/ACM Transactions on Networking - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 90 2018February 22<![CDATA[Table of contents]]>261C12522<![CDATA[IEEE/ACM Transactions on Networking publication information]]>261C2C279<![CDATA[Toward Cloud-Based Distributed Interactive Applications: Measurement, Modeling, and Analysis]]>2613163285<![CDATA[Not All VANET Broadcasts Are the Same: Context-Aware Class Based Broadcast]]>26117301993<![CDATA[A Probabilistic Framework for Structural Analysis and Community Detection in Directed Networks]]>directed networks. Two major points that need to be addressed are: 1) a formal and precise definition of the graph clustering and community detection problem in directed networks and 2) algorithm design and evaluation of community detection algorithms in directed networks. Motivated by these, we develop a probabilistic framework for structural analysis and community detection in directed networks based on our previous work in undirected networks. By relaxing the assumption from symmetric bivariate distributions in our previous work to bivariate distributions that have the same marginal distributions in this paper, we can still formally define various notions for structural analysis in directed networks, including centrality, relative centrality, community, and modularity. We also extend three commonly used community detection algorithms in undirected networks to directed networks: the hierarchical agglomerative algorithm, the partitional algorithm, and the fast unfolding algorithm. These are made possible by two modularity preserving and sparsity preserving transformations. In conjunction with the probabilistic framework, we show these three algorithms converge in a finite number of steps. In particular, we show that the partitional algorithm is a linear time algorithm for large sparse graphs. Moreover, the outputs of the hierarchical agglomerative algorithm and the fast unfolding algorithm are guaranteed to be communities. These three algorithms can also be extended to general bivariate distributions with some minor modifications. We also conduct various experiments by using two sampling methods in directed networks: 1) PageRank and 2) random walks with self-loops and backward jumps.]]>26131462834<![CDATA[On the Rate Regions of Single-Channel and Multi-Channel Full-Duplex Links]]>rate regions of full-duplex links in the single- and multi-channel cases (in the latter case, the channels are assumed to be orthogonal, e.g., OFDM). We present analytical results that characterize the uplink and downlink rate region and efficient algorithms for computing rate pairs at the region’s boundary. We also provide near-optimal and heuristic algorithms that “convexify” the rate region when it is not convex. The convexified region corresponds to a combination of a few full-duplex rates (i.e., to time sharing between different operation modes). The algorithms can be used for theoretical characterization of the rate region as well as for resource (time, power, and channel) allocation with the objective of maximizing the sum of the rates when one of them (uplink or downlink) must be guaranteed (e.g., due to QoS considerations). We numerically illustrate the rate regions and the rate gains (compared with time division duplex) for various channel and cancellation scenarios. The analytical results provide insights into the properties of the full-duplex rate region and are essential for future development of scheduling, channel allocation, and power control algorithms.]]>26147602223<![CDATA[Asynchronously Coordinated Multi-Timescale Beamforming Architecture for Multi-Cell Networks]]>$10times $ gains of the theoretically optimal coordinated MU-MIMO approach, without the need to either tightly coordinate the clocks of the remote transmitters or meet tight delay constraints.]]>26161754602<![CDATA[Optimizing Internet Transit Routing for Content Delivery Networks]]>26176893378<![CDATA[Every Timestamp Counts: Accurate Tracking of Network Latencies Using Reconcilable Difference Aggregator]]>261901032086<![CDATA[SSED: Servers Under Software-Defined Network Architectures to Eliminate Discovery Messages]]>2611041173685<![CDATA[Boolean Gossip Networks]]>$2^{16}-1$ possible nonempty sets of binary Boolean functions, whether the induced chain is absorbing has nothing to do with the topology of the underlying interaction graph, as long as connectivity is assumed. These results illustrate the possibilities of relating dynamical properties of Boolean networks to graphical properties of the underlying interactions.]]>2611181302491<![CDATA[Anomaly Detection and Attribution in Networks With Temporally Correlated Traffic]]>cross entropy (CE) method, which detects anomalies as well as attributes anomalies to flows. The second algorithm performs anomaly detection via GLRT on the aggregated flows transformation—a compact low-dimensional representation of the raw traffic flows. The two algorithms complement each other and allow the network operator to first activate the flow aggregation algorithm in order to quickly detect anomalies in the system. Once an anomaly has been detected, the operator can further investigate which specific flows are anomalous by running the CE-based algorithm. We perform extensive performance evaluations and experiment our algorithms on synthetic and semi-synthetic data, as well as on real Internet traffic data obtained from the MAWI archive, and finally make recommendations regarding their usability.]]>2611311443086<![CDATA[Diamond: Nesting the Data Center Network With Wireless Rings in 3-D Space]]>Diamond, which nests the wired DCN with radios equipped on all servers. To harvest the gain allowed by the rich reconfigurable wireless resources, we propose the low-cost deployment of scalable 3-D ring reflection spaces (RRSs) which are interconnected with streamlined wired herringbone to enable large number of concurrent wireless transmissions through high-performance multi-reflection of radio signals over metal. To increase the number of concurrent wireless transmissions within each RRS, we propose a precise reflection method to reduce the wireless interference. We build a 60-GHz-based testbed to demonstrate the function and transmission ability of our proposed architecture. We further perform extensive simulations to show the significant performance gain of diamond, in supporting up to five times higher server-to-server capacity, enabling network-wide load balancing, and ensuring high fault tolerance.]]>2611451605094<![CDATA[One More Tag Enables Fine-Grained RFID Localization and Tracking]]>2611611743090<![CDATA[Spatial Mappings for Planning and Optimization of Cellular Networks]]>irregular topologies with more access points, where service demand is concentrated. While this dynamism requires networks with the ability to adapt to time-varying conditions, the non-uniformity of the service demand makes the planning, analysis, and optimization difficult. In order to help with these tasks, a framework based on canonical domains and spatial mappings (e.g., conformal mapping) have recently been proposed. The idea is to carry out part of the planning in a canonical (perfectly symmetric) domain that is connected to the physical one (real-scenario) by means of a spatial transformation designed to map the access points consistently with the service demand. This paper continues the research in that direction by introducing additional tools and possibilities to that framework, namely the use of centroidal Voronoi algorithms and non-conformal composite mappings. Moreover, power optimization is also introduced to the framework. The results show the usability and effectiveness of the proposed method and its promising research perspectives.]]>2611751882359<![CDATA[Easy Path Programming: Elevate Abstraction Level for Network Functions]]>2611892022327<![CDATA[Using Adaptive Heartbeat Rate on Long-Lived TCP Connections]]>2612032162494<![CDATA[Partial Order Theory for Fast TCAM Updates]]>$1.05sim 11.3times $ ) compared with state-of-the-art techniques.]]>2612172302181<![CDATA[Multi-Touch in the Air: Concurrent Micromovement Recognition Using RF Signals]]>performing interactions in the air. In this paper, we propose RF-glove, a system that recognizes concurrent multiple finger micromovement using RF signals, so as to realize the vision of “multi-touch in the air.” It uses a commercial-off-the-shelf (COTS) RFID reader with three antennas and five COTS tags attached to the five fingers of a glove, one tag per finger. During the process of a user performing finger micromovements, we let the RFID reader continuously interrogate these tags and obtain the backscattered RF signals from each tag. For each antenna–tag pair, the reader obtains a sequence of RF phase values called a phase profile from the tag’s responses over time. To tradeoff between accuracy and robustness in terms of matching resolution, we propose a two phase approach, including coarse-grained filtering and fine-grained matching. To tackle the variation of template phase profiles at different positions, we propose a phase-model-based solution to reconstruct the template phase profiles based on the exact locations. Experiment results show that we achieve an average accuracy of 92.1% under various moving speeds, orientation deviations, and so on.]]>2612312442643<![CDATA[Utility-Centric Networking: Balancing Transit Costs With Quality of Experience]]>2612452583031<![CDATA[Trading Utility for Privacy in Shared Spectrum Access Systems]]>2612592731790<![CDATA[Joint Resource Allocation for Software-Defined Networking, Caching, and Computing]]>2612742874129<![CDATA[Adaptive Sector Coloring Game for Geometric Network Information-Based Inter-Cell Interference Coordination in Wireless Cellular Networks]]>2612883013249<![CDATA[Cache Policies for Linear Utility Maximization]]>2613023131234<![CDATA[Radiation Constrained Scheduling of Wireless Charging Tasks]]>Radiation cOnstrained scheduling of wireless Charging tasKs (ROCK), that is, given wireless charging tasks with required charging energy and charging deadline for rechargeable devices, scheduling the power of wireless chargers to maximize the overall effective charging energy for all rechargeable devices, and further to minimize the total charging time, while guaranteeing electromagnetic radiation (EMR) safety, i.e., no point on the considered 2-D area has EMR intensity exceeding a given threshold. To address ROCK, we first present a centralized algorithm. We transform ROCK from nonlinear problem to linear problem by applying two approaches of area discretization and solution regularization, and then propose a linear programming-based greedy test algorithm to solve it. We also propose a distributed algorithm that is scalable with network size by presenting an area partition scheme and two approaches called area-scaling and EMR-scaling, and prove that it achieves effective charging energy no less than $(1-varepsilon)$ of that of the optimal solution, and charging time no more than that of the optimal solution. We conduct both simulation and field experiments to validate our theoretical findings. The results show that our algorithm achieves 94.9% of the optimal effective charging energy and requires 47.1% smaller charging time compared with the optimal one when ${varepsilon } geq 0.2$ , and outperforms the other algorithms by at least 350.1% in terms of charging time with even more effective charging energy.]]>2613143272663<![CDATA[Loop-Free Route Updates for Software-Defined Networks]]>$k$ -round update schedule exists is NP-complete already for $k=3$ , and there are problem instances requiring $Omega (n)$ rounds, where $n$ is the network size. Given these negative results, we introduce an attractive, relaxed notion of loop-freedom. We show that relaxed loop-freedom admits for much shorter update schedules (up to a factor $Omega (n)$ in the best case), and present a scheduling algorithm which requires at most $Theta (log n)$ rounds.]]>2613283412250<![CDATA[Priority Queueing for Packets With Two Characteristics]]>$V$ , we present a policy that achieves competitive ratio $left ({1+({W+2}/{V})}right)$ , where $W$ is the maximal number of required processing cycles. We also consider copying costs during admission.]]>2613423551937<![CDATA[WMGR: A Generic and Compact Routing Scheme for Data Center Networks]]>$n$ , the number of nodes) in all of these topologies. The scheme finds the shortest paths in topologies based on Cayley graphs and trees (e.g. Fat tree), while in the rest of topologies, the length of any path is stretched by a factor that grows logarithmically (with respect to $n$ ). Moreover, the simulation results show that many of the paths remain far below this upper bound.]]>2613563693256<![CDATA[Device-to-Device Networking Meets Cellular via Network Coding]]>2613703832204<![CDATA[Fast Rerouting Against Multi-Link Failures Without Topology Constraint]]>$k$ -link failures ($k geq 2$ ). Then, we propose a tunneling on demand (TOD) approach, which covers most failures with ISR, and activate tunneling only when failures cannot be detoured around by ISR. We develop algorithms to compute ISR properly so as to minimize the number of activated tunnels, and compute the protection tunnels if necessary. We prove that TOD can protect routing against any single-link failures and dual-link failures. We evaluate TOD by simulations with real-world topologies. The results show that TOD can achieve a near 100% protection ratio with small tunneling overhead for multi-link failures, making a better tradeoff than the state-of-the-art label-based approaches.]]>2613843971656<![CDATA[Scalability and Satisfiability of Quality-of-Information in Wireless Networks]]>scalably feasible QoI regions, which provide upper bounds on QoI requirements that can be supported for certain network applications.]]>2613984113249<![CDATA[On Practical Construction of Quality Fault-Tolerant Virtual Backbone in Homogeneous Wireless Networks]]>$k$ -connected $m$ -dominating set problem on the UDG. So far, most results are focused on designing a constant factor approximation algorithm for this NP-hard problem under two positive integers $k$ and $m$ satisfying $m geq k geq 1$ and $k leq 3$ . This paper introduces an approximation algorithm for the problem with $m geq k geq 1$ . This algorithm is simple to implement; it connects the components by adding a bounded number of paths, which first computes a 1-connected $m$ -dominating set $D$ and repeats the following steps: (a) search the separators arbitrarily in $(i-1,m)$ -CDS with $i = 2, 3, cdots, k$ , (b) add a bounded number of paths connecting the components separated by separators in $(i-1,m)$ -CDS to improve the connectivity of $(i-1,m)$ -CDS, until it becomes $k$ -connected, and (c) remove redundant paths if there exist at every iteration. We provide a rigorous theoretical analysis to prove that the proposed algorithm is correct and its approximation ratio is a constant, for any fixed $k$ .]]>2614124212421<![CDATA[Kraken: Online and Elastic Resource Reservations for Cloud Datacenters]]>a priori. Unfortunately, this is not practical in today’s cloud environments, where application demands are inherently unpredictable, e.g., due to differences in the input data sets or phenomena, such as failures and stragglers. To overcome these limitations, we designed Kraken, a system that allows to dynamically update minimum guarantees for both network bandwidth and compute resources at runtime. Unlike previous work, Kraken does not require prior knowledge about the resource needs of the applications but allows to modify reservations at runtime. Kraken achieves this through an online resource reservation scheme, which comes with provable optimality guarantees. In this paper, we motivate the need for dynamic resource reservation schemes, present how this is provided by Kraken, and evaluate Kraken via extensive simulations and a preliminary Hadoop prototype.]]>2614224353202<![CDATA[Scheduling Frameworks for Cloud Container Services]]>2614364501856<![CDATA[The Throughput and Access Delay of Slotted-Aloha With Exponential Backoff]]>$b=1.35$ is more appealing than the standard value $b=2$ .]]>2614514641663<![CDATA[FDoF: Enhancing Channel Utilization for 802.11ac]]>$2.83times $ , or by $1.36times $ on average, as compared to the conventional 802.11ac. By combining FDoF’s power allocation with frame padding, the average throughput gain can be further increased to $1.75times $ .]]>2614654772155<![CDATA[Information Spreading Forensics via Sequential Dependent Snapshots]]>independent observations of the underlying network while assuming a homogeneous information spreading rate. We conduct a theoretical and experimental study on information spreading, and propose a new and novel estimation framework to estimate 1) information spreading rates, 2) start time of the information source, and 3) the location of information source by utilizing multiple sequential and dependent snapshots where information can spread at heterogeneous rates. Our framework generalizes the current state-of-the-art rumor centrality [1] and the union rumor centrality [2]. Furthermore, we allow heterogeneous information spreading rates at different branches of a network. Our framework provides conditional maximum likelihood estimators for the above three metrics and is more accurate than rumor centrality and Jordan center in both synthetic networks and real-world networks. Applying our framework to the Twitter’s retweet networks, we can accurately determine who made the initial tweet and at what time the tweet was sent. Furthermore, we also validate that the rates of information spreading are indeed heterogeneous among different parts of a retweet network.]]>2614784912094<![CDATA[Scheduling of Collaborative Sequential Compressed Sensing Over Wide Spectrum Band]]>2614925051746<![CDATA[Optimal Control for Generalized Network-Flow Problems]]>virtual network of queues. When specialized to the unicast setting, the UMW policy yields a throughput-optimal cycle-free routing and link scheduling policy. This is in contrast with the well-known throughput-optimal back-pressure (BP) policy which allows for packet cycling, resulting in excessive latency. Extensive simulation results show that the proposed UMW policy incurs a substantially smaller delay as compared with the BP policy. The proof of throughput-optimality of the UMW policy combines ideas from the stochastic Lyapunov theory with a sample path argument from adversarial queueing theory and may be of independent theoretical interest.]]>2615065191373<![CDATA[SCAPE: Safe Charging With Adjustable Power]]>$R_{t}$ . We present novel techniques to reformulate SCAPE into a traditional linear programming problem, and then remove its redundant constraints as much as possible to reduce computational effort. Next, we propose a series of distributed algorithms, including a fully distributed algorithm that provably achieves $(1-epsilon)$ approximation ratio and requires only communications with neighbors within a constant distance for each charger. Through extensive simulation and testbed experiments, we demonstrate that our proposed algorithms can outperform the set-cover algorithm by up to 17.05%, and has an average performance gain of 41.1% over the existing algorithm in terms of the overall charging utility.]]>2615205332388<![CDATA[Dynamic, Fine-Grained Data Plane Monitoring With Monocle]]>2615345471741<![CDATA[Caching Encrypted Content Via Stochastic Cache Partitioning]]>2615485612424<![CDATA[Minimizing Controller Response Time Through Flow Redirecting in SDNs]]>2615625752227<![CDATA[Analysis of Millimeter-Wave Multi-Hop Networks With Full-Duplex Buffered Relays]]>2615765902996<![CDATA[Online Aggregation of the Forwarding Information Base: Accounting for Locality and Churn]]>O(w)-competitive algorithm, where ${w}$ is the length of an IP address. We also derive a lower bound which shows that our result is asymptotically optimal within a natural class of algorithms, based on so-called sticks.]]>2615916041689<![CDATA[An LDPC Approach for Chunked Network Codes]]>2616056171242<![CDATA[Achieving High Scalability Through Hybrid Switching in Software-Defined Networking]]>2616186322540<![CDATA[Joint Optimization of Multicast Energy in Delay-Constrained Mobile Wireless Networks]]>$k$ destinations within an imposed delay constraint. Most existing works simply focus on deriving transmission schemes with the minimum transmitting energy, overlooking the energy consumption at the receiver side. Therefore, in this paper, we propose ConMap, a novel and general framework for efficient transmission scheme design that jointly optimizes both the transmitting and receiving energy. In doing so, we formulate our problem of designing minimum energy transmission scheme, called DeMEM, as a combinatorial optimization one, and prove that the approximation ratio of any polynomial time algorithm for DeMEM cannot be better than $({1}/{4})ln k$ . Aiming to provide more efficient approximation schemes, the proposed ConMap first converts DeMEM into an equivalent directed Steiner tree problem through creating auxiliary graph gadgets to capture energy consumption, then maps the computed tree back into a transmission scheme. The advantages of ConMap are threefolded: 1) Generality– ConMap exhibits strong applicability to a wide range of energy models; 2) Flexibility– Any algorithm designed for the problem of directed Steiner tree can be embedded into our ConMap framework to achieve different performance guarantees and complexities; 3) Efficiency– ConMap preserves the approximation ratio of the embedded Steiner tree algorithm, to which only slight overhead will be incurred. The three features are then empirically validated, with ConMap also yielding near-optimal transmission schemes compared to a brute-force exact algorithm. To o-
r best knowledge, this is the first work that jointly considers both the transmitting and receiving energy in the design of multicast transmission schemes in mobile wireless networks.]]>2616336463759<![CDATA[List of Reviewers]]>261647655101<![CDATA[IEEE/ACM Transactions on Networking society information]]>261C3C3169<![CDATA[IEEE/ACM Transactions on Networking information for authors]]>261C4C452