The virtual path layout problem in fast networks (extended abstract)
From MaRDI portal
Publication:5361414
DOI10.1145/197917.198100zbMath1373.68046MaRDI QIDQ5361414
Publication date: 29 September 2017
Published in: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/197917.198100
68M10: Network design and communication in computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
A complete characterization of the path layout construction problem for ATM networks with given hop count and load, ATM layouts with bounded hop count and congestion, On the design of efficient ATM routing schemes, Layouts for mobility management in wireless ATM networks, Scheduling in synchronous networks and the greedy algorithm, Optimal layouts on a chain ATM network, Virtual network embedding in the cycle, Virtual path layouts optimizing total hop count on ATM tree networks, Directed virtual path layouts in ATM networks