Abstract

We present two routing algorithms based on deflection and convergence, which are able to provide high bandwidth and an ending guarantee for the end-to-end delay in a core network. We study the performance of these routing techniques by using simulations, and we prove the bounds on the delay.

© 2009 Optical Society of America

Full Article  |  PDF Article

References

  • View by:
  • |
  • |
  • |

  1. L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
    [CrossRef]
  2. P. Baran, “On distributed communication networks,” IEEE Trans. Commun. Syst., vol. CS-12, pp. 1–9, 1964.
  3. Y. Ofek, M. Yung, “Principles for high speed network control: loss-less and deadlock-freeness, self-routing and a single buffer per link,” in Annu. ACM Symp. on Principles of Distrib uted Computing, Quebec City, Canada, 1990, pp. 161–175.
  4. J. C. Brassil, R. L. Cruz, “Bounds on maximum delay in networks with deflection routing,” IEEE Trans. Parallel Distrib. Syst., vol. 6, no. 7, pp. 724–732, 1995.
    [CrossRef]
  5. A. Schuster, “Bounds and analysis techniques for greedy hot-potato routing,” in Optical Interconnections and Parallel Processing: The Interface, Norwell, MA: Kluwer Academic, 1997, pp. 284–354.
  6. D. Barth, P. Berthomé, J. Cohen, “The Eulerian stretch of a digraph and the ending guarantee of a convergence routing,” J. Interconnect. Netw. (JOIN), vol. 5, no. 2, pp. 93–109, 2004.
    [CrossRef]
  7. C. Laforest, S. Vial, “Short cut Eulerian routing of datagrams in all optical point-to-point networks,” in Proc. Int. Parallel and Distributed Processing Symp., IPDPS 2002, Abstracts and CD-ROM, Ft. Lauderdale, FL, Apr. 15–19, 2002, vol. 1, pp. 39–44.
  8. D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.
  9. C. Berge, Graphs and Hypergraphs, Amsterdam, North Holland, 1973.
  10. P. Ferguson, G. Huston, Quality of Service: Delivering QoS on the Internet and in Corporate Networks. New York, NY: Wiley, 1999.
  11. B. Hajek, “Bounds on evacuation time for deflection routing,” Distrib. Comput., vol. 5, no. 1, pp. 1–6, 1991.
    [CrossRef]
  12. B. Yener, S. Matsoukas, Y. Ofek, “Iterative approach to optimizing convergence routing priorities,” IEEE/ACM Trans. Netw., vol. 5, no. 4, pp. 530–542, Aug. 1997.
    [CrossRef]
  13. U. Feige, R. Krauthgamer, “Networks on which hot-potato routing does not livelock,” Distrib. Comput., vol. 13, pp. 53–58, 2000.
    [CrossRef]
  14. U. Feige, “Observations on hot potato routing,” in 3rd Israel Symp. on the Theory of Computing and Systems, 1995. Proceedings, Tel Aviv, Israel, Jan. 4–61995, pp. 30–39.
  15. A. Symvonis, “A note on deflection routing on undirected graphs,” University of Sydney, Dept. of Computer Science, Tech. Rep. TR94-493, 1994.
  16. A. Mayer, Y. Ofek, M. Yung, “Local fairness in general-topology networks with convergence routing,” in IEEE INFO COM '95. Fourteenth Annu. Joint Conf. of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings, Boston, MA, Apr. 2–6, 1995, vol. 2, pp. 891–899.
  17. B. Yener, T. Boult, Y. Ofek, “Hamiltonian decompositions of regular topology networks with convergence routing,” Columbia University, Computer Science Department, Tech. Rep. CUCS-011094, 1994.
  18. D. Barth, P. Berthomé, T. Czarchoski, F. J.-M., C. Laforest, S. Vial, “A mixed deflection and convergence routing algorithm: design and performance,” in Euro-Par 2002 Parallel Processing, vol. 2400 of Lecture Notes in Computer Science, Berlin: Springer, 2002, pp. 767–774.
    [CrossRef]
  19. S. Mneimneh, G. Damm, F. Verchère, F. Quessette, “Minimum deflection routing in bufferless networks,” U.S. Patent Application 20040022240, Feb. 5, 2004.
  20. S. Mneimneh, F. Quessette, “Linear complexity algorithms for maximum advance deflection routing in some networks,” in 2006 Workshop on High Performance Switching and Routing, Poznan, Poland, 2006, pp. 1–7.
  21. D. Barth, P. Berthomé, C. Laforest, S. Vial, “Some Eulerian parameters about performances of a convergence routing in the 2D-mesh network,” LRI, Tech. Rep. LRI-1346, Jan. 2003.
  22. P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, I. Kotuliak, “Multiservice optical network: main concepts and first achievements of the ROM program,” J. Lightwave Technol., vol. 19, pp. 23–31, Jan. 2001.
    [CrossRef]
  23. A. Borrero, J.-M. Fourneau, F. Quessette, “Packet selection in a deflection routing algorithm,” in Proc. of the 17th Int. Symp. on Computer and Information Sciences, Orlando, FL, Oct. 28–30, 2002, pp. 103–114.
  24. K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.
  25. M. Veran, D. Potier, “QNAP-2: A Portable Environment for Queueing Network,” in Modelling Techniques and Tools for Performance Analysis. Amsterdam: North-Holland, 1985, pp. 25–63.
  26. D. Barth, J.-M. Fourneau, D. Nott, D. Chiaroni, “Routing and QoS in an all-optical packet network,” in 2nd Int. Conf. on Broadband Networks, 2005. BroadNets 2005, Boston, MA, Oct. 7, 2005, vol. 2, pp. 1063–1072.
  27. D. Barth, J.-M. Fourneau, D. Nott, “Two cycles routing and end to end delay bound in all optical network,” presented at Int. Conf. on Photonics in Switching 2008 (PS 2008), Sapporo, Japan, Aug. 4–7, 2008, poster session.
  28. D. Barth, N. Pires, “Robustesse du routage eulérien dans le réseau ROMEO,” Université de Versailles—St. Quentin, 2005, http://www.prism.uvsq.fr/rapports/2005/document_2005_87.doc.

2004 (1)

D. Barth, P. Berthomé, J. Cohen, “The Eulerian stretch of a digraph and the ending guarantee of a convergence routing,” J. Interconnect. Netw. (JOIN), vol. 5, no. 2, pp. 93–109, 2004.
[CrossRef]

2003 (1)

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

2001 (1)

2000 (1)

U. Feige, R. Krauthgamer, “Networks on which hot-potato routing does not livelock,” Distrib. Comput., vol. 13, pp. 53–58, 2000.
[CrossRef]

1997 (1)

B. Yener, S. Matsoukas, Y. Ofek, “Iterative approach to optimizing convergence routing priorities,” IEEE/ACM Trans. Netw., vol. 5, no. 4, pp. 530–542, Aug. 1997.
[CrossRef]

1995 (1)

J. C. Brassil, R. L. Cruz, “Bounds on maximum delay in networks with deflection routing,” IEEE Trans. Parallel Distrib. Syst., vol. 6, no. 7, pp. 724–732, 1995.
[CrossRef]

1991 (1)

B. Hajek, “Bounds on evacuation time for deflection routing,” Distrib. Comput., vol. 5, no. 1, pp. 1–6, 1991.
[CrossRef]

1964 (1)

P. Baran, “On distributed communication networks,” IEEE Trans. Commun. Syst., vol. CS-12, pp. 1–9, 1964.

Amin, A. A.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

Atmaca, T.

Baran, P.

P. Baran, “On distributed communication networks,” IEEE Trans. Commun. Syst., vol. CS-12, pp. 1–9, 1964.

Barth, D.

D. Barth, P. Berthomé, J. Cohen, “The Eulerian stretch of a digraph and the ending guarantee of a convergence routing,” J. Interconnect. Netw. (JOIN), vol. 5, no. 2, pp. 93–109, 2004.
[CrossRef]

P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, I. Kotuliak, “Multiservice optical network: main concepts and first achievements of the ROM program,” J. Lightwave Technol., vol. 19, pp. 23–31, Jan. 2001.
[CrossRef]

D. Barth, J.-M. Fourneau, D. Nott, D. Chiaroni, “Routing and QoS in an all-optical packet network,” in 2nd Int. Conf. on Broadband Networks, 2005. BroadNets 2005, Boston, MA, Oct. 7, 2005, vol. 2, pp. 1063–1072.

D. Barth, J.-M. Fourneau, D. Nott, “Two cycles routing and end to end delay bound in all optical network,” presented at Int. Conf. on Photonics in Switching 2008 (PS 2008), Sapporo, Japan, Aug. 4–7, 2008, poster session.

D. Barth, N. Pires, “Robustesse du routage eulérien dans le réseau ROMEO,” Université de Versailles—St. Quentin, 2005, http://www.prism.uvsq.fr/rapports/2005/document_2005_87.doc.

D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.

D. Barth, P. Berthomé, T. Czarchoski, F. J.-M., C. Laforest, S. Vial, “A mixed deflection and convergence routing algorithm: design and performance,” in Euro-Par 2002 Parallel Processing, vol. 2400 of Lecture Notes in Computer Science, Berlin: Springer, 2002, pp. 767–774.
[CrossRef]

D. Barth, P. Berthomé, C. Laforest, S. Vial, “Some Eulerian parameters about performances of a convergence routing in the 2D-mesh network,” LRI, Tech. Rep. LRI-1346, Jan. 2003.

Berde, B.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Berge, C.

C. Berge, Graphs and Hypergraphs, Amsterdam, North Holland, 1973.

Berthomé, P.

D. Barth, P. Berthomé, J. Cohen, “The Eulerian stretch of a digraph and the ending guarantee of a convergence routing,” J. Interconnect. Netw. (JOIN), vol. 5, no. 2, pp. 93–109, 2004.
[CrossRef]

P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, I. Kotuliak, “Multiservice optical network: main concepts and first achievements of the ROM program,” J. Lightwave Technol., vol. 19, pp. 23–31, Jan. 2001.
[CrossRef]

D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.

D. Barth, P. Berthomé, C. Laforest, S. Vial, “Some Eulerian parameters about performances of a convergence routing in the 2D-mesh network,” LRI, Tech. Rep. LRI-1346, Jan. 2003.

D. Barth, P. Berthomé, T. Czarchoski, F. J.-M., C. Laforest, S. Vial, “A mixed deflection and convergence routing algorithm: design and performance,” in Euro-Par 2002 Parallel Processing, vol. 2400 of Lecture Notes in Computer Science, Berlin: Springer, 2002, pp. 767–774.
[CrossRef]

Borrero, A.

A. Borrero, J.-M. Fourneau, F. Quessette, “Packet selection in a deflection routing algorithm,” in Proc. of the 17th Int. Symp. on Computer and Information Sciences, Orlando, FL, Oct. 28–30, 2002, pp. 103–114.

D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.

Boult, T.

B. Yener, T. Boult, Y. Ofek, “Hamiltonian decompositions of regular topology networks with convergence routing,” Columbia University, Computer Science Department, Tech. Rep. CUCS-011094, 1994.

Brassil, J. C.

J. C. Brassil, R. L. Cruz, “Bounds on maximum delay in networks with deflection routing,” IEEE Trans. Parallel Distrib. Syst., vol. 6, no. 7, pp. 724–732, 1995.
[CrossRef]

Callegati, F.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Cerroni, W.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Chiaroni, D.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, I. Kotuliak, “Multiservice optical network: main concepts and first achievements of the ROM program,” J. Lightwave Technol., vol. 19, pp. 23–31, Jan. 2001.
[CrossRef]

D. Barth, J.-M. Fourneau, D. Nott, D. Chiaroni, “Routing and QoS in an all-optical packet network,” in 2nd Int. Conf. on Broadband Networks, 2005. BroadNets 2005, Boston, MA, Oct. 7, 2005, vol. 2, pp. 1063–1072.

Cohen, J.

D. Barth, P. Berthomé, J. Cohen, “The Eulerian stretch of a digraph and the ending guarantee of a convergence routing,” J. Interconnect. Netw. (JOIN), vol. 5, no. 2, pp. 93–109, 2004.
[CrossRef]

Cruz, R. L.

J. C. Brassil, R. L. Cruz, “Bounds on maximum delay in networks with deflection routing,” IEEE Trans. Parallel Distrib. Syst., vol. 6, no. 7, pp. 724–732, 1995.
[CrossRef]

Czarchoski, T.

D. Barth, P. Berthomé, T. Czarchoski, F. J.-M., C. Laforest, S. Vial, “A mixed deflection and convergence routing algorithm: design and performance,” in Euro-Par 2002 Parallel Processing, vol. 2400 of Lecture Notes in Computer Science, Berlin: Springer, 2002, pp. 767–774.
[CrossRef]

Damm, G.

S. Mneimneh, G. Damm, F. Verchère, F. Quessette, “Minimum deflection routing in bufferless networks,” U.S. Patent Application 20040022240, Feb. 5, 2004.

Dembeck, L.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Develder, C.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Dittman, L.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Dotaro, E.

Eilenberger, G.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

El Biaze, H.

Feige, U.

U. Feige, R. Krauthgamer, “Networks on which hot-potato routing does not livelock,” Distrib. Comput., vol. 13, pp. 53–58, 2000.
[CrossRef]

U. Feige, “Observations on hot potato routing,” in 3rd Israel Symp. on the Theory of Computing and Systems, 1995. Proceedings, Tel Aviv, Israel, Jan. 4–61995, pp. 30–39.

Ferguson, P.

P. Ferguson, G. Huston, Quality of Service: Delivering QoS on the Internet and in Corporate Networks. New York, NY: Wiley, 1999.

Fourneau, J.

D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.

Fourneau, J.-M.

A. Borrero, J.-M. Fourneau, F. Quessette, “Packet selection in a deflection routing algorithm,” in Proc. of the 17th Int. Symp. on Computer and Information Sciences, Orlando, FL, Oct. 28–30, 2002, pp. 103–114.

D. Barth, J.-M. Fourneau, D. Nott, “Two cycles routing and end to end delay bound in all optical network,” presented at Int. Conf. on Photonics in Switching 2008 (PS 2008), Sapporo, Japan, Aug. 4–7, 2008, poster session.

D. Barth, J.-M. Fourneau, D. Nott, D. Chiaroni, “Routing and QoS in an all-optical packet network,” in 2nd Int. Conf. on Broadband Networks, 2005. BroadNets 2005, Boston, MA, Oct. 7, 2005, vol. 2, pp. 1063–1072.

Gangloff, E.

Gosselin, S.

Gravey, P.

Guillemot, C.

Hajek, B.

B. Hajek, “Bounds on evacuation time for deflection routing,” Distrib. Comput., vol. 5, no. 1, pp. 1–6, 1991.
[CrossRef]

Hébuterne, G.

Huston, G.

P. Ferguson, G. Huston, Quality of Service: Delivering QoS on the Internet and in Corporate Networks. New York, NY: Wiley, 1999.

Imaizumi, H.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

J.-M., F.

D. Barth, P. Berthomé, T. Czarchoski, F. J.-M., C. Laforest, S. Vial, “A mixed deflection and convergence routing algorithm: design and performance,” in Euro-Par 2002 Parallel Processing, vol. 2400 of Lecture Notes in Computer Science, Berlin: Springer, 2002, pp. 767–774.
[CrossRef]

Jourdan, A.

Koerber, W.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Kotuliak, I.

Krauthgamer, R.

U. Feige, R. Krauthgamer, “Networks on which hot-potato routing does not livelock,” Distrib. Comput., vol. 13, pp. 53–58, 2000.
[CrossRef]

Laalaoua, R.

Laforest, C.

P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, I. Kotuliak, “Multiservice optical network: main concepts and first achievements of the ROM program,” J. Lightwave Technol., vol. 19, pp. 23–31, Jan. 2001.
[CrossRef]

D. Barth, P. Berthomé, T. Czarchoski, F. J.-M., C. Laforest, S. Vial, “A mixed deflection and convergence routing algorithm: design and performance,” in Euro-Par 2002 Parallel Processing, vol. 2400 of Lecture Notes in Computer Science, Berlin: Springer, 2002, pp. 767–774.
[CrossRef]

D. Barth, P. Berthomé, C. Laforest, S. Vial, “Some Eulerian parameters about performances of a convergence routing in the 2D-mesh network,” LRI, Tech. Rep. LRI-1346, Jan. 2003.

D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.

C. Laforest, S. Vial, “Short cut Eulerian routing of datagrams in all optical point-to-point networks,” in Proc. Int. Parallel and Distributed Processing Symp., IPDPS 2002, Abstracts and CD-ROM, Ft. Lauderdale, FL, Apr. 15–19, 2002, vol. 1, pp. 39–44.

Le Sauze, N.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, I. Kotuliak, “Multiservice optical network: main concepts and first achievements of the ROM program,” J. Lightwave Technol., vol. 19, pp. 23–31, Jan. 2001.
[CrossRef]

Leligou, N.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Mahony, M.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Matsoukas, S.

B. Yener, S. Matsoukas, Y. Ofek, “Iterative approach to optimizing convergence routing priorities,” IEEE/ACM Trans. Netw., vol. 5, no. 4, pp. 530–542, Aug. 1997.
[CrossRef]

Matsumoto, N.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

Mayer, A.

A. Mayer, Y. Ofek, M. Yung, “Local fairness in general-topology networks with convergence routing,” in IEEE INFO COM '95. Fourteenth Annu. Joint Conf. of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings, Boston, MA, Apr. 2–6, 1995, vol. 2, pp. 891–899.

Mneimneh, S.

S. Mneimneh, F. Quessette, “Linear complexity algorithms for maximum advance deflection routing in some networks,” in 2006 Workshop on High Performance Switching and Routing, Poznan, Poland, 2006, pp. 1–7.

S. Mneimneh, G. Damm, F. Verchère, F. Quessette, “Minimum deflection routing in bufferless networks,” U.S. Patent Application 20040022240, Feb. 5, 2004.

Morikawa, H.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

Mortensen, B.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Nakano, Y.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

Neri, F.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Nott, D.

D. Barth, J.-M. Fourneau, D. Nott, D. Chiaroni, “Routing and QoS in an all-optical packet network,” in 2nd Int. Conf. on Broadband Networks, 2005. BroadNets 2005, Boston, MA, Oct. 7, 2005, vol. 2, pp. 1063–1072.

D. Barth, J.-M. Fourneau, D. Nott, “Two cycles routing and end to end delay bound in all optical network,” presented at Int. Conf. on Photonics in Switching 2008 (PS 2008), Sapporo, Japan, Aug. 4–7, 2008, poster session.

Ofek, Y.

B. Yener, S. Matsoukas, Y. Ofek, “Iterative approach to optimizing convergence routing priorities,” IEEE/ACM Trans. Netw., vol. 5, no. 4, pp. 530–542, Aug. 1997.
[CrossRef]

A. Mayer, Y. Ofek, M. Yung, “Local fairness in general-topology networks with convergence routing,” in IEEE INFO COM '95. Fourteenth Annu. Joint Conf. of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings, Boston, MA, Apr. 2–6, 1995, vol. 2, pp. 891–899.

B. Yener, T. Boult, Y. Ofek, “Hamiltonian decompositions of regular topology networks with convergence routing,” Columbia University, Computer Science Department, Tech. Rep. CUCS-011094, 1994.

Y. Ofek, M. Yung, “Principles for high speed network control: loss-less and deadlock-freeness, self-routing and a single buffer per link,” in Annu. ACM Symp. on Principles of Distrib uted Computing, Quebec City, Canada, 1990, pp. 161–175.

Pickavet, M.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Pires, N.

D. Barth, N. Pires, “Robustesse du routage eulérien dans le réseau ROMEO,” Université de Versailles—St. Quentin, 2005, http://www.prism.uvsq.fr/rapports/2005/document_2005_87.doc.

Potier, D.

M. Veran, D. Potier, “QNAP-2: A Portable Environment for Queueing Network,” in Modelling Techniques and Tools for Performance Analysis. Amsterdam: North-Holland, 1985, pp. 25–63.

Quessette, F.

D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.

S. Mneimneh, G. Damm, F. Verchère, F. Quessette, “Minimum deflection routing in bufferless networks,” U.S. Patent Application 20040022240, Feb. 5, 2004.

S. Mneimneh, F. Quessette, “Linear complexity algorithms for maximum advance deflection routing in some networks,” in 2006 Workshop on High Performance Switching and Routing, Poznan, Poland, 2006, pp. 1–7.

A. Borrero, J.-M. Fourneau, F. Quessette, “Packet selection in a deflection routing algorithm,” in Proc. of the 17th Int. Symp. on Computer and Information Sciences, Orlando, FL, Oct. 28–30, 2002, pp. 103–114.

Rafel, A.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Renaud, M.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Saito, T.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

Schuster, A.

A. Schuster, “Bounds and analysis techniques for greedy hot-potato routing,” in Optical Interconnections and Parallel Processing: The Interface, Norwell, MA: Kluwer Academic, 1997, pp. 284–354.

Sole-Pareta, J.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Stavdas, A.

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

Symvonis, A.

A. Symvonis, “A note on deflection routing on undirected graphs,” University of Sydney, Dept. of Computer Science, Tech. Rep. TR94-493, 1994.

Takenaka, M.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

Tanemura, T.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

Veran, M.

M. Veran, D. Potier, “QNAP-2: A Portable Environment for Queueing Network,” in Modelling Techniques and Tools for Performance Analysis. Amsterdam: North-Holland, 1985, pp. 25–63.

Verchère, F.

S. Mneimneh, G. Damm, F. Verchère, F. Quessette, “Minimum deflection routing in bufferless networks,” U.S. Patent Application 20040022240, Feb. 5, 2004.

Vial, S.

P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. Le Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. El Biaze, R. Laalaoua, E. Gangloff, I. Kotuliak, “Multiservice optical network: main concepts and first achievements of the ROM program,” J. Lightwave Technol., vol. 19, pp. 23–31, Jan. 2001.
[CrossRef]

D. Barth, P. Berthomé, C. Laforest, S. Vial, “Some Eulerian parameters about performances of a convergence routing in the 2D-mesh network,” LRI, Tech. Rep. LRI-1346, Jan. 2003.

D. Barth, P. Berthomé, T. Czarchoski, F. J.-M., C. Laforest, S. Vial, “A mixed deflection and convergence routing algorithm: design and performance,” in Euro-Par 2002 Parallel Processing, vol. 2400 of Lecture Notes in Computer Science, Berlin: Springer, 2002, pp. 767–774.
[CrossRef]

C. Laforest, S. Vial, “Short cut Eulerian routing of datagrams in all optical point-to-point networks,” in Proc. Int. Parallel and Distributed Processing Symp., IPDPS 2002, Abstracts and CD-ROM, Ft. Lauderdale, FL, Apr. 15–19, 2002, vol. 1, pp. 39–44.

D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.

Watabe, K.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

Yener, B.

B. Yener, S. Matsoukas, Y. Ofek, “Iterative approach to optimizing convergence routing priorities,” IEEE/ACM Trans. Netw., vol. 5, no. 4, pp. 530–542, Aug. 1997.
[CrossRef]

B. Yener, T. Boult, Y. Ofek, “Hamiltonian decompositions of regular topology networks with convergence routing,” Columbia University, Computer Science Department, Tech. Rep. CUCS-011094, 1994.

Yung, M.

A. Mayer, Y. Ofek, M. Yung, “Local fairness in general-topology networks with convergence routing,” in IEEE INFO COM '95. Fourteenth Annu. Joint Conf. of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings, Boston, MA, Apr. 2–6, 1995, vol. 2, pp. 891–899.

Y. Ofek, M. Yung, “Principles for high speed network control: loss-less and deadlock-freeness, self-routing and a single buffer per link,” in Annu. ACM Symp. on Principles of Distrib uted Computing, Quebec City, Canada, 1990, pp. 161–175.

Distrib. Comput. (2)

U. Feige, R. Krauthgamer, “Networks on which hot-potato routing does not livelock,” Distrib. Comput., vol. 13, pp. 53–58, 2000.
[CrossRef]

B. Hajek, “Bounds on evacuation time for deflection routing,” Distrib. Comput., vol. 5, no. 1, pp. 1–6, 1991.
[CrossRef]

IEEE J. Sel. Areas Commun. (1)

L. Dittman, C. Develder, D. Chiaroni, F. Neri, F. Callegati, W. Koerber, A. Stavdas, M. Renaud, A. Rafel, J. Sole-Pareta, W. Cerroni, N. Leligou, L. Dembeck, B. Mortensen, M. Pickavet, N. Le Sauze, M. Mahony, B. Berde, G. Eilenberger, “The European IST project DAVID: a viable approach towards optical packet switching,” IEEE J. Sel. Areas Commun., vol. 7, pp. 1026–1040, 2003.
[CrossRef]

IEEE Trans. Commun. Syst. (1)

P. Baran, “On distributed communication networks,” IEEE Trans. Commun. Syst., vol. CS-12, pp. 1–9, 1964.

IEEE Trans. Parallel Distrib. Syst. (1)

J. C. Brassil, R. L. Cruz, “Bounds on maximum delay in networks with deflection routing,” IEEE Trans. Parallel Distrib. Syst., vol. 6, no. 7, pp. 724–732, 1995.
[CrossRef]

IEEE/ACM Trans. Netw. (1)

B. Yener, S. Matsoukas, Y. Ofek, “Iterative approach to optimizing convergence routing priorities,” IEEE/ACM Trans. Netw., vol. 5, no. 4, pp. 530–542, Aug. 1997.
[CrossRef]

J. Interconnect. Netw. (JOIN) (1)

D. Barth, P. Berthomé, J. Cohen, “The Eulerian stretch of a digraph and the ending guarantee of a convergence routing,” J. Interconnect. Netw. (JOIN), vol. 5, no. 2, pp. 93–109, 2004.
[CrossRef]

J. Lightwave Technol. (1)

Other (20)

A. Borrero, J.-M. Fourneau, F. Quessette, “Packet selection in a deflection routing algorithm,” in Proc. of the 17th Int. Symp. on Computer and Information Sciences, Orlando, FL, Oct. 28–30, 2002, pp. 103–114.

K. Watabe, T. Saito, N. Matsumoto, T. Tanemura, H. Imaizumi, A. A. Amin, M. Takenaka, Y. Nakano, H. Morikawa, “80 gb/s multi-wavelength optical packet switching using PLZT switch,” in 11th International Conference on Optical Networking Design and Modeling (ONDM 2007), vol. 4534 of Lecture Notes in Computer Science, Berlin: Springer 2007, pp. 11–20.

M. Veran, D. Potier, “QNAP-2: A Portable Environment for Queueing Network,” in Modelling Techniques and Tools for Performance Analysis. Amsterdam: North-Holland, 1985, pp. 25–63.

D. Barth, J.-M. Fourneau, D. Nott, D. Chiaroni, “Routing and QoS in an all-optical packet network,” in 2nd Int. Conf. on Broadband Networks, 2005. BroadNets 2005, Boston, MA, Oct. 7, 2005, vol. 2, pp. 1063–1072.

D. Barth, J.-M. Fourneau, D. Nott, “Two cycles routing and end to end delay bound in all optical network,” presented at Int. Conf. on Photonics in Switching 2008 (PS 2008), Sapporo, Japan, Aug. 4–7, 2008, poster session.

D. Barth, N. Pires, “Robustesse du routage eulérien dans le réseau ROMEO,” Université de Versailles—St. Quentin, 2005, http://www.prism.uvsq.fr/rapports/2005/document_2005_87.doc.

C. Laforest, S. Vial, “Short cut Eulerian routing of datagrams in all optical point-to-point networks,” in Proc. Int. Parallel and Distributed Processing Symp., IPDPS 2002, Abstracts and CD-ROM, Ft. Lauderdale, FL, Apr. 15–19, 2002, vol. 1, pp. 39–44.

D. Barth, P. Berthomé, A. Borrero, J. Fourneau, C. Laforest, F. Quessette, S. Vial, “Performance comparisons of Eulerian routing and deflection routing in a 2D-mesh all optical network,” presented at 15th European Simulation Multiconf., Prague, Czech Republic, June 6–9, 2001.

C. Berge, Graphs and Hypergraphs, Amsterdam, North Holland, 1973.

P. Ferguson, G. Huston, Quality of Service: Delivering QoS on the Internet and in Corporate Networks. New York, NY: Wiley, 1999.

A. Schuster, “Bounds and analysis techniques for greedy hot-potato routing,” in Optical Interconnections and Parallel Processing: The Interface, Norwell, MA: Kluwer Academic, 1997, pp. 284–354.

Y. Ofek, M. Yung, “Principles for high speed network control: loss-less and deadlock-freeness, self-routing and a single buffer per link,” in Annu. ACM Symp. on Principles of Distrib uted Computing, Quebec City, Canada, 1990, pp. 161–175.

U. Feige, “Observations on hot potato routing,” in 3rd Israel Symp. on the Theory of Computing and Systems, 1995. Proceedings, Tel Aviv, Israel, Jan. 4–61995, pp. 30–39.

A. Symvonis, “A note on deflection routing on undirected graphs,” University of Sydney, Dept. of Computer Science, Tech. Rep. TR94-493, 1994.

A. Mayer, Y. Ofek, M. Yung, “Local fairness in general-topology networks with convergence routing,” in IEEE INFO COM '95. Fourteenth Annu. Joint Conf. of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings, Boston, MA, Apr. 2–6, 1995, vol. 2, pp. 891–899.

B. Yener, T. Boult, Y. Ofek, “Hamiltonian decompositions of regular topology networks with convergence routing,” Columbia University, Computer Science Department, Tech. Rep. CUCS-011094, 1994.

D. Barth, P. Berthomé, T. Czarchoski, F. J.-M., C. Laforest, S. Vial, “A mixed deflection and convergence routing algorithm: design and performance,” in Euro-Par 2002 Parallel Processing, vol. 2400 of Lecture Notes in Computer Science, Berlin: Springer, 2002, pp. 767–774.
[CrossRef]

S. Mneimneh, G. Damm, F. Verchère, F. Quessette, “Minimum deflection routing in bufferless networks,” U.S. Patent Application 20040022240, Feb. 5, 2004.

S. Mneimneh, F. Quessette, “Linear complexity algorithms for maximum advance deflection routing in some networks,” in 2006 Workshop on High Performance Switching and Routing, Poznan, Poland, 2006, pp. 1–7.

D. Barth, P. Berthomé, C. Laforest, S. Vial, “Some Eulerian parameters about performances of a convergence routing in the 2D-mesh network,” LRI, Tech. Rep. LRI-1346, Jan. 2003.

Cited By

OSA participates in CrossRef's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (14)

Fig. 1
Fig. 1

Generic structure of an all-optical packet router.

Fig. 2
Fig. 2

Digraph and the numbers defining an Eulerian tour.

Fig. 3
Fig. 3

Directed ring representation of the same network.

Fig. 4
Fig. 4

Head of the distribution of the packet delays on the mesh with nonuniform traffic.

Fig. 5
Fig. 5

Tail of the distribution of the packet delays on the mesh with nonuniform traffic.

Fig. 6
Fig. 6

Antenna Eulerian tour in a 7 × 7 square mesh.

Fig. 7
Fig. 7

Comparison of average distance and average shortcut intervals in p × p meshes.

Fig. 8
Fig. 8

S = 20 , Antenna, 11 × 11 mesh, delay versus arrival rate for deflection, mixed (20), sc-mixed (20), and sc-mixed (8) routing algorithms.

Fig. 9
Fig. 9

Antenna, 11 × 11 mesh, mixture traffic, distribution of transport delay for a sc-mixed routing algorithm with threshold 20.

Fig. 10
Fig. 10

S = 8 , Antenna, mixed routing, phase transition sample path due to a burst of packets.

Fig. 11
Fig. 11

S = 8 , Antenna, mixed routing, throughput after a burst of packets.

Fig. 12
Fig. 12

S = 20 , Antenna, mixed routing, effect of a burst of packets.

Fig. 13
Fig. 13

S = 8 , Antenna, sc-mixed routing, effect of a burst of packets.

Fig. 14
Fig. 14

S = 5 , Antenna, sc-mixed routing, effect of a burst of packets.

Equations (9)

Equations on this page are rendered with MathJax. Learn more.

d C ( u , v ) = max a = ( u , w ) A ( G ) I C ( u , v , a ) ,
stretch W C = max u , v V ( G ) u v d C ( u , v ) ,
D ( G , S , C ) = diam G + 2 S + stretch W C 3 .
stretch W C = { m 2 + 3 if p is odd m 2 + 2 p 3 otherwise } .
S d C ( u , v ) = { 1 if ( u , v ) is an arc 1 + min x S u , v S d C ( x , v ) else } .
S d C = max u , v V ( G ) S d C ( u , v ) ,
D ( G , S , C ) = diam G + 2 S + stretch W C 3 ,
d 1 d 0 c + ( S 1 ) .
D ( G , S , C ) = 4 p ( p 1 ) + 2 S 4 .