Packet classification using binary content addressable memory
Packet classification is the core mechanism that enables many networking devices. Although using ternary content addressable memory (TCAM) to perform high-speed packet classification has become the widely adopted solution, TCAM is very expensive, has ...
Characterizing and optimizing cellular network performance during crowded events
During crowded events, cellular networks face voice and data traffic volumes that are often orders of magnitude higher than what they face during routine days. Despite the use of portable base stations for temporarily increasing communication capacity ...
Time-stable performance in parallel queues with non-homogeneous and multi-class workloads
Motivated by applications in data centers, we consider a scenario where multiple classes of requests arrive at a dispatcher at time-varying rates which historically has daily or weekly patterns. We assume that the underlying environment is such that at ...
IP fast rerouting and disjoint multipath routing with three edge-independent spanning trees
We develop approaches for disjoint multipath routing and fast recovery in IP networks that guarantee recovery from arbitrary two link failures. We achieve this by developing the first known algorithm to construct three edge-independent spanning trees, ...
Mobility weakens the distinction between multicast and unicast
Comparing with the unicast technology, multiple flows from the same source in multicast scenario can be aggregated even if their destinations are different. This paper evaluates such distinction by the multicast gain on per-node capacity and delay, ...
A QoE-aware resource distribution framework incentivizing context sharing and moderate competition
We contend that context information of Internet clients can help to efficiently manage a variety of underlying resources for different Internet services and systems. We therefore propose a resource distribution framework that provides quality of ...
Interdependent security with strategic agents and cascades of infection
We investigate cascades in networks consisting of strategic agents with interdependent security. We assume that the strategic agents have choices between i) investing in protecting themselves, ii) purchasing insurance to transfer (some) risks, and iii) ...
Scalpel: scalable preferential link tomography based on graph trimming
Inferring per-link metrics through aggregated path measurements, known as network tomography, is an effective way to facilitate various network operations, such as network monitoring, load balancing, and fault diagnosis. We study the problem of ...
Joint congestion control and routing optimization: an efficient second-order distributed approach
Distributed joint congestion control and routing optimization has received a significant amount of attention recently. To date, however, most of the existing schemes follow a key idea called the back-pressure algorithm. Despite having many salient ...
SplayNet: towards locally self-adjusting networks
This paper initiates the study of locally self-adjusting networks: networks whose topology adapts dynamically and in a decentralized manner, to the communication pattern σ. Our vision can be seen as a distributed generalization of the self-adjusting ...
ISP service tier design
Internet Service Provider design of service tiers are modeled and analyzed, based on demand for web browsing and video streaming. A basic model that considers user willingness to pay, network capacity, and application performance is formulated to ...
Towards zero-time wakeup of line cards in power-aware routers
- Tian Pan,
- Ting Zhang,
- Junxiao Shi,
- Yang Li,
- Linxiao Jin,
- Fuliang Li,
- Jiahai Yang,
- Beichuan Zhang,
- Xueren Yang,
- Mingui Zhang,
- Huichen Dai,
- Bin Liu
As the network infrastructure has been consuming more and more power, various schemes have been proposed to improve the power efficiency of network devices. Many schemes put links to sleep when idle and wake them up when needed. A presumption in these ...
Taming the uncertainty: budget limited robust crowdsensing through online learning
Mobile crowdsensing has been intensively explored recently due to its flexible and pervasive sensing ability. Although many crowdsensing platforms have been built for various applications, the general issue of how to manage such systems intelligently ...
Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels
It has been known that scheduling algorithms designed to achieve throughput optimality and good delay performance often require solving the Maximum Weighted Independent Set (MWIS) problem. However, under most realistic network settings, the MWIS problem ...
Using viewing statistics to control energy and traffic overhead in mobile video streaming
Video streaming can drain a smartphone battery quickly. A large part of the energy consumed goes to wireless communication. In this article, we first study the energy efficiency of different video content delivery strategies used by service providers ...
Application-level scheduling with probabilistic deadline constraints
Opportunistic scheduling of delay-tolerant traffic has been shown to substantially improve spectrum efficiency. To encourage users to adopt delay-tolerant scheduling for capacity-improvement, it is critical to provide guarantees in terms of completion ...
The capacity of wireless CSMA/CA networks
Due to a poor understanding of the interactions among transmitters, wireless networks using carrier sense multiple access with collision avoidance (CSMA/CA) have been commonly stigmatized as unpredictable in nature. Even elementary questions regarding ...
Estimating traffic and anomaly maps via network tomography
Mapping origin-destination (OD) network traffic is pivotal for network management and proactive security tasks. However, lack of sufficient flow-level measurements as well as potential anomalies pose major challenges towards this goal. Leveraging the ...
Tag-ordering polling protocols in RFID systems
Future RFID technologies will go far beyond today's widely used passive tags. Battery-powered active tags are likely to gain more popularity due to their long operational ranges and richer on-tag resources. With integrated sensors, these tags can ...
Mitigating timing side channel in shared schedulers
In this work, we study information leakage in timing side channels that arise in the context of shared event schedulers. Consider two processes, one of them an innocuous process (referred to as Alice) and the other a malicious one (referred to as Bob), ...
Scalable video streaming with helper nodes using random linear network coding
Video streaming generates a substantial fraction of the traffic on the Internet. The demands of video streaming also increase the workload on the video server, which in turn leads to substantial slowdowns. In order to resolve the slowdown problem, and ...
Packet-level network compression: realization and scaling of the network-wide benefits
The existence of considerable amount of redundancy in the Internet traffic at the packet level has stimulated the deployment of packet-level redundancy elimination techniques within the network by enabling network nodes to memorize data packets. ...
Twins: device-free object tracking using passive tags
Device-free object tracking provides a promising solution for many localization and tracking systems to monitor non-cooperative objects, such as intruders, which do not carry any transceiver. However, existing device-free solutions mainly use special ...
Distributed opportunistic scheduling for energy harvesting based wireless networks: a two-stage probing approach
This paper considers a heterogeneous ad hoc network with multiple transmitter-receiver pairs, in which all transmitters are capable of harvesting renewable energy from the environment and compete for one shared channel by random access. In particular, ...
Data gathering optimization by dynamic sensing and routing in rechargeable sensor networks
In rechargeable sensor networks (RSNs), energy harvested by sensors should be carefully allocated for data sensing and data transmission to optimize data gathering due to time-varying renewable energy arrival and limited battery capacity. Moreover, the ...
Processor-network speed scaling for energy: delay tradeoff in smartphone applications
Many smartphone applications, e.g., file backup, are intrinsically delay-tolerant so that data processing and transfer can be delayed to reduce smartphone battery usage. In the literature, these energy--delay tradeoff issues have been addressed ...
Privacy-assured aggregation protocol for smart metering: a proactive fault-tolerant approach
Smart meters are integral to demand response in emerging smart grids, by reporting the electricity consumption of users to serve application needs. But reporting real-time usage information for individual households raises privacy concerns. Existing ...
Distributed resource management for cognitive ad hoc networks with cooperative relays
It is well known that the data transport capacity of a wireless network can be increased by leveraging the spatial and frequency diversity of the wireless transmission medium. This has motivated the recent surge of research in cooperative and dynamic-...
Online load balancing under graph constraints
In several data center settings, each arriving job may only be served by one of a subset of servers. Such a graph constraint can arise due to several reasons. One is locality of the data needed by a job; for example, in content farms (e.g., in Netflix ...
Scalable algorithms for NFA multi-striding and NFA-based deep packet inspection on GPUs
Finite state automata (FSA) are used by many network processing applications to match complex sets of regular expressions in network packets. In order to make FSA-based matching possible even at the ever-increasing speed of modern networks, multi-...