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 graduatelevel students in computer science as a
secondary text.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!