The virtual path layout problem in fast networks (extended abstract)

DOI10.1145/197917.198100MaRDI QIDQ5361414zbMATH OpenOpenAlexFDO

Authors Shmuel Zaks, Ornan Gerstel

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(10)

• 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
• 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
• Optimal layouts on a chain ATM network

This page was built for publication: The virtual path layout problem in fast networks (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361414)