ATM layouts with bounded hop count and congestion

DOI10.1007/PL00008929zbMath1448.68043OpenAlexW1971749371MaRDI QIDQ5138350

Enrico Nardelli, Michele Flammini, Guido Proietti

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00008929

zbMATH Keywords

computational complexityroutingATM networksedge and node congestion

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (1)

Graceful reassignment of excessively long communications paths in networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hop-Congestion Trade-Offs for High-Speed Networks
• The virtual path layout problem in fast networks (extended abstract)
• On the design of efficient ATM routing schemes

This page was built for publication: ATM layouts with bounded hop count and congestion