Localized Quality of Service Routing for the Internet: 739 (The Springer International Series in Engineering and Computer Science) - Hardcover

Nelakuditi, Srihari; Zhi-Li Zhang

 
9781402074776: Localized Quality of Service Routing for the Internet: 739 (The Springer International Series in Engineering and Computer Science)

Inhaltsangabe

The exponential growth of Internet brings to focus the need to control such large scale networks so that they appear as coherent, almost intelligent, organ­ isms. It is a challenge to regulate such a complex network of heterogeneous elements with dynamically changing traffic conditions. To make such a sys­ tem reliable and manageable, the decision making should be decentralized. It is desirable to find simple local rules and strategies that can produce coherent and purposeful global behavior. Furthermore, these control mechanisms must be adaptive to effectively respond to continually varying network conditions. Such adaptive, distributed, localized mechanisms would provide a scalable so­ lution for controlling large networks. The need for such schemes arises in a variety of settings. In this monograph, we focus on localized approach to quality of service routing. Routing in the current Internet focuses primarily on connectivity and typi­ cally supports only the "best-effort" datagram service. The routing protocols deployed such as OSPF use the shortest path only routing paradigm, where routing is optimized for a single metric such as hop count or administrative weight. While these protocols are well suited for traditional data applications such as ftp and telnet, they are not adequate for many emerging applications such as IP telephony, video on demand and teleconferencing, which require stringent delay and bandwidth guarantees. The "shortest paths" chosen for the "best effort" service may not have sufficient resources to provide the requisite service for these applications.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

The exponential growth of Internet brings to focus the need to control such large scale networks so that they appear as coherent, almost intelligent, organ­ isms. It is a challenge to regulate such a complex network of heterogeneous elements with dynamically changing traffic conditions. To make such a sys­ tem reliable and manageable, the decision making should be decentralized. It is desirable to find simple local rules and strategies that can produce coherent and purposeful global behavior. Furthermore, these control mechanisms must be adaptive to effectively respond to continually varying network conditions. Such adaptive, distributed, localized mechanisms would provide a scalable so­ lution for controlling large networks. The need for such schemes arises in a variety of settings. In this monograph, we focus on localized approach to quality of service routing. Routing in the current Internet focuses primarily on connectivity and typi­ cally supports only the "best-effort" datagram service. The routing protocols deployed such as OSPF use the shortest path only routing paradigm, where routing is optimized for a single metric such as hop count or administrative weight. While these protocols are well suited for traditional data applications such as ftp and telnet, they are not adequate for many emerging applications such as IP telephony, video on demand and teleconferencing, which require stringent delay and bandwidth guarantees. The "shortest paths" chosen for the "best effort" service may not have sufficient resources to provide the requisite service for these applications.

Reseña del editor

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Weitere beliebte Ausgaben desselben Titels

9781461350491: Localized Quality of Service Routing for the Internet: 739 (The Springer International Series in Engineering and Computer Science, 739)

Vorgestellte Ausgabe

ISBN 10:  1461350492 ISBN 13:  9781461350491
Verlag: Springer, 2003
Softcover