Universal Routing Strategies for Interconnection Networks

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Scheideler, Christian (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Έκδοση: 1st ed. 1998.
• Σειρά: Lecture Notes in Computer Science, 1390
• Θέματα: Computer communication systems.; Algorithms.; Computers.; Computer science-Mathematics.; Combinatorics.; Computer Communication Networks.; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Discrete Mathematics in Computer Science.

This book presents the history and state of the art of universal routing strategies, which can be applied to networks independently of their respective topologies. It opens with a self-contained introduction, accessible also to newcomers. The main original results are new universal network protocols...