IEEE/ACM Transactions on Networking

We consider the problem of streaming live content to a cluster of co-located wireless devices that have both an expensive unicast base-station-to-device B2D interface, as well as an inexpensive broadcast device-to-device D2D interface, which can be used ...

This paper proposes a new polynomial time constant factor approximation algorithm for a more-a-decade-long open NP-hard problem, the minimum four-connected \($\)-dominating set problem in unit disk graph UDG with any positive integer \($m \geq \) for the first time in ...

We consider the problem of optimal matching with queues in dynamic systems and investigate the value-of-information. In such systems, operators match tasks and resources stored in queues, with the objective of maximizing the system utility of the ...

Network inference is an effective mechanism to infer end-to-end flow rates and has enabled a variety of applications e.g., network surveillance and diagnosis. This paper is focused on the opposite side of network inference, i.e., how to make inference ...

Network traffic classification is the process of analyzing traffic flows and associating them to different categories of network applications. Network traffic classification represents an essential task in the whole chain of network security. Some of ...

This paper presents a hopless networking paradigm. Incorporating recent techniques of rateless codes, senders break packets into rateless information streams and each single stream automatically adapts to diverse channel qualities at all potential ...

Information-centric networking ICN facilitates content identification in networks and offers parametric representation of content semantics. This paper proposes an ICN/WDM network architecture that uses these features to offer superior network ...

We address a classical problem concerning energy efficiency in sensor networks. In particular, we consider the problem of maximizing the lifetime of coverage of targets in a wireless sensor network with battery-limited sensors. We first show that the ...

For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed influence maximization problem. Despite a ...

Estimation of link delay densities in a computer network, from source-destination delay measurements, is of great importance in analyzing and improving the operation of the network. In this paper, we develop a general approach for estimating the density ...

Coping with network failures has been recognized as an issue of major importance in terms of social security, stability, and prosperity. It has become clear that current networking standards fall short of coping with the complex challenge of surviving ...

Most analyses of routing vector protocols, such as the Border Gateway Protocol BGP, are conducted in the context of a single destination in a given network. In that context, for arbitrary routing policies, it is computationally intractable to determine ...

With increasing data demand, wireless networks are evolving to a hierarchical architecture where coverage is provided by both wide-area base stations BS and dense deployments of short-range access nodes ANs e.g., small cells. The dense scale and ...

Dense wireless networks are a promising solution to meet the huge capacity demand in 5G wireless systems. However, there are two implementation issues, namely, the interference and backhaul issues. To resolve these issues, we propose a novel network ...

Packet networks need to maintain the state in the form of forwarding tables at each switch. The cost of this state increases as networks support ever more sophisticated per-flow routing, traffic engineering, and service chaining. Per-flow or per-path ...

It is well established that physical layer impairments significantly affect the performance of optical networks. The management of these impairments is critical for successful transmission, and may significantly affect network layer routing decisions. ...

Inferring fine-grained link metrics by using aggregated path measurements, known as network tomography, is an effective and efficient way to facilitate various network operations, such as network monitoring, load balancing, and failure diagnosis. Given ...

With the increasing popularization of radio frequency identification RFID technology in the retail and logistics industry, RFID privacy concern has attracted much attention, because a tag responds to queries from readers no matter they are authorized or ...

One of the primary functions of a cloud service provider is to allocate cloud resources to users upon request. Requests arrive in real-time and resource placement decisions must be made as and when a request arrives, without any prior knowledge of ...

Power-line communications PLC are becoming a key component in home networking, because they provide easy and high-throughput connectivity. The dominant MAC protocol for high data-rate PLC, the IEEE 1901, employs a CSMA/CA mechanism similar to the ...

This paper concerns the practically important problem of multi-category radio frequency identification RFID estimation: given a set of RFID tags, we want to quickly and accurately estimate the number of tags in each category. However, almost all the ...

In large-scale radio frequency identification RFID-enabled applications, we sometimes only pay attention to a small set of key tags, instead of all. This paper studies the problem of key tag population tracking, which aims at estimating how many key ...

Full-duplex FD communication has the potential to substantially increase the throughput in wireless networks. However, the benefits of FD are still not well understood. In this paper, we characterize the FD rate gains in both single-channel and multi-...

This paper presents the packet-scale paradigm for designing end-to-end congestion control protocols for ultra-high speed networks. The paradigm discards the legacy framework of RTT-scale protocols, and instead builds upon two revolutionary foundations—...

Several data center transport protocols have been proposed in recent years e.g., DCTCP, PDQ, and pFabric. In this paper, we first identify the underlying strategies used by the existing data center transports, namely, in-network Prioritization used in ...

Since the advent of datacenter networking, achieving low latency within the network has been a primary goal. Many congestion control schemes have been proposed in recent years to meet the datacenters’ unique performance requirement. The nature of ...

Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to ...

Network applications commonly maintain local copies of remote data sources in order to provide caching, indexing, and data-mining services to their clients. Modeling performance of these systems and predicting future updates usually requires knowledge ...

We study the problem of efficiently disseminating packets in multi-hop wireless networks. At each time slot, the network controller activates a set of non-interfering links and forward selected copies of packets on each activated link. The maximum rate ...

RFID technology has been widely adopted for real-world applications, such as warehouse management, logistic control, and object tracking. This paper focuses on a new angle of applying RFID technology—monitoring the temporal change of a tag set in a ...