R. Srikant

Publications (4)2.03 Total impact

• Source

  Available from: illinois.edu

  Article: The Multicast Capacity of Large Multihop Wireless Networks

  S. Shakkottai, Xin Liu, R. Srikant
  [show abstract] [hide abstract]
  ABSTRACT: We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicast sessions may coexist. We first calculate an upper bound on the achievable transmission rate per multicast flow as a function of the number of multicast sources in such a network. We then propose a simple comb-based architecture for multicast routing, which achieves the upper bound in an order sense under certain constraints. Compared to the approach of constructing a Steiner tree to decide multicast paths, our construction achieves the same order-optimal results while requiring little location information and no computational overhead.
  IEEE/ACM Transactions on Networking 01/2011; · 2.03 Impact Factor
• Source

  Available from: ucdavis.edu

  Article: Asymptotic uniform data-rate guarantees in large wireless networks.

  Xin Liu, R. Srikant
  Ad Hoc Networks. 01/2008; 6:325-343.
• Article: DIMACS Series in Discrete Mathematics

  Xin Liu, R. Srikant
  [show abstract] [hide abstract]
  ABSTRACT: We consider an exponential server queue accessed by many di#erent flows. It is assumed that the source and destination information of each flow is available in the packet. We compute upper and lower bounds on the sum timing capacity of this channel. We derive asymptotically tight lower and upper bounds on the sum timing capacity for discrete-time queues with general service-time distributions. We also discuss the role of the scheduling discipline at the server on the amount of uncertainty in the information obtained by an eavesdropper who only observes the packet but not the timing between the packets.
  09/2004;
• Source

  Available from: bell-labs.com

  Article: Bounds on the Sum Timing Capacity of Single-server Queues with Multiple Input and Output Terminals

  Xin Liu, R Srikant
  [show abstract] [hide abstract]
  ABSTRACT: We consider an exponential server queue accessed by many differ-ent flows. It is assumed that the source and destination information of each flow is available in the packet. We compute upper and lower bounds on the sum timing capacity of this channel. We derive asymptotically tight lower and upper bounds on the sum timing capacity for discrete-time queues with general service-time distributions. We also discuss the role of the scheduling discipline at the server on the amount of uncertainty in the information obtained by an eavesdropper who only observes the packet but not the timing between the packets.
  DIMACS Series in Discrete Mathematics and Theoretical Computer Science.