Algorithms and Models for Problems in Networking

Many interesting theoretical problems arise from computer networks. In this paper the authors will consider three of them: algorithms and data structures for problems involving distances in networks (in particular compact routing schemes, distance labels, and distance oracles), algorithms for wireless capacity and scheduling problems, and algorithms for optimizing iBGP overlays in autonomous systems on the Internet. While at first glance these problems may seem extremely different, they are similar in that they all attempt to look at a previously studied networking problem in new, more realistic frameworks.

Provided by: Carnegie Mellon University Topic: Networking Date Added: Jul 2010 Format: PDF

Find By Topic