Routing, Disjoint Paths, and Classification
Abstract
In this thesis, the authors study two classes of problems: routing and classification. Routing problems include those that concern the tradeoff between routing table size and short-path forwarding (Part I), and the classic Edge Disjoint Paths problem (Part II). Both have applications in communications networks, especially in overlay networks, and in large and high-speed networks, such as optical networks. The third part of this thesis concerns a type of classification problem that is motivated by a computational biology problem, where it is desirable that a small amount of genotype data from each individual is sufficient to classify individuals according to their populations of origin.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 2006
- Accession Number
- ADA490548
Entities
People
- Shuheng Zhou
Organizations
- Carnegie Mellon University