Hop-Congestion Trade-Offs for High-Speed Networks

DOI10.1142/S0129054197000100MaRDI QIDQ4358514zbMATH OpenOpenAlexFDO

Authors Andrzej Pelc, Evangelos Kranakis, D. Krizanc

Publication date 29 September 1997

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054197000100

zbMATH Keywords

asymptotically optimal virtual path layoutsATM networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Virtual Path Layouts in ATM Networks
• ATM layouts with bounded hop count and congestion
• Structural Information and Communication Complexity
• scientific article; zbMATH DE number 2006657

Cited in

(13)

• Layouts for mobility management in wireless ATM networks
• On iterative solutions for performance of high-speed switching networks
• On the total\(_k\)-diameter of connection networks
• Virtual path layouts optimizing total hop count on ATM tree networks
• Routing and delay analysis models for high-speed networks
• Directed virtual path layouts in ATM networks
• On delay versus congestion in designing rearrangeable multihop lightware networks
• scientific article; zbMATH DE number 1717296 (Why is no real title available?)
• Characterization of the traffic on high-speed token-ring networks
• Virtual Path Layouts in ATM Networks
• ATM layouts with bounded hop count and congestion
• Minimizing congestion of layouts for ATM networks with faulty links
• On the design of efficient ATM routing schemes

This page was built for publication: Hop-Congestion Trade-Offs for High-Speed Networks

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