Update URL for article.

Full reference is:

Eitan Zahavi
"D-Mod-K Routing Providing Non-Blocking Traffic for Shift Permutations on
 Real Life Fat Trees"
CCIT Report #776, September 2010

IRWIN AND JOAN JACOBS
CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES
DEPARTMENT OF ELECTRICAL ENGINEERING
TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY, HAIFA 32000, ISRAEL

diff --git a/docs/source/Platform_examples.rst b/docs/source/Platform_examples.rst
index 4a2759e..29b481d 100644 (file)
--- a/docs/source/Platform_examples.rst
+++ b/docs/source/Platform_examples.rst
@@ -132,8 +132,8 @@ cluster (and thus reduce its price) while maintaining a high bisection
 bandwidth and a relatively low diameter. To model this in SimGrid,
 pass a ``topology="FAT_TREE"`` attribute to your cluster. The
 ``topo_parameters=#levels;#downlinks;#uplinks;link count`` follows the
-semantic introduced in the `Figure 1B of this article
-<http://webee.eedev.technion.ac.il/wp-content/uploads/2014/08/publication_574.pdf>`_.
+semantic introduced in the `Figure 1(b) of this article
+<https://ece.technion.ac.il/wp-content/uploads/2021/01/publication_776.pdf>`_.
 
 Here is the meaning of this example: ``2 ; 4,4 ; 1,2 ; 1,2``
 

diff --git a/docs/source/Tutorial_MPI_Applications.rst b/docs/source/Tutorial_MPI_Applications.rst
index a71270c..12d61e7 100644 (file)
--- a/docs/source/Tutorial_MPI_Applications.rst
+++ b/docs/source/Tutorial_MPI_Applications.rst
@@ -186,8 +186,8 @@ cluster (and thus reduce its price) while maintaining a high bisection
 bandwidth and a relatively low diameter. To model this in SimGrid,
 pass a ``topology="FAT_TREE"`` attribute to your cluster. The
 ``topo_parameters=#levels;#downlinks;#uplinks;link count`` follows the
-semantic introduced in `Figure 1B of this article
-<http://webee.eedev.technion.ac.il/wp-content/uploads/2014/08/publication_574.pdf>`_.
+semantic introduced in `Figure 1(b) of this article
+<https://ece.technion.ac.il/wp-content/uploads/2021/01/publication_776.pdf>`_.
 
 Here is the meaning of this example: ``2 ; 4,4 ; 1,2 ; 1,2``
 

diff --git a/examples/platforms/cluster_fat_tree.xml b/examples/platforms/cluster_fat_tree.xml
index ede509f..3ba6191 100644 (file)
--- a/examples/platforms/cluster_fat_tree.xml
+++ b/examples/platforms/cluster_fat_tree.xml
@@ -2,8 +2,8 @@
 <!DOCTYPE platform SYSTEM "https://simgrid.org/simgrid.dtd">
 <platform version="4.1">
   <!-- This is an example for a fat tree cluster.
-  This is taken from figure 1/ b/ of the paper "D-Mod-K Routing Providing on-Blocking Traffic for Shift Permutations on
-  Real Life Fat Trees" available at http://webee.eedev.technion.ac.il/wp-content/uploads/2014/08/publication_574.pdf
+  This is taken from figure 1(b) of the paper "D-Mod-K Routing Providing on-Blocking Traffic for Shift Permutations on
+  Real Life Fat Trees" available at https://ece.technion.ac.il/wp-content/uploads/2021/01/publication_776.pdf
   This defines a two levels fat-tree, with 4 leaf switches connected to 4 nodes each and 2 core switches connected to
   each leaf switch by two cables -->
 

diff --git a/teshsuite/platforms/cluster_fat_tree_noncontiguous_rad.xml b/teshsuite/platforms/cluster_fat_tree_noncontiguous_rad.xml
index a90424f..d5afae8 100644 (file)
--- a/teshsuite/platforms/cluster_fat_tree_noncontiguous_rad.xml
+++ b/teshsuite/platforms/cluster_fat_tree_noncontiguous_rad.xml
@@ -2,8 +2,8 @@
 <!DOCTYPE platform SYSTEM "https://simgrid.org/simgrid.dtd">
 <platform version="4.1">
   <!-- This is an example for a fat tree cluster.
-  This is taken from figure 1/ b/ of the paper "D-Mod-K Routing Providing on-Blocking Traffic for Shift Permutations on
-  Real Life Fat Trees" available at http://webee.eedev.technion.ac.il/wp-content/uploads/2014/08/publication_574.pdf
+  This is taken from figure 1(b) of the paper "D-Mod-K Routing Providing on-Blocking Traffic for Shift Permutations on
+  Real Life Fat Trees" available at https://ece.technion.ac.il/wp-content/uploads/2021/01/publication_776.pdf
   This defines a two levels fat-tree, with 4 leaf switches connected to 4 nodes each and 2 core switches connected to
   each leaf switch by two cables -->