Title page
Abstract
Contents
I. Introduction 10
1.1 Why Traffic Grooming? 11
1.2 Traffic Grooming Problems 13
1.2.1 OPTICAL CROSS-CONNECT(OXC) 13
1.2.2 TRAFFIC GROOMING PROBLEMS 17
1.3 Thesis Objectives 19
1.4 Scope of Thesis 19
II. Analysis of the Key Algorithms 20
2.1 TLRC and SLRC 20
2.1.1 Traffic Grooming Policies 20
2.1.2 Principle of Algorithms 22
2.1.3 Advantages and Disadvantages 24
2.2 IGABAG 25
2.2.1 Overview 25
2.2.2 Principle of Algorithms 26
2.2.2.1 CONSTRUCTION OF AUXILIARY GRAPH 26
2.2.2.2 SOLVING TRAFFIC GROOMING PROBLEM BASED ON THE AUXILIARY GRAPH 28
2.2.2.3 INTEGRATED GROOMING ALGORITHM BASED ON THE AUXILIARY GRAPH(IGABAG) 29
2.2.3 Advantages and Disadvantages 32
2.3 Problem Statements 33
III. The Proposed Algorithms 34
3.1 Time Efficient Algorithm 34
3.1.1 Principle and Process 34
3.1.2 Practical examples 36
3.1.3 Complexity Computation 39
3.2 Cost-constraint Grooming Algorithm 40
3.2.1 Penalty Cost 40
3.2.2 Marginal Cost 41
3.2.3 Pseudo Codes 42
IV. Simulation Results 45
4.1 Optimal Cost Evaluation 45
4.1.1 STS-1 Connection 46
4.1.2 OC-3 Connection 46
4.1.3 OC-12 Connection 47
4.1.4 OC-48 Connection 47
4.2 Complexity Comparison 50
4.3 Performance Evaluation 51
V. Concluding Remarks 56
5.1 Summary of Contributions 56
5.2 Future Works 56
References 57
Acknowledgements 60
[Figure 1-1] Sample grooming OXC Architectures 16
[Figure 2-1] An illustrate example of SLRC algorithm 22
[Figure 2-2] (a) Physical topology of network 1. (b) Virtual topology of network 1. (c) Auxiliary graph of network 1 26
[Figure 3-1] An illustrative graph for Time Efficient Algorithm 35
[Figure 3-2] An example of Time Efficient Algorithm with 14-node network 37
[Figure 3-3] An example of Time Efficient Algorithm with 20-node network 38
[Figure 3-4] A penalty cost example 40
[Figure 4-1] The number of grooming fabrics corresponding to connection type 45
[Figure 4-2] Total cost in case of STS-1 connection 46
[Figure 4-3] Total cost in case of OC-3 connection 46
[Figure 4-4] Total cost in case of OC-12 connection 47
[Figure 4-5] Total cost in case of OC-48 connection 47
[Figure 4-6] Total cost in case of OC-48 connection when P changes 49
[Figure 4-7] Complexity comparison 50
[Figure 4-8] BBR versus load for different for different grooming OXCs under different bandwidth-granularity distributions 54
[Figure 4-9] Blocking Performance of TCGA, SLRC, IGABAG 55