Bounds on evacuation time for deflection routing-Reference-Cited by-同舟云学术

Bounds on evacuation time for deflection routing

Published:1991-06 Issue:1 Volume:5 Page:1-6
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib Comput

Author:

Hajek B.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02311228.pdf

Reference9 articles.

1. Baran P: On distributed communication networks. IEEE Trans Commun Syst 12:1–9 (1964)

2. Borodin A, Hopcroft JE: Routing, merging and sorting on parallel models of computation. J Comput Syst Sci 30:130–145 (1985)

3. Greenberg AG, Goodman J: Sharp approximate models of adaptive routing in mesh networks. In: Boxma OJ, Cohen JW, Tijms JC (eds) Teletraffic analysis and computer performance evaluation. Amsterdam: Elsevier 1986, pp 255–270

4. Greenberg AG, Hajek B: Average case performance of deflection routing in a hypercube. Preprint 1989

5. Hillis D: The connection machine. Boston: MIT Press 1985

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures;ACM Transactions on Design Automation of Electronic Systems;2012-01

2. Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks;Journal of Optical Communications and Networking;2009-07-28

3. Efficient bufferless packet switching on trees and leveled networks;Journal of Parallel and Distributed Computing;2007-11

4. The Data Vortex, an All Optical Path Multicomputer Interconnection Network;IEEE Transactions on Parallel and Distributed Systems;2007-03

5. Universal Bufferless Packet Switching;SIAM Journal on Computing;2007-01