Abstract. In previous papers we proposed the ITB mechanism to improve the performance of up*/down * routing in irregular networks with source routing. With this mechanism, both minimal routing and a better use of network links are guaranteed, resulting on an overall network performance improvement. In this paper, we show that the ITB mechanism can be used with any source routing scheme in the COW environment. In particular, we apply ITBs to DFS and routing algorithms, which provide better routes than up*/down * routing. Results show that ITB strongly improves DFS and Smart throughput (by 63 % and 23%, res-pectively, for 64-switch networks).
A carefully designed routing synthesis can help system designers achieve a better load balancing in ...
We study end-to-end delay performance of different routing algorithms in networks with random failur...
[[abstract]]In this paper, we use ns2 to simulate our new routing methods. We compare the delivery r...
Clusters of workstations (COWs) are becoming incre-asingly popular as a cost-effective alternative t...
Clusters of workstations (COWs) are becoming increasingly popular as a cost-effective alternative to...
Networks of workstations (NOWs) are becoming increas-ingly popular as a cost-effective alternative t...
Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to...
Networks of workstations (NOWs) are becoming increas-ingly popular as a cost-effective alternative t...
Networks of workstations (NOWs) are becoming incre-asingly popular as a cost-effective alternative t...
Abstract. InfiniBand is very likely to become the de facto standard for communication between nodes ...
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such...
Two of the most commonly used intra-domain Internet routing protocols are Open Shortest Path First (...
We introduce an routing mechanism, referred to as algorithmic rout-ing. It minimizes the memory cons...
We introduce an O(N) routing mechanism, referred to as algorithmic routing. It minimizes the memory ...
We present a new, deadlock-free, routing scheme for toroidal interconnection networks, called OutFla...
A carefully designed routing synthesis can help system designers achieve a better load balancing in ...
We study end-to-end delay performance of different routing algorithms in networks with random failur...
[[abstract]]In this paper, we use ns2 to simulate our new routing methods. We compare the delivery r...
Clusters of workstations (COWs) are becoming incre-asingly popular as a cost-effective alternative t...
Clusters of workstations (COWs) are becoming increasingly popular as a cost-effective alternative to...
Networks of workstations (NOWs) are becoming increas-ingly popular as a cost-effective alternative t...
Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to...
Networks of workstations (NOWs) are becoming increas-ingly popular as a cost-effective alternative t...
Networks of workstations (NOWs) are becoming incre-asingly popular as a cost-effective alternative t...
Abstract. InfiniBand is very likely to become the de facto standard for communication between nodes ...
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such...
Two of the most commonly used intra-domain Internet routing protocols are Open Shortest Path First (...
We introduce an routing mechanism, referred to as algorithmic rout-ing. It minimizes the memory cons...
We introduce an O(N) routing mechanism, referred to as algorithmic routing. It minimizes the memory ...
We present a new, deadlock-free, routing scheme for toroidal interconnection networks, called OutFla...
A carefully designed routing synthesis can help system designers achieve a better load balancing in ...
We study end-to-end delay performance of different routing algorithms in networks with random failur...
[[abstract]]In this paper, we use ns2 to simulate our new routing methods. We compare the delivery r...