Light-tree based multicast traffic grooming in WDM mesh networks
Rongping Lin, Wen‐De Zhong, Sanjay K. Bose, Moshe Zukerman, Qirui Huang
Abstract
Rongping Lin, Wen‐De Zhong, Sanjay K. Bose, Moshe Zukerman, Qirui Huang
Abstract
To multiplex or groom multiple low bandwidth connections into a high bandwidth wavelength channel is called traffic grooming in wavelength-division multiplexing (WDM) mesh networks. This paper proposes a light-tree-based mathematical formulation to provide optimal assignments of light-trees for multicast traffic grooming in order to maximize network throughput. Simulations show the validity of the formulation.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
To multiplex or groom multiple low bandwidth connections into a high bandwidth wavelength channel is called traffic grooming in wavelength-division multiplexing (WDM) mesh networks. This paper proposes a light-tree-based mathematical formulation to provide optimal assignments of light-trees for multicast traffic grooming in order to maximize network throughput. Simulations show the validity of the formulation.
Key concepts: Traffic grooming, Multicast, Computer network, Computer science, Wavelength-division multiplexing, Bandwidth (computing), Multiplexing, Distributed computing