scientific article; zbMATH DE number 1835984

MaRDI QIDQ4779552zbMATHFDO

Authors Krzysztof Walkowiak

Publication date 13 May 2003

Full work available at URL https://eudml.org/doc/207585

zbMATH Keywords

ATMbranch and bound algorithmsurvivable networks

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Network design and communication in computer systems (68M10)

Recommendations

• A design of self-healing ATM networks based on backup virtual paths.
• A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
• Preplanned rerouting optimization and dynamic path
• Virtual path design in service-specific ATM networks
• scientific article; zbMATH DE number 1332662

Cited in

(9)

• Optimizing the system of virtual paths by tabu search.
• Architecture for restorable call allocation and fast VP restoration in mesh ATM networks
• A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
• Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network
• Preplanned rerouting optimization and dynamic path
• Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks
• Efficient algorithms for shared backup allocation in networks with partial information
• scientific article; zbMATH DE number 1717292 (Why is no real title available?)
• A design of self-healing ATM networks based on backup virtual paths.

This page was built for publication:

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