Advanced search
Publication Cover
Journal of the Chinese Institute of Engineers Volume 29, 2006 - Issue 7: Communications
Submit an article Journal homepage
26
Views
2
CrossRef citations to date
0
Altmetric
Full paper

A novel algorithm for node‐encircling and link candidate p‐cycles design in WDM mesh network

Taifei Zhao Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu, 610054, China Phone: 86–28–83203008 Fax: 86–28–83203008 E-mail: [email protected]
,
Hongfang Yu Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu, 610054, China
&
Lemin Li Key Lab of Broadband Optical Fiber Transmission and Communication Networks, University of Electronic Science and Technology of China, Chengdu, 610054, China
Pages 1227-1233 | Received 26 Oct 2005, Accepted 24 Apr 2006, Published online: 04 Mar 2011

References

  • Doucette , J. , He , D. , Grover , W. D. and Yang , O. “Algorithmic Approaches for Efficient Enumeration of Candidate p‐Cycles and Capacitated p‐Cycle Network Design,” . Proceedings of the Fourth International Workshop on the Design of Reliable Communication Networks (DRCN 2003) . Banff, Alberta, Canada. pp. 212 – 220 .
  • Grover , W. D. and Stamatelakis , D. “Cycle‐Oriented Distributed Preconfiguration: Ring‐Like Speed with Mesh‐Like Capacity for Self‐Planning Network Restoration,” . Proceedings of the IEEE International Conference on Communications (ICC 1998) . Atlanta, GA, USA. pp. 537 – 543 .
  • Grover , W. D. and Doucette , J. E. “Advances in Optical Network Design with p‐Cycles: Joint Optimization and Pre‐Selection of Candidate p‐cycles,” . Proceedings of the IEEE‐LEOS Summer Topical Meeting on All Optical Networking 2002, . Mont Tremblant, Quebec, Canada. pp. 49 – 50 .
  • Ko , K. W. and Cheung , K. W. “A Local Map Based (LMB) Self‐Healing Scheme for Arbitrary Topology Networks,” . Proceedings of the IEEE Global Telecommunications Conference (Globecom'97) . Phoenix, AZ, USA. pp. 1393 – 1397 .
  • Liu , C. and Ruan , L. “Finding Good Candidate Cycles for Efficient p‐Cycle Network Design,” . Proceedings of the International Conference On Computer Communications and Networks (ICCCN 2004) . Chicago, IL, USA. pp. 321 – 326 .
  • Shen , G. and Grover , W. D. 2003 . “Extending the p‐Cycle Concept to Path Segment Protection for Span and Node Failure Recovery,” . IEEE Journal on Selected Areas in Communications , 21 ( 8 ) : 1306 – 1319 .
  • Stamatelakis , D. and Grover , W. D. 2000 . “IP Layer Restoration and Network Planning Based on Virtual Protection Cycles,” . IEEE Journal on Selected Areas in Communications , 18 ( 10 ) : 1938 – 1949 .
  • Zhang , H. and Yang , O. “Finding Protection Cycles in DWDM Networks,” . Proceedings of the IEEE International Conference on Communications (ICC 2002) . New York, USA. pp. 2756 – 2760 .
  • Corresponding author. (Tel: 86–28–83203008; Fax: 86–28–83201113; Email: [email protected])

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.