R. Srikant
Learning Graph Structure in Discrete Markov Random Fields.
Thu, 04/26/2012 - 15:01 — SomNambulAuthors: R. Srikant, Jian Ni, Rui Wu
Subjects: Machine Learning
AbstractWe present a general algorithm for learning the structure of discrete Markov
random fields from i.i.d. samples. Several algorithms have been proposed for
structure learning algorithms earlier and each of these address the learning
problem under different assumptions.Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints.
Mon, 07/12/2010 - 15:01 — SomNambulAuthors: Juan Jose Jaramillo, R. Srikant, Lei Ying
Subjects: Networking and Internet Architecture
AbstractThis paper studies the problem of scheduling in single-hop wireless networks
with real-time traffic, where every packet arrival has an associated deadline
and a minimum fraction of packets must be transmitted before the end of the
deadline. Using optimization and stochastic network theory we propose a
framework to model the quality of service (QoS) requirements under delay
constraints. The model allows for fairly general arrival models with
heterogeneous constraints.Backpressure-based Packet-by-Packet Adaptive Routing in Communication Networks.
Fri, 05/28/2010 - 15:01 — SomNambulAuthors: R. Srikant, Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, Alexander Stoylar
Subjects: Networking and Internet Architecture
AbstractBackpressure-based adaptive routing algorithms where each packet is routed
along a possibly different path have been extensively studied in the
literature. However, such algorithms typically result in poor delay performance
and involve high implementation complexity. In this paper, we develop a new
adaptive routing algorithm built upon the widely-studied back-pressure
algorithm. We decouple the routing and scheduling components of the algorithm
by designing a probabilistic routing table which is used to route packets to
per-destination queues.Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks.
Thu, 12/17/2009 - 16:01 — SomNambulAuthors: R. Srikant, Jian Ni, Bo Tan
Subjects: Networking and Internet Architecture
AbstractRecently, it has been shown that CSMA-type random access algorithms can
achieve the maximum possible throughput in ad hoc wireless networks. However,
these algorithms assume an idealized continuous-time CSMA protocol where
collisions can never occur. In addition, simulation results indicate that the
delay performance of these algorithms can be quite bad.The Asymptotic Behavior of Minimum Buffer Size Requirements in Large P2P Streaming Networks.
Mon, 09/07/2009 - 22:13 — SomNambulAuthors: R. Srikant, Lei Ying, Srinivas Shakkottai
Subjects: Networking and Internet Architecture
AbstractThe growth of real-time content streaming over the Internet has resulted in
the use of peer-to-peer (P2P) approaches for scalable content delivery. In such
P2P streaming systems, each peer maintains a playout buffer of content chunks
which it attempts to fill by contacting other peers in the network. The
objective is to ensure that the chunk to be played out is available with high
probability while keeping the buffer size small. Given that a particular peer
has been selected, a \emph{policy} is a rule that suggests which chunks should
be requested by the peer from other peers..Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks with Elastic and Inelastic Traffic.
Thu, 08/27/2009 - 13:23 — SomNambulAuthors: Juan Jose Jaramillo, R. Srikant
Subjects: Networking and Internet Architecture
AbstractThis paper studies the problem of congestion control and scheduling in ad hoc
wireless networks that have to support a mixture of best-effort and real-time
traffic. Optimization and stochastic network theory have been successful in
designing architectures for fair resource allocation to meet long-term
throughput demands. However, to the best of our knowledge, strict packet delay
deadlines were not considered in this framework previously. In this paper, we
propose a model for incorporating the quality of service (QoS) requirements of
packets with deadlines in the optimization framework.
User login
