Knapsack based multicast traffic grooming for optical networks

Pradhan, Ashok Kumar; Chatterjee, Bijoy Chand; Oki, Eiji; De, Tanmay

doi:10.1016/j.osn.2017.08.002

Cited by 5 publications

(1 citation statement)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The heuristic light tree dependent methodology which had been developed known by the name, 0/1 knapsack dependent multi-cast grooming of traffic [14]. They devised this methodology for reducing the cost incurred in networking by making sure of limited counts of several layered optical and electronic components such as splitters, transmitters, and receivers along with the consumed wavelengths while networking.…”

Section: Related Workmentioning

confidence: 99%

Optimized Traffic Grooming through modified PSO based Iterative Hungarian algorithm in Optical Networks

Kumarnath

Batri

2021

ITC

View full text Add to dashboard Cite

Due to huge size of the data and quick transmission of data between the nodes present in the optical network, a condition of network traffic is created among the nodes of the network. This issue of traffic can be overcome by employing numerous traffic grooming techniques. In this research paper, the best suitable shortest path is determined by the multi objective modified PSO algorithm and an innovative visibility graph based Iterative Hungarian Traffic grooming algorithm is implemented to reduce the blocking ratio through improving the allocation of bandwidth between the users. Then finally the performance analysis is carried out by means of performance measures such as traffic throughput, transceivers count, average propagation delay, blocking ratio, and success ratio. It can be inferred that the proposed work obtains enhanced outcomes when compared to the other existing techniques.

show abstract

Section: Related Workmentioning

confidence: 99%