Jay Kumar Sundararajan

Learn More
A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast channel with stochastic arrivals and full feedback, but the proposed scheme is(More)
The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract—The theory of network coding promises significant benefits in network performance, especially in lossy networks and in multicast and multipath scenarios. To realize these benefits in practice, we need to understand how coding(More)
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract—We propose a mechanism that incorporates network coding into TCP(More)
The problem of serving multicast flows in a crossbar switch is considered. Intraflow linear network coding is shown to achieve a larger rate region than the case without coding. A traffic pattern is presented which is achievable with coding but requires a switch speedup when coding is not allowed. The rate region with coding can be characterized in a simple(More)
For a packet erasure broadcast channel with two receivers, a new coding algorithm is proposed that makes use of feedback to achieve asymptotically optimal queue size at the sender and decoding delay at the receivers, without compromising on throughput. Our coding module is compatible with the drop-when-seen queuing algorithm proposed in earlier work [1].(More)
— In very large networks with heavy traffic, congestion control plays an important role in network resource management. One approach to this is the Active Queue Management (AQM) algorithms. Many AQM algorithms have been proposed and analyzed but they mainly focus on single queued links. Recognizing the fact that input queued switches are limited in(More)
We propose a new feedback-based adaptive coding scheme for a packet erasure broadcast channel. The main performance metric of interest is the delay. We consider two types of delay - decoding delay and delivery delay. Decoding delay is the time difference between the instant when the packet is decoded at an arbitrary receiver and the instant when it arrived(More)
—Current approaches to the practical implementation of network coding are batch-based, and often do not use feedback, except possibly to signal completion of a file download. In this paper, the various benefits of using feedback in a network coded system are studied. It is shown that network coding can be performed in a completely online manner, without the(More)
Current medium access control mechanisms are based on collision avoidance and collided packets are discarded. The recent work on ZigZag decoding departs from this approach by recovering the original packets from multiple collisions. In this paper, we present an algebraic representation of collisions which allows us to view each collision as a linear(More)
— We present a new approach to network coding problems that could lead to a systematic method for deciding solvability of a given network. The approach is based on a graph theoretic formulation of the problem. The constraints at each node in the network are represented using hyperedges in a 'conflict' hypergraph. This representation reduces the solvability(More)