Ms. Zhipeng Zhao Profile

Zhipeng Zhao

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 18 March 2024 Paper

Bidirectional demarcated vector-based bidirectional link failure localization method in optical network

Jiahui Wang, Haojun Zhang, Zhipeng Zhao

Proceedings Volume 13104, 131040D (2024) https://doi.org/10.1117/12.3017098

KEYWORDS: Optical networks, Optical sensing, Failure analysis, Binary data, Detection and tracking algorithms, Telecommunication networks, Signal detection, Mathematical optimization, Design, Algorithm development

Read Abstract +

In optical networks, link failures caused by fiber cuts occur frequently. Existing studies fails to take cost optimization, accuracy, and latency simultaneously when it comes to bidirectional link failure localization. In this paper, we propose a Bidirectional Demarcated Vector (BDV) algorithm, which is designed to guarantee 100% failure localization while minimizing costs. Concretely, the optical network topology is reconstructed as a digraph by using bidirectional demarcated vectors firstly. The direction of the directed edge between the same two nodes is opposite. Then an integer linear programming (ILP) model is designed to generate a directed monitoring trail based on the reconstructed optical network topology by adjusting the search space, constraint conditions, and link state adaptability. In addition, to maximize the utilization rate of link resources when selecting the optimal localization strategy, the bidirectional traffic factor is considered to compare the costs of different trajectories. Simulation results show that, the BDV method is about 20% lower than the Detection Selection algorithm in terms of localization cost, and is 50%-60% lower in latency than the Fusion algorithm (denoted by AA) and the Detection Selection algorithm (DS). Furthermore, the BDV algorithm surpasses the Random Walk-based failure localization algorithm (RWL) by about 10% in terms of localization accuracy.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years