Fault Tolerant System for Sparse Traffic Grooming in Optical WDM Mesh Networks Using Combiner Queue
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 3
Abstract
Queuing theory is an important concept in current internet technology. As the requirement of bandwidth goes on increasing it is necessary to use optical communication for transfer of data. Optical communication at backbone network requires various devices for traffic grooming. The cost of these devices is very high which leads to increase in the cost of network. One of the solutions to this problem is to have sparse traffic grooming in optical WDM mesh network. Sparse traffic grooming allows only few nodes in the network as grooming node (G-node). These G-nodes has the grooming capability and other nodes are simple nodes where traffic grooming is not possible. The grooming nodes are the special nodes which has high cost. The possibility of faults at such a node, or link failure is high. Resolving such faults and providing efficient network is very important. So we have importance of such survivable sparse traffic grooming network. Queuing theory helps to improve the result of network and groom the traffic in the network. The paper focuses on the improvement in performance of the backbone network and reduction in blocking probability. To achieve the goals of the work we have simulated the model. The main contribution is to use survivability on the sparse grooming network and use of combiner queues at each node. It has observed that Combiner queuing alone does the job of minimizing blocking probability and balancing the load over the network. The model is not only cost effective but also increases the performance of network and minimizes the call blocking probability
Authors and Affiliations
Sandip Shinde, Dr. Suhas Patil, Dr. S. Roslin, Archana Shinde
Keywords
Related Articles
- EP ID EP159320
- DOI 10.14569/IJACSA.2016.070324
- Views 117
- Downloads 0
Comparison of 2D and 3D Local Binary Pattern in Lung Cancer Diagnosis
Comparative study between 2D and 3D Local Binary Patter (LBP) methods for extraction from Computed Tomography (CT) imagery data in lung cancer diagnosis is conducted. The lung image classification is performed usi...
Value based PSO Test Case Prioritization Algorithm
Regression testing is performed to see if any changes introduced in software will not affect the rest of functional software parts. It is inefficient to re-execute all test cases every time the changes are made. In this...
An Investigation into the Suitability of k-Nearest Neighbour (k-NN) for Software Effort Estimation
Software effort estimation is an increasingly significant field, due to the overwhelming role of software in today’s global market. Effort estimation involves forecasting the effort in person-months or hours required for...
Ranking Method in Group Decision Support to Determine the Regional Prioritized Areas and Leading Sectors using Garrett Score
The main objective of regional development is to achieve equal development in different regions. However, the long duration and complexity of the process may result in the unequal development of some regions. In order to...
Gatekeepers Practices in Knowledge Diffusion within Saudi Organizations: KFMC Case Study
Gatekeepers in organizations play a critical role in terms of disseminating and transferring outside knowledge into their groups. This research contributes in identifying the gatekeepers' practices in terms of gathering,...