The complexity of routing in~hierarchical PNNI networks

DOI10.1007/s11081-009-9088-0zbMath1273.90044OpenAlexW2078932930MaRDI QIDQ374679

Eric Rosenberg

Publication date: 24 October 2013

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-009-9088-0

zbMATH Keywords

shortest pathtelecommunicationsgeometric programminghierarchical routingnonlinear duality

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing hierarchical routing error
• Optimal clustering structures for hierarchical topological design of large computer networks
• On solving a primal geometric program by partial dual optimization
• Globally Convergent Algorithms for Convex Programming
• Optimization of hierarchical routing protocols
• Convex Analysis
• Linearizing Geometric Programs

This page was built for publication: The complexity of routing in~hierarchical PNNI networks