Cover image for Localized quality of service routing for the internet
Title:
Localized quality of service routing for the internet
Personal Author:
Series:
The Kluwer international series in engineering and computer science
Publication Information:
Boston, Mass. : Kluwer Academic Publishers, 2003
ISBN:
9781402074776
Added Author:

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

Dedicationp. v
List of Figuresp. xi
Prefacep. xiii
Acknowledgmentsp. xv
1. Introductionp. 1
2. Problem Settingp. 7
1 Bandwidth Guaranteesp. 7
2 Explicit Routingp. 8
3 Link State Updatesp. 9
4 Performance Metricsp. 10
3. Related Workp. 13
1 Global QoS Routingp. 13
2 Localized QoS Routingp. 16
2.1 Sticky Random Routingp. 17
2.2 Learning Automata based Routingp. 17
3 Hybrid QoS Routingp. 18
4. Localized Proportional Routing: Theoretical Modelsp. 21
1 Global Optimal Proportional Routingp. 21
2 Localized Proportional Routingp. 24
2.1 Virtual Capacity Modelp. 25
2.2 Virtual Link based Minimizationp. 27
2.3 Virtual Path based Minimizationp. 30
2.4 Performance Comparisonp. 32
3 Alternative Paths and Localized Trunk Reservationp. 36
3.1 Localized Link-level Trunk Reservationp. 37
3.2 Localized Path-level Trunk Reservationp. 38
3.3 Effectiveness of Localized Trunk Reservationp. 40
5. Localized Proportional Routing: Practical Schemesp. 43
1 Heuristic Equalization Strategiesp. 43
1.1 Equalization of Blocking Probabilitiesp. 43
1.2 Equalization of Blocking Ratesp. 43
2 Proportional Sticky Routingp. 46
2.1 Proportional flow routingp. 47
2.2 Computation of flow proportionsp. 48
2.3 Performance Evaluation and Analysisp. 50
2.4 Heterogeneous Trafficp. 57
2.5 Sensitivity of psrp. 63
2.6 Routing Stabilityp. 63
3 Approximation of ebpp. 64
3.1 Proportion Computationp. 65
3.2 Performance Evaluationp. 65
6. Candidate Path Selectionp. 71
1 Hybrid Approach to QoS Routingp. 72
2 Widest Disjoint Pathsp. 73
3 Performance Analysisp. 77
3.1 Simulation Environmentp. 78
3.2 Performance of wdpp. 78
3.3 Comparison of wsp and wdpp. 82
7. Hierarchical Proportional Routingp. 87
1 Hierarchical Routingp. 87
2 Topology and State Aggregationp. 88
3 Hierarchical Source Routingp. 90
4 Hierarchical Next-hop Routingp. 91
5 Performance Evaluationp. 92
5.1 Simulation Environmentp. 93
5.2 Convergence and Adaptivityp. 93
5.3 Blocking Performancep. 95
8. Conclusions and Future Workp. 99
Referencesp. 101
Indexp. 107