We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
Yijie Han, Richard J. La, Armand M. Makowski, Seun...
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
Data-intensive applications in the Condor High Throughput Computing environment can place heavy demands on network resources for checkpointing and remote data access. We have deve...
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
We propose a technique to automatically synthesize programs and schedules for hard real-time distributed (embedded) systems from synchronous data-flow models. Our technique connec...
Dumitru Potop-Butucaru, Akramul Azim, Sebastian Fi...