Parameswaran Ramanathan

Learn More
Internet applications and users have very diverse service expectations, making the current <i>same-service-to-all</i> model inadequate and limiting. In the <i>relative differentiated services</i> approach, the network traffic is grouped in a small number of <i>service classes which are ordered based on their packet forwarding quality</i>, in terms of(More)
The problem of scheduling multiple streams of realtime customers. is addressed in this paper. The paper first introduces the notion of (m, k)-firm deadlines to better characterize the timing constraints of real-time streams. More specifically, a stream is said to have (m, k)-firm deadlines if at least m out of any k consecutive customers must meet their(More)
The packet-pair technique aims to estimate the capacity of a path (bottleneck bandwidth) from the dispersion of two equal-sized probing packets sent back to back. It has been also argued that the dispersion of longer packet bursts (packet trains) can estimate the available bandwidth of a path. This paper examines such packet-pair and packet-train dispersion(More)
Internet applications and users have very diverse quality of service expectations, making the same-service-to-all model of the current Internet inodequate and limiting. There i s a widespread consensus today that the Internet architecture has to be extended with service differentiation mechanisms so that certain users and applications can get better service(More)
Collaboration in sensor networks must be fault tolerant due to the harsh environmental conditions in which such networks can be deployed. This paper focuses on finding algorithms for collaborative target detection that are efficient in terms of communication cost, precision, accuracy, and number of faulty sensors tolerable in the network. Two algorithms,(More)
ÐTasks in a real-time control application are usually periodic and they have deadline constraints by which each instance of a task is expected to complete its computation, even in the adverse circumstances caused by component failures. Techniques to recover from processor failures often involve a reconfiguration in which all tasks are assigned to fault-free(More)
The highly distributed infrastructure provided by sensor networks supports fundamentally new ways of designing surveillance systems. In this paper, we discuss sensor networks for target classification and tracking. Our formulation is anchored on location-aware data routing to conserve system resources, such as energy and bandwidth. Distributed(More)
Two novel distributed particle filters with Gaussian Mixer approximation are proposed to localize and track multiple moving targets in a wireless sensor network. The distributed particle filters run on a set of uncorrelated sensor cliques that are dynamically organized based on moving target trajectories. These two algorithms differ in how the distributive(More)
In order to monitor a region for traffic traversal, sensors can be deployed to perform collaborative target detection. Such a sensor network achieves a certain level of detection performance with an associated cost of deployment. This paper addresses this problem by proposing path exposure as a measure of the goodness of a deployment and presents an(More)