Achieving High Availability in Inter-DC WAN Traffic Engineering
- Han Zhang,
- Xia Yin,
- Xingang Shi,
- Jilong Wang,
- Zhiliang Wang,
- Yingya Guo,
- Tian Lan,
- Yahui Li,
- Yongqing Zhu,
- Ke Ruan,
- Haijun Geng
Inter-DataCenter Wide Area Network (Inter-DC WAN) that connects geographically distributed data centers is becoming one of the most critical network infrastructures. Due to limited bandwidth and inevitable link failures, it is highly challenging to ...
A Secure and Intelligent Data Sharing Scheme for UAV-Assisted Disaster Rescue
Unmanned aerial vehicles (UAVs) have the potential to establish flexible and reliable emergency networks in disaster sites when terrestrial communication infrastructures go down. Nevertheless, potential security threats may occur on UAVs during data ...
Cooperation Preference Aware Shapley Value: Modeling, Algorithms and Applications
The Shapley value is a cornerstone in cooperative game theory and has been widely applied in networking, data science, etc. The classical Shapley value assumes that each player has an equal preference to cooperate with each other. Since the cooperation ...
Octopus: Exploiting the Edge Intelligence for Accessible 5G Mobile Performance Enhancement
While 5G has rolled out since 2019 and exhibited versatile advantages, its performance under high/extreme mobility scenes (e.g., driving, high-speed railway or HSR) remains mysterious. In this work, we carry out a large-scale field-trial campaign, taking &...
AirNN: Over-the-Air Computation for Neural Networks via Reconfigurable Intelligent Surfaces
- Sara Garcia Sanchez,
- Guillem Reus-Muns,
- Carlos Bocanegra,
- Yanyu Li,
- Ufuk Muncuk,
- Yousof Naderi,
- Yanzhi Wang,
- Stratis Ioannidis,
- Kaushik Roy Chowdhury
Over-the-air analog computation allows offloading computation to the wireless environment through carefully constructed transmitted signals. In this paper, we design and implement the first-of-its-kind convolution that uses over-the-air computation and ...
Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments
In this work, we study the connected version of the covering problem motivated by the coverage of ad-hoc drones’ swarm. We focus on the situation where the number of drones is given, and this number is not necessarily enough to cover all users. ...
SlimFL: Federated Learning With Superposition Coding Over Slimmable Neural Networks
Federated learning (FL) is a key enabler for efficient communication and computing, leveraging devices’ distributed computing capabilities. However, applying FL in practice is challenging due to the local devices’ heterogeneous energy, ...
Privacy Protection Under Incomplete Social and Data Correlation Information
Data reporters have privacy concerns when they are requested to contribute personal data to a data collector. Such privacy concerns are strengthened by data correlation and social relationship, as the data correlation could inevitably cause privacy issues ...
On the Multilayer Planning of Filterless Optical Networks With OTN Encryption
With enhanced cost-effectiveness, filterless optical networks (FONs) have been considered as a promising candidate for future optical infrastructure. However, as the transmission in FON relies on the “select-and-broadcast” scenario, it is ...
Simultaneous Data Dissemination Among WiFi and ZigBee Devices
Recent advances in Cross-Technology Communication (CTC) have opened a new door for cooperation among heterogeneous IoT devices to support ubiquitous applications, such as smart homes and smart offices. However, existing work mainly focuses on physical ...
StarFront: Cooperatively Constructing Pervasive and Low-Latency CDNs Upon Emerging LEO Satellites and Clouds
Internet content providers (ICPs) typically exploit content distribution networks (CDNs) to provide wide-area data access with high availability and low latency. However, our analysis on a large-scale trace collected from seven major CDN operators has ...
Exploring the Impact of Critical Programmability on Controller Placement for Software-Defined Wide Area Networks
Control latency is a critical concern for deploying Software-Defined Networking (SDN) into Wide Area Networks (WANs). A Software-Defined WAN (SD-WAN) can be divided into multiple domains controlled by multiple controllers with a logically centralized ...
The Closed Resolver Project: Measuring the Deployment of Inbound Source Address Validation
Ingress filtering, commonly referred to as Source Address Validation (SAV), is a practice aimed at discarding packets with spoofed source IP addresses at the network periphery. Outbound SAV, i.e., dropping traffic with spoofed source IP addresses as it ...
A One-Pass Clustering Based Sketch Method for Network Monitoring
Network monitoring solutions need to cope with increasing network traffic volumes, as a result, sketch-based monitoring methods have been extensively studied to trade accuracy for memory scalability and storage reduction. However, sketches are sensitive ...
Enhancing TCP via Hysteresis Switching: Theoretical Analysis and Empirical Evaluation
In this paper we study the relationship between the TCP packet loss cycle and the performance of time-sensitive traffic in data centers. Using real traffic measurements and analysis, we find that such loss cycles are not long enough to enable most ...
Fast, Scalable and Robust Centralized Routing for Data Center Networks
- Fusheng Lin,
- Hongyu Wang,
- Guo Chen,
- Guihua Zhou,
- Tingting Xu,
- Dehui Wei,
- Li Chen,
- Yuanwei Lu,
- Andrew Qu,
- Hua Shao,
- Hongbo Jiang
This paper presents a fast and robust centralized data center network (DCN) routing solution, called Primus. For fast routing calculation, Primus uses centralized controllers to collect/disseminate the network’s link-states (LS), and offload the ...
Optimizing Parameter Mixing Under Constrained Communications in Parallel Federated Learning
In vanilla Federated Learning (FL) systems, a centralized parameter server (PS) is responsible for collecting, aggregating and distributing model parameters with decentralized clients. However, the communication link of a single PS can be easily ...
CocoSketch: High-Performance Sketch-Based Measurement Over Arbitrary Partial Key Query
Sketch-based measurement has emerged as a promising solutions due to its high accuracy and resource efficiency. Prior sketches focus on measuring single flow keys and cannot support measurement on multiple keys. This work takes a significant step towards ...
Optimal Oblivious Routing With Concave Objectives for Structured Networks
- Kanatip Chitavisutthivong,
- Sucha Supittayapornpong,
- Pooria Namyar,
- Mingyang Zhang,
- Minlan Yu,
- Ramesh Govindan
Oblivious routing distributes traffic from sources to destinations following predefined routes with rules independent of traffic demands. While finding optimal oblivious routing with a concave objective is intractable for general topologies, we show that ...
Multi-Edge Server-Assisted Dynamic Federated Learning With an Optimized Floating Aggregation Point
- Bhargav Ganguly,
- Seyyedali Hosseinalipour,
- Kwang Taik Kim,
- Christopher G. Brinton,
- Vaneet Aggarwal,
- David J. Love,
- Mung Chiang
We propose cooperative edge-assisted dynamic federated learning (<monospace>CE-FL</monospace>). <monospace>CE-FL</monospace> introduces a distributed machine learning (ML) architecture, where data collection is carried out at the end devices, while the ...
Constrained Network Slicing Games: Achieving Service Guarantees and Network Efficiency
Network slicing is a key capability for next generation mobile networks. It enables infrastructure providers to cost effectively customize logical networks over a shared infrastructure. A critical component of network slicing is resource allocation, which ...
Crowdfunding With Cognitive Limitations
To achieve the desirable funding target in a crowdfunding campaign, the project creator needs to accurately anticipate the pledging behaviors of contributors with practical cognitive limitations. In this paper, we present a study on how the contributors&#...
Online Learning for Failure-Aware Edge Backup of Service Function Chains With the Minimum Latency
Virtual network functions (VNFs) have been widely deployed in mobile edge computing (MEC) to flexibly and efficiently serve end users running resource-intensive applications, which can be further serialized to form service function chains (SFCs), ...
Enabling Distributed and Optimal RDMA Resource Sharing in Large-Scale Data Center Networks: Modeling, Analysis, and Implementation
Remote Direct Memory Access (RDMA) suffers from unfairness issues and performance degradation when multiple applications share RDMA network resources. Hence, an efficient resource scheduling mechanism is urged to optimally allocates RDMA resources among ...
Deep Reinforcement Learning-Based Online Resource Management for UAV-Assisted Edge Computing With Dual Connectivity
Mobile Edge Computing (MEC) is a key technology towards delay-sensitive and computation-intensive applications in future cellular networks. In this paper, we consider a multi-user, multi-server system where the cellular base station is assisted by a UAV, ...
Distributed Transport Protocols for Quantum Data Networks
Quantum computing holds great promise and this work proposes to use new quantum data networks (QDNs) to connect multiple small quantum computers to form a cluster. Such a QDN differs from existing quantum key distribution (QKD) networks in that the former ...
A Longitudinal and Comprehensive Measurement of DNS Strict Privacy
The DNS privacy protection mechanisms, DNS over TLS (DoT) and DNS over HTTPS (DoH), only work correctly if both the server and client support the Strict Privacy profile and no vulnerability exists in the implemented TLS/HTTPS. A natural question then ...
Burst-Aware Time-Triggered Flow Scheduling With Enhanced Multi-CQF in Time-Sensitive Networks
Deterministic transmission guarantee in time-sensitive networks (TSN) relies on queue models (such as CQF, TAS, ATS) and resource scheduling algorithms. Thanks to its ease of use, the CQF queue model has been widely adopted. However, the existing resource ...
Ark Filter: A General and Space-Efficient Sketch for Network Flow Analysis
Sketches are widely deployed to represent network flows to support complex flow analysis. Typical sketches usually employ hash functions to map elements into a hash table or bit array. Such sketches still suffer from potential weaknesses upon throughput, ...
An Adaptive Metadata Management Scheme Based on Deep Reinforcement Learning for Large-Scale Distributed File Systems
A major challenge confronting today’s distributed metadata management schemes is how to meet the dynamic requirements of various applications through effectively mapping and migrating metadata nodes to different metadata servers (MDS’s). ...