under quality of service (qos) routing, paths for flows are selected based upon the knowledge of resource availability at network nodes and the qos requirements of flows. qos routing schemes proposed differ in the way they gather information about the network state and select paths based on this information. we broadly categorize these schemes into best-path routing and proportional routing. the best-path routing schemes gather global network state information and always select the best path for an incoming flow based on this global view. on the other hand, proportional routing schemes proportion incoming flows among a set of candidate paths. we have shown that it is possible to compute near-optimal proportions using only locally collected information. furthermore, a few good candidate paths can be selected using infrequently exchanged global information and thus with minimal communication overhead. localized quality of service routing for the internet, describes these schemes in detail demonstrating that proportional routing schemes can achieve higher throughput with lower overhead than best-path routing schemes. it first addresses the issue of finding near-optimal proportions for a given set of candidate paths based on locally collected flow statistics. this book will also look into the selection of a few good candidate paths based on infrequently exchanged global information. the final phase of this book will describe extensions to proportional routing approach to provide hierarchical routing across multiple areas in a large network. localized quality of service routing for the internet is designed for researchers and practitioners in industry, and is suitable for graduate level students in computer science as a secondary text.