 |
Assessing asymptotic independence of file size and transfer rate in network response data |
Eric Friedman is interested in designing networks with self-interested users, trust and reputation in online interactions, fair and robust protocol design, and wireless networks and sensornets.
Shane Henderson uses simulation optimization to create methods for developing high-quality, easily-implementable operating policies for multiclass networks.
Mark Lewis uses stochastic dynamic programming for the development of easily implementable heuristics for the dynamic control of queueing networks.
Sidney Resnick is interested in statistics of the Internet and stochastic models which offer some explanation of the empirically observed stylized facts gleaned from the measurement data. Of particular interest to him is dependence structure of heavy-tailed data and how such structure is reflected in modeling explanations of burstiness, long-range dependence, and congestion.
Gennady Samorodnitsky is interested in stochastic behavior of communication networks where the loads on the network fluctuate wildly, as can be captured by heavy-tailed models and models with long memory. Long memory is believed to cause deterioration in network performance. Samorodnitsky is interested in finding ways to reduce the extent of such deterioration and is looking at limiting behavior of networks, the so-called “bird-eye view” on the network.
David Shmoys models network design issues as discrete optimization problems (e.g., building a network that supports specified communication patterns at the least possible cost), and provides algorithmic approaches to computing optimal and near-optimal solutions for the models. His work includes both the design of algorithms for which the quality of solutions found and algorithmic efficiency are analyzed theoretically, as well as the design and implementation of heuristic approaches that work well on real-world data.
Leslie Trotter has research interests which include: the use of integer programming models in network design and in the analysis of flow efficiency in transport and data networks; models of efficient algorithmic exploitation of parallel computing networks; optimal component placement models for the design of communication networks; and optimal delivery patterns for commodity routing and distribution networks.
David Williamson creates and analyzes approximation algorithms for the problem of designing networks that can survive specified numbers of node and link failures, and is interested in related problems in the area of network design.