<![CDATA[ IEEE/ACM Transactions on Networking - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 90 2019April 25<![CDATA[Table of Contents]]>272C1C4535<![CDATA[IEEE/ACM Transactions on Networking publication information]]>272C2C280<![CDATA[A Split-Central-Buffered Load-Balancing Clos-Network Switch With In-Order Forwarding]]>2724674761289<![CDATA[Sharing Cache Resources Among Content Providers: A Utility-Based Approach]]>2724774902025<![CDATA[Dynamic Cloud Network Control Under Reconfiguration Delay and Cost]]>2724915042345<![CDATA[Understanding and Improving the Performance of Constructive Interference Using Destructive Interference in WSNs]]>destructive interference on a designated byte to provide a feedback. We leverage this feedback to adapt transmission powers. We compared CI with and without DIPA in two real-life testbeds. On one testbed, we achieve around 25% lower packet losses while using only half of its transmission power for 64-B packets. On the other testbed, we achieve 25% lower packet losses while consuming only 47% of its transmission power for 128-B packets. Existing CI-based protocols can easily incorporate DIPA into them to achieve lower packet losses and higher energy efficiencies.]]>2725055172933<![CDATA[Enabling Out-of-Band Coordination of Wi-Fi Communications on Smartphones]]>$1 rightarrow 0$ appearing on TIM bit by locally regulating packet receiving operations. We adopt this $1 rightarrow 0$ as the basic signal, and leverage the time length in between two signals to encode information. We demonstrate that OBC can be used to convey coordination information with close to 100% accuracy. We have implemented and evaluated BackPSM on a testbed. The results show that BackPSM can decode the traffic pattern of peers reliably using OBC, and establish collision-free schedules fast to achieve out-of-band coordination of client communications. BackPSM reduces screen-off energy by up to 60% and outperforms the state-of-the-art strategies by 16%–42%.]]>2725185313145<![CDATA[Battle of Opinions Over Evolving Social Networks]]>2725325452099<![CDATA[Minimum Connected Dominating Set Under Routing Cost Constraint in Wireless Sensor Networks With Different Transmission Ranges]]>$rho $ -range connected dominating set under the constraint $alpha $ -times of the minimum routing cost ($alpha $ MOC-$rho $ CDS), where $alpha ge 5$ and $rho $ is the ratio of the maximum-to-minimum transmission radius. Our contributions are three folds. First, we propose a polynomial time approximation scheme which generates the $alpha $ MOC-$rho $ CDS with the size of at most $(1+epsilon)$ times of the optimum solution, where $epsilon $ is the error parameter. Second, we propose a polynomial time algorithm and prove that it has two approximation ratios $(6rho +1)^{2}(2rho +1)^{2}$ and $10lceil ({2pi }/{theta })rceil lfloor ({ln 3rho }/({ln (1/cos theta)})) rfloor ~-
lfloor ({ln rho }/({ln (2cos (pi /5))}))rfloor $ , where $theta < arcsin ({1}/{3rho })$ . Finally, we propose the distributed version of the constant approximation ratio algorithm which has both the time complexity and message complexity $O(n^{3})$ , where $n$ is the number of sensor nodes. Besides, the simulation results demonstrate the efficiency of our algorithms.]]>2725465592415<![CDATA[Catch Me if You Can: A Closer Look at Malicious Co-Residency on the Cloud]]>2725605763843<![CDATA[A Longitudinal View of Dual-Stacked Websites—Failures, Latency and Happy Eyeballs]]>AAAA entries over the six years have reduced by 29% over IPv4 and by 57% over IPv6. As of Dec 2018, 56% of these websites are faster over IPv6 with 95% of the rest being at most 1 ms slower. We also identify glitches in web content delivery that once fixed can help improve the user experience over IPv6. Using a publicly available dataset, we show that 40% of ALEXA 1M websites with AAAA entries were not accessible over IPv6 in 2009. These complete failures have reduced to 1.9% as of Jan 2019. However, our data collection on partial failures helps identify further that 27% of these popular websites with AAAA entries still suffer from partial failure over IPv6. These partial failures are affected by DNS resolution errors on images, javascript and CSS content. For 12% of these websites, more than half of the content belonging to same-origin sources fails over IPv6, while analytics and third-party advertisements contribute to failures from cross-origin sources. Our results also contribute to the IETF standardisation process. We witness that using an happy eyeballs timer value of 250 ms, clients prefer IPv6 connections to 99% of ALEXA 10 K websites (with AAAA entries) more than 96% of the time. Although, this makes clients prefer slower IPv6 connections in 81% of the cases. Our results show that a Happy Eyeballs (MBA) timer value of 150 ms does not severly affect IPv6 pr-
ference towards websites. The entire dataset presenting results on partial failures, latency and HE used in this paper is publicly released.]]>2725775902756<![CDATA[2K+ Graph Construction Framework: Targeting Joint Degree Matrix and Beyond]]>2725916063197<![CDATA[Completely Uncoupled Algorithms for Network Utility Maximization]]>${epsilon }$ ) Markov chain, whose stochastically stable states are the set of actions that maximize the sum utility. In the second part, we present an approximate sub-gradient algorithm for concave utilities, which is considerably faster and requires lesser memory. We study the performance of the sub-gradient algorithm for decreasing and fixed step sizes. We show that, for decreasing step sizes, the Cesaro averages of the utilities converges to a neighborhood of the optimal sum utility. For constant step size, we show that the time average utility converges to a neighborhood of the optimal sum utility. Our main contribution is the expansion of the achievable rate region, which has not been considered in the previous paper on completely uncoupled algorithms for utility maximization. This expansion aids in allocating a fair share of resources to the nodes, which is important in applications like channel selection, user association, and power control.]]>2726076201401<![CDATA[Toward Secure and Efficient Communication for the Internet of Things]]>2726216342893<![CDATA[Push the Barrier: Discrete Event Protocol Emulation]]>2726356482182<![CDATA[TipTop: (Almost) Exact Solutions for Influence Maximization in Billion-Scale Networks]]>$(1-epsilon)$ -optimal solution for arbitrary $epsilon >0$ that scales to very large networks, such as Twitter. At the heart of TipTop lies an innovative technique that reduces the number of samples as much as possible. This allows us to exactly solve CTVM on a much smaller space of generated samples using integer programming. Furthermore, TipTop lends a tool for researchers to benchmark their solutions against the optimal one in large-scale networks, which is currently not available.]]>2726496611720<![CDATA[Network Slicing Games: Enabling Customization in Multi-Tenant Mobile Networks]]>network slicing game in which each tenant reacts to the user allocations of the other tenants so as to maximize its own utility. We show that, for elastic traffic, the game associated with such strategic behavior converges to a Nash equilibrium. At the Nash equilibrium, a tenant always achieves the same or better performance than that of a static partitioning of resources, thus providing the same level of protection as static partitioning. We further analyze the efficiency and fairness of the resulting allocations, providing tight bounds for the price of anarchy and envy-freeness. Our analysis and extensive simulation results confirm that the mechanism provides a comprehensive practical solution to realize network slicing. Our theoretical results also fills a gap in the analysis of this resource allocation model under strategic players.]]>2726626753222<![CDATA[Individual Preference Probability Modeling and Parameterization for Video Content in Wireless Caching Networks]]>global popularity distributions of video content have been investigated in the past and used in a variety of caching algorithms, this paper investigates the statistical modeling of the individual user preferences. With individual preferences being represented by probabilities, we identify their critical features and parameters and propose a novel modeling framework by using a genre-based hierarchical structure as well as a parameterization of the framework based on an extensive real-world data set. Besides, the correlation analysis between parameters and critical statistics of the framework is conducted. With the framework, an implementation recipe for generating practical individual preference probabilities is proposed. By comparing with the underlying real data, we show that the proposed models and generation approach can effectively characterize the individual preferences of users for video content.]]>2726766903085<![CDATA[Zero-Day Signature Extraction for High-Volume Attacks]]>$P$ the messages captured in the network at peacetime (i.e., mostly legitimate traffic) and $A$ the messages captured during attack time (i.e., contains many attack messages), we present a tool for extracting a set $S$ of strings that are frequently found in $A$ and not in $P$ , thus allowing the identification of the attack packets. This is an important tool in protecting sites on the Internet from worm attacks and distributed denial of service attacks and may also be useful for other problems, including command and control identification and the DNA-sequences analysis. The main contributions of this paper are the system we developed to extract the required signatures together with the string-heavy hitters problem definition and the algorithm for solving this problem. This algorithm finds popular strings of variable length in a set of messages, using, in a tricky way, the classic heavy-hitter algorithm as a building block. The algorithm runs in linear time requiring one-pass over the input. Our system makes use of this algorithm to extract the desired signatures. Furthermore, we provide an extended algorithm which is able to identify groups of signatures, often found together in the same packets, which further improves the quality of signatures generated by our system. Using our system, a yet unknown attack can be detected and stopped within minutes from attack start time.]]>2726917062203<![CDATA[Adding Support for Automatic Enforcement of Security Policies in NFV Networks]]>2727077202359<![CDATA[An Attribute-Based Framework for Secure Communications in Vehicular Ad Hoc Networks]]>2727217331746<![CDATA[A Span Power Management Scheme for Rapid Lightpath Provisioning and Releasing in Multi-Core Fiber Networks]]>$alpha $ , which is the ratio of the number of dummy wavelengths to the number of dummy and lightpath wavelengths in each span, and there exists a point of $alpha $ where the blocking probability becomes minimum. We further observe that the proposed scheme outperforms the conventional approaches in terms of blocking probability and average waiting time, as traffic loads increase. Finally, we provide the direction on how our introduced model can be considered for a network with multi-span routes.]]>2727347473421<![CDATA[Estimating Cardinality of Arbitrary Expression of Multiple Tag Sets in a Distributed RFID System]]>2727487622669<![CDATA[Modeling Multi-User WLANs Under Closed-Loop Traffic]]>2727637761485<![CDATA[On the Granularity of Trie-Based Data Structures for Name Lookups and Updates]]>2727777892357<![CDATA[Routing Stability in Hybrid Software-Defined Networks]]>2727908044813<![CDATA[An Objective-Driven On-Demand Network Abstraction for Adaptive Applications]]>2728058182830<![CDATA[Tash: Toward Selective Reading as Hash Primitives for Gen2 RFIDs]]>2728198342770<![CDATA[Multi-Tier Caching Analysis in CDN-Based Over-the-Top Video Streaming Systems]]>2728358471824<![CDATA[Privacy-Preserving and Truthful Double Auction for Heterogeneous Spectrum]]>2728488612685<![CDATA[Zero Rating: The Power in the Middle]]>2728628741244<![CDATA[Performance Degradation in Parallel-Server Systems]]>$lambda $ , are dispatched by $n$ dispatchers, each of them balancing a fraction $1/n$ of the load to $K/n$ servers. Servers are first-come-first-served (FCFS) queues and dispatchers implement size interval task assignment policy with equal load (SITA-E), a size-based policy such that the servers are equally loaded. We compare the performance of a system with $n>1$ dispatchers and a single dispatcher. We show that the performance of a system with $n$ dispatchers, $K$ servers, and arrival rate $lambda $ coincides with that of a system with one dispatcher, $K/n$ servers, and arrival rate $lambda /n$ . We define the degradation factor as the ratio between the performance of a system with $K$ servers and arrival rate $lambda $ and the performance of a system with $K/n$ servers and arrival rate $lambda /n$ . We establish a partial monotonicity on $n$ for the degradation factor and, therefore, the degradation factor is lower bounded by one. We then investigate the upper bound of the degradation factor for particular distributions. We consider two continuous service time distributions: uniform and bounded Pareto and a discrete distribution with two values, which is the distribution that maximizes the variance for a given mean. We show that the performance degradation is small for uniformly distributed job sizes but that for Bounded Pareto and two points distributions it can be unbounded. We have investigated the degradation using the distribution obtained from real traces.]]>2728758881171<![CDATA[Tagger: Practical PFC Deadlock Prevention in Data Center Networks]]>2728899023390<![CDATA[IEEE/ACM Transactions on Networking information for authors]]>272903903112<![CDATA[IEEE/ACM Transactions on Networking society information]]>272C3C31429