Virtual path layouts optimizing total hop count on ATM tree networks

DOI10.1016/j.jda.2004.05.003zbMath1066.90011OpenAlexW2072311414MaRDI QIDQ1775020

David Peleg, Uri Pincas

Publication date: 4 May 2005

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.05.003

zbMATH Keywords

Dynamic programmingATM networksNetwork designHop countVirtual paths

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal layouts on a chain ATM network
• Directed virtual path layouts in ATM networks
• 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: Virtual path layouts optimizing total hop count on ATM tree networks