Learn More
—Bufferbloat is a phenomenon where excess buffers in the network cause high latency and jitter. As more and more interactive applications (e.g. voice over IP, real time video conferencing and financial transactions) run in the Internet, high latency and jitter degrade application performance. There is a pressing need to design intelligent queue management(More)
—As video traffic increases in the Internet and competes for limited bandwidth resources, it is important to design bandwidth sharing and loss protection schemes that account for video characteristics, beyond the traditional paradigm of fair-rate allocation among data flows. Ideally, such a scheme should handle both persistent and transient congestion as(More)
—This paper presents a novel scheme, Layered Internet Video Engineering (LIVE), in which network nodes feed back virtual congestion levels to video senders to assist both media-aware bandwidth sharing and transient loss protection. The video senders respond to such feedback by adapting the rates of encoded H.264/SVC streams based on their respective video(More)
We consider a finite horizon dynamic game with N selfish players who observe their types privately and take actions, which are publicly observed. Players' types evolve as conditionally independent Markov processes, conditioned on their current actions. Their actions and types jointly determine their instantaneous rewards. Since each player has a different(More)
—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 simultaneously. Our setting is a streaming system that uses a block-by-block random linear coding(More)
—This paper investigates a slotted random access system where packet capture is modeled using communication theoretic techniques. It is shown that the optimum rates and attempt probabilities depend on the receiver architecture, operating signal-to-noise ratio (SNR) and block length. High SNR analysis reveals that joint decoder asymptotically yields either a(More)
We present a network-assisted scheme for media-aware bandwidth sharing among multiple video streaming sessions. Departing from the conventional paradigm of fair-rate allocation among data traffic flows, our scheme allocates the bottleneck bandwidth among the video streams according to their rate-distortion (R-D) characteristics, with the objective of(More)
We model an Internet marketplace using a set of servers that choose prices for performing jobs. Each server has a queue of unfinished jobs, and is penalized for delay by the market maker via a holding cost. A server completes jobs with a low or high "quality", and jobs truthfully report the quality with which they were completed. The best estimate of(More)
With spectrum auctions as our prime motivation, in this paper we analyze combinatorial auctions where agents' valuations exhibit complementarities. Assuming that the agents only value bundles of size at most k and also assuming that we can assess prices, we present a mechanism that is efficient, approximately envy-free, asymptotically strategy-proof and(More)
—In this paper, a two-sided matching market is considered, and a descending price algorithm based auction mechanism is proposed to determine market clearing prices. For general valuations with a intelligent choice of reverse constricted sets, we prove that the algorithm converges in a finite number of rounds. Then specializing to the rank one valuations in(More)