Publications

A renormalization group analysis is carried out of the long time behavior of random walks in an environment with a positionally random local drift force.

We study the design and analysis of randomized on-line algorithms. We show that this problem is closely related to the synthesis of random walks on graphs with positive real costs on their edges.

We show that the amortized analysis of on-line algorithms is tied to the study of random walks on graphs and hence to the theory of electric networks.

Recent years have seen tremendous growth in the deployment of wireless local area networks (WLANs). An important design issue in such networks is that of distributed scheduling.

In operations research and networking problems, random-order-of-service (ROS) provides a well-known alternative to the classic first-come-first-served (FCFS) policy.

Network management protocols often require timely and meaningful insight about per flow network traffic.

Decentralized dynamic spectrum allocation (DSA) that exploit adaptive antenna array interference mitigation (IM) diversity at the receiver, is addressed in interference-limited environment with hig

We review robust and scalable network architectures that support dynamic traffic variations.

Parallel communication algorithms and networks are central to large scale parallel computing and, also data communications.

Parallel communication algorithms and networks are central to large scale parallel computing and, also data communications.