![Universal Routing Strategies for Interconnection Networks [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
Universal Routing Strategies for Interconnection Networks [electronic resource] /
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 for store-and-forward and wormhole routing with small buffers or without buffers; these results are presented in detail and their potential applications are discussed. The book ends with a summary of open problems and an outlook of future directions in the area of routing theory.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
1998
|
| Subjects: | Computer science., Computer communication systems., Computers., Algorithms., Computer science, Combinatorics., Computer Science., Computer Communication Networks., Algorithm Analysis and Problem Complexity., Computation by Abstract Devices., Discrete Mathematics in Computer Science., |
| Online Access: | http://dx.doi.org/10.1007/BFb0052928 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
KOHA-OAI-TEST:210181 |
|---|---|
| record_format |
koha |
| spelling |
KOHA-OAI-TEST:2101812018-07-30T23:42:09ZUniversal Routing Strategies for Interconnection Networks [electronic resource] / Scheideler, Christian. author. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,1998.engThis 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 for store-and-forward and wormhole routing with small buffers or without buffers; these results are presented in detail and their potential applications are discussed. The book ends with a summary of open problems and an outlook of future directions in the area of routing theory.Communication mechanisms used in practice -- Terminology -- to store-and-forward routing -- The routing number -- Offline routing protocols -- Oblivious routing protocols -- Adaptive routing protocols -- Compact routing protocols -- to wormhole routing -- Oblivious routing protocols -- Protocols for all-optical networks -- Summary and future directions.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 for store-and-forward and wormhole routing with small buffers or without buffers; these results are presented in detail and their potential applications are discussed. The book ends with a summary of open problems and an outlook of future directions in the area of routing theory.Computer science.Computer communication systems.Computers.Algorithms.Computer scienceCombinatorics.Computer Science.Computer Communication Networks.Algorithm Analysis and Problem Complexity.Computation by Abstract Devices.Discrete Mathematics in Computer Science.Combinatorics.Springer eBookshttp://dx.doi.org/10.1007/BFb0052928URN:ISBN:9783540697923 |
| institution |
COLPOS |
| collection |
Koha |
| country |
México |
| countrycode |
MX |
| component |
Bibliográfico |
| access |
En linea En linea |
| databasecode |
cat-colpos |
| tag |
biblioteca |
| region |
America del Norte |
| libraryname |
Departamento de documentación y biblioteca de COLPOS |
| language |
eng |
| topic |
Computer science. Computer communication systems. Computers. Algorithms. Computer science Combinatorics. Computer Science. Computer Communication Networks. Algorithm Analysis and Problem Complexity. Computation by Abstract Devices. Discrete Mathematics in Computer Science. Combinatorics. Computer science. Computer communication systems. Computers. Algorithms. Computer science Combinatorics. Computer Science. Computer Communication Networks. Algorithm Analysis and Problem Complexity. Computation by Abstract Devices. Discrete Mathematics in Computer Science. Combinatorics. |
| spellingShingle |
Computer science. Computer communication systems. Computers. Algorithms. Computer science Combinatorics. Computer Science. Computer Communication Networks. Algorithm Analysis and Problem Complexity. Computation by Abstract Devices. Discrete Mathematics in Computer Science. Combinatorics. Computer science. Computer communication systems. Computers. Algorithms. Computer science Combinatorics. Computer Science. Computer Communication Networks. Algorithm Analysis and Problem Complexity. Computation by Abstract Devices. Discrete Mathematics in Computer Science. Combinatorics. Scheideler, Christian. author. SpringerLink (Online service) Universal Routing Strategies for Interconnection Networks [electronic resource] / |
| description |
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 for store-and-forward and wormhole routing with small buffers or without buffers; these results are presented in detail and their potential applications are discussed. The book ends with a summary of open problems and an outlook of future directions in the area of routing theory. |
| format |
Texto |
| topic_facet |
Computer science. Computer communication systems. Computers. Algorithms. Computer science Combinatorics. Computer Science. Computer Communication Networks. Algorithm Analysis and Problem Complexity. Computation by Abstract Devices. Discrete Mathematics in Computer Science. Combinatorics. |
| author |
Scheideler, Christian. author. SpringerLink (Online service) |
| author_facet |
Scheideler, Christian. author. SpringerLink (Online service) |
| author_sort |
Scheideler, Christian. author. |
| title |
Universal Routing Strategies for Interconnection Networks [electronic resource] / |
| title_short |
Universal Routing Strategies for Interconnection Networks [electronic resource] / |
| title_full |
Universal Routing Strategies for Interconnection Networks [electronic resource] / |
| title_fullStr |
Universal Routing Strategies for Interconnection Networks [electronic resource] / |
| title_full_unstemmed |
Universal Routing Strategies for Interconnection Networks [electronic resource] / |
| title_sort |
universal routing strategies for interconnection networks [electronic resource] / |
| publisher |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, |
| publishDate |
1998 |
| url |
http://dx.doi.org/10.1007/BFb0052928 |
| work_keys_str_mv |
AT scheidelerchristianauthor universalroutingstrategiesforinterconnectionnetworkselectronicresource AT springerlinkonlineservice universalroutingstrategiesforinterconnectionnetworkselectronicresource |
| _version_ |
1756268760790990848 |