Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
Conferences > ECOC > 2011 > Mo.1.K > Mo.1.K.4

Efficient Node-Disjoint Paths Search in WDM Networks with Asymmetric Nodes

Tomohiro Hashiguchi, Yi Zhu, and Jason P. Jue

Not Accessible

Your library or personal account may give you access

Abstract

We present an efficient node-disjoint paths search method considering asymmetric nodes. Through simulation results, we show that the proposed method significantly improves the success rate of path search.

© 2011 Optical Society of America

PDF Article
More Like This
End-to-end Link-Disjoint Path Computation and Resource Pre-locking Scheme for Multi-domain Packet Transport Networks

Junfen Li, Lei Wang, Xue Chen, Mingjun Guo, Shihua Zhang, and Yang Cao
AF2A.150 Asia Communications and Photonics Conference (ACP) 2016

Survivable Virtual Topology Mapping for Single-Node Failure in IP over WDM network

Fen Yuan, Xiaoliang Niu, Xin Li, Shanguo Huang, and Wanyi Gu
83101S Asia Communications and Photonics Conference and Exhibition (ACP) 2011

Impairment Aware RWA based on a K-Shuffle Edge-Disjoint Path Solution (IA-KS-EDP)

Chirag Taunk, Sarvesh Bidkar, Chava. V. Saradhi, and Ashwin Gumaste
OThAA6 Optical Fiber Communication Conference (OFC) 2011

View More...
Select as filters
Select Topics Cancel
Top
       
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.
Privacy | Terms of Use