Scaling Laws of Variable Topology Networks: Stochastic and Information Theoretic Approaches

Alhussein Abouzeid

April 27, 2006

Abstract

A variety of networks exhibit highly dynamic topologies e.g. wireless ad-hoc, disruption-tolerant, and mesh networks. A major focus of the research community has been the design of efficient routing protocols for such networks. This talk presents mathematical techniques that characterize the scaling laws of such protocols, such as throughput, delay and overhead. This talk will focus on two approaches. The first approach develops an information-theoretic measure of routing overhead, which we believe ultimately leads to the "second law of computer networks infodynamics." The second approach uses queuing theory and other stochastic models to characterize the delay-throughput tradeoff and routing pattern effects on the scaling of reactive routing protocols, including the conditions for "infinite scalability."

Speaker Bio

Alhussein Abouzeid received the B.S. degree (with honors) from Cairo University, Cairo, Egypt in 1993, and the M.S. and Ph.D. degrees from University of Washington, Seattle, WA in 1999 and 2001, respectively, all in electrical engineering. He assumed his current position as Assistant Professor in the Electrical, Computer and Systems Engineering Department at Rensselaer Polytechnic Institute, Troy, NY, in 2001. His research interests include the design and performance evaluation of wireless and hybrid networks. He received an NSF CAREER award in 2006 for "Multi-Layer Modeling and Design of Wireless Ad Hoc Networks."

LM Seminar Series
Fundamentals of Networking Lab

For further information on the series, contact pam@ee.washington.edu.