Abstract
In this thesis, we investigate two routing problems. The first, which is known as the multiconstraint QoS (quality of service) routing problem, is to find a single path that satisfies multiple QoS constraints. For this problem, we consider two routing environments: (a) a given source node has detailed routing information provided by a link-state protocol, and (b) the source node has relatively simple routing information provided by a distance-vector protocol. First, we develop a greedy scheme, called MPLMR (Multi-postpath-based lookahead multiconstraint routing), for case (a). MPLMR has an efficient
