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

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

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

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)

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

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

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

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

Presents the table of contents for this issue of the publication.

Presents a listing of the editorial board, board of governors, current staff, committee members, and/or society editors for this issue of the publication.

Motivated by medium access control for resource-challenged wireless Internet of Things (IoT) networks, we consider the problem of queue scheduling with reduced queue state information. In particular, we consider a time-slotted scheduling model with $N$ wireless links, such that links $i$ and $i+1$ , $1 \leq i \leq N-1$ cannot transmit together. Our aim in this paper is to study throughput-optimal,

We study networks of M/M/1 queues in which nodes act as caches that store objects. Exogenous requests for objects are routed towards nodes that store them; as a result, object traffic in the network is determined not only by demand but, crucially, by where objects are cached. We determine how to place objects in caches to attain a certain design objective, such as, e.g., minimizing network congestion

Programmable network switches promise flexibility and high throughput, enabling applications such as load balancing and traffic engineering. Network measurement is a fundamental building block for such applications, including tasks such as the identification of heavy hitters (largest flows) or the detection of traffic changes. However, high-throughput packet processing architectures place certain limitations

We consider a single-unicast networking scenario where a sender streams a flow at a fixed rate to a receiver across a multi-hop network, possibly using multiple paths. Transmission over a link incurs a traffic-dependent link delay. We optimize network delay concerning two popular metrics, namely maximum delay and average delay. Well-known pessimistic results state that a flow cannot simultaneously

Radio Frequency Identification (RFID) technology has been proliferating in recent years, especially with its wide usage in retail, warehouse and supply chain management. One of its most popular applications is to automatically detect missing products (attached with RFID tags) in a large storage place. However, most existing protocols assume that the IDs of all tags within a reader’s coverage are known

We study a job-assignment problem in a large-scale server farm system with geographically deployed servers as abstracted computer components (e.g., storage, network links, and processors) that are potentially diverse. We aim to maximize the energy efficiency of the entire system by effectively controlling carried load on networked servers. A scalable, near-optimal job-assignment policy is proposed

The attacks, faults, and severe communication/system conditions in Mobile Crowd Sensing (MCS) make false data detection a critical problem. Observing the intrinsic low dimensionality of general monitoring data and the sparsity of false data, false data detection can be performed based on the separation of normal data and anomalies. Although the existing separation algorithm based on Direct Robust Matrix

Routing in large-scale computer networks today is built on hop-by-hop routing: packet headers specify the destination address and routers use internal forwarding tables to map addresses to next-hop ports. In this paper we take a new look at the scalability of this paradigm. We define a new model that reduces forwarding tables to sequential strings, which then lend themselves readily to an information-theoretical

Recent years have witnessed the rapid growth of mobile virtual network operators (MVNOs), which operate on top of existing cellular infrastructures of base carriers, while offering cheaper or more flexible data plans compared to those of the base carriers. In this paper, we present a two-year measurement study towards understanding various fundamental aspects of today’s MVNO ecosystem, including its

Multi-access Edge Computing (MEC) has emerged as a flexible and cost-effective paradigm, enabling resource constrained mobile devices to offload, either partially or completely, computationally intensive tasks to a set of servers at the edge of the network. Given that the shared nature of the servers’ resources introduces high computation and communication uncertainty, in this paper we consider users’

The introduction of software-defined networking (SDN) has emerged as a new network paradigm for network innovations. By decoupling the control plane from the data plane in traditional networks, SDN provides high programmability to control and manage networks. However, the communication between the two planes can be a bottleneck of the whole network. SDN-aimed DoS attacks can cause long packet delay

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal.

Presents a listing of the editorial board, board of governors, current staff, committee members, and/or society editors for this issue of the publication.

Modern video players employ complex algorithms to adapt the bitrate of the video that is shown to the user. Bitrate adaptation requires a tradeoff between reducing the probability that the video freezes (rebuffers) and enhancing the quality of the video. A bitrate that is too high leads to frequent rebuffering, while a bitrate that is too low leads to poor video quality. Video providers segment videos

Age of information (AoI), defined as the time that elapsed since the last received update was generated, is a newly proposed metric to measure the timeliness of information updates in a network. We consider AoI minimization problem for a network with general interference constraints, and time varying channels. We propose two policies, namely, virtual-queue based policy and age-based policy when the

Cloud computing has long been the main backbone that Internet of Things (IoT) devices rely on to accommodate their storage and analytical needs. However, the fact that cloud systems are often located quite far from the IoT devices and the emergence of delay-critical IoT applications urged the need for extending the cloud architecture to support delay-critical services. Given that fog nodes possess

Distributed computing frameworks such as MapReduce are often used to process large computational jobs. They operate by partitioning each job into smaller tasks executed on different servers. The servers also need to exchange intermediate values to complete the computation. Experimental evidence suggests that this so-called Shuffle phase can be a significant part of the overall execution time for several

Can the popular shortest remaining processing time (SRPT) algorithm achieve a constant competitive ratio on multiple servers when server speeds are adjustable (speed scaling) with respect to the flow time plus energy consumption metric? This question has remained open for a while, where a negative result in the absence of speed scaling is well known. The main result of this paper is to show that multi-server

Spectrum shortage is a fundamental problem in wireless networks, and this problem becomes increasingly acute with the rapid proliferation of wireless devices. To address this issue, spectrum sharing in the context of cognitive radio networks (CRNs) has been regarded as a promising solution. Although there is a large body of work on spectrum sharing in the literature, most existing work is limited to

We consider a system in which there exists two ISPs, one “big” Content Provider (CP), and a continuum of End-Users (EUs). One of the ISPs is neutral and the other is non-neutral. We consider that the CP can differentiate between ISPs by controlling the quality of the content she is offering on each one. We also consider that EUs have different levels of innate preferences for ISPs. We formulate a sequential

Database-driven Dynamic Spectrum Sharing (DSS) is the de-facto technical paradigm adopted by Federal Communications Commission for increasing spectrum efficiency, which allows licensed spectrum to be opportunistically used by secondary users. In database-driven DSS, a geo-location database administrator (DBA) maintains spectrum availability information over its service region in the form of a Radio

Traffic measurement in high-speed networks has many important functions in improving network performance, assisting resource allocation, and detecting anomalies. In this paper, we study a generalized problem called ${k}$ -persistent spread estimation, which measures the volume of persist traffic elements in each flow that appear during at least ${k}$ out of ${t}$ measurement periods, where ${k}$ and

Embedding Radio-Frequency IDentification (RFID) into everyday objects to construct ubiquitous networks has been a long-standing goal. However, a major problem that hinders the attainment of this goal is the current inefficient reading of RFID tags. To address the issue, the research community introduces the technique of Bloom Filter (BF) to RFID systems. This work presents TagMap, a practical solution

MapReduce jobs need to shuffle a large amount of data over the network between mapper and reducer nodes. The shuffle time accounts for a big part of the total running time of the MapReduce jobs. Therefore, optimizing the makespan of shuffle phase can greatly improve the performance of MapReduce jobs. A large fraction of production jobs in data centers are recurring with predictable characteristics

The number of Internet of Things is growing exponentially, among which the ZigBee devices are being widely deployed, incurring severe collision problem in ZigBee networks. Instead of collision avoidance or packet retransmissions which introduce extra time/energy overhead, existing methods try to decompose multi-packet collision directly. For example, state-of-the-art mZig exploits collision-free chips

Direct Acyclic Graph (DAG)-based ledger and the corresponding consensus algorithm has been identified as a promising technology for Internet of Things (IoT). Compared with Proof-of-Work (PoW) and Proof-of-Stake (PoS) that have been widely used in blockchain, the consensus mechanism designed on DAG structure (simply called as DAG consensus) can overcome some shortcomings such as high resource consumption

The emerging millimeter-wave (mmWave) networking technology promises to unleash a new wave of multi-Gbps wireless applications. However, due to high directionality of the mmWave radios, maintaining stable link connection remains an open problem. Users’ slight orientation change, coupled with motion and blockage, can easily disconnect the link. In this paper, we propose RoMil, a robotic mmWave relay

In this paper, we explore how a programmable forwarding plane offered by a new breed of network switches might naturally accelerate consensus protocols, specifically focusing on Paxos. The performance of consensus protocols has long been a concern. By implementing Paxos in the forwarding plane, we are able to significantly increase throughput and reduce latency. Our P4-based implementation running

A dynamic routing policy, referred to as Heat-Diffusion (HD), is developed for multihop uniclass wireless networks subject to random traffic, time-varying topology and inter-channel interference. The policy uses only current condition of queue occupancies and channel states, with requiring no knowledge of traffic and topology. Besides throughput optimality, HD minimizes an average quadratic routing

The prosperity of IEEE 802.11-based Wi-Fi networks aggravates cross-technology interference to IEEE 802.15.4-enabled ZigBee networks widely deployed to enable various Internet-of-Things applications. To make ZigBee communication reliable and robust even in a dense Wi-Fi environment, taming Wi-Fi interference in ZigBee networks especially from the perspective of physical layer is of paramount importance

Monitoring the performance of a large network would involve a high measurement cost. To reduce the overhead, sparse network monitoring techniques may be applied to select paths or time intervals to take the measurements, while the remaining monitoring data can be inferred leveraging the spatial-temporal correlations among data. The quality of missing data recovery, however, highly relies on the specific

In this study, we consider wide-sense nonblocking operation of a converting-space-converting switching fabric. We propose a routing strategy based on the functional decomposition of second-stage switches, called the XsVarSWITCH routing strategy. This routing strategy is suitable for all kinds of three-stage switching fabrics operating in a slotted mode, regardless of frequency, time, or other types

We study the path planning of submarine cable systems with trunk-and-branch tree topology on the surface of the earth. Existing work on path planning represents the earth’s surface by triangulated manifolds and takes account of laying cost of the cable including material, labor, alternative protection levels, terrain slope and survivability of the cable. Survivability issues include the risk of future

Always keeping a certain distance between vehicles in a platoon system is important for collision avoidance. Centralized platoon systems let the leader vehicle determine and notify the velocities of all the vehicles in the platoon. Unfortunately, such a centralized method generates high packet drop rate and communication delay due to the leader vehicle’s limited communication capability. Therefore

Segment Routing (SR) is a source routing paradigm which is widely used in Traffic Engineering (TE). By using SR, a node steers a packet through an ordered list of instructions called segments. By some extensions of interior gateway protocol, SR can be applied to IP/MPLS or IPv6 network without signal protocol. SR over IPv6 (SRv6) is attracting wide attention because of its interoperation ability with

Many next generation Internet architectures exist in the literature for addressing various issues like increasing traffic, mobility and efficient content dissemination. One such emerging fundamental design is Information Centric Networking (ICN). The Pending Interest Table (PIT) is one of the essential components of the ICN forwarding plane responsible for the stateful routing in ICN. Optimal size

Virtualization techniques help edge environments separate the role of the traditional edge providers into two: edge infrastructure providers (EIPs), who manage the physical edge infrastructure, and edge service providers (ESPs), who aggregate resources (especially, compute resources) from multiple EIPs to place service entities and offer value-added services to end users (EUs). In such an environment

This article studies distributed algorithms to control self-organizing flying drones with massive MIMO networking capabilities - a network scenario referred to as mDroneNet . We attempt to answer the following fundamental question: what is the optimal way to provide spectrally-efficient wireless access to a multitude of ground nodes with mobile hotspots mounted on drones and endowed with a large number

In spectrum sharing, a spatial separation region is defined around a primary user (PU) where co-channel and/or adjacent channel secondary users (SUs) are not allowed to operate. This region is often called an Exclusion Zone (EZ), and it protects the PU from harmful interference caused by SUs. Unfortunately, existing methods for defining an EZ prescribe a static and an overly conservative boundary,

The rapid development of network function virtualization (NFV) enables a communication network to provide in-network services using virtual network functions (VNFs) deployed on general IT hardware. While existing studies on NFV focused on how to provision VNFs from the provider’s perspective, little is done about how to validate the provisioned resources from the user’s perspective. In this work, we

Presents the table of contents for this issue of the publication.

Presents a listing of the editorial board, board of governors, current staff, committee members, and/or society editors for this issue of the publication.

Cardinality estimation is the task of determining the number of distinct elements (or the cardinality) in a data stream, under a stringent constraint that the input data stream can be scanned by just one single pass. This is a fundamental problem with many practical applications, such as traffic monitoring of high-speed networks and query optimization of Internet-scale database. To solve the problem

Most sensor networks employ dynamic routing protocols so that the routing topology can be dynamically optimized with environmental changes. The routing behaviors can be quite complex with increasing network scale and environmental dynamics. Knowledge on the routing path of each packet is certainly a great help in understanding the complex routing behaviors, allowing effective performance diagnosis

LED luminaries are now deployed densely in indoor areas to provide uniform illumination. Visible Light Communication (VLC) can also benefit from this dense LED infrastructure. In this paper, we propose DenseVLC, a cell-free massive MIMO networking system enabled by densely distributed LEDs, that forms different beamspots to simultaneously serve multiple receivers. This is a cell-free system, as there

Emerging 5G systems will need to efficiently support both enhanced mobile broadband traffic (eMBB) and ultra-low-latency communications (URLLC) traffic. In these systems, time is divided into slots which are further sub-divided into minislots. From a scheduling perspective, eMBB resource allocations occur at slot boundaries, whereas to reduce latency URLLC traffic is pre-emptively overlapped at the

Data collection in Wireless Sensor Networks (WSN) draws significant attention, due to emerging interest in technologies ranging from Internet of Things (IoT) networks to simple “Presence” applications, which identify the status of the devices (active or inactive). Numerous Medium Access Control (MAC) protocols for WSN, which can address the challenge of data collection in dense networks, were suggested

Capacity planning and sales projection are essential tasks for network operators. This work aims to help network providers to carry out network capacity planning and sales projection by answering: Given topology and capacity, whether the network can serve current flow demands with high probabilities? We name such probability as the “ flow availability ”, and present the flow availability estimation

Mobile crowdsensing is a new paradigm in which a requester can recruit a group of mobile users via a platform and coordinate them to perform some sensing tasks by using their smartphones. In mobile crowdsensing, each user might perform multiple tasks with different sensing qualities. Meanwhile, the users participating in the crowdsensing will ask for sufficient rewards to compensate for their expenditures

Spectrum regulators are pursuing centralized, dynamic sharing systems that will enable spectrum access for new wireless technologies. These sharing systems will leverage cognitive radio concepts to automatically identify suitable spectrum for users. Collected user information may be considered sensitive, and some incumbents are hesitant about spectrum sharing, citing privacy concerns. Privacy preserving