Heuristics for Sparse Traffic Grooming in Dynamic WDM Optical Mesh Networks

Shinde, Sandip R.; Patil, Suhas H.

doi:10.1109/iccubea.2015.36

Cited by 6 publications

(8 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shengfeng Zhang [4] proposed some traffic partitioning strategies over sparse traffic grooming to improve the results. Sandip Shinde [5] proposed a heuristics method. This method proposed for sparse traffic grooming.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The node with greater weight count has the maximum probability to be selected as grooming node. Also, Sandip Shinde [6] proposed a modified multiobjective meta heuristics based on the heuristics proposed in [5]. The method proposed in [5], [6] are proved to be the best for reducing the blocking probability and improve the network performance for sparse traffic grooming.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Combiner Queues for Survivability in Optical WDM Mesh Network

Shinde¹,

Roslin²,

Patil³

2018

jcm

Self Cite

View full text Add to dashboard Cite

Survivability is the major problem in Wavelength Division Multiplexed (WDM) Optical network. Also, the selection of grooming node is another important issue in the Optical Mesh Network. Most of the work in the field of the optical network is focused of sparse traffic grooming and survivability as a separate issue. We here presented a novel approach for providing survivability to sparse traffic grooming. This survivability on sparse traffic grooming is considered for the failure of a link on sparse grooming network. When we have sparse grooming network and a link failure occurs then we are providing a solution of shared link using combiner queues. We have proved that the combiner queues help to reduce the blocking probability and also reduce the number of call dropping. We have presented the queuing model which helps to calculate the total requests at a node or in the entire network. The presented combiner queuing model is useful for the calculation of probabilities, as m server queuing system.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Combiner Queues for Survivability in Optical WDM Mesh Network

Shinde¹,

Roslin²,

Patil³

2018

jcm

Self Cite

View full text Add to dashboard Cite

show abstract

“…The other is ordinary nongrooming node, called -node, which can only switch the whole input traffic to the output port. The network, configured with -node and -node, is called sparse grooming networks [12,13]. However, in sparse grooming networks, since the -node has no ability to groom the low-speed traffic, it would lead to the unreasonable use of network wavelength resource, and the network performance will ebb.…”

Section: Introductionmentioning

confidence: 99%

A Grooming Nodes Optimal Allocation Method for Multicast in WDM Networks

Wei

Shen

Liu

et al. 2016

Advances in OptoElectronics

View full text Add to dashboard Cite

The grooming node has the capability of grooming multicast traffic with the small granularity into established light at high cost of complexity and node architecture. In the paper, a grooming nodes optimal allocation (GNOA) method is proposed to optimize the allocation of the grooming nodes constraint by the blocking probability for multicast traffic in sparse WDM networks. In the proposed GNOA method, the location of each grooming node is determined by the SCLD strategy. The improved smallest cost largest degree (SCLD) strategy is designed to select the nongrooming nodes in the proposed GNOA method. The simulation results show that the proposed GNOA method can reduce the required number of grooming nodes and decrease the cost of constructing a network to guarantee a certain request blocking probability when the wavelengths per fiber and transmitter/receiver ports per node are sufficient for the optical multicast in WDM networks.

show abstract

“…G-nodes are selected based on various factors such as nodal degree, maximum traffic node, any random m nodes, etc. But any of these methods does not give the best solutions we are using the heuristic in [14] by applying combiner Queue to the nodes.…”

Section: Survivable Sparse Traffic Grooming Using Combiner Queuesmentioning

confidence: 99%

“…al. [14] heuristic algorithms are proposed for G-node selection. On the selected G-node grooming will be performed which results in efficient solution.…”

Section: Literature Reviewmentioning

confidence: 99%

Fault Tolerant System for Sparse Traffic Grooming in Optical WDM Mesh Networks Using Combiner Queue

Shinde¹,

Patil²,

Roslin³

et al. 2016

ijacsa

View full text Add to dashboard Cite

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.

show abstract

Heuristics for Sparse Traffic Grooming in Dynamic WDM Optical Mesh Networks

Cited by 6 publications

References 11 publications

Combiner Queues for Survivability in Optical WDM Mesh Network

Combiner Queues for Survivability in Optical WDM Mesh Network

A Grooming Nodes Optimal Allocation Method for Multicast in WDM Networks

Fault Tolerant System for Sparse Traffic Grooming in Optical WDM Mesh Networks Using Combiner Queue

Contact Info

Product

Resources

About