Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
---|---|---|---|---|---|
Searching... | 30000010113017 | TK5105.5 H42 2006 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
Due to the dramatic increase in competition over the last few years, it has become more and more important for Internet Service Providers (ISPs) to run an efficient business and offer an adequate Quality of Service. The Competitive Internet Service Provider is a comprehensive guide for those seeking to do just that.
Oliver Heckmann approaches the issue from a system point of view, looking not only at running a network, but also at connecting the network with peering and transit partners or planning the expansion of the network.
The Competitive Internet Service Provider:
Offers an advanced reference on the topic, drawing on state-of-the art research in network technology. Clearly defines the criteria enabling ISPs to operate with the greatest efficiency and deliver adequate Quality of Service. Discusses the implications of the future multiservice Internet and multimedia applications such as Voice over IP, peer-to-peer, or network games. Delivers a comparative evaluation of different feasible Quality of Service approaches. Explores scientific methods such as queuing theory, network calculus, and optimization theory. Illustrates concepts throughout with mathematical models and simulations.This invaluable reference will provide academic and industrial researchers in the field of network and communications technology, graduate students on telecommunications courses, as well as ISP managers, engineers and technicians, equipment manufacturers and consultants, with an understanding of the concepts and issues involved in running a successful ISP.
Author Notes
Oliver Heckmann is a researcher at the Multimedia Communications laboratory at the Darmstadt University of Technology. His area of expertise is ISPs (internet service providers). He has also worked on the M31 European Union Project (www.m3i.org) which was voted one of the most successful research projects in the EU's Fifth Framework programme which dealt with the implementation of a QoS (Quality of Service) system using Intserv and Diffserv. He is currently working as a consultant for the M31 successor MMAPPSW (www.mmapps.org). Olivier is the technical manager of the LETSQoS (www.letsqos.de) research project that is funded by the German research network provider DFN.
Table of Contents
Foreword | p. xiii |
List of Figures | p. xv |
List of Tables | p. xix |
List of Abbreviations | p. xxi |
Part I Introduction and Basics | p. 1 |
1 Introduction | p. 3 |
1.1 Motivation | p. 3 |
1.2 Efficiency and Quality of Service | p. 4 |
1.2.1 Network Efficiency | p. 4 |
1.2.2 Network Quality of Service | p. 5 |
1.2.3 Trade-off between Efficiency and Quality of Service | p. 5 |
1.3 Action Space and Approach | p. 6 |
1.4 Overview | p. 8 |
2 Internet Service Providers | p. 11 |
2.1 A Classification Model for ISPs | p. 13 |
2.1.1 Definition of Internet Service Providers | p. 13 |
2.1.2 Internet Service Provider Roles | p. 14 |
2.1.3 Support Provider Roles | p. 20 |
2.1.4 End-users | p. 23 |
2.2 Classification of Selected Providers | p. 23 |
2.3 Summary and Conclusions | p. 27 |
3 Performance Analysis Basics | p. 29 |
3.1 Queueing Theory | p. 29 |
3.1.1 Introduction | p. 29 |
3.1.2 Kendall's Notation | p. 30 |
3.1.3 Little's Law | p. 31 |
3.1.4 M/M/1 Queueing Systems | p. 32 |
3.1.5 M/M/1/B Queueing Systems | p. 33 |
3.1.6 M/G/1 Queueing Systems | p. 34 |
3.1.7 Other Queueing Systems | p. 35 |
3.1.8 Queueing Networks | p. 36 |
3.1.9 Conclusions | p. 36 |
3.2 Network Calculus | p. 36 |
3.2.1 Basics | p. 37 |
3.2.2 Example | p. 38 |
3.2.3 Conclusions | p. 39 |
3.2.4 Outlook | p. 39 |
3.3 Optimisation Techniques | p. 40 |
3.3.1 Introduction | p. 40 |
3.3.2 Modelling Optimisation Problems | p. 40 |
3.3.3 Solving Optimisation Problems | p. 42 |
3.4 Summary and Conclusions | p. 45 |
4 Internet Protocols | p. 47 |
4.1 The Internet Protocol Stack | p. 47 |
4.1.1 IP | p. 48 |
4.1.2 UDP | p. 50 |
4.1.3 TCP | p. 51 |
4.1.4 Lower Layer Protocols | p. 59 |
4.2 Summary and Conclusions | p. 63 |
5 Applications | p. 65 |
5.1 World Wide Web | p. 65 |
5.1.1 QoS Requirements | p. 66 |
5.1.2 Traffic Model | p. 66 |
5.2 Peer-to-Peer Applications | p. 69 |
5.2.1 QoS Requirements | p. 69 |
5.2.2 Traffic Model | p. 69 |
5.2.3 The Future of P2P | p. 70 |
5.3 Online Games | p. 71 |
5.3.1 Computer Game Market | p. 71 |
5.3.2 Classification of Computer Games | p. 71 |
5.3.3 Online Game Architectures | p. 71 |
5.3.4 QoS Requirements | p. 73 |
5.3.5 Traffic Model | p. 73 |
5.4 Voice over IP | p. 73 |
5.4.1 QoS Requirements | p. 73 |
5.4.2 Traffic Model | p. 74 |
5.5 Traffic Classification | p. 76 |
5.5.1 Port-based Traffic Classification | p. 76 |
5.5.2 Advanced Mechanisms | p. 76 |
5.6 Summary and Conclusions | p. 77 |
Part II Network Architecture | p. 79 |
6 Network Architecture Overview | p. 81 |
6.1 Introduction | p. 81 |
6.2 Quality of Service Architectures | p. 82 |
6.2.1 Components of a Quality of Service System | p. 83 |
6.2.2 The Integrated Services Architecture | p. 86 |
6.2.3 Stateless Core Architectures | p. 93 |
6.2.4 The Diffserv Architecture | p. 95 |
6.2.5 Tuned Best-effort Architectures | p. 103 |
6.2.6 Other Architectures | p. 109 |
6.2.7 Classification of Quality of Service Architectures | p. 110 |
6.3 Data Forwarding Architecture | p. 113 |
6.3.1 IP Routing | p. 114 |
6.3.2 Label Switching | p. 116 |
6.4 Signalling Architecture | p. 118 |
6.4.1 Routing Protocols | p. 118 |
6.4.2 Quality of Service Signalling Protocols | p. 119 |
6.4.3 Label Distribution Protocols | p. 120 |
6.5 Security Architecture | p. 121 |
6.6 Admission Control | p. 122 |
6.6.1 Location | p. 124 |
6.6.2 Flow and Network Behaviour | p. 127 |
6.6.3 Guarantees | p. 129 |
6.6.4 Other Properties | p. 130 |
6.7 Summary and Conclusions | p. 132 |
7 Analytical Comparison of Quality of Service Systems | p. 133 |
7.1 On the Benefit of Admission Control | p. 134 |
7.1.1 Fixed Load | p. 135 |
7.1.2 Variable Load | p. 136 |
7.1.3 Variable Capacity | p. 140 |
7.1.4 Summary and Conclusions | p. 141 |
7.2 On the Benefit of Service Differentiation | p. 143 |
7.2.1 Traffic Types | p. 143 |
7.2.2 Best-Effort Network Model | p. 144 |
7.2.3 QoS Network Model | p. 145 |
7.2.4 Utility Functions | p. 148 |
7.2.5 Evaluation | p. 150 |
7.2.6 Summary and Conclusions | p. 156 |
8 Experimental Comparison of Quality of Service Systems | p. 159 |
8.1 QoS Systems | p. 162 |
8.1.1 Intserv/RSVP QoS Systems | p. 162 |
8.1.2 Standard Diffserv QoS Systems | p. 164 |
8.1.3 Olympic Diffserv | p. 170 |
8.1.4 Overprovisioned Best-Effort | p. 170 |
8.2 Experiment Setup | p. 171 |
8.2.1 Traffic | p. 171 |
8.2.2 Topologies | p. 174 |
8.2.3 Utility | p. 176 |
8.2.4 Evaluation Metrics | p. 178 |
8.3 Per-flow versus Per-class Scheduling | p. 179 |
8.4 Central versus Decentral Admission Control | p. 183 |
8.5 Direct Comparison | p. 185 |
8.6 Summary and Conclusions | p. 191 |
Part III Interconnections | p. 193 |
9 Interconnections Overview | p. 195 |
9.1 A Macroscopic View on Interconnections | p. 196 |
9.1.1 Strictly Hierarchical Structure | p. 196 |
9.1.2 Fully Meshed Structure | p. 197 |
9.1.3 Realistic Structures | p. 198 |
9.2 A Microscopic View on Interconnections | p. 199 |
9.2.1 Taxonomy and Classification of Interconnections | p. 199 |
9.2.2 Peering | p. 201 |
9.2.3 Transit | p. 202 |
9.2.4 Service Level Agreements | p. 202 |
9.3 Interconnection Method | p. 203 |
9.3.1 Internet Exchange Points | p. 203 |
9.3.2 Evaluation | p. 204 |
9.4 Interconnection Mix | p. 205 |
9.4.1 Negotiation Process | p. 205 |
9.4.2 Determining the Interconnection Mix | p. 206 |
9.5 Summary and Conclusions | p. 208 |
10 Optimising the Interconnection Mix | p. 209 |
10.1 Costs | p. 210 |
10.1.1 Description | p. 210 |
10.1.2 Evaluation | p. 214 |
10.2 Reliability | p. 218 |
10.2.1 Policies | p. 220 |
10.2.2 Evaluation | p. 222 |
10.3 Quality of Service | p. 224 |
10.3.1 Policies | p. 224 |
10.3.2 Evaluation | p. 225 |
10.4 Environment Changes | p. 227 |
10.4.1 Adjusting the Basic Models | p. 228 |
10.4.2 Evaluation | p. 228 |
10.5 Summary and Conclusions | p. 233 |
Part IV Traffic and Network Engineering | p. 235 |
11 Traffic and Network Engineering Overview | p. 237 |
11.1 Network Design and Network Engineering | p. 237 |
11.1.1 Network Design | p. 238 |
11.1.2 Network Engineering | p. 239 |
11.2 Traffic Engineering | p. 240 |
11.3 Traffic Matrix Estimation | p. 243 |
11.4 Summary and Conclusions | p. 245 |
12 Evaluation of Traffic Engineering | p. 247 |
12.1 Traffic Engineering Performance Metrics | p. 248 |
12.1.1 Path Length | p. 248 |
12.1.2 Maximal Bottleneck Utilisation | p. 249 |
12.1.3 Average Utilisation | p. 249 |
12.1.4 Average Load | p. 249 |
12.1.5 Congestion Costs | p. 250 |
12.2 Traffic Engineering Strategies | p. 251 |
12.2.1 Traffic Engineering Objectives | p. 251 |
12.2.2 Shortest Path Routing | p. 252 |
12.2.3 Equal Cost Multipath | p. 252 |
12.2.4 Explicit Routing | p. 252 |
12.2.5 Path Selection | p. 254 |
12.3 Experiment Setup | p. 255 |
12.3.1 Traffic Creation | p. 258 |
12.3.2 Capacity Assignment | p. 258 |
12.4 Explicit Routing versus Path Selection | p. 259 |
12.5 Performance Evaluation | p. 260 |
12.5.1 Basic Experiment | p. 260 |
12.5.2 Variation of the Congestion Cost Function | p. 264 |
12.5.3 Influence of the Topologies | p. 265 |
12.5.4 Variation of the Traffic Distribution | p. 267 |
12.5.5 Conclusions | p. 269 |
12.6 Singlepath versus Multipath | p. 269 |
12.7 Influence of the Set of Paths | p. 270 |
12.8 Summary and Conclusions | p. 272 |
13 Network Engineering | p. 273 |
13.1 Quality of Service Systems and Network Engineering | p. 273 |
13.2 Capacity Expansion | p. 276 |
13.2.1 Capacity Expansion Process | p. 276 |
13.2.2 Capacity Expansion Strategies | p. 277 |
13.2.3 Performance Evaluation | p. 283 |
13.2.4 Recommendations | p. 288 |
13.3 On the Influence of Elastic Traffic | p. 290 |
13.3.1 Elasticity of Traffic Matrices | p. 290 |
13.3.2 Impact on Capacity Expansion | p. 293 |
13.4 Summary and Conclusions | p. 294 |
Part V Appendices | p. 295 |
A Topologies Used in the Experiments | p. 297 |
B Experimental Comparison of Quality of service Systems | p. 303 |
C Analytical Comparison of Interconnection Methods | p. 329 |
C.1 Internet Exchange Point Cost Models | p. 329 |
C.1.1 Exchange Router | p. 329 |
C.1.2 Exchange LAN | p. 330 |
C.1.3 Exchange MAN | p. 332 |
C.2 Cost Efficiency of an Internet Exchange Point | p. 332 |
C.3 LAN versus MAN IXP Structure | p. 336 |
D Elasticity of Traffic Matrices - Network Models | p. 339 |
D.1 Basic Model | p. 339 |
D.2 Discrete Service Times | p. 341 |
D.3 Self-similar Traffic | p. 343 |
D.4 Related Work | p. 343 |
Bibliography | p. 345 |
Index | p. 365 |