The forwarding index of communication networks
IEEE Transactions on Information Theory
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The Computer Journal
On forwarding indices of networks
Discrete Applied Mathematics
Efficient deadlock-free routing
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Complexity of the forwarding index problem
SIAM Journal on Discrete Mathematics
Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks
IEEE Transactions on Computers
Requirements for Deadlock-Free, Adaptive PacketRouting
SIAM Journal on Computing
Introduction to distributed algorithms
Introduction to distributed algorithms
Discrete Applied Mathematics
Universal algorithms for store-and-forward and wormhole routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Compact routing schemes with low stretch factor (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Worst case bounds for shortest path interval routing
Journal of Algorithms
The Compactness of Interval Routing
SIAM Journal on Discrete Mathematics
On Efficiency of Interval Routing Algorithms
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
The Complexity of Interval Routing on Random Graphs
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
On the Dilation of Interval Routing
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Multi-Dimensional Interval Routing Schemes
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
A Lower Bound for Linear Interval Routing
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Static and Dynamic Low-Congested Interval Routing Schemes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Deadlock-Free Interval Routing Schemes
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Shortest Path and Dilation Bounded Interval Routing
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
On Multi-Label Linear Interval Routing Schemes (Extended Abstract)
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
On Interval Routing Schemes and Treewidth
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract)
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Deadlock- and livelock-free packet switching networks
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Minimal, deadlock-free routing in hypercubic and arbitrary networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
| Hi-index | 0.00 |
We give a survey of recent theoretical results for communication problems in point to point networks. This survey is based on the previous surveys in [57,25]. Communication problems are studied as routing path systems satisfying given communication patterns in a network. Efficiency parameters of path systems such as congestion, dilation, stretch factor, compactness and buffer size are considered. We focus on the current research directions and the various techniques that are used. Open problems related to this line of research and an overview of several related research directions are given.