R
Rainer R. Iraschko
Publications - 5
Citations - 552
Rainer R. Iraschko is an academic researcher. The author has contributed to research in topics: Network topology & Capacity optimization. The author has an hindex of 4, co-authored 5 publications receiving 549 citations.
Papers
More filters
Journal ArticleDOI
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
TL;DR: A method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfermode (ATM) virtual path (VP)-based restoration and jointly optimizing working path routing and spare capacity placement.
Journal ArticleDOI
A highly efficient path-restoration protocol for management of optical network transport integrity
TL;DR: A heuristic principle that tests well against integer programming solutions of MCMF routing is presented, and it is predicted that network operators could aggressively optimize their spare capacity, toward theoretical minimums, while still assuring 100% restorability.
Patent
Path restoration of networks
TL;DR: In this article, a distributed method for creating telecommunications paths in a network, particularly after a span failure, was proposed, where each node has a digital cross-connect switch for making and breaking connections between adjacent spans forming span pairs at a node.
Proceedings ArticleDOI
Optimal capacity placement for path restoration in mesh survivable networks
TL;DR: A method for capacity optimization of path restorable networks and the capacity benefits of path over span restoration are provided and the further benefits of jointly optimizing working path routing and spare capacity placement in path Restorable networks are quantified by extending the capacity optimization method presented.
Patent
Restoring failed telecoms. links using software agents
TL;DR: In this article, a distributed method for creating telecommunications paths in a network, particularly after a span failure, is proposed, where each node has a digital cross-connect switch for making and breaking connections between adjacent spans forming span pairs at a node.