Algorithm Design of the p-Cycle Protection Applied to SDN Based on OFDM Transmission

Article Preview

Abstract:

This Paper based on the research framework of SDN, at the transport layer uses the OFDM technology transfer, namely encapsulate traffic for high speed large capacity transmission in the spectrum. Under the architecture of SDN based on p-cycle of new protection algorithm (EffectiveGrow algorithm) to protect spectrum, and using classic p-cycle algorithm turns compare with it, through the JAVA building the pan-european COST239 network topology, comparison algorithm between the various performance indicators. Finally, the simulation results show that compared with the existing classic algorithm has better performance and is suitable for the SDN capacity and configuration.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1231-1236

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Software-Defined Networking: the New Norm for Networks. ONF White Paper, (2012).

Google Scholar

[2] Mckeown N, Anderson T, Balakrishnan H, Parulkar G, Peterson L, Rexford J, Shenker S, Turner J. OpenFlow: Enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 69 − 74.

DOI: 10.1145/1355734.1355746

Google Scholar

[3] D. Zhou and S. Subramaniam. Survivability in optical networks [J]. IEEE Network, 2000, 14(6): 16-23.

Google Scholar

[4] W. Shieh, HongchunBao, TangY, Coherent optical OFDM: theory and design, Optics ExPress, VOI. 16(2), 2008, PP841-859.

Google Scholar

[5] D.A. Schupke. Comparison of p-cycle configuration methods for dynamic network[J]. Optical networks and technologies, 2005, 164: 153-159.

Google Scholar

[6] W. D. Grover,J. Doucette. Advances in optical network design with p-cycles: Joint optimization and preselection of candidate p-cycles[J]. IEEE LEOS Summer Topicals, 2002: 49 – 50.

DOI: 10.1109/leosst.2002.1027542

Google Scholar

[7] Shen Gangxiang, Grover W D. Design and performance of protected working capacity envelopes based on p-cycles for dynamic provisioning of survivable services [J]. Journal of Optical Networking, 2005, 4(7): 361-390.

DOI: 10.1364/jon.4.000361

Google Scholar

[8] Doucette J, He D, Grover W D, etal . Algorithmic approaches for efficient enumeration of candidate P-cycles and capacitated P-cycle network design [A]. In Proceeding s of Fourth International Workshop on the Design of Reliable Communication Networks ( DRCN2003) [ C] . Canada: IEEE, 2003. 212-220.

DOI: 10.1109/drcn.2003.1275359

Google Scholar

[9] W. Bin, Kwan L. Yeung. ILP Formulations for p-Cycle Design Without Candidate Cycle Enumeration[J]. IEEE/ACM Transactions on networking, 2010, 18(1): 284-295.

DOI: 10.1109/tnet.2009.2025769

Google Scholar