Restoration performance study of k-shortest disjoint paths in WDM optical networks |
| |
Authors: | Sungwoo Tak E. K. Park |
| |
Affiliation: | (1) Department of Computer Science and Engineering, Research Institute of Computer Information and Communication, Pusan National University, San-30, Jangjeon-dong, Geumjeong-gu, Busan, 609-735, Republic of Korea;(2) School of Computing and Engineering, University of Missouri, Kansas City, USA |
| |
Abstract: | Many researchers have proposed restoration techniques incorporating the concept of k-shortest disjoint paths in survivable WDM (Wavelength Division Multiplexing) optical networks, but without considering network performance and network costs simultaneously. In this paper we need to carefully look into how well the concept of shortest disjoint paths is incorporated for given objective functions. Seven objective functions and four algorithms are presented to evaluate the concept of k-shortest disjoint paths for the design of a robust WDM optical network. A case study based on simulation experiments is conducted to illustrate the application and efficiency of k-shortest disjoint paths in terms of following objective goals: minimal wavelengths, minimal wavelength link distance, minimal wavelength mileage costs, even distribution of traffic flows, average restoration time of backup lightpaths, and physical topology constraints. Sungwoo Takis an assistant professor in the Department of Computer Science and Engineering at Pusan National University. He is also a research member at Research Institute of Computer Information and Communication at Pusan National University. He received a Ph.D. degree in Computer Science from the University of Missouri Kansas City. He has served as a TPC member for the IEEE ICCCN (International Conference on Computer Communications and Networks) since 2004. His research interests include Computer Networks, Wireless Networks, Software Architecture, WDM Optical Networks, Real-time Systems, and SoC (System on Chips) based Communication Chip Design. E. K. Park is a Professor of Computer Science at the University of Missouri at Kansas City. He received a Ph.D. degree in Computer Science from the Northwestern University. His research interests include software engineering, software architectures, software agents, distributed systems, object-oriented methodology, software tolerance and reliability, computer networks and management, optical networks, database/data mining, and information/knowledge management. |
| |
Keywords: | Restoration Shortest disjoint paths WDM optical networks Optimization Dynamic programming principle |
本文献已被 SpringerLink 等数据库收录! |
|