A mixed deflection and convergence routing algorithm: Design and performance

DOI10.1007/3-540-45706-2_107MaRDI QIDQ4813143zbMATH OpenFDO

Authors Pascal Berthomé, T. Czarchoski, Jean-Michel Fourneau, Christian Laforest, Sandrine Vial, D. Barth

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2400/24000767.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Deflection routing on a torus is monotone
• Performance of deflection routing algorithms in IP optical transport networks
• A versatile model for predicting the performance of deflection-routing networks
• Packet Routing: Complexity and Algorithms
• Simple, efficient routing schemes for all-optical networks

Cited in

(3)

• Performance of deflection routing algorithms in IP optical transport networks
• Deflection routing on a torus is monotone
• A versatile model for predicting the performance of deflection-routing networks

This page was built for publication: A mixed deflection and convergence routing algorithm: Design and performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813143)