The average hop count measure for virtual path layouts

DOI10.1007/3-540-45414-4_18MaRDI QIDQ4436056zbMATH OpenFDO

Authors Uri Pincas, David Peleg

Publication date 23 November 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2180/21800255.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Virtual path layouts optimizing total hop count on ATM tree networks
• Virtual Path Layouts in ATM Networks
• On the design of efficient ATM routing schemes
• scientific article; zbMATH DE number 1263996
• ATM layouts with bounded hop count and congestion

Cited in

(7)

• Virtual path layouts optimizing total hop count on ATM tree networks
• Average hopcount of the shortest path in tree-like components with finite size
• Paths in the simple random graph and the Waxman graph
• Virtual path layout in ATM path with given hop count
• A lower bound for the average number of hops in communication networks with circulant topologies of arbitrary degree
• Hop-Congestion Trade-Offs for High-Speed Networks
• A complete characterization of the path layout construction problem for ATM networks with given hop count and load

This page was built for publication: The average hop count measure for virtual path layouts

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