- ホーム
- > 洋書
- > 英文書
- > Computer / General
基本説明
Describes these schemes in detail demonstrating that proportional routing schemes can achieve higher throughput with lower overhead than best-path routing schemes.
Full Description
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.
Contents
1. Introduction.- 2. Problem Setting.- 1 Bandwidth Guarantees.- 2 Explicit Routing.- 3 Link State Updates.- 4 Performance Metrics.- 3. Related Work.- 1 Global QoS Routing.- 2 Localized QoS Routing.- 3 Hybrid QoS Routing.- 4. Localized Proportional Routing: Theoretical Models.- 1 Global Optimal Proportional Routing.- 2 Localized Proportional Routing.- 2.1 Virtual Capacity Model.- 2.2 Virtual Link based Minimization.- 2.3 Virtual Path based Minimization.- 2.4 Performance Comparison.- 3 Alternative Paths and Localized Trunk Reservation.- 5. Localized Proportional Routing: Practical Schemes.- 1 Heuristic Equalization Strategies.- 2 Proportional Sticky Routing.- 3 Approximation of ebp.- 6. Candidate Path Selection.- 1 Hybrid Approach to QoS Routing.- 2 Widest Disjoint Paths.- 3 Performance Analysis.- 7. Hierarchical Proportional Routing.- 1 Hierarchical Routing.- 2 Topology and State Aggregation.- 3 Hierarchical Source Routing.- 4 Hierarchical Next-hop Routing.- 5 Performance Evaluation.- 8. Conclusions and Future Work.- References.
