Abstract
All-to-all personalized communication (AAPC) requires each of the N nodes in a network to send a unique message to each of the other N - 1 nodes. In this paper, we study the problem of scheduling AAPC in WDM rings with K wavelengths and T transmitter-receiver pairs per node. We first determine the theoretical lower bound on the schedule length in a unidirectional ring with negligible tuning delay. A scheduling method based on a 'recursive packing procedure' is then proposed. Two extensions of the above work are also made. First, we use a similar method to schedule AAPC in bidirectional rings with a small T, which achieves a better schedule performance than the method in reference one. Second, we modify the schedule to take into account the effects of non-negligible tuning delay. The schedules derived in this paper can achieve the minimum length for some values of K and T, and a near minimum length in other cases.© (1997) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
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.
