Swarthmore College Department of Computer Science

Talk by Ananya Das, University of California-Davis Computer Science Department

Efficient Algorithms for Heterogeneous Network Services
Friday, February 12, 2010
SCI 240, 4:00 pm (cookies at 3:45)

Abstract

Today's Internet provides critical infrastructure for a diverse set of services, including health care, education, news, business, and entertainment. Based on customer requirements, network service providers must decide how to manage resources while efficiently satisfying customer requests. Although some services require highly reliable connections, many customers may have less stringent requirements. By intelligently managing their resources, network providers can often exploit these varied requirements, and ultimately better satisfy customer needs.

We consider the problem of efficient routing in an Optical core network to satisfy customer requests for heterogeneous network services. Each request arrives dynamically and must be satisfied (or rejected) as it arrives. Since even the offline version of this problem is intrinsically hard, we develop efficient heuristic algorithms to solve it. We simulate the performance of our algorithms on realistic network environments to demonstrate their effectiveness and improvements over previous approaches.