In the talk we consider a network embedded in a geometric space and greedy routing that forwards the message to a neighbor whose distance to the destination is the smallest. We consider the deformation of the network geometry using curvature flow and show that greedy routing on differently curved space have a number of desirable properties such as guaranteed delivery, traffic load balancing, multipath routing, and fast recovery upon node/link failures.
Dr. Jie Gao is an associate professor at Department of Computer Science, State University of New York, Stony Brook. She obtained her Ph.D degree from Department of Computer Science, Stanford University in 2004 and her B.S. degree from the Special Class for the Gifted Young at University of Science and Technology of China in 1999. She spent the academic year 2004-2005 at Center for the Mathematics of Information, California Institute of Technology. She received NSF CAREER award in 2006.