Dissertation > Excellent graduate degree dissertation topics show

Research on Hose-model-based Robust Routing and Survivability in WDM Optical Networks

Author: DaiZuo
Tutor: LiLeMin
School: University of Electronic Science and Technology
Course: Communication and Information System
Keywords: WDM Mesh Networks Hose model Robust routing Robust invulnerability Valiant load balancing VPN tree routing Adaptive Load Balancing Heuristic algorithm
CLC: TN929.1
Type: PhD thesis
Year: 2010
Downloads: 75
Quote: 0
Read: Download Dissertation


WDM (Wavelength Division Multiplexing) optical network planning and design, traditional routing and survivability of the program are given a clear traffic matrix. However, in recent years, with the explosive growth of the Internet data traffic as well as the emerging broadband services continue to emerge, running on a light layer packet data will dramatically change the situation in the practical application is difficult to predict or estimate specific point-to-point between the size of the business flow. Therefore, very necessary to study the bandwidth demand information is not known the case robust routing and invulnerability to accommodate its rapid growth and dynamic change. Hose (Hose) uncertain business model first appeared in the virtual private network (VPN, Virtual Private Network). The model does not specify a full traffic matrix, only the inflow and outflow of the synthetic traffic of each node (i.e., the traffic matrix of the \Does not require a specific description of the network business distribution hose model greatly reduces the difficulty of the business is estimated, as well as to improve the flexibility of the design. The this study Hose model optimization problem in WDM optical networks, focused on the following two aspects: (1) based on the the Hose model of robust routing problem; (2) based on the robustness of the Hose model invulnerability research. The innovation of this paper include the following five points. First, the the static robust routing problem the Hose uncertain traffic model. The difference is that with the previous solution, the paper not only consider how to reduce the link cost, but more fully examine the main factors affecting network cost (including link cost and nodes exchange overhead) than now A heuristic algorithm of network resources more economical solutions. Second, under the the Hose model's framework, the authors study how business needs to ascertain the point-to-point information to achieve a robust optimization routing problem, and propose a new routing strategy, and gives heuristic algorithm. The algorithm is an effective solution to the delay and jitter of the larger problem of the existing robust routing scheme. Explore the the Hose model under the dynamic QoS (Quality of Serive Quality of Service) routing problem and propose a heuristic algorithm. The algorithm is based on the level of service of the connection request, this network service transmission, and idle the number of wavelengths on each link to dynamically adjust the route. Compared with the existing dynamic robust routing algorithm, the proposed algorithm has superior performance. Fourth, research the robust single link in WDM mesh networks invulnerability design problems, and the two shared protection heuristic algorithm. The simulation results show that the two algorithms within the scope of their application are significant performance advantages: the relative invulnerability algorithm previously robust overhead and recovery time, they have a more significant improvement. Fifth discussed based on the dynamic the Hose model of multi-failure survivability. For two main ideas: (1) adopt a classification protected; (2) the introduction of the concept of the \In accordance with these two ideas, the authors propose a heuristic algorithm, and its effectiveness is verified by simulation. The second chapter discussed from three aspects the robust routing WDM mesh networks under Hose volume of business model: (1) Hose model the static robust routing problem; matrix part of (2) the volume of business to ascertain ( the robust routing case refers to the part of the network between the nodes on the size of the business needs known); (3) the Hose model under the dynamic robust routing problem. Problem (1) of the cost of the whole network minimum target and two, respectively, based on the single-path routing (Single Path Routing, SPR) routing structure and Valiant load balancing (Valiant Load-balancing the VLB) routing structure mathematical planning (MP, Mathematical Programming) model. Wavelength optical transceivers, as well as wavelength converters and other resources can be informed of the best equipped to solve the mathematical model. As the robust optimization in WDM network routing problem is NP-complete (NP-complete, NPC), so the authors also proposed two based SPR and VLB heuristic algorithm - IBFS (Iterative Breadth-first Search) algorithm and MNC (Maximizing Network Capability) algorithm. Computer simulations show that the two algorithms have the good performance of the MNC algorithm has better scalability in large-scale network performance is significantly better than the previous program. Problem (2), based on the observation of changes in the volume of business, on the basis of the VLB adaptive load balancing (Adaptive Load-balancing, ALB) mechanism, and gives a heuristic algorithm - ADT (Adding Direct Traffic) algorithm. The core idea is the use of point-to-point traffic information known, as little as possible to adjust the virtual topology VLB established two-hop by hop routing transmission more business, so as to achieve adaptive load balancing mechanism reduce the delay and jitter purpose. The simulation results show that with high throughput, ALB can provide better quality of service than VLB. For problem (3), the authors consider a fully connected logical topology proposed heuristic algorithm DDALB (Differentiated Dynamic Adaptive Load-balancing). Chapter III of this article to Chapter study WDM mesh networks robust in under Hose uncertain model invulnerability. Chapters III and IV studies (Single-link Failure) single link failure and link failure the invulnerability (Correlated-link Failure) case design problem, while the fifth chapter of multi-network component failure ( Multiple Failures) invulnerability issues were discussed. Of two, respectively, based on the shared VPN tree routing and Valiant load balancing mechanism segment protection (Shared Segment Protection, SSP) heuristic algorithm - TSSP (Tree-based Shared-segment Protection) algorithm to solve the single link failure and the VLB-SSP (VLB-based Shared-segment Protection) algorithm. In resource allocation, TSSP algorithm through reducing working tree leaf node (ie tree topology moderate as a node) number to reduce the working path (Work Path, WP) and protection path (Backup Path, BP) number thereby effectively utilizing resources; VLB-SSP through minimize the cost of the whole network configuration of working and protection wavelengths to reduce overhead. Fault recovery, two algorithms are used to segment protection mechanism, and therefore the speed of recovery is also faster. For related link invulnerability, this study is divided into two areas. (1) for the dual-link failures to the survivability of design issues, the authors propose a heuristic protection algorithm - DVLBSP (Differentiated VLB Shared Protection) algorithm. The algorithm follows the grading protection (Differentiated Protection) thought the protection path, given only does not meet the reliability requirements of the working path seeking protection path; while also taking into consideration of the whole network of the business model and the network topology, combined the shared protection ideological configuration to protect the wavelength. The simulation results show that DVLBSP algorithm to achieve a better trade-off between cost and reliability. (2) Shared Risk Link Group (Shared Risk Link Group, SRLG) invulnerability, the authors propose a heuristic algorithm PSPPKT (Partial SRLG-disjoint Protection with Partially Known Traffic), and demonstrated its effectiveness through computer simulation . For multi-network component failures, of the protection and restoration (Restoration) the two Invulnerability programs combine heuristic algorithm based on adaptive load balancing mechanism CAL (Criticality Avoidance Load-balancing). The simulation results can be seen, the CAL algorithm is a more practical dynamic Hose volume of business model-based multi-network parts invulnerability program. For validation and assessment of the proposed performance of various algorithms, the author has developed simulation platform. Chapter VI of this simulation platform, and gives important pseudo-code. Chapter VII is the full text summary.

Related Dissertations

  1. Study on Site Selection of Ecological Food Franchisees in Jiaxiang, Taiyuan,F426.82
  2. Research of Vehicle Scheduling Problem Based on Ant Colony Algorithm,TP301.6
  3. The Research of Signal Detecting Algorithms and Improved Sphere Detecting Algorithms in MIMO Systems,TN919.3
  4. Hysteresis -based optimization of vehicle routing problem,O224
  5. Parallel sorting multiple orders optimization problem,F224
  6. Aircraft assembly moving assembly line job scheduling optimization,V262.43
  7. Flexible resource scheduling algorithm for dynamic combinatorial production and realization,F426.8
  8. Resource-based needs analysis study time production plant logistics optimization,F426.471
  9. Study on Mixed Model Line Balancing with Human Factors Under Make-to-Order Environment,F273;F224
  10. Application Research of Critical Chain Project Method in Project Schedule Management,F224
  11. Distribution center location based on the supply chain environment research,F224
  12. A Flow-shop S with Parameters Research of Complexity and Heuristic Lgorithms for the Parallel Machine and Cheduling Problems,O223
  13. Study on Attribute Reduction Algorithms Based on Rough Sets,TP18
  14. Design and Implementation of the 110 police line optimization system,TP301.6
  15. Two Kinds of Double Objective Functions Scheduling Problem Reserch,O223
  16. Integrated Batch Planning Research of Steelmaking Based on Robust Optimization Method,TF758
  17. Preliminary Design and Development for Roller Heating Process Management and Decision Support System,TP311.52
  18. Research and Application on Matching Method of Vessels and Cargos in Ocean Shipping Market,F224
  19. Applications of the Heuristic Algorithm on Military Goods-load,E075
  20. Scheduling and Process Monitoring System of Steelmaking-Refining-Continuous Casting Production,TP277
  21. Design and Implementation of Web-based Free Pickup & Delivery to Airport Service System,TP311.52

CLC: > Industrial Technology > Radio electronics, telecommunications technology > Wireless communications > Lightwave communications, laser communications
© 2012 www.DissertationTopic.Net  Mobile