NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
traffic routing for multicomputer networks with virtual cut-through capabilityConsideration is given to the problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered. An approach is proposed that formulates the route selection problem as a minimization problem with a link cost function that depends upon the traffic through the link. The form of this cost function is derived using the probability of establishing a virtual cut-through route. The route selection problem is shown to be NP-hard, and an algorithm is developed to incrementally reduce the cost by rerouting the traffic. The performance of this algorithm is exemplified by two network topologies: the hypercube and the C-wrapped hexagonal mesh.
Document ID
19930033377
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Kandlur, Dilip D.
(IBM Thomas J. Watson Research Center Yorktown Heights, NY, United States)
Shin, Kang G.
(Michigan Univ. Ann Arbor, United States)
Date Acquired
August 15, 2013
Publication Date
October 1, 1992
Publication Information
Publication: IEEE Transactions on Computers
Volume: 41
Issue: 10
ISSN: 0018-9340
Subject Category
COMPUTER SYSTEMS
Funding Number(s)
CONTRACT_GRANT: NAG1-296
CONTRACT_GRANT: N00014-85-K-0122
Distribution Limits
Public
Copyright
Other