Optimal layouts on a chain ATM network

DOI10.1016/S0166-218X(98)80002-4zbMath0907.90135OpenAlexW2086779593MaRDI QIDQ1392534

Avishai Wool, Ornan Gerstel, Shmuel Zaks

Publication date: 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

routingchain networkshigh-speed (ATM) networksoptimal polynomial dynamic programmingrooted virtual path layout problemworst-case measures

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (6)

A complete characterization of the path layout construction problem for ATM networks with given hop count and load ⋮ GMPLS label space minimization through hypergraph layouts ⋮ Virtual path layouts optimizing total hop count on ATM tree networks ⋮ On the design of efficient ATM routing schemes ⋮ Layouts for mobility management in wireless ATM networks ⋮ Designing Hypergraph Layouts to GMPLS Routing Strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing networks with compact routing tables
• Optimal clustering structures for hierarchical topological design of large computer networks
• Routing with Polynomial Communication-Space Trade-Off
• The virtual path layout problem in fast networks (extended abstract)
• Optimal layouts on a chain ATM network

This page was built for publication: Optimal layouts on a chain ATM network