IEEE/ACM Transactions on Networking

This paper analyzes the impact on the stability of the TCP-Reno congestion control mechanism when a network coding NC layer is inserted in the TCP/IP stack. A model of the dynamics of the TCP-NC protocol combined with random early detection RED as ...

This paper presents CSPR, a compressive-sensing-based approach for path reconstruction in wireless sensor networks. By viewing the whole network as a path representation space, an arbitrary routing path can be represented by a path vector in the space. ...

We study Compound TCP C-TCP, the default TCP in the Windows operating system, with Random Exponential Marking REM and the widely used Drop-Tail queue policy. The performance metrics we consider are stability of the queue size, queuing delay, link ...

Due to the lossy nature of wireless links, it is difficult to determine if packet losses are due to wireless-induced effects or from malicious discarding. Many prior efforts on detecting malicious packet drops rely on evidence collected via passive ...

This paper investigates the multicast capacity of static wireless social networks. We adopt the two-layer network model, which includes the social layer and the networking layer. In the social layer, the social group size of each source node is modeled ...

Network coding has been shown to offer significant throughput benefits over certain wireless network topologies. However, the application of network coding may not always improve the network performance. In this paper, we first provide an analytical ...

We consider optimal distributed computation of a given function of distributed data. The input data nodes and the sink node that receives the function form a connected network that is described by an undirected weighted network graph. The algorithm to ...

In wireless networks, the design of radio resource sharing mechanisms is complicated by the complex interference constraints among the various links. In their seminal paper IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Tassiulas and ...

We study multihop networks with flow-scheduling constraints, no constraints on simultaneous activation of different links, potentially multiple source-destination routes, and a mix of heavy-tailed and light-tailed traffic. In this setting, we analyze ...

Auction mechanisms have recently attracted substantial attention as an efficient approach to pricing and allocating resources in cloud computing. This work, to the authors' knowledge, represents the first online combinatorial auction designed for the ...

The construction of a logical network on top of a physical optical infrastructure involves two intertwined tasks: logical link selection-deciding which pairs of routers will be connected by logical links lightpaths; and logical link routing-deciding how ...

The study of the optimality of low-complexity greedy scheduling techniques in wireless communications networks is a very complex problem. The Local Pooling LoP factor provides a single-parameter means of expressing the achievable capacity region and ...

Greedy routing has been applied to both wireline and wireless networks due to its scalability of routing state and resiliency to network dynamics. In this work, we solve a fundamental problem in applying greedy routing to networks with arbitrary ...

IPTV service providers offering Video-on-Demand currently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes, it will soon become infeasible to replicate the entire library at each ...

In cloud gaming systems, the game program runs at servers in the cloud, while clients access game services by sending input events to the servers and receiving game scenes via video streaming. In this paradigm, servers are responsible for all ...

Peer-to-peer P2P video streaming is a scalable and cost-effective technology to stream video content to a large population of users and has attracted a lot of research for over a decade now. Recently, network coding has been introduced to improve the ...

Virtual machines VMs are widely adopted today to provide elastic computing services in datacenters, and they still heavily rely on TCP for congestion control. VM scheduling delays due to CPU sharing can cause frequent spurious retransmit timeouts RTOs. ...

Recent literature including our past work provides analysis and solutions for using: 1 erasure coding; 2 parallelism; or 3 variable slicing/chunking i.e., dividing an object of a specific size into a variable number of smaller chunks in speeding up the ...

Distributed storage codes have recently received a lot of attention in the community. Independently, another body of work has proposed integrity-checking schemes for cloud storage, none of which, however, is customized for coding-based storage or can ...

Traditional TCP/IP fingerprinting tools e.g., nmap are poorly suited for Internet-wide use due to the large amount of traffic and intrusive nature of the probes. This can be overcome by approaches that rely on a single SYN packet to elicit a vector of ...

In this paper, we present our effort towards comprehensive traffic forecasting for big data applications using external, light-weighted file system monitoring. Our idea is motivated by the key observations that rich traffic demand information already ...

This paper considers a wireless link with randomly arriving data that are queued and served over a time-varying channel. It is known that any algorithm that comes within ε of the minimum average power required for queue stability must incur average ...

Motivated by the increasing popularity of learning and predicting human user behavior in communication and computing systems, in this paper, we investigate the fundamental benefit of predictive scheduling, i.e., predicting and pre-serving arrivals, in ...

Modern access network technologies like Long Term Evolution LTE and High Speed Packet Access HSPA use time-slotting mechanisms to optimize resource sharing and overall network performance. In time-slotted networks, the one-way delay of all packets in a ...

This paper treats power-aware throughput maximization in a multiuser file downloading system. Each user can receive a new file only after its previous file is finished. The file state processes for each user act as coupled Markov chains that form a ...

Recently, several CSMA algorithms based on the Glauber dynamics model have been proposed for wireless link scheduling, as viable solutions to achieve the throughput optimality, yet simple to implement. However, their delay performance still remains ...

This paper documents and to some extent elucidates the progress of IPv6 across major Internet stakeholders since its introduction in the mid 1990s. IPv6 offered an early solution to a well-understood and well-documented problem IPv4 was expected to ...

Privacy has been the key road block to cloud computing as clouds may not be fully trusted. This paper is concerned with the problem of privacy-preserving range query processing on clouds. Prior schemes are weak in privacy protection as they cannot ...

On-demand video streaming is becoming a killer application for wireless networks. Recent information-theoretic results have shown that a combination of caching on the users' devices and device-to-device D2D communications yields throughput scalability ...

In the context of the IEEE 1588 Precision Time Protocol PTP, estimating the delay's bias is a problem that appears in both one-way using transparent devices or two-way message exchange mechanisms. For estimating the offset via the two-way message ...