Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010046846 | TK5105.543 N44 2003 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
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.
Author Notes
Srihari Nelakuditi: University of South Carolina U.S.A.
Zhi-Li Zhang: University of Minnesota U.S.A.
Table of Contents
Dedication | p. v |
List of Figures | p. xi |
Preface | p. xiii |
Acknowledgments | p. xv |
1. Introduction | p. 1 |
2. Problem Setting | p. 7 |
1 Bandwidth Guarantees | p. 7 |
2 Explicit Routing | p. 8 |
3 Link State Updates | p. 9 |
4 Performance Metrics | p. 10 |
3. Related Work | p. 13 |
1 Global QoS Routing | p. 13 |
2 Localized QoS Routing | p. 16 |
2.1 Sticky Random Routing | p. 17 |
2.2 Learning Automata based Routing | p. 17 |
3 Hybrid QoS Routing | p. 18 |
4. Localized Proportional Routing: Theoretical Models | p. 21 |
1 Global Optimal Proportional Routing | p. 21 |
2 Localized Proportional Routing | p. 24 |
2.1 Virtual Capacity Model | p. 25 |
2.2 Virtual Link based Minimization | p. 27 |
2.3 Virtual Path based Minimization | p. 30 |
2.4 Performance Comparison | p. 32 |
3 Alternative Paths and Localized Trunk Reservation | p. 36 |
3.1 Localized Link-level Trunk Reservation | p. 37 |
3.2 Localized Path-level Trunk Reservation | p. 38 |
3.3 Effectiveness of Localized Trunk Reservation | p. 40 |
5. Localized Proportional Routing: Practical Schemes | p. 43 |
1 Heuristic Equalization Strategies | p. 43 |
1.1 Equalization of Blocking Probabilities | p. 43 |
1.2 Equalization of Blocking Rates | p. 43 |
2 Proportional Sticky Routing | p. 46 |
2.1 Proportional flow routing | p. 47 |
2.2 Computation of flow proportions | p. 48 |
2.3 Performance Evaluation and Analysis | p. 50 |
2.4 Heterogeneous Traffic | p. 57 |
2.5 Sensitivity of psr | p. 63 |
2.6 Routing Stability | p. 63 |
3 Approximation of ebp | p. 64 |
3.1 Proportion Computation | p. 65 |
3.2 Performance Evaluation | p. 65 |
6. Candidate Path Selection | p. 71 |
1 Hybrid Approach to QoS Routing | p. 72 |
2 Widest Disjoint Paths | p. 73 |
3 Performance Analysis | p. 77 |
3.1 Simulation Environment | p. 78 |
3.2 Performance of wdp | p. 78 |
3.3 Comparison of wsp and wdp | p. 82 |
7. Hierarchical Proportional Routing | p. 87 |
1 Hierarchical Routing | p. 87 |
2 Topology and State Aggregation | p. 88 |
3 Hierarchical Source Routing | p. 90 |
4 Hierarchical Next-hop Routing | p. 91 |
5 Performance Evaluation | p. 92 |
5.1 Simulation Environment | p. 93 |
5.2 Convergence and Adaptivity | p. 93 |
5.3 Blocking Performance | p. 95 |
8. Conclusions and Future Work | p. 99 |
References | p. 101 |
Index | p. 107 |