We describe the adaptive source routing (ASR) method which is a first attempt to combine adaptive routing and source routing methods. In ASR, the adaptivity of each packet is determined at the source processor. Every packet can be routed in a fully adaptive or partially adaptive or non-adaptive manner, all within the same network at the same time. We evaluate and compare performance of the proposed adaptive source routing networks and oblivious routing networks by simulations. We also describe a route generation algorithm that determines maximally adaptive routes in multistage networks
Most commercial switch-based network technologies for PC clusters use deterministic routing. Alterna...
Message-passing concurrent computers, also known as multicomputers, such as the Caltech Cosmic Cube ...
This thesis gives a general discussion of routing for computer networks, followed by an overview of ...
We describe the adaptive source routing (ASR) method which is a first attempt to combine adaptive ro...
Abstract — Interconnection networks have been adopted in multicomputer systems, clusters, or chip mu...
The IBM RS/6000 SP is one of the most successful commercially available multicomputers. SP owes its ...
Now that we had a look at how well certain families of networks can perform routing, we want to conc...
Recent increases in the pin bandwidth of integrated-circuits has motivated an increase in the degree...
The IBM RS 6000 SP is one of the most successful commercially available multicomputers. SP owes its ...
Oblivious routing can be implemented on simple router hardware, but network performance suffers when...
The efficiency with which the routing protocol of a multihop packet-radio network uses transmission ...
Cataloged from PDF version of article.The IBM RS 6000 SP is one of the most successful commercially ...
Message-passing concurrent computers, also known as multicomputers, such as the Caltech Cosmic Cube...
Today’s scalable high-performance applications heavily depend on the bandwidth characteristics of th...
We present the source-tree adaptive routing (STAR) protocol and analyze its performance in wireless ...
Most commercial switch-based network technologies for PC clusters use deterministic routing. Alterna...
Message-passing concurrent computers, also known as multicomputers, such as the Caltech Cosmic Cube ...
This thesis gives a general discussion of routing for computer networks, followed by an overview of ...
We describe the adaptive source routing (ASR) method which is a first attempt to combine adaptive ro...
Abstract — Interconnection networks have been adopted in multicomputer systems, clusters, or chip mu...
The IBM RS/6000 SP is one of the most successful commercially available multicomputers. SP owes its ...
Now that we had a look at how well certain families of networks can perform routing, we want to conc...
Recent increases in the pin bandwidth of integrated-circuits has motivated an increase in the degree...
The IBM RS 6000 SP is one of the most successful commercially available multicomputers. SP owes its ...
Oblivious routing can be implemented on simple router hardware, but network performance suffers when...
The efficiency with which the routing protocol of a multihop packet-radio network uses transmission ...
Cataloged from PDF version of article.The IBM RS 6000 SP is one of the most successful commercially ...
Message-passing concurrent computers, also known as multicomputers, such as the Caltech Cosmic Cube...
Today’s scalable high-performance applications heavily depend on the bandwidth characteristics of th...
We present the source-tree adaptive routing (STAR) protocol and analyze its performance in wireless ...
Most commercial switch-based network technologies for PC clusters use deterministic routing. Alterna...
Message-passing concurrent computers, also known as multicomputers, such as the Caltech Cosmic Cube ...
This thesis gives a general discussion of routing for computer networks, followed by an overview of ...