Abstract
We show how a mixed routing strategy can be used for burst switching in all-optical networks. This new routing strategy combines deflection routing and convergence routing. Deflection routing is known to avoid deadlocks but livelocks may occur (packets move but never reach their destination) while convergence routing provides deterministic transport delays but has a very low network utilization. The convergence routing is based on a decomposition of the grid into two Eulerian directed cycles. The routing strategy permits the shortening of the ending guarantee; it is almost as efficient as deflection routing and it is consistent with the bursts we consider in the ROMEO project. We also compute the probability of failure insertion.
This work has been supported by the French RNRT project ROMEO.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barth, D., Berthomé, P., Borrero, A., Fourneau, J.-M., Laforest, C., Quessette, F., Vial, S.: Performance Comparisons of Eulerian Routing and Deection Routing in a 2D-Mesh All Optical Network. In: Proceedings of the 15th European Simulation Multiconference, pp. 887–891 (2001)
Barth, D., Berthomé, P., Cohen, J.: The Eulerian Stretch of a Digraph and the Ending Guarantee of a Convergence Routing. Technical Report A00-R-400, LORIA, BP 239, F54506 Vandoeuvre-ls-Nancy, France (2000)
Barth, D., Berthomé, P., Czachorski, T., Fourneau, J.-M., Laforest, C., Vial, S.: A Mixed Deflection and Eulerian Routing Algorithm: Design and Performance. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 767–774. Springer, Heidelberg (2002)
Brassil, J.C., Cruz, R.L.: Bounds on Maximum Delay in Networks with Deection Routing. IEEE Transactions on Parallel and Distributed Systems 6, 724–732 (1995)
Gravey, P., Gosselin, S., Guillemot, C., Chiaroni, D., Le Sauze, N., Jourdan, A., Dotaro, E., Barth, D., Berthomé, P., Laforest, C., Vial, S., Atmaca, T., Hébuterne, G., El Biaze, H., Laalaoua, R., Gangloff, E., Kotuliak, I.: Multiservice Optical Network: Main Concepts and First Achievements of the ROM Program. Journal of Ligthwave Technology 19, 23–31 (2001)
Laforest, C., Vial, S.: Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks. In: Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), Fort Lauderdale, FL, USA, IEEE Computer Society, Los Alamitos (2002)
Ofek, Y., Yung, M.: Principles for High Speed Network Control: Loss-Less and Deadlock-Freeness, Self-routing and a Single Buffer per Link. In: ACM Symposium on Principles of Distributed Computing, pp. 161–175 (1990)
Qiao, C., Yoo, M.: Optical Burst Switching (OBS) - A New Paradigm for an Optical Internet. Journal of High Speed Networks 8, 69–84 (1999)
Schuster, A.: Bounds and Analysis Techniques for Greedy Hot-Potato Routing. In: Berthomé, P., Ferrira, A. (eds.) Optical Interconnections and Parallel Processing: The Interface, pp. 284–354. Kluwer Academic Publishers, Dordrecht (1997)
Xu, L., Perros, H.G., Rouskas, G.: Techniques for Optical Packet Switching and Optical Burst Switching. IEEE Communications Magazine 39, 136–142 (2001)
Yener, B., Matsoukas, S., Ofek, Y.: Iterative Approach to Optimizing Convergence Routing Priorities. IEEE/ACM Transactions on Networking 5, 530–542 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fourneau, JM., Nott, D. (2004). Mixed Routing for ROMEO Optical Burst. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30182-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23526-2
Online ISBN: 978-3-540-30182-0
eBook Packages: Springer Book Archive