IEEE/ACM Transactions on Networking

We investigate the performance of distributed least-mean square (LMS) algorithms for parameter estimation over sensor networks where the regression data of each node are corrupted by white measurement noise. Under this condition, we show that the ...

Congestion control becomes indispensable in highly utilized consolidated networks running demanding applications. In this paper, proactive congestion management schemes for Clos networks are described and evaluated. The key idea is to move the ...

This paper characterizes the outcomes of secondary spectrum markets when multiple providers compete for secondary demand. We study a competition model in which each provider aims to enhance its revenue by opportunistically serving a price-dependent ...

The performance and operational characteristics of the Domain Name System (DNS) protocol are of deep interest to the research and network operations community. In this paper, we present measurement results from a unique dataset containing more than 26 ...

Peer-to-peer (P2P) streaming technologies can take advantage of the upload capacity of clients, and hence can scale to large content distribution networks with lower cost. A fundamental question for P2P streaming systems is the maximum streaming rate ...

This paper considers the problem of scheduling real-time traffic in wireless networks. We consider ad hoc wireless networks with general conflict graph-based interference model and single-hop traffic. Each packet is associated with a deadline and will ...

An overlay macrocell-femtocell system aims to increase the system capacity with a low-cost infrastructure. To construct such an infrastructure, we need to solve some existing problems. First, there is a tradeoff between femtocell coverage and overall ...

Geo-distributed clouds provide an intriguing platform to deploy online social network (OSN) services. To leverage the potential of clouds, a major concern of OSN providers is optimizing the monetary cost spent in using cloud resources while considering ...

In this paper, we asses the benefits of using partial relaying in energy-harvesting networks. We consider a system composed of a source, a relay, and a destination. Each of the source and the relay has energy-harvesting capability and generates its own ...

An Enhanced-Internet network that provides ultra-low-latency guaranteed-rate (GR) communications for Cloud Services is proposed. The network supports two traffic classes, the Smooth and Best-Effort classes. Smooth traffic flows receive low-jitter GR ...

In this paper, we propose a hybrid iterated local search (ILS) heuristic, named GPP4G-ILS, to solve the global planning problem of survivable wireless networks. The planning problem of wireless networks is to determine a set of sites among potential ...

Lately, there has been an upsurge of interest in compressed data structures, aiming to pack ever larger quantities of information into constrained memory without sacrificing the efficiency of standard operations, like random access, search, or update. ...

We consider a distributed multiuser system where individual entities possess observations or perceptions of one another, while the truth is only known to themselves and they might have an interest in withholding or distorting the truth. We ask the ...

The problem of online packet scheduling with hard deadlines has been studied extensively in the single-hop setting, whereas it is notoriously difficult in the multihop setting. This difficulty stems from the fact that packet scheduling decisions at each ...

MapReduce/Hadoop framework has been widely used to process large-scale datasets on computing clusters. Scheduling map tasks with data locality consideration is crucial to the performance of MapReduce. Many works have been devoted to increasing data ...

A fundamental problem for the delay and backlog analysis across multihop paths in wireless networks is how to account for the random properties of the wireless channel. Since the usual statistical models for radio signals in a propagation environment do ...

Decentralized monitoring and alarming systems can be an attractive alternative to centralized architectures. Distributed sensor nodes (e.g., in the smart grid's distribution network) are closer to an observed event than a global and remote observer or ...

We present the architecture and protocols of ROME, a layer-2 network designed to be backwards-compatible with Ethernet and scalable to tens of thousands of switches and millions of end-hosts. Such large-scale networks are needed for emerging ...

In this paper, we study, analyze, and evaluate a performance-aware cross-layer design approach for wireless multihop networks. Through network utility maximization (NUM) and weighted network graph modeling, a cross-layer algorithm for performing jointly ...

By taking advantage of active sensing using radio waves, radar sensors can offer several advantages over passive sensors. Although much attention has been given to multistatic and multiple-input-multiple-output (MIMO) radar concepts, little has been ...

Live media streaming has become one of the most popular applications over the Internet. We have witnessed the successful deployment of commercial systems with content delivery network (CDN)- or peer-to-peer-based engines. While each being effective in ...

Studies on the propagation of malware in mobile networks have revealed that the spread of malware can be highly inhomogeneous. Platform diversity, contact list utilization by the malware, clustering in the network structure, etc., can also lead to ...

We analyze throughput-delay scaling laws of mobile ad hoc networks under a content-centric traffic scenario, where users are mainly interested in retrieving contents cached by other nodes. We assume limited buffer size available at each node and Zipf-...

Counting the number of radio frequency identification (RFID) tags, namely RFID counting, is needed by a wide array of important wireless applications. Motivated by its paramount practical importance, researchers have developed an impressive arsenal of ...

Scalable routing for large-scale wireless networks needs to find near shortest paths with low state on each node, preferably sublinear with the network size. Two approaches are considered promising toward this goal: compact routing and geometric routing ...

Recent trends in science applications call for long-range and large-scale collaboration among laboratories and super-computing sites. Long gone are the days of entering data manually into a spreadsheet on a local workstation. The world's most powerful ...

Proportional Fair (PF) scheduling algorithms are the de facto standard in cellular networks. They exploit the users' channel state diversity (induced by fast-fading) and are optimal for stationary channel state distributions and an infinite time-...

In most wireless networks, nodes have only limited local information about the state of the network, which includes connectivity and channel state information. With limited local information about the network, each node's knowledge is mismatched; ...

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-...

Most existing research adopts a "flat" view of radio frequency identification (RFID) systems to perform various functions of collecting tag IDs, estimating the number of tags, detecting the missing tags, etc. However, in practice, tags are often ...