MPTCP Meets FEC: Supporting Latency-Sensitive Applications Over Heterogeneous Networks
Over the past years, TCP has gone through numerous updates to provide performance enhancement under diverse network conditions. However, with respect to losses, little can be achieved with legacy TCP detection and recovery mechanisms. Both fast ...
Incentive Mechanism for Privacy-Aware Data Aggregation in Mobile Crowd Sensing Systems
The recent proliferation of human-carried mobile devices has given rise to mobile crowd sensing MCS systems that outsource the collection of sensory data to the public crowd equipped with various mobile devices. A fundamental issue in such systems is to ...
Optimization-Based Linear Network Coding for General Connections of Continuous Flows
For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and a little is known about its complexity. Most of the existing methods for identifying solutions rely on very restricted ...
SDN-RDCD: A Real-Time and Reliable Method for Detecting Compromised SDN Devices
A software-defined network SDN is increasingly deployed in many practical settings, bringing new security risks, e.g., SDN controller and switch hijacking. In this paper, we propose a real-time method to detect compromised SDN devices in a reliable way. ...
Multi-Dimensional Auction Mechanisms for Crowdsourced Mobile Video Streaming
Crowdsourced mobile video streaming enables nearby mobile video users to aggregate network resources to improve their video streaming performances. However, users are often selfish and may not be willing to cooperate without proper incentives. Designing ...
On the Efficiency of Online Social Learning Networks
- Christopher G. Brinton,
- Swapna Buccapatnam,
- Liang Zheng,
- Da Cao,
- Andrew S. Lan,
- Felix M. F. Wong,
- Sangtae Ha,
- Mung Chiang,
- H. Vincent Poor
A social learning network SLN emerges when users exchange information on educational topics with structured interactions. The recent proliferation of massively scaled online human learning, such as massive open online courses MOOCs, has presented a ...
Connectivity in Interdependent Networks
We propose and analyze a graph model to study the connectivity of interdependent networks. Two interdependent networks of arbitrary topologies are modeled as two graphs, where every node in one graph is supported by supply nodes in the other graph, and ...
NetEgg: A Scenario-Based Programming Toolkit for SDN Policies
Recent emergence of software-defined networks offers an opportunity to design domain-specific programming abstractions aimed at network operators. In this paper, we propose scenario-based programming, a framework that allows network operators to program ...
Optimal Dynamic Cloud Network Control
Distributed cloud networking enables the deployment of a wide range of services in the form of interconnected software functions instantiated over general purpose hardware at multiple cloud locations distributed throughout the network. We consider the ...
Truthful Online Auction Toward Maximized Instance Utilization in the Cloud
Although infrastructure as a service IaaS users are busy scaling up/out their cloud instances to meet the ever-increasing demands, the dynamics of their demands, as well as the coarse-grained billing options offered by leading cloud providers, have led ...
Synchronize Inertial Readings From Multiple Mobile Devices in Spatial Dimension
In this paper, we investigate the problem of space synchronization, i.e., synchronizing inertial readings from multiple mobile devices in the spatial dimension, in other words, multiple mobile devices are space synchronized to have the same 3-D ...
Rural Broadband Access via Clustered Collaborative Communication
Broadband penetration in rural areas of the developing countries is significantly low. The unique challenges in enabling rural connectivity are sparsity of population locations and modest income of the villagers, which induce low return on investment to ...
SGX-Tor: A Secure and Practical Tor Anonymity Network With SGX Enclaves
With Tor being a popular anonymity network, many attacks have been proposed to break its anonymity or leak information of a private communication on Tor. However, guaranteeing complete privacy in the face of an adversary on Tor is especially difficult, ...
Merlin: A Language for Managing Network Resources
- Robert Soule,
- Shrutarshi Basu,
- Parisa Jalili Marandi,
- Fernando Pedone,
- Robert Kleinberg,
- Emin Gun Sirer,
- Nate Foster
This paper presents Merlin, a framework for managing resources in software-defined networks. With Merlin, administrators express high-level policies using programs in a declarative language. The language includes logical predicates to identify sets of ...
Randomized Algorithms for Scheduling Multi-Resource Jobs in the Cloud
We consider the problem of scheduling jobs with multiple-resource requirements CPU, memory, and disk in a distributed server platform, motivated by data-parallel and cloud computing applications. Jobs arrive dynamically over time and require certain ...
Improving Routing Convergence With Centrality: Theory and Implementation of Pop-Routing
One of the key features of a routing protocol is its ability to recover from link or node failures, recomputing routes efficiently without creating temporary loops. Indeed, in real conditions, there is always a trade-off between the overhead due to the ...
Global Round Robin: Efficient Routing With Cut-Through Switching in Fat-Tree Data Center Networks
Fat tree is a scalable and widely deployed data center network topology. In this paper, a novel framework for designing per-packet load-balanced routing algorithms in fat tree called global round robin GRR is proposed. Routing in fat tree consists of ...
WCS: Weighted Component Stitching for Sparse Network Localization
Network location is one of the critical issues and a challenge in wireless sensor and ad hoc networks, in particular when networks are sparse. However, even in highly sparse networks, there exist well-connected subgraphs while the distribution of the ...
Low Computational Cost Bloom Filters
Bloom filters BFs are widely used in many network applications but the high computational cost limits the system performance. In this paper, we introduce a low computational cost Bloom filter named One-Hashing Bloom filter OHBF to solve the problem. The ...
Online Learning With Randomized Feedback Graphs for Optimal PUE Attacks in Cognitive Radio Networks
In a cognitive radio network, a secondary user learns the spectrum environment and dynamically accesses the channel, where the primary user is inactive. At the same time, a primary user emulation PUE attacker can send falsified primary user signals and ...
FastND: Accelerating Directional Neighbor Discovery for 60-GHz Millimeter-Wave Wireless Networks
Neighbor discovery ND is a critical primitive for 60-GHz wireless networks with highly directional radios. Prior work has attempted to improve the ND efficiency but overlooks the unique properties of 60-GHz phased-array antennas and spatial channel ...
Maximizing Service Reward for Queues With Deadlines
In this paper, we consider a real-time queuing system with rewards and deadlines. We assume that the packet processing time is known upon arrival, as is the case in communication networks. This assumption allows us to demonstrate that the well-known ...
Distributed Join-the-Idle-Queue for Low Latency Cloud Services
Low latency is highly desirable for cloud services. To achieve a low response time, stringent timing requirements are needed for task scheduling in a large-scale server farm spanning thousands of servers. In this paper, we conduct an in-depth analysis ...
Consistently High MIMO Rates via Switched-Beam Antennas
The demand for wireless bandwidth is rising to unprecedented levels. The industry has responded with the inclusion of advanced PHY techniques, most notably multi-user MU MIMO, in the most recent Wi-Fi and LTE standards. However, despite the theoretical ...
$BitCoding$: Network Traffic Classification Through Encoded Bit Level Signatures
With many network protocols using obfuscation techniques to hide their identity, robust methods of traffic classification are required. In traditional deep-packet-inspection DPI methods, application specific signatures are generated with byte-level data ...
Distributed Low-Latency Data Aggregation for Duty-Cycle Wireless Sensor Networks
Data aggregation is an essential operation for the sink to obtain summary information in a wireless sensor network WSN. The problem of minimum latency aggregation schedule MLAS which seeks a fastest and conflict-free aggregation schedule has been well ...
A Multi-Traffic Inter-Cell Interference Coordination Scheme in Dense Cellular Networks
This paper proposes a novel semi-distributed and practical ICIC scheme based on the Almost Blank SubFrame ABSF approach specified by 3GPP. We define two mathematical programming problems for the cases of guaranteed and best-effort traffic, and use game ...
ProgLIMI: Programmable LInk Metric Identification in Software-Defined Networks
In this paper, we propose the Programmable LInk Metric Identification ProgLIMI infrastructure for software-defined networking SDN networks. ProgLIMI identifies round-trip link metrics RTLMs from accumulated end-to-end metrics of selected measurement ...
Decoupling Beam Steering and User Selection for MU-MIMO 60-GHz WLANs
Multi-user transmission at 60 GHz promises to increase the throughput of next-generation WLANs via both analog and digital beamforming. To maximize the capacity, analog beams need to be jointly configured with user selection and digital weights; however,...
Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors
Barrier Coverage plays a vital role in wireless sensor networks. Research on barrier coverage has mainly focused on the lifetime maximization and the critical conditions to achieve $k$ -Barrier Coverage under various sensing models. When sensors are ...
Subjects
Currently Not Available