| Title | Path Planning of Submarine Cables |
| Publication Type | Conference Paper |
| Year of Publication | 2019 |
| Authors | Wang, Qing, Wang, Zengfu, Guo, Jun, Tahchi, Elias, Wang, Xinyu, Moran, Bill, Zukerman, Moshe |
| Conference Name | 2019 21st International Conference on Transparent Optical Networks (ICTON) |
| Date Published | jul |
| Keywords | cable costs, cable risk factors, Cable shielding, cost effectiveness, Dijkstra's algorithm, Earth, Earthquakes, fast marching method, FMM, Internet, Internet data, Internet traffic, long-haul cable path design, maintenance engineering, Metrics, optical cables, optical fibre networks, Optimization, path planning, pubcrawl, Resiliency, Scalability, seismic resilience, submarine cables, submarine optical fiber cables, submarine optical-fiber cables, telecommunication network planning, telecommunication traffic, Underwater cables, Underwater Networks |
| Abstract | Submarine optical-fiber cables are key components in the conveying of Internet data, and their failures have costly consequences. Currently, there are over a million km of such cables empowering the Internet. To carry the ever-growing Internet traffic, additional 100,000s of km of cables will be needed in the next few years. At an average cost of \$28,000 per km, this entails investments of billions of dollars. In current industry practice, cable paths are planned manually by experts. This paper surveys our recent work on cable path planning algorithms, where we use several methods to plan cable paths taking account of a range of cable risk factors in addition to cable costs. Two methods, namely, the fast marching method (FMM) and the Dijkstra's algorithm are applied here to long-haul cable path design in a new geographical region. A specific example is given to demonstrate the benefit of the FMM-based method in terms of the better path planning solutions over the Dijkstra's algorithm. |
| DOI | 10.1109/ICTON.2019.8840388 |
| Citation Key | wang_path_2019 |
Path Planning of Submarine Cables