Learn More
—Wireless systems offer a unique mixture of connec-tivity, flexibility, and freedom. It is therefore not surprising that wireless technology is being embraced with increasing vigor. For real-time applications, user satisfaction is closely linked to quantities such as queue length, packet loss probability, and delay. System performance is therefore related(More)
—The rapid increase of content delivery over the Internet has led to the proliferation of content distribution networks (CDNs). Management of CDNs requires algorithms for request routing, content placement, and eviction in such a way that user delays are small. We abstract the system of frontend source nodes and backend caches of the CDN in the likeness of(More)
3833 of the coefficients jSjuS [15]. Since there are at most 2 n 0 1 coefficients jSju S , the maximization in (22) can be solved in O(n) (linear) time. V. CONCLUSION We considered throughput optimal control of a wireless networks with cooperative relaying. Our model applies to a general network topology and several different types of cooperative scenarios.(More)
—Network coding has gained significant attention in recent years as a means to improve throughput, especially in mul-ticast scenarios. These capacity gains are achieved by combining packets algebraically at various points in the network, thereby alleviating local congestion at the nodes. The benefits of network coding are greatest when the network is(More)
—This paper considers the relationship between code-rate selection and queueing performance for communication systems subject to time-varying channel conditions. While error-correcting codes offer protection against channel uncertainties , there exists a natural tradeoff between the enhanced protection of low-rate codes and the rate penalty imposed by(More)
—This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters. This gives a framework that allows a rigorous analysis of the queue as a function of the code rate. Most prior work in(More)
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Each data source is seen as generating a commodity along a fixed route, and the objective is to maximize the total system throughput under some concept of fairness, subject to capacity constraints of the links used. This problem is well studied under(More)
The popularity of Peer-to-Peer (P2P) file sharing has resulted in large flows between different ISPs, which imposes significant transit fees on the ISPs in whose domains the communicating peers are located. The fundamental tradeoff faced by a peer-swarm is between free, yet delayed content exchange between intra-domain peers, and inter-domain communication(More)
Quantization is intrinsic to several data acquisition systems. This process is especially important in distributed settings, where observations must Lrst be compressed before they are disseminated. There have been many practical successes in the area of quantization, including the acclaimed Lloyd-Max algorithm. This article adopts a different perspective(More)
  • 1