Dimension order routing algorithms use the least amount of network resources compared to other routing algorithms. Dimension order algorithms have lower amount of path diversity compared to other routing algorithms. This methodology establishes a methodology to allow dimension order algorithms to increase their path diversity by increasing the amount of resources required. This methodology implements dimensional skipping where the routing algorithm is able to determine that a particular dimensional plane is congested and that it should be skipped and revisited later on a different plane.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.