Abstract
A light trail is a unidirectional bus from a convener node to an end node. The main advantage of a light trail over a light path is that the communication channel of a light trail can be accessed by intermediate nodes providing more flexibility for traffic grooming. Several auxiliary graph models have been developed in the literature for traffic grooming in light-trail optical WDM mesh networks. These auxiliary graph models have one or more drawbacks that do not fully reflect the characteristics of a light trail. This paper develops a novel auxiliary graph model that has none of the drawbacks and is able to reflect all characteristics of a light trail. Based on the auxiliary graph model, two effective dynamic traffic grooming algorithms are proposed. The proposed dynamic traffic grooming algorithms are shown to yield low request blocking ratio.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
