Abstract

This paper compares two path selection strategies for optical burst switching networks: a) the path from source to destination is chosen randomly from the set of the k shortest paths; b) the path selection is based on a probabilistic model for the link demands. In the second strategy, the set of shortest paths from source to destination is ranked according to the probability of their overall link demands. The path selection schemes are evaluated for a specific scenario of grid over OBS networks. Our results show that, in general, the probabilistic model outperforms the random k shortest path routing scheme, this improvement is relevant for small job sizes.

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 call

Disclaimer: 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.