-
Table of contents IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-10-14
Presents the table of contents for this issue of this publication.
-
IEEE/ACM Transactions on Networking publication information IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-10-14
Provides a listing of current staff, committee members and society officers.
-
Pose Sensing With a Single RFID Tag IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-11 Jia Liu; Shigang Chen; Min Chen; Qingjun Xiao; Lijun Chen
Determining an object’s spatial pose (including orientation and position) plays a fundamental role in a variety of applications, such as automatic assembly, indoor navigation, and robot driving. In this paper, we design a fine-grained pose sensing system called Tag-Compass that attaches a single tag to an object (whose size may be small) and identifies the tagged object’s pose by determining the spatial
-
MARS: A Multi-Attribute Routing and Scheduling Algorithm for DTN Interplanetary Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-13 Sara El Alaoui; Byrav Ramamurthy
The Interplanetary Network (IPN) or the Interplanetary Internet is a network composed of interconnected space objects, which are in turn connected to mission control stations on the surface of Earth. The IPN is our only portal to the deep space, and yet it has been relatively sparse, until recently. With the ongoing and the planned missions to the outer space, the Delay Tolerant Networking (DTN) based
-
Distributed Opportunistic Scheduling in Cooperative Networks With RF Energy Harvesting IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-11 Ziling Wei; Jinshu Su; Baokang Zhao; Xicheng Lu
In this paper, the problem of distributed opportunistic channel access in wireless cooperative networks is investigated. To cope with the energy limitation problem of relay nodes, radio-frequency (RF) energy harvesting is considered, and thus, no external energy is needed for each relay node. Then, a novel distributed opportunistic scheduling (DOS) scheme is proposed. In the scheme, users contend for
-
IEEE/ACM Transactions on Networking information for authors IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-10-14
Provides instructions and guidelines to prospective authors who wish to submit manuscripts.
-
IEEE/ACM Transactions on Networking society information IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-10-14
Provides a listing of current committee members and society officers.
-
Thompson Sampling for Combinatorial Network Optimization in Unknown Environments IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-10-02 Alihan Hüyük; Cem Tekin
Influence maximization, adaptive routing, and dynamic spectrum allocation all require choosing the right action from a large set of alternatives. Thanks to the advances in combinatorial optimization, these and many similar problems can be efficiently solved given an environment with known stochasticity. In this paper, we take this one step further and focus on combinatorial optimization in unknown
-
On the Tussle Between Over-the-Top and Internet Service Providers: Analysis of the Netflix- Comcast Type of Deals IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-28 Xin Wang; Richard T. B. Ma
Over-the-top (OTT) services reach users via the open Internet without dedicated infrastructures and have experienced enormous growth in recent years. Netflix, an OTT streaming provider, now accounts for more than one-third of peak U.S. downstream traffic and causes cord-cutting of traditional cable pay-TV services from incumbent Internet service providers (ISPs). However, the service quality of video
-
Network Latency Estimation With Leverage Sampling for Personal Devices: An Adaptive Tensor Completion Approach IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-25 Lei Deng; Haifeng Zheng; Xiao-Yang Liu; Xinxin Feng; Zhizhang David Chen
In recent years, end-to-end network latency estimation has attracted much attention because of its significance for network performance evaluation. Given the widespread use of personal devices, latency estimation from partially observed samples becomes more complicated due to unstable communication conditions, while measuring the latencies between all nodes in a large-scale network is infeasible and
-
SICS: Secure and Dynamic Middlebox Outsourcing IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-24 Huazhe Wang; Xin Li; Yang Wang; Yu Zhao; Ye Yu; Hongkun Yang; Chen Qian
There is an increasing trend that enterprises outsource their middlebox processing to a cloud for lower cost and easier management. However, outsourcing middleboxes brings threats to the enterprise’s private information, including the traffic and rules of middleboxes, all of which are visible within the cloud. Existing solutions for secure middlebox outsourcing either incur significant performance
-
Zero-Rating of Content and Its Effect on the Quality of Service in the Internet IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-23 Fehmina Malik; Manjesh K. Hanawal; Yezekael Hayel
The ongoing net neutrality debate has generated a lot of heated discussions on whether or not monetary interactions should be regulated between content and access providers. Among the several topics discussed, ‘differential pricing’ has recently received attention due to ‘zero-rating’ platforms proposed by some service providers. In the differential pricing scheme, Internet Service Providers (ISPs)
-
Elmo: Source Routed Multicast for Public Clouds IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-22 Muhammad Shahbaz; Lalith Suresh; Jennifer Rexford; Nick Feamster; Ori Rottenstreich; Mukesh Hira
We present Elmo, a system that addresses the multicast scalability problem in multi-tenant datacenters. Modern cloud applications frequently exhibit one-to-many communication patterns and, at the same time, require sub-millisecond latencies and high throughput. IP multicast can achieve these requirements but has control- and data-plane scalability limitations that make it challenging to offer it as
-
Novel Architecture and Heuristic Algorithms for Software-Defined Wireless Sensor Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-22 Ammar Hawbani; Xingfu Wang; Liang Zhao; Ahmed Al-Dubai; Geyong Min; Omar Busaileh
This article extends the promising software-defined networking technology to wireless sensor networks to achieve two goals: 1) reducing the information exchange between the control and data planes, and 2) counterbalancing between the sender’s waiting-time and the duplicate packets. To this end and beyond the state-of-the-art, this work proposes an SDN-based architecture, namely MINI-SDN, that separates
-
Predictive Switch-Controller Association and Control Devolution for SDN Systems IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-18 Xi Huang; Simeng Bian; Ziyu Shao; Hong Xu
For software-defined networking (SDN) systems, to enhance the scalability and reliability of control plane, existing solutions adopt either multi-controller design with static switch-controller association, or static control devolution by delegating certain request processing back to switches. Such solutions can fall short in face of temporal variations of request traffics, incurring considerable local
-
TopoX: Topology Refactorization for Minimizing Network Communication in Graph Computations IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-17 Yiming Zhang; Haonan Wang; Menghan Jia; Jinyan Wang; Dongsheng Li; Guangtao Xue; Kian-Lee Tan
Efficient graph partitioning is vital for high-performance graph-parallel systems. Traditional graph partitioning methods attempt to both minimize communication cost and guarantee load balancing in computation. However, the skewed degree distribution of natural graphs makes it difficult to simultaneously achieve the two objectives. This article proposes topology refactorization (TR), a topology-aware
-
HyCloud: Tweaking Hybrid Cloud Storage Services for Cost-Efficient Filesystem Hosting IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-11 Jinlong E; Yong Cui; Zhenhua Li; Mingkang Ruan; Ennan Zhai
Today’s cloud storage infrastructures typically provide two distinct types of services for hosting files: object storage like Amazon S3 and filesystem storage like Amazon EFS. In practice, a cloud storage user often desires the advantages of both—efficient filesystem operations with a low unit storage price. An intuitive approach to achieving this goal is to combine the two types of services, e.g.
-
Service Function Path Provisioning With Topology Aggregation in Multi-Domain Optical Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-09 Boyuan Yan; Yongli Zhao; Xiaosong Yu; Yajie Li; Sabidur Rahman; Yongqi He; Xiangjun Xin; Jie Zhang
Traffic flows are often processed by a chain of Service Functions (SFs) (known as Service Function Chaining (SFC)) to satisfy service requirements. The deployed path for a SFC is called Service Function Path (SFP). SFs can be virtualized and migrated to datacenters, thanks to the evolution of Software Defined Network (SDN) and Network Function Virtualization (NFV). In such a scenario, provisioning
-
A Coverage-Aware Resource Provisioning Method for Network Slicing IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-07 Quang-Trung Luu; Sylvaine Kerboeuf; Alexandre Mouradian; Michel Kieffer
With network slicing in 5G networks, Mobile Network Operators can create various slices for Service Providers (SPs) to accommodate customized services. Usually, the various Service Function Chains (SFCs) belonging to a slice are deployed on a best-effort basis. Nothing ensures that the Infrastructure Provider (InP) will be able to allocate enough resources to cope with the increasing demands of some
-
Exploiting Link Diversity for Performance-Aware and Repeatable Simulation in Low-Power Wireless Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-09-02 Zhiwei Zhao; Geyong Min; Wei Dong; Xue Liu; Weifeng Gao; Tao Gu; Minghang Yang
Network simulation is a fundamental service for performance testing and protocol design in wireless networks. Due to the wireless dynamics, it is highly challenging to provide repeatable and reliable simulation results that are comparable to the empirical experimental results. To achieve repeatability for simulation, the existing works focus on reproducing the behaviors on individual links. However
-
CleanG—Improving the Architecture and Protocols for Future Cellular Networks With NFV IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-31 Ali Mohammadkhan; K. K. Ramakrishnan; Vivek A. Jain
With the rapid increase in the number of users and changing pattern of network usage, cellular networks will continue to be challenged meeting bandwidth and latency requirements. A significant contributor to latency and overhead is cellular network’s complex control-plane. We propose CleanG, a new packet core architecture and significantly more efficient control-plane protocol, that exploits the capabilities
-
Optimal PHY Configuration in Wireless Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-31 Mark Shifrin; Daniel S. Menasché; Asaf Cohen; Dennis Goeckel; Omer Gurewitz
In this work, we study the optimal configuration of the physical layer in wireless networks by means of Semi-Markov Decision Process (SMDP) modeling. In particular, assume the physical layer is characterized by a set of potential operating points, with each point corresponding to a rate and reliability pair; for example, these pairs might be obtained through a now-standard diversity-multiplexing tradeoff
-
Two-Stage Game Design of Payoff Decision-Making Scheme for Crowdsourcing Dilemmas IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-31 Hui Xia; Rui Zhang; Xiangguo Cheng; Tie Qiu; Dapeng Oliver Wu
Crowdsourcing uses collective intelligence to finish complicated tasks and is widely applied in many fields. However, the crowdsourcing dilemmas between the task requester and the task completer restrict the efficiency of system severely, e.g., the cooperation dilemma leads to the failure in the interactions and the quality of service dilemma results in the inability of task completer to provide high-quality
-
FTrack: Parallel Decoding for LoRa Transmissions IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-27 Xianjin Xia; Yuanqing Zheng; Tao Gu
LoRa has emerged as a promising Low-Power Wide Area Network (LP-WAN) technology to connect a huge number of Internet-of-Things (IoT) devices. The dense deployment and an increasing number of IoT devices lead to intense collisions due to uncoordinated transmissions. However, the current MAC/PHY design of LoRaWAN fails to recover collisions, resulting in degraded performance as the system scales. This
-
Prophet: Toward Fast, Error-Tolerant Model-Based Throughput Prediction for Reactive Flows in DC Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-26 Jingxuan Zhang; Kai Gao; Y. Richard Yang; Jun Bi
As modern network applications ( e.g. , large data analytics) become more distributed and can conduct application-layer traffic adaptation, they demand better network visibility to better orchestrate their data flows. As a result, the ability to predict the available bandwidth for a set of flows has become a fundamental requirement of today’s networking systems. While there are previous studies addressing
-
Burstable Instances for Clouds: Performance Modeling, Equilibrium Analysis, and Revenue Maximization IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-26 Yuxuan Jiang; Mohammad Shahrad; David Wentzlaff; Danny H. K. Tsang; Carlee Joe-Wong
Leading cloud providers recently introduced a new instance type named burstable instances to better match the time-varying workloads of tenants and further reduce their costs. In the research community, however, little has been done to understand burstable instances from a theoretical perspective. This paper presents the first unified framework to model, analyze, and optimize the operation of burstable
-
Scheduling Relaxed Loop-Free Updates Within Tight Lower Bounds in SDNs IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-26 Hao Zhou; Xiaofeng Gao; Jiaqi Zheng; Guihai Chen
We consider a fundamental update problem of avoiding forwarding loops based on the node-ordering protocol in Software Defined Networks (SDNs). Due to the distributed data plane, forwarding loops may occur during the updates and influence the network performance. The node-ordering protocol can avoid such forwarding loops by controlling the update orders of the switches and does not consume extra flow
-
Congestion Minimization for Service Chain Routing Problems With Path Length Considerations IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-26 Lingnan Gao; George N. Rouskas
Network function virtualization (NFV), with its perceived potential to accelerate service deployment and to introduce flexibility in service provisioning, has drawn a growing interest from industry and academia alike over the past few years. One of the key challenges in realizing NFV is the service chain routing problem, whereby traffic must be routed so as to traverse the various components of a network
-
AWG-Based Nonblocking Shuffle-Exchange Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-26 Tong Ye; Jingjie Ding; Tony T. Lee; Guido Maier
Optical shuffle-exchange networks (SENs) have wide application in different kinds of interconnection networks. This article proposes an approach to construct modular optical SENs, using a set of arrayed waveguide gratings (AWGs) and tunable wavelength converters (TWCs). According to the wavelength routing property of AWGs, we demonstrate for the first time that an AWG is functionally equivalent to
-
WiZig: Cross-Technology Energy Communication Over a Noisy Channel IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-25 Xiuzhen Guo; Yuan He; Xiaolong Zheng
The proliferation of IoT applications brings the demand of ubiquitous connections among heterogeneous wireless devices. Cross-Technology Communication (CTC) is a significant technique to directly exchange data among heterogeneous devices that follow different standards. By exploiting a side-channel like frequency, amplitude, or temporal modulation, the existing works enable CTC but have limited performance
-
Multi-Party Privacy Conflict Management in Online Social Networks: A Network Game Perspective IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-25 Kemi Ding; Junshan Zhang
In this work, we consider the multi-party privacy conflict (MPC) in an online social network (OSN). As many data items uploaded to the OSN are “co-owned” by multiple users with different privacy concerns, some personal information of OSN users may be disclosed by others unintentionally. On the contrary with existing mainstream OSN platforms allowing only the very user uploading the data to set the
-
A Secure Middlebox Framework for Enabling Visibility Over Multiple Encryption Protocols IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-24 Juhyeng Han; Seongmin Kim; Daeyang Cho; Byungkwon Choi; Jaehyeong Ha; Dongsu Han
Network middleboxes provide the first line of defense for enterprise networks. Many of them typically inspect packet payload to filter malicious attack patterns. However, the widespread use of end-to-end cryptographic protocols designed to promote security and privacy, either inhibits deep packet inspection in the network or forces enterprises to use solutions that are not secure. This article introduces
-
Network Scheduling and Compute Resource Aware Task Placement in Datacenters IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-19 Ali Munir; Ting He; Ramya Raghavendra; Franck Le; Alex X. Liu
To improve the performance of data-intensive applications, existing datacenter schedulers optimize either the placement of tasks or the scheduling of network flows. The task scheduler strives to place tasks close to their input data (i.e., maximize data locality) to minimize network traffic, while assuming fair sharing of the network. The network scheduler strives to finish flows as quickly as possible
-
Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-19 Guocong Quan; Jian Tan; Atilla Eryilmaz
Least-recently-used (LRU) caching and its variants have conventionally been used as a fundamental and critical method to ensure fast and efficient data access in computer and communication systems. Emerging data-intensive applications over unreliable channels, e.g., mobile edge computing and wireless content delivery networks, have imposed new challenges in optimizing LRU caching in environments prone
-
Scheduling and Power Allocation Dampens the Negative Effect of Channel Misreporting in Massive MIMO IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-19 Zhanzhan Zhang; Yin Sun; Ashutosh Sabharwal; Zhiyong Chen; Bin Xia
We study the sensitivity of multi-user scheduling performance to channel magnitude misreporting in systems with massive antennas. We consider the round-robin scheduler combined with max-min and waterfilling power controls, respectively. We show that user scheduling combined with power allocation, in general, dampens the negative effect of channel misreporting compared to the purely physical layer analysis
-
On Parallel and Hitless vSDN Reconfiguration IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-19 Sicheng Zhao; Xing Wu; Zuqing Zhu
The symbiosis of network virtualization and software-defined networking (SDN) enables an infrastructure provider (InP) to build various virtual software defined networks (vSDNs) over a shared substrate network (SNT). To handle a dynamic network environment, the InP may need to reconfigure the mapping schemes of vSDNs for a variety of reasons. Although previous studies have addressed how to calculate
-
Social-Aware Privacy-Preserving Mechanism for Correlated Data IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-06-17 Guocheng Liao; Xu Chen; Jianwei Huang
We study a privacy-preserving data collection problem by considering individuals’ data correlation and social relationship. A data collector gathers data from some data reporters to perform certain analysis with a privacy-preserving mechanism. Due to the data correlation, the analysis will cause privacy leakage not only to the data reporters but also to those individuals who do not report data. Owing
-
Packet Header Obfuscation Using MIMO IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-06-17 Yue Cao; Ahmed Osama Fathy Atya; Shailendra Singh; Zhiyun Qian; Srikanth V. Krishnamurthy; Thomas F. La Porta; Prashant Krishnamurthy; Lisa Marvel
Eavesdroppers can exploit exposed packet headers towards attacks that profile clients and their data flows. In this paper, we propose FOG, a framework for effective full and partial header blinding using MIMO, to thwart eavesdroppers. FOG effectively tracks header bits as they traverse physical (PHY) layer sub-systems that perform functions like scrambling and interleaving. It combines multiple blinding
-
A Scalable, High-Performance, and Fault-Tolerant Network Architecture for Distributed Machine Learning IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-06-19 Songtao Wang; Dan Li; Yang Cheng; Jinkun Geng; Yanshu Wang; Shuai Wang; Shutao Xia; Jianping Wu
In large-scale distributed machine learning (DML), the network performance between machines significantly impacts the speed of iterative training. In this paper we propose BML , a scalable, high-performance and fault-tolerant DML network architecture on top of Ethernet and commodity devices. BML builds on BCube topology, and runs a fully-distributed gradient synchronization algorithm. Compared to a
-
Approximation Algorithms for the Min-Max Cycle Cover Problem With Neighborhoods IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-06-16 Lijia Deng; Wenzheng Xu; Weifa Liang; Jian Peng; Yingjie Zhou; Lei Duan; Sajal K. Das
In this paper we study the min-max cycle cover problem with neighborhoods, which is to find a given number of $K$ cycles to collaboratively visit $n$ Points of Interest (POIs) in a 2D space such that the length of the longest cycle among the $K$ cycles is minimized. The problem arises from many applications, including employing mobile sinks to collect sensor data in wireless sensor networks (WSNs)
-
Bound Inference in Network Performance Tomography With Additive Metrics IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-06-19 Cuiying Feng; Luning Wang; Kui Wu; Jianping Wang
Network performance tomography infers performance metrics on internal network links with end-to-end measurements. Existing results in this domain are mainly Boolean-based, i.e., they check whether or not a link is identifiable, and return the exact value on identifiable links. If a link is not identifiable, the Boolean-based solution gives no performance result for the link. In this paper, we extend
-
PFCA: A Programmable FIB Caching Architecture IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-06-25 Garegin Grigoryan; Yaoqing Liu; Minseok Kwon
Ternary Content-Addressable Memory (TCAM) chips are used to store Forwarding Information Bases (FIB) in modern routers. TCAM provides next-hop lookup for IP packets at the line-rate. However, TCAM is expensive and energy-consuming; in addition, the constant FIB growth may lead to TCAM overflow problem. Yet only a small portion of FIB entries carries the most of network traffic. Thus, FIB caching, namely
-
Design and Implementation of TCP-Friendly Meters in P4 Switches IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-07-01 Shie-Yuan Wang; Hsien-Wen Hu; Yi-Bing Lin
Metering the traffic of a flow and dropping the portion of traffic that exceeds the target rate set by the meter is very important to provide quality of service (QoS) in a network. Most existing switches on the market provide the meter function. Although these meters regulate the traffic of a UDP flow very well, according to our tests, they are not TCP-friendly. For example, we found that a TCP flow
-
Routing in Communication Networks With Interdependent Power Grid IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-06-25 Peng-Yong Kong
In smart grid, power grid and communication network are interdependent. With this interdependence, a failure in one network may lead to a cascade of failures across the networks. Considering such failures, we develop a model to determine communication route failure probability and quantify its impact in term of lost load. We formulate an optimization to find the set of optimal routes that minimize
-
Elastic Traffic Engineering Subject to a Fair Bandwidth Allocation via Bilevel Programming IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-18 Stefano Coniglio; Luca Giovanni Gianoli; Edoardo Amaldi; Antonio Capone
The ability of TCP’s congestion control scheme to adapt the rate of traffic flows and fairly use all the available resources is one of the Internet’s pillars. So far, however, the elasticity of traffic has been disregarded in traffic engineering (TE) methodologies mainly because, only recently, the increase in access capacity has moved the bottlenecks from the access network to the operator network
-
Certificateless Homomorphic Signature Scheme for Network Coding IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-14 Jinyong Chang; Yanyan Ji; Bilin Shao; Maozhi Xu; Rui Xue
Homomorphic signature is an extremely important public key authentication technique for network coding to defend against pollution attacks. As a public key cryptographic primitive, it also encounters the same problem of how to confirm the relationship between some public key $pk$ and the identity $ID$ of its owner. In the setting of distributed network coding, the intermediate and destination nodes
-
Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-13 János Tapolcai; Lajos Rónyai; Balázs Vass; László Gyimóthi
At backbone network planning, an important task is to identify the failures to get prepared for. Technically, a list of link sets, called Shared Risk Link Groups (SRLG), is defined. The observed reliability of network services strongly depends on how carefully this list was selected and whether it contains every high-risk failure event. Regional failures often cause the breakdown of multiple elements
-
Throughput Maximization in Uncooperative Spectrum Sharing Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-12 Thomas Stahlbuhk; Brooke Shrader; Eytan Modiano
Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves optimality by adaptively scheduling transmissions relative to each user’s stochastic traffic demands. To implement the method, users must report their queue backlogs
-
Online Identification of Groups of Flows Sharing a Network Bottleneck IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-06 David A. Hayes; Michael Welzl; Simone Ferlin; David Ros; Safiqul Islam
Most Internet hosts today support multiple access technologies and network interfaces. Multipath transport protocols, like MPTCP, are being deployed (e.g., in smartphones), allowing transparent simultaneous use of multiple links. Besides providing increased resilience to link failures, multipath transports may better exploit available (aggregate) capacity across all interfaces. The safest way to ensure
-
Pricing, Competition and Content for Internet Service Providers IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-06 Peter Key; Richard Steinberg
We examine competition between two Internet Service Providers (ISPs), where the first ISP provides basic Internet service, while the second ISP provides Internet service plus content, i.e., enhanced service , where the first ISP can partner with a Content Provider to provide the same content as the second ISP. When such a partnering arrangement occurs, the Content Provider pays the first ISP a transfer
-
Towards Software-Defined Buffer Management IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-06 Kirill Kogan; Danushka Menikkumbura; Gustavo Petri; Youngtae Noh; Sergey I. Nikolenko; Alexander Sirotkin; Patrick Eugster
Buffering architectures and policies for their efficient management are core ingredients of a network architecture. However, despite strong incentives to experiment with and deploy new policies, opportunities for changing anything beyond minor elements are limited. We introduce a new specification language, OpenQueue, that allows to express virtual buffering architectures and management policies representing
-
A Fast and Compact Invertible Sketch for Network-Wide Heavy Flow Detection IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-06 Lu Tang; Qun Huang; Patrick P. C. Lee
Fast detection of heavy flows (e.g., heavy hitters and heavy changers) in massive network traffic is challenging due to the stringent requirements of fast packet processing and limited resource availability. Invertible sketches are summary data structures that can recover heavy flows with small memory footprints and bounded errors, yet existing invertible sketches incur high memory access overhead
-
Rethinking Fast and Friendly Transport in Data Center Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-06 Tao Zhang; Jiawei Huang; Kai Chen; Jianxin Wang; Jianer Chen; Yi Pan; Geyong Min
The sustainable growth of bandwidth has been an inevitable tendency in current Data Center Networks (DCN). However, the dramatic expansion of link capacity offers a remarkable challenge to the transport layer protocols of DCN, i.e., how to converge fast and enable data flow to utilize the high bandwidth effectively. Meanwhile, the new protocol should be compatible to the traditional TCP because the
-
Joint Server Assignment and Resource Management for Edge-Based MAR System IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-05 Can Wang; Sheng Zhang; Zhuzhong Qian; Mingjun Xiao; Jie Wu; Baoliu Ye; Sanglu Lu
Mobile Augmented Reality (MAR) applications usually contain computation-intensive tasks which far outstrip the capability of mobile devices. One way to overcome this is offloading computation-intensive MAR tasks to remote clouds. However, the wide area network delay is hard to reduce. Thanks to edge computing, we can offload MAR tasks to nearby servers. Prior studies focus on either single-task MAR
-
LaScaDa: A Novel Scalable Topology for Data Center Network IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-08-03 Zina Chkirbene; Rachid Hadjidj; Sebti Foufou; Ridha Hamila
The growth of cloud-based services is mainly supported by the core networking infrastructures of large-scale data centers, while the scalability of these services is influenced by the performance and dependability characteristics of data centers. Hence, the data center network must be agile and reconfigurable in order to respond quickly to the ever-changing application demands and service requirements
-
Efficient Anonymous Temporal-Spatial Joint Estimation at Category Level Over Multiple Tag Sets With Unreliable Channels IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-07-31 Youlin Zhang; Shigang Chen; You Zhou; Olufemi O. Odegbile; Yuguang Fang
Radio-frequency identification (RFID) technologies have been widely used in inventory control, object tracking and supply chain management. One of the fundamental system functions is called cardinality estimation, which is to estimate the number of tags in a covered area. In this paper, we extend the research of this function in two directions. First, we perform joint cardinality estimation among tags
-
Information Source Finding in Networks: Querying With Budgets IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-07-31 Jaeyoung Choi; Sangwoo Moon; Jiin Woo; Kyunghwan Son; Jinwoo Shin; Yung Yi
In this paper, we study a problem of detecting the source of diffused information by querying individuals, given a sample snapshot of the information diffusion graph, where two queries are asked: (i) whether the respondent is the source or not, and (ii) if not, which neighbor spreads the information to the respondent. We consider the case when respondents may not always be truthful and some cost is
-
Detecting IoT Devices in the Internet IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-07-28 Hang Guo; John Heidemann
Distributed Denial-of-Service (DDoS) attacks launched from compromised Internet-of-Things (IoT) devices have shown how vulnerable the Internet is to large-scale DDoS attacks. To understand the risks of these attacks requires learning about these IoT devices: where are they? how many are there? how are they changing? This paper describes three new methods to find IoT devices on the Internet: server
-
Quantifying Deployability and Evolvability of Future Internet Architectures via Economic Models IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-07-23 Ye Li; Hong Xie; John C. S. Lui; Kenneth L. Calvert
Emerging new applications demand the current Internet to provide new functionalities. Although many future Internet architectures and protocols have been proposed to fulfill such needs, ISPs have been reluctant to deploy many of these architectures. We believe technical issues are not the main reasons as many of these new proposals are technically sound. In this paper, we take an economic perspective
-
Pricing, Bandwidth Allocation, and Service Competition in Heterogeneous Wireless Networks IEEE ACM Trans. Netw. (IF 3.315) Pub Date : 2020-07-22 Cheng Chen; Randall A. Berry; Michael L. Honig; Vijay G. Subramanian
Small-cells deployed in licensed spectrum can expand wireless service to low mobility users, which potentially reduces the demand for macro-cellular networks with wide-area coverage. Introducing such heterogeneity also makes network resource allocation more complicated. To understand these challenges and tradeoffs we present a two-tier heterogeneous wireless network model with two types of users: mobile
Contents have been reproduced by permission of the publishers.