Events & News
Colloquium
| Category | Lecture |
| Date | Thursday, March 22, 2012 |
| Time | 11:00 am |
| Concludes | 12:00 pm |
| Location | Gould-Simpson 906 |
| Speaker | Brendan Mumey |
| Title | Associate Professor |
| Affiliation | Computer Science, Montana State University |
Two Recent Problems in “Green” Networking
This talk will cover to two problems I have recently worked on. The first is a flow allocation and rate adaptation problem in which the goal is to best route communications flows so as to minimize the additional energy use required. The model assumes that each network link has several operating states that provide different levels of capacity but at different power costs. We show that a greedy strategy can provide a 2-approximation for allocating a single flow. The second problem is a joint routing and resource allocation problem for data centers; the problem is how best to allocate resources across a set of data centers and determine how to which data centers should serve which clients in order to guarantee a given maximum delay at minimum (energy) cost. We present an O(log n) approximation algorithm for this problem.
Biography
Brendan Mumey, Associate Professor in Computer Science at Montana State University, graduated from the University of Alberta with a B.Sc. in mathematics in 1990. He received a M.Sc. in computer science from the University of British Columbia in 1992, and received a Ph.D. in computer science from the University of Washington in 1997 at which time he joined the faculty at Montana State University. Most of his early research was in computational biology but in the last five years he has been interested various aspects of networking. He is the current editor of SIGACT News. In 2011 he held a Visiting Fulbright Distinguished Chair in the Communications and Networking department at Aalto University in Finland. He is a member of IEEE and ACM.