The hop-limit approach for spare-capacity assignment in survivable networks
IEEE/ACM Transactions on Networking (TON)
Virtual path routing for survivable ATM networks
IEEE/ACM Transactions on Networking (TON)
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
IEEE/ACM Transactions on Networking (TON)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
IEEE Communications Magazine
IEEE Communications Magazine
End-to-end survivable broadband networks
IEEE Communications Magazine
Self-healing virtual path architecture in ATM networks
IEEE Communications Magazine
IEEE Network: The Magazine of Global Internetworking
Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks
Computational Optimization and Applications
Branch-and-bound algorithm for anycast flow assignment in connection-oriented networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Three classifiers for acute abdominal pain diagnosis – comparative study
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Evolutionary algorithm for congestion problem in connection-oriented networks
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.00 |
Issues of computer network survivability have gained much attention in recent years since computer networks plays an important role in modern world. Many organizations, institutions, companies use computer networks as a basic tool for transmitting many kinds of information. Service disruptions in modern networks are expected to be significant because loss of services and traffic in high-speed fiber systems could cause a lot of damages including economic loses, political conflicts, human health problems. In this paper we focus on problems of survivable connection oriented network design. A new objective function LF for primary routes assignment applying the local-destination rerouting strategy is defined. Next, an optimization problem of primary routes assignment using the LF function is formulated. Moreover, a branch and bound algorithm for that problem is proposed. The theory and experimental results demonstrate the ability to apply the LF function to dynamic and static design of survivable connection oriented networks.