Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks (eBook)

Vol 1a 1
Front Cover 1
The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks 4
Copyright Page 5
Table of Contents 14
PREFACE 6
LIST OF REFEREES 10
TECHNICAL PROGRAMME 12
AUTHOR INDEX 22
Chapter 1. 
26 
1. INTRODUCTION 26
2. SCOPE OF PERSONAL COMMUNICATION SERVICES 27
3. ITU-T ACTIVITY ON MOBILE/UPT TRAFFIC ENGINEERING STANDARDS 28
4. TRAFFIC PERFORMANCE - LAND MOBILE SERVICES 29
5. TRAFFIC PERFORMANCE - UPT SERVICE 33
6. CONCLUSIONS 36
REFERENCES 37
Chapter 2. 
38 
1. Introduction 38
2. Analysis of the Model 39
3. Practical Discussion 42
4. Examples 43
REFERENCES 45
Chapter 3. 
48 
1. Introduction 48
2. Preliminaries 49
3. Single Link (Trunk) Models 49
4. Blocking at Subsequent Links 51
5. Reservation Over Tandem Trunks 51
6. Numerical Results and Discussion 51
7. Signalling Implications 53
8. Impact of Usage Parameter Controls 53
9. Other Considerations And Conclusions 55
REFERENCES 56
Chapter 4. 
60 
1. INTRODUCTION 60
2. PACKET TRAFFIC MEASUREMENTS AND THEIR FRACTAL PROPERTIES 61
3. APPLICATIONS 63
4. Summary 67
REFERENCES 67
Chapter 5. 
70 
1. INTRODUCTION 70
2. THE MODEL 71
3. QUEUEING RESULTS 73
4. IMPLICATIONS FOR B - ISDN 75
5. CONCLUSIONS 78
References 78
Chapter 6. 
80 
1. INTRODUCTION 80
2. THE PARTIAL BUFFER SHARING AND THE MODEL 81
3· THE ANALYSIS 83
4. NUMERICAL RESULTS 87
5. CONCLUSIONS 88
REFERENCES 89
Chapter 7. Overflow probability upper bound for heterogeneous fluid queues 
90 
INTRODUCTION 90
1. GENERAL BENES FORMULA 91
2. EVALUATING THE BENES FORMULA 93
3. HOMOGENEOUS SOURCES 95
4. EFFECTIVE BANDWIDTH 98
CONCLUSION 98
REFERENCES 99
Chapter 8. m-MMBP Characterization of the Departure Process of an m-MMBP/Geo/1/K Queue 100
1. INTRODUCTION 100
2. THE m-STATE MARKOV MODULATED BERNOULLI PROCESS 101
3. THE DEPARTURE PROCESS OF AN m-MMBP/Geo/1/K QUEUE 102
4. CHARACTERIZATION OF THE DEPARTURE PROCESS 104
REFERENCES 107
Chapter 9. 
110 
1. INTRODUCTION 110
2. TRAFFIC MANAGEMENT in INTELLIGENT NETWORKS 111
3. ALGORITHMS for PERIODIC UPDATES 113
4. SENSITIVITY to UPDATE INTERVAL and CONTROL LEVEL 116
5. CONCLUSION 118
REFERENCES 119
Chapter 10. 
120 
1. Introduction 120
2. User Perception Experiment 121
3. Experimental Results 121
4. Implications for Network Evolution 124
5. Conclusions 128
Acknowledgments 129
References 129
Chapter 11. 
130 
1. INTRODUCTION 130
2. The Nature of Release Avalanches 131
3. Design Criteria for the Avalanche Control Algorithm 133
4. Description of the Algorithm 134
5. Call Completion Performance of the Algorithm 135
6. Summary and Future Work 138
REFERENCES 139
Chapter 12. Critical Congestion Control Issues in the Evolution of Common Channel Signaling Networks 140
1. INTRODUCTION 140
2. PREVIOUS SS7 CONGESTION CONTROL STUDIES 141
3. CRITICAL CONGESTION CONTROL STUDY AREAS 144
4. CONCLUSION 148
ACKNOWLEDGMENT 148
REFERENCES 148
Chapter 13. 
150 
1. Summary 150
2. Motivation 151
3. Holding Time Distribution - Single Subscriber 152
4. Holding Time Distributions in Subscriber Groups 154
5. Facsimile Connection Holding Time 157
6. Conclusion 158
7. Acknowledgement 159
References 159
Chapter 14. 
160 
1. PREFACE 160
2. OLD RUSSIAN TELETRAFFIC PAPERS 160
3. POST-KHINCHIN PERIOD 162
4. FEEDBACK STUDIES 164
5. WHY THE ITC-COMMUNITY DOES NOT TAKE INTEREST IN THEEX-USR STUDIES? 166
REFERENCES 166
Chapter 15. On the modified-offered-load approximation for the nonstationary Erlang loss model 170
1 Introduction 170
2 The Mt/PHt/s/O Queue 172
3 The Mt/PHt/8 Queue 173
4 The Fundamental Identity and Bounds for MOL 174
5 MOL Bounds for the Mt/Mt/S/0 Queue 175
6 Example: Changing M/M/s/O Rates in Midstream 177
References 178
Chapter 16. 
180 
1 INTRODUCTION 180
2 Model description 181
3 Analysis 182
4 Numerical 
191 
5 Conclusions 193
References 193
Chapter 17. 
194 
1. INTRODUCTION 194
2. MODEL 195
3. WORK IN THE SYSTEM 196
4. WAITING TIME OF SUPERCUSTOMERS 199
5. WAITING TIMES OF INDIVIDUAL CUSTOMERS 199
6. NUMBER OF INDIVIDUAL CUSTOMERS 201
7. NUMERICAL EXAMPLES 203
REFERENCES 203
Chapter 18. On the asymptotic behavior of discrete-time single-server queueing systems with general Markov-modulated arrival processes 204
1. INTRODUCTION 204
2. QUEUEING MODEL DESCRIPTION 205
3. THE SIMPLE ANALYTIC APPROACH 206
4. EXTENSION TO MULTIPLE TRAFFIC TYPES 211
5. NUMERICAL EXAMPLES AND CONCLUSIONS 212
REFERENCES 213
Chapter 19. 
216 
1. INTRODUCTION 216
2. INPUT POWER SPECTRUM 217
3. LINK CAPACITY ALLOCATION 220
4. CONCLUSION 223
References 224
Chapter 20. 
226 
1 Effective bandwidths 226
2 A Simple Formula for Effective Bandwidths 227
3 Traffic Source Models 229
4 Use of Effective Bandwidths in Switch-loading 232
5 Conclusions 235
References 237
Chapter 21. A Call Admission Control for Multiservice Networks with Declarable 
238 
1. INTRODUCTION 238
2. CALL ADMISSION CONTROL 239
3. OPTIMIZATION ALGORITHM 240
4. NUMERICAL INVESTIGATIONS 242
5. POLICING 246
6. Conclusion 247
REFERENCES 247
Chapter 22. 
248 
1 INTRODUCTION 248
2 WORST CASE SOURCE 249
3 GAIN OBTAINED BY INCLUDING m AND r2 IN THE STD 251
4 OPERATIONAL PARAMETERS RELATED TO P, m & r2, AND THEIR UPC ALGORITHMS
5 CONCLUSIONS 256
ACKNOWLEDGEMENTS 257
REFERENCES 257
Chapter 23. 
258 
1. INTRODUCTION 258
2. PROBLEM FORMULATION 260
3. CONSTANT-BIT-RATE SOURCES 261
4. ACCOUNTING FOR DELAY VARIATION IN INTERMEDIATE NETWORKS 262
5. CONFORMING THROUGHPUT TO DEPEND ON BURSTINESS 265
6. SUMMARY 266
REFERENCES 267
Chapter 24. 
268 
1. INTRODUCTION 268
2. LOAD PROFILES OF CALL TYPES IN SWITCHING SYSTEMS 269
3. GENERAL OBJECTIVES FOR OVERLOAD CONTROL MECHANISMS 270
4. OVERLOAD CONTROL WITH PROCESSOR LOAD INDICATOR 272
5. CONCLUSIONS 276
REFERENCES 277
Chapter 25. 
278 
1. Introduction 278
2. ISDN Traffic Characteristics 279
3. Performance Specifications 281
4. Overload Control 283
5. Conclusion 284
References 285
Chapter 26. 
288 
1. INTRODUCTION 288
2. SYSTEM CONFIGURATION 288
3. STATE PROBABILITIES AND CHARACTERISTIC TRAFFIC VALUES 289
4. RESULTS 292
5. CONCLUSION 293
REFERENCES 294
APPENDIX: RECURSIVE SOLUTION 295
Chapter 27. 
300 
1. Introduction 300
2. Telecommunication Networks 302
3. Requirements 303
4. Models - The Feedback Queue 305
5. Conclusions 306
REFERENCES 307
Chapter 28. 
310 
1. INTRODUCTION 310
2. THE INTERARRIVAL TIME DISTRIBUTION OF THE CORRELATED ARRIVAL PROCESS 311
3. APPLICATIONS: OVERLOAD CONTROL 315
4. CONCLUSIONS 317
References 317
Chapter 29. 
320 
1. INTRODUCTION 320
2. Bit-Rate Characteristics of a VBR 
321 
3. TES-Based Source Modeling 323
4. Statistical Multiplexer Simulation 328
5. Concluding Remarks 330
REFERENCES 330
Chapter 30. Characterizing Alarm Traffic from Telephone Exchanges: Methodology and Case Study 332
1. INTRODUCTION 332
2. GENERAL CONCEPTS 333
3. CHARACTERIZATION OF ALARM ARRIVAL PROCESSES 335
4. EXAMPLE 338
5. CONCLUSIONS 342
REFERENCES 342
Chapter 31. 
344 
1. INTRODUCTION 344
2. ETHERNET TRAFFIC MEASUREMENTS 345
3. SELF-SIMILAR STOCHASTIC PROCESSES 345
4. THE SELF-SIMILAR NATURE OF ETHERNET TRAFFIC 349
5. PARSIMONIOUS MODELING OF SELF - SIMILAR TRAFFIC 350
6. DISCUSSION 352
REFERENCES 353
Chapter 32. 
354 
1. INTRODUCTION 354
2. BACKGROUND AND MOTIVATION 355
3. CHAOTIC MAP MODELS OF TRAFFIC 357
4. PERFORMANCE ANALYSIS 360
5. SUMMARY 362
REFERENCES 363
Chapter 33. 
364 
1. INTRODUCTION 364
2. FORCE ALGORITHMS 365
3. ERLANG C AND M/G/C MODELS 366
4. ASA DISTRIBUTION 368
5. ANSWER CONSISTENCY ALGORITHMS 369
6. CONCLUSIONS 371
REFERENCES 371
Chapter 34. 
374 
1. INTRODUCTION 374
2. CDMA CELLULAR SYSTEMS 374
3. TRAFFIC CHARACTERISTICS OF CDMA 376
4. RESULTS 377
4. CONCLUSION 380
REFERENCES 381
Chapter 35. 
382 
1. Introduction 382
2. IN Overview 382
3. Teletraffic Implications of IN Services 383
4. Conclusions 391
References 391
Chapter 36. 
392 
1. INTRODUCTION 392
2. FAILURE PROPAGATION VIA NETWORK MANAGEMENT/CONTROL MESSAGES 392
3. ADEQUATE OVERLOAD CONTROLS 393
4. DISABLING NETWORK MANAGEMENT CONTROLS 395
5. SUMMARY 400
6. ACKNOWLEDGEMENTS 401
REFERENCES 401
Chapter 37. Which Arrival Law Parameters Are Decisive for Queueing System 
402 
I. Introduction 402
II. Important Queueing Parameters 403
III. The Fitting Procedure 407
IV. Numerical Example 410
V. Conclusions 410
References 411
Chapter 38. 
412 
1. INTRODUCTION 412
2. THE MATHEMATICAL MODEL AND ITS ANALYSIS 414
3. OUTPUT TRAFFIC CHARACTERIZATION 417
4. NUMERICAL RESULTS AND APPLICATIONS 419
5· CONCLUSIONS 422
APPENDIX 423
REFERENCES 424
Chapter 39. 
426 
1. INTRODUCTION 426
2. EFFECTIVE BANDWIDTHS 427
3. SOURCES OF KNOWN PEAK RATE 428
4. A NUMERICAL EXAMPLE 431
5. GENERALIZATIONS 434
REFERENCES 435
Chapter 40. 
436 
1. INTRODUCTION AND SUMMARY 436
2. A CONCRETE EXAMPLE 439
3. AN EXPLANATION: ASYMPTOTICS FOR SCALED PROCESSES 442
4. WHEN IS THE EB APPROXIMATION EFFECTIVE? 443
5. SOURCES LESS BURSTY THAN POISSON 444
6. CONCLUSIONS 445
REFERENCES 445
Chapter 41. 
446 
1. INTRODUCTION 446
2. A-M-S TYPE FLUID QUEUE 447
3. PRELIMINARIES 447
4. SINGLE SOURCE 448
5. MULTIPLE SOURCES 450
6. CONCLUSIONS 455
REFERENCES 455
Chapter 42. 
456 
1. INTRODUCTION 456
2. DESCRIPTION OF THE MULTIPLEXER 457
3. BUSY AND IDLE PERIODS FOR BERNOULLI SOURCES 457
4. EXTENSION OF RESULTS TO ON/OFF SOURCES 459
5. THE SIZE OF THE STATE SPACE {S8} 464
6. CONCLUSIONS 464
ACKNOWLEDGEMENTS 465
REFERENCES 465
Chapter 43. 
466 
1. OUTLINE OF THE PROBLEM 466
2. CASE OF SOURCES WITH CONSTANT BIT RATE 466
3. MULTIPLEXING OF BURSTY SOURCES 472
4. CONCLUSION 477
5. BIBLIOGRAPHY 477
Chapter 44. Idle and busy period distributions of an infinite capacity N * D/D/1 queue 478
1. INTRODUCTION 478
2. IDLE PERIOD DISTRIBUTION 479
3. BUSY PERIOD DISTRIBUTION 481
4. CONCLUSIONS 483
ACKNOWLEDGEMENTS 484
REFERENCES 484
Chapter 45. 
486 
1. Introduction 486
2. Queueing model 486
3. Some numerical results 493
4. Conclusions 494
References 494
Appendix A: The roots of the equation zk-B(z)p=0 inside the unit circle 495
Chapter 46. 
496 
1. INTRODUCTION 496
2. MODEL OF CELLULAR SYSTEMS AND THE RELATED DEFINITIONS 497
3. COMPUTATIONAL COMPLEXITY 498
4. NUMERICAL EXAMPLES 502
5. DECOMPOSITION AND HEURISTICS 503
6. CONCLUDING REMARKS 505
REFERENCES 505
Chapter 47. 
506 
1. INTRODUCTION 506
2. TRANSFORMING OPERATION 508
3. QUEUEING NETWORK 511
4. NUMERICAL EXAMPLE 513
5. DISCUSSING THE RESULTS 515
6. CONCLUSIONS 516
REFERENCES 517
Chapter 48. 
518 
1. Introduction 518
2. Basic Definitions 520
3. Zone Paging Algorithm 520
4 . Computing the Probability p 521
5. Minimizing the Cost Function 522
6. No Repage of the Zone 523
7. Dynamic Zones 523
8. Registration upon Zone Crossing 525
9. Conclusion 526
10. References 527
Chapter 49. The highway PALM: a stochastic model to capture space and time dynamics in wireless communication systems 528
1 Introduction 528
2 Highway PALM and Conservation Equations 530
3 The Fundamental Results 533
4 Fundamental Theorem for Cell Traffic 534
5 The Constant Velocity Case 535
References 537
Chapter 50. 
538 
1 INTRODUCTION 538
2 SEGMENTATION AND REASSEMBLY NODES 539
3 THE DEPARTURE PROCESS OF A SEGMENTATION NODE 541
4 WAITING TIME IN A SERVICE NODE AFTER SEGMENTATION 542
5 THE DEPARTURE PROCESS OF A SERVICE NODE AFTER SEGMENTATION 543
6 DEPARTURE PROCESS OF A REASSEMBLY NODE 544
7 THE WAITING TIME IN A REASSEMBLY NODE 545
8 ACCURACY 546
9 CONCLUSIONS 548
10 ACKNOWLEDGEMENTS 549
11 REFERENCES 549
Chapter 51. 
550 
1. Introduction and Summary 550
2. Distributed Switching and Intelligent Networks 550
3. A Generalized Stochastic Activity Network 551
4. The Basic Steps In Modeling Process 552
5. Model Assumptions and Validation 558
REFERENCES 559
Chapter 52. 
560 
I. INTRODUCTION 560
II. CASE OF GENERAL QUEUEING NETWORKS 561
III. SINGLE SERVER PACKET SWITCHED NETWORK WITH GENERAL INPUT 564
IV. SINGLE SERVER PACKET SWITCHED NETWORK WITH POISSON INPUT 566
V. CASE OF CORRELATED PACKETS 571
VI. CONCLUSION 573
REFERENCES 573
Chapter 53. 
574 
1. Introduction 574
2. Extreme Behavior of Finite Mixtures 575
3. Extreme Behavior of Phase Type Distributions 580
4. Extreme Values in Markovian Networks 582
5. Summary 582
REFERENCES 583
Chapter 54. 
584 
1 Introduction 584
2 Worst case analysis of nonhomogeneous variable bit rate traffic generated by monoservice terminals 585
3 The case of traffic generated by multiservice terminals 591
4 Conclusions 593
References 593
Chapter 55. 
596 
1. INTRODUCTION 596
2. DETERMINISTIC PATTERNS AS TRAFFIC DESCRIPTORS 597
3. CALL ADMISSION CONTROL ACCORDING TO THE WDPA SCHEME 598
4 . PERFORMANCE EVALUATION 601
5. CONCLUSIONS 604
REFERENCES 604
Chapter 56. 
606 
1. INTRODUCTION 606
2. PROBLEM STATEMENT 606
3. CONVENTIONAL CONJECTURE 607
4. THE COUNTER-EXAMPLE 607
5. SIMULATION ANALYSIS 608
6. FLUID FLOW SAMPLE PATH ANALYSIS 609
7. CONCLUSIONS 610
ACKNOWLEDGEMENTS 610
REFERENCES 610
Chapter 57. 
616 
1. INTRODUCTION 616
2. TRAFFIC PATTERNS AND DEFINITIONS OF WORST CASE BEHAVIOR 617
3. WORST CASE BEHAVIOR OF LBB SOURCES: UNBUFFERED CASE 619
4. ANOMALY IN HETEROGENEOUS CASE AND OTHER PERFORMANCE MEASURES 621
5. BUFFERED CASE: A COUNTER-EXAMPLE 622
6. CONNECTION ACCEPTANCE CONTROL FOR LBB SOURCES: EQUIVALENT BANDWIDTH CHARACTERIZATION 623
REFERENCES 625
Chapter 58. 
626 
1. INTRODUTION 626
2. NETWORK AND TRAFFIC MODEL 627
3. ANALYTICAL MODEL 629
4. NUMERICAL RESULTS 632
5. CONCLUSIONS 634
REFERENCES 635
Chapter 59. 
636 
1. INTRODUCTION 636
2. THE RESEQUENCING PROCESS IN THE MPSR SWITCH 637
3. COMMON BUFFER DIMENSIONING 639
4. PERFORMANCE RESULTS 643
5. CONCLUSIONS 644
REFERENCES 644
Chapter 60. 
648 
1. INTRODUCTION 648
2. STRUCTURE OF THE SYSTEM 649
3. PERFORMANCE OF THE DISTRIBUTION SUBNET 651
4. PERFORMANCE OF THE ROUTING SUBNET 652
5. EVALUATION RESULTS 656
6. CONCLUSIONS 659
REFERENCES 659
Chapter 61. 
660 
1. INTRODUCTION 660
2. THE GENERAL CONDITION 660
3. SPECIAL CASES OF THE NON-BLOCKING CONDITION 662
4. NON-BLOCKING CONDITIONS FOR ATM NETWORKS 664
5. MULTI-SLOT SWITCHING REQUIRING CONSECUTIVE TIME SLOTS 665
6. CONCLUSIONS 669
REFERENCES 669
Chapter 62. 
670 
1. Introduction 670
2. The Shuffleout architecture 671
3. Channel grouping algorithms 672
4. Performance analysis 676
5. Performance results 676
6. Conclusions 676
7. References 677
Chapter 63. 
680 
1. Introduction 680
2. Network Design for Protection Against Link Failures 682
3. Mathematical Models of Protection Schemes 684
4. Illustrative Examples 687
REFERENCES 690
Chapter 64. 
692 
1. INTRODUCTION 692
2. MOTIVATION FOR THE PROPOSED ROUTING TECHNIQUE 693
3. DESCRIPTION OF ROUTING WITH ECONOMIC REGULATION 694
4. EVALUATION OF THE PROPOSED TECHNIQUE 698
5. CONCLUSION 700
REFERENCES 701
Chapter 65. 
702 
1. INTRODUCTION 702
2. WIN DYNAMIC ROUTING STRATEGIES 704
3. NETWORK MODELS & PERFORMANCE COMPARISONS
4. STANDARDIZED CCS SIGNALING MESSAGES FOR WIN DYNAMIC ROUTING 708
5. PROPOSAL FOR STANDARDIZATION 710
6. SUMMARY & CONCLUSIONS
REFERENCES 711
Chapter 66. 
712 
1. INTRODUCTION 712
2. DATA MODEL 713
3. RESULTS 716
4. ACKNOWLEDGEMENTS 718
REFERENCES 718
Chapter 67. 
724 
1. INTRODUCTION 724
2. ECONOMICAL DIMENSIONING THROUGH THE USE OF TRANSIT ROUTES 725
3. COST REDUCTIONS BY COALITIONS 727
4. DATA 730
5. RESULTS 731
6. CONCLUSIONS 732
REFERENCES 733
Chapter 68. 
734 
1. INTRODUCTION 734
2. MODEL DESCRIPTION AND PROBLEM FORMULATION 735
3. DERIVATIONS OF THE ESTIMATOR 737
4. SIMULATION EXAMPLES 741
REFERENCES 743
Chapter 69. 
744 
1 INTRODUCTION 744
2 SYSTEM DESCRIPTION 745
3 MEASURING DISTRIBUTIONS AND QUANTILES 746
4 PARAMETERS 746
5 RESULTS 747
6 CONCLUSIONS 753
REFERENCES 753
Chapter 70. 
754 
1. Introduction 754
2. Model description 756
3. A pseudo-conservation law 757
4. Comparison between the dormant and the non-dormant server case 762
5. Conclusion 766
REFERENCES 767
Chapter 71. 
768 
1. Introduction 768
2. Exact results for the overflow probability 769
3. Bounds for the overflow probability 771
4. Approximations for the overflow probability 773
5. Optimization problem 775
6. Conclusions and suggestions for further research 776
REFERENCES 777
Chapter 72. 
782 
1. THE MODEL 783
2 PERFORMANCE CHARACTERISTICS 786
3 CONCLUSION 791
RERFERENECES 791
Chapter 73. 
792 
1 Introduction 792
2 Description of the method 793
3 Some properties of the estimate (11) 795
4 Examples 797
5 Conclusions 800
References 801
Chapter 74. 
802 
1. INTRODUCTION 802
2. A TM QUEUEING BEHAVIOUR 803
3 . ACCELERATED SIMULATION TECHNIQUES 804
4. CELL RATE SIMULATION MODELLING 805
5. IMPLEMENTING A CELL RATE SIMULATOR 808
6. CELL LOSS PROBABILITY RESULTS 809
7. CONCLUSIONS 810
ACKNOWLEDGEMENTS 810
REFERENCES 811
Chapter 75. 
812 
1. Introduction 812
2. The Reference Model M/M/1/N 813
3. A Simplified LRE-Algorithm for Discrete Random Sequences 814
4. The RESTART/LRE - Algorithm 815
5. Simulation Results 818
6. Final Remarks 820
REFERENCES 821
Chapter 76. 
822 
1. INTRODUCTION 822
2. GENERAL DESCRIPTION 823
3. GAIN OBTAINED WITH RESTART 825
4. OPTIMAL GAIN 828
5. APPROXIMATIONS OF THE OPTIMAL PARAMETERS 829
6. USE OF HYSTERESIS TO LESSEN THE IMPACT OF RESTORATION COST 830
7. ASTRO: ADVANCED SIMULATION TOOL WITH RESTART 
831 
8. APPLICATION EXAMPLE 833
9. CONCLUSIONS 834
REFERENCES 835
Vol 1b 836
Front Cover 836
The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks 839
Copyrigh Page 840
Table of Contents 849
PREFACE 841
NATIONAL COMMITTEE 843
TECHNICAL PROGRAMME COMMITTEE 844
LIST OF REFEREES 845
TECHNICAL PROGRAMME 847
AUTHOR INDEX 857
Chapter 77. Sample Path Analysis of Token Rings 861
Abstract 861
1. Introduction 861
2. A General Result 862
3. Linear Burstiness Bounds 864
4. Limiting Average Rates 867
References 869
Chapter 78. Performance Evaluation and Engineering Guidelines for the M/K Multiple Priority Policy in DQDB Networks 871
Abstract 871
1.0 Introduction and Background 871
2.0 Analytic Approximations 873
3.0 Performance Evaluation of the M/K Policy 874
4.0 Engineering Guidelines 878
5.0 Concluding Remarks 880
Chapter 79. On a procedure to test whether the random variables of a sequence are independent and identically distributed, with applications to telephone and packet-switched networks 881
ABSTRACT 881
1. INTRODUCTION 881
2. THE PROPOSED TEST-STATISTIC: DEFINITION 882
3. MAIN ASYMPTOTIC RESULTS 883
4. SIMULATION RESULTS 886
5. APPLICATION TO REAL DATA 888
REFERENCES 890
Chapter 80. Performance Comparison of Error Recovery Schemes for High Bandwidth-Delay Product Networks 891
1. Introduction 891
2. Analytic Model 892
3. Analysis 893
4. Performance Comparisons 898
5. Conclusion 902
REFERENCES 902
Chapter 81. Networks of customer queues and resource queues 903
1. INTRODUCTION 903
2. SYSTEM DESCRIPTION 904
3. THE EQUILIBRIUM DISTRIBUTION 906
4. NETWORKS OF CUSTOMER QUEUES AND RESOURCE QUEUES 909
CONCLUSION 913
ACKNOWLEDGEMENT 913
REFERENCES 913
Chapter 82. THE POWER-SERIES ALGORITHM APPLIED TO POLLING SYSTEMS WITH A DORMANT SERVER 915
1. INTRODUCTION 915
2. MODEL DESCRIPTION 916
3. BALANCE EQUATIONS 917
4. COMPUTATION SCHEME 918
5. NUMERICAL EXAMPLES 921
6. OPTIMIZATION 923
7. CONCLUSION 924
REFERENCES 924
Chapter 83. Erlang capacity of a shared resource 925
1. INTRODUCTION 925
2. ASYMPTOTIC APPROXIMATIONS 927
3. ADMISSION CONTROL 931
4. NUMERICAL RESULTS 933
REFERENCES 934
Chapter 84. Quick Simulation of Stationary Tail Probabilities at a Packet Switch 937
1. INTRODUCTION 937
2. GI/D/1 QUEUES 939
3. PCP/D/1 QUEUES 942
4. Future Work 943
REFERENCES 945
Chapter 85. Dimensioning and Design Methods for Integrated ATM Networks 947
1. INTRODUCTION 947
2. EQUIVALENT BANDWIDTH, DETERMINATION AND CONTROL 948
3. THE MULTI-RATE DIMENSIONING OF A LINK 949
4. EXTENSIONS OF THE RESULTS FOR AN OVERFLOW NETWORK 954
5 CONCLUSIONS 955
REFERENCES 956
Chapter 86. Real-Time Traffic Estimation in ATM Networks 957
1. INTRODUCTION 957
2. ESTIMATING ARRIVAL RATE 958
3. SIMULATION RESULTS 962
4. HARDWARE IMPLEMENTATION OF ESTIMATOR 964
5. CONCLUSIONS 965
REFERENCES 966
Chapter 87. A Technique for Measuring Rare Cell Losses in ATM Systems 967
Abstract 967
1 INTRODUCTION 967
2 GENERATOR BASED IMPORTANCE SAMPLING 969
3 FLUID FLOW CONTROL VARIABLES 976
4 SUMMARY OF THE MEASUREMENT METHOD 978
5 CONCLUDING REMARKS 979
References 979
Chapter 88. MANAGEMENT OF RECONFIGURABLE VIRTUAL PATH NETWORKS 981
1. Virtual Path Networks 981
2. ALGORITHMS FOR DYNAMIC CAPACITY MANAGEMENT 982
3. Applying Dynamic Capacity Management 984
4. Conclusions 988
5. Further Work 989
REFERENCES 989
Chapter 89. THE EFFECT OF MULTIPATH ROUTING ON THE LOSS PERFORMANCE OF MULTIPLEXED ON-OFF SOURCES 991
1 INTRODUCTION 991
2 CHOICE OF ALLOCATION GRANULARITY 993
3 SOURCE MODEL 994
4 LOSS PERFORMANCE 994
5 CONCLUSIONS 999
References 1000
Chapter 90. Topological Design of Metropolitan Area Networks 1001
1 INTRODUCTION 1001
2 MAN NETWORK MODELLING 1002
3 ALGORITHMS 1003
4 RESULTS 1007
5 CONCLUSION 1009
Acknowledgement 1009
REFERENCES 1009
Chapter 91. Analysing Timed-Token Ring Protocols Using the Power 
1011 
Abstract 1011
1 Introduction 1011
2 The Model and Notation 1012
3 1-limited service discipline 1013
4 Performance Measures 1016
5 Exhaustive service discipline 1016
6 Numerical results 1017
References 1020
Chapter 92. Mean Waiting Time Approximations for FDDI 1023
1 Introduction 1023
2 Modelling 1025
3 Stability Conditions 1026
4 Mean Waiting Time Analysis 1027
5 A Case Study 1031
6 Conclusion 1033
7 Acknowledgement 1033
References 1034
Chapter 93. 
1035 
1. INTRODUCTION 1035
2. MODELING 1036
3. SOLUTION OF THE MODEL 1038
4. COMPUTATION OF THE QUEUE-LENGTH TAIL DISTRIBUTION 1040
5. RESULTS 1043
6. SUMMARY 1044
REFERENCES 1044
Chapter 94. 
1045 
1. INTRODUCTION 1045
2. NETWORK MODELS 1046
3. PROTOCOL OPERATION 1047
4. EXAMPLE RESULTS 1049
5. CONCLUSIONS 1054
REFERENCES 1054
Chapter 95. 
1055 
1. Introduction and main results 1055
2. Sketch of Proofs 1059
3.Concluding remarks 1061
REFERENCES 1061
Chapter 96. 
1063 
1. Introduction 1063
2. Pathwise representation of the stationary queue length distribution 1065
3. Large deviations equivalent 1065
4. Approximate queue length distribution 1068
5. Numerical results 1068
References 1071
Chapter 97. 
1073 
1. INTRODUCTION 1073
2. ANALYSIS 1073
3. NUMERICAL CONSIDERATIONS 1077
4. SIMULATION DESCRIPTION 1078
5. RESULTS 1078
6. CONCLUSIONS 1082
References 1082
Chapter 98. 
1083 
1. INTRODUCTION 1083
2. DEFINITIONS AND ASSUMPTIONS 1084
3. MINIMUM TEAM SIZE TO MEET MULTI-QUEUE M/G/C OBJECTIVES 1085
4. PERFORMANCE PREDICTION 1090
5. CAPACITY DETERMINATION 1091
6. SOLVING DYNAMIC PRIORITY CONTROLS MIXED DISCIPLINE
7. CONCLUSION 1092
REFERENCES 1092
Chapter 99. 
1093 
1. INTRODUCTION 1093
2. EXPLOITING POLLACZEK'S GI/G/1 CONTOUR INTEGRAL 1096
3. THE TRANSIENT BMAP/G/1 QUEUE 1097
REFERENCES 1100
Chapter 100. 
1103 
1 INTRODUCTION 1103
2 SYSTEM MODEL 1105
3 PROBLEM FORMULATION 1107
4 DISTRIBUTED ALGORITHMS 1110
5 VPN TRAFFIC MANAGEMENT 1112
6 CONCLUSIONS AND FUTURE DIRECTIONS 1113
References 1113
Chapter 101. 
1115 
1. INTRODUCTION 1115
2. MODEL BASED ON KALMAN FILTER 1117
3. SIMULATION PACKAGE 1123
4. NUMERICAL RESULTS 1124
5. CONCLUSIONS 1124
REFERENCES 1126
Chapter 102. 
1127 
1 INTRODUCTION 1127
2 DESCRIPTION OF THE ADAPTIVE CAC STRATEGY 1128
3 PERFORMANCE MODELLING 1130
4 PERFORMANCE ASSESSMENT 1135
5 CONCLUSION 1137
REFERENCES 1138
Chapter 103. 
1139 
1. INTRODUCTION 1139
2 . MATHEMATICAL FRAMEWORK 1140
3 . CAC WITH UNCERTAIN MEANS 1142
4. A PRACTICAL EXAMPLE 1144
5. CONCLUSIONS AND FUTURE WORK 1147
REFERENCES 1148
Chapter 104. Performance of an Efficient Discipline for Hybrid STM-ATM Switching and Transport 1149
1. Introduction 1149
2. Hybrid STM-ATM Frame Layout 1150
3. Comparison with Related Work 1150
4. Analysis 1151
5. Results 1157
6. Conclusions 1158
References 1158
Chapter 105. 
1159 
1 INTRODUCTION 1159
2 RESOURCE SHARING SCHEMES 1160
3 MODELING 1162
4 PERFORMANCE EVALUATION 1163
5 RESULTS 1164
6 CONCLUSION 1169
REFERENCES 1169
Chapter 106. 
1171 
1. INTRODUCTION 1171
2. CONNECTIONLESS ATM INFRASTRUCTURE 1172
3. MULTICAST SERVICE IMPLEMENTATION 1174
4. CONNECTIONLESS SERVER DESIGN 1174
5. CASE STUDY 1175
6. CONCLUSIONS 1177
REFERENCES 1177
Chapter 107. 
1181 
1. INTRODUCTION 1181
2. FR-ATM IWU OPTIONS 1184
3. Resource Management Issues in ATM Network 1187
REFERENCES 1189
APPENDIX : APPROXIMATE ANALYSIS OF ON-OFF SOURCES 1190
Chapter 108. Service Integration in DQDB MANs and Impact on ATM Interworking Performance 1193
I. INTRODUCTION 1193
II. MODELLING 1194
III. Numerical Results 1198
IV. CONCLUSIONS 1203
REFERENCES 1204
Chapter 109. 
1205 
1 Introduction 1205
2 The Modified Adaptive Sequential Projection Algorithm Operation 1206
3 The Robust Sequential Projection Algorithm 1207
4 Errors Covariance Estimation - Qk and Rk 1207
5 State Transition Matrix Estimation 1212
6 Reinitialization and Robustness 1213
7 Conclusions 1213
References 1214
Chapter 110. 
1215 
1. Introduction 1215
2. State space modeling 1216
3. Applying the Kalman filter and smoothing algorithm 1220
4. Numerical results 1221
5. Conclusion 1223
REFERENCES 1224
Chapter 111. 
1225 
1 Introduction 1225
2 Preliminaries 1225
3 Traffic Models 1226
4 Estimation Methods 1229
5 Numerical Examples 1231
References 1233
Chapter 112. 
1235 
1. Introduction 1235
2. Dimensioning method for a trunk group 1236
3. Profit-maximization dimensioning method in a network 1240
4. Conclusion 1244
References 1244
Chapter 113. 
1245 
1 Introduction 1245
2 The customer problem 1246
2.4 Characterisation of the optimal solution 1248
2.5 Solution technique 1249
3 The problem of the leased line supplier 1249
4 Results 1252
5 Conclusion 1255
References 1256
Chapter 114. 
1257 
1. INTRODUCTION 1257
2. BANDWIDTH ALLOCATION STRATEGIES IN BROADBAND NET WORKS 1257
3. MEAN-VALUE ANALYSIS RECURSION FOR A MULTI-SERVICE LINK 1258
4. COMPUTATIONAL ISSUES 1263
5. CONCLUSIONS 1263
REFERENCES 1266
Chapter 115. 
1267 
1. INTRODUCTION AND SUMMARY 1267
2. MODELS 1269
3. SOLUTION TECHNIQUES 1269
4. TRUNK RESERVATION 1272
5. COMPARISON OF PERFORMANCES FOR MULTIRATE TRAFFIC IN VARIOUS IMPLEMENTATIONS 1274
REFERENCES 1276
Chapter 116. 
1279 
1. INTRODUCTION 1279
2. COMBINATORIAL PROPERTIES OF LIMITED-AVAILABILITY GROUPS 1280
3. DISTRIBUTIONS OF AVAILABLE SUBGROUPS 1282
4. DISTRIBUTION OF LINKS AVAILABILITY IN THE DIGITAL SWITCHES 1284
5. CALCULATION OF THE SWITCHING NETWORKS 1285
6. CONCLUSION 1287
REFERENCES 1288
Chapter 117. 
1289 
1 Introduction 1289
2 The Model 1290
3 Exact Algorithm 1291
4 Asymptotic Approximations 1293
5 Numerical Results 1295
6 Conclusions and Extensions 1298
References 1298
Chapter 118. 
1301 
1. Link Models 1302
2. Network Optimization 1307
3. Conclusion 1308
REFERENCES 1310
Chapter 119. 
1311 
1. INTRODUCTION 1311
2. SPACE PRIORITY MECHANISMS 1312
3. PRINCIPLES OF PERFORMANCE STUDIES 1315
4. THE SIMULATION RESULTS 1317
5. CONCLUSION 1319
REFERENCES 1320
Chapter 120. 
1321 
1. INTRODUCTION 1321
2. REFERENCE CONFIGURATION AND CONTROL PROTOCOLS 1323
3. SYSTEM MODEL AND PERFORMANCE EVALUATION 1325
5. CONCLUSIONS 1330
REFERENCES 1330
Chapter 121. 
1331 
1. Introduction 1331
2. Hierarchical Temporal Controls 1331
3. Traffic Model Assumptions 1332
4. Hierarchical Model for the Multilevel Control 1332
5. Analysis of the Multilevel Hierarchical Control Model 1333
6. Numerical Result 1337
7. Summary 1338
REFERENCES 1338
Chapter 122. 
1341 
1. INTRODUCTION 1341
2. REACTIVE CONTROL METHOD 1342
3. TRAFFIC MODELS 1345
4. PERFORMANCE EVALUATION 1346
5. SIMULATION TESTING 1349
6. CONCLUSIONS 1349
REFERENCES 1350
Chapter 123. 
1351 
1. Introduction 1351
2. Forecasting the demand for telephone service 1352
3. Forecasting the demand for ISDN services 1354
4. Forecasting the demand for new telecommunications services 1357
5. Robust architecture of an access network under conditions of demand uncertainty 1358
6. Conclusion 1360
References 1360
Chapter 124. 
1361 
1. FSN CONCEPT 1361
2. FSN DESIGN MODELS 1363
3. ANALYSIS OF FSN DESIGNS 1368
4. SUMMARY 1370
REFERENCES 1370
Chapter 125. 
1371 
1. INTRODUCTION 1371
2. NEURAL TREE TOOL 1372
3. APPLICATION TO DIAGNOSIS OF CIRCUIT-SWITCHED NETWORKS 1375
4. EXPERIMENTAL RESULTS FOR A TRAFFIC OVERLOAD DISTURBANCE 1378
5. CONCLUSION 1379
REFERENCES 1380
Chapter 126. 
1381 
1. INTRODUCTION 1381
2. NOTATION 1381
3. GENERIC MODEL DESCRIPTION 1382
4. SPECIFIC REALISATIONS OF THE MODEL 1385
5. EXAMPLES 1388
REFERENCES 1389
Chapter 127. 
1391 
1. INTRODUCTION 1391
2. NETWORK ARCHITETCURE 1392
3. NETWORK PROTOCOL 1393
4. CONCLUSIONS, OPEN ISSUES, AND FUTURE WORK 1399
5. REFERENCES 1399
Chapter 128. 
1401 
1. Introduction 1401
2. Traditional Models 1403
3· Model Verification 1403
4. "Scenic" Model 1404
5. Conclusion 1409
REFERENCES 1409
Chapter 129. 
1411 
1. INTRODUCTION 1411
2. CHARACTERISTICS OF THE INTERNAL TRAFFIC 1412
3. MODELING THE INTERNAL TRAFFIC 1414
4. ANALYSIS OF THE SWITCH FABRIC 1416
5. NUMERICAL RESULTS 1419
6. CONCLUSION 1420
ACKNOWLEDGEMENT 1421
REFERENCES 1421
Chapter 130. 
1423 
1. INTRODUCTION 1423
2. RESOURCE ALLOCATION TECHNIQUES 1424
3. THE FAST BANDWIDTH RESERVATION SHAPER 1427
4. PERFORMANCE OF THE SHAPER 1429
5. CONCLUSIONS 1433
REFERENCES 1433
Chapter 131. 
1435 
ABSTRACT 1435
1. INTRODUCTION 1435
2. WORST TRAFFIC PROFILE DEPARTING FROM A LEAKY BUCKET 1436
3. CAC ALGORITHM 1438
4. THE EFFECT OF CDV TOLERANCE 1441
5. CONCLUSIONS 1443
REFERENCES 1444
Chapter 132. Cell conformance and Quality of Service guarantees in ATM Networks 1445
1. Introduction 1445
2. Definition of cell conformance 1446
3. Defining network commitments concerning Cell Loss Ratio 1447
4. Inter-dependent conformance controls 1448
5. Application to tagging 1452
6. Conclusion 1453
REFERENCES 1454
Chapter 133. 
1455 
1. INTRODUCTION 1455
2. THE THREE POLICING MECHANISMS 1456
3. CONFORMANCE TO THE PEAK CELL RATE 1457
4. THE MAXIMUM THROUGHPUT FUNCTION 1458
5. DIMENSIONING OF THE COMPARED MECHANISMS 1459
6. COMPARISON OF THE MAXIMUM THROUGHPUT FUNCTIONS 1460
7. BURSTY OUTPUT TRAFFIC ALLOWED BY THE THREE ALGORITHMS AND ITS IMPACT ON CELL LOSS PERFORMANCE 1461
8. CONCLUSIONS 1464
REFERENCES 1464
Chapter 134. 
1465 
1 Introduction 1465
2 Peak cell rate monitor algorithm 1467
3 Analysis 1468
4 Traffic scenario 1470
5 Numerical results 1471
6 Conclusion 1474
References 1474
Chapter 135. 
1475 
1. INTRODUCTION 1475
2. A DSS DEDICATED TO MODERNIZATION PLANNING OF TELECOMMUNICATIONS NETWORK 1477
3. INCORPORATING SENSITIVITY ANALYSIS 1479
4. CONCLUSIONS AND FURTHER WORK 1484
REFERENCES 1484
Chapter 136. 
1485 
1. INTRODUCTION 1485
2 SURVIVABILITY MECHANISMS 1486
3 DESIGN CONSIDERATIONS 1488
4 DESIGN OF SURVIVABLE SYSTEMS 1488
5 SURVIVABILITY MECHANISM COMPARISON 1490
6 GUIDELINES 1494
7 CONCLUSIONS 1494
REFERENCES 1494
Chapter 137. 
1495 
1. INTRODUCTION 1495
2. THE LOWER BOUND NETWORK DESIGN (LBD) 1497
3. A HEURISTIC NETWORK DESIGN PROCEDURE 1500
4. HEURISTIC DESIGN VS. LOWER BOUND DESIGN 1501
5. CONCLUDING REMARKS 1502
REFERENCES 1503
Chapter 138. 
1505 
1. Introduction 1505
2. Horton's and Strahler's Laws and Ordering Systems 1505
3. Analysis of Subscriber Networks 1506
4. Computer Simulation of Subscriber Network 1508
5. Analysis by Computer Simulation 1509
6. Application of the Laws 1512
7. Conclusion 1514
REFERENCES 1514
Chapter 139. 
1515 
1. Introduction 1515
2. Adaptive Routing with Equitable Load Balancing 1517
3. Simulation of the Controls 1521
REFERENCES 1523
Chapter 140. 
1525 
1. Introduction 1525
2. The threshold-based routing algorithm 1526
3. Inputs for the model 1528
4. Outputs from the model 1529
5. Results 1529
6. Conclusions 1532
REFERENCES 1533
Chapter 141. 
1535 
1. INTRODUCTION 1535
2. PROTOCOL DESCRIPTION 1536
3. PERFORMANCE OF THE PROTOCOL: NO CREDIT MANAGEMENT 1537
4. FRAME-BASED CREDIT MANAGEMENT 1539
5. CONCLUSION 1543
References 1543
Chapter 142. Evaluation of High Speed Network Protocols by a Network Simulator using a Transputer Complex 1545
1. INTRODUCTION 1545
2. PURPOSE OF THIS SIMULATOR 1545
3. CONFIGURATION OF THE SIMULATOR 1547
4. HIGH SPEED PROTOCOL STACK 1548
5. PROTOCOL PROCESSING TIME MEASUREMENT 1549
6. RESULTS OF PERFORMANCE EVALUATION 1550
7. CONCLUSION 1554
REFERENCES 1554
Chapter 143. 
1555 
1. Introduction 1555
2. An Analysis of the Effect of Timing of Rerouting 1556
3. Performance Evaluation 1559
4. Conclusions 1562
REFERENCES 1562