Deployment of P-Cycle in Optical Networks: A Data Mining Approach

Authors

  • Dr. S. Umarani  SRM University,PACE Institute of Technology & Sciences, Andhra Pradesh, India
  • Dr. T. Rama Chaithanya  SRM University,PACE Institute of Technology & Sciences, Andhra Pradesh, India
  • M. Divya  

Keywords:

P-Cycle, Floyd's Algorithm, Demand Calculation, Data Mining.

Abstract

The major challenge in survivable networks is the design of resource allocation algorithms that allocate network resources efficiently while at the same time being able to quickly recover from failure by rerouting the broken connection using the reserved spare capacity. This issue is particularly more challenging in optical networks operating under the wavelength continuity constraint, where the same wavelength must be assigned on all links in the selected path. This paper review the p-cycle deployment using widely used data mining algorithms and demands are calculated based on the floyd’s algorithm.

References

  1. Abdelhamid, E, Eshoul & Hussein T Mouftah 2009, ‘Survivability Approaches Using P-cycles in WDM Mesh Networks Under Static Traffic’ , IEEE/ACM transaction on Networking, vol. 17, no.2.
  2. Ahmed, CF, Tanbeer, SK & Jeong, BS 2011, ‘A Framework for Mining High Utility Web Access Sequences’, IETE Technical Review, vol.28, no.1, pp.3-16.
  3. Aiman Moyaid Said P D D, Dominic & Azween B Abdullah 2009, ‘A Comparative Study Of FP-Growth Variations’, IJCSNS International Journal of Computer Science and Network Security, vol.9, no.5.
  4. Baglioni, M, Ferrara, U, Romei, A, Ruggieri, S & Turini, F 2003, ‘Preprocessing and Mining Web Log Data for Web Personalization’, Proceedings of the 8th Italian Conference on Artificial Intelligence, NCS vol.2829, pp.237-249.
  5. Borges, J & Levene, M 2000, ‘Data Mining of User Navigation Patterns’, Web Usage Analysis and User Profiling, vol.1836, pp.92-111.
  6. Chan, K et al 2002, ‘Comparison of Machine Learning and Traditional Classifiers in Glaucoma Diagnosis’, IEEE Trans. Biomed. Eng., vol.49, no.9, 963-974.
  7. Grover WD & Doucette J 2002, ‘Advances in optical networks design with P-cycles: Joint optimization and pre-selection of candidate P-cycles’, in proc. IEEE/LEOS, All-Optical Networking Conf., Mont Trem-blant, Qc, Canada, pp.WA2.49-WA2 -50.
  8. Hongsik Choi, Suresh Subramaniam & Hyeong-Ah Choi 2004, ‘Loopback Recovery from Double-Link Failures in Optical Mesh Networks’, IEEE Transaction on Networking,vol.12, no.6.
  9. Joshi, A 2001, ‘Web/data mining and personalization’, University of Maryland Baltimore County (UMBC) eBiquity Research Area, http://ebiquity.umbc.edu/project/html/id/17/Web-Data-Mining-and-Personalization.
  10. Kosala, R & Blockeel, H 2000, ‘Web Mining Research: A Survey’, In ACM SIGKDD Explorations, vol.2, pp.1-15.
  11. Poonam Sharma & Gudla Balakrishna 2011, ‘PrefixSpan: Mining Sequential Patterns by Prefix-Projected Pattern’, International Journal of Computer Science & Engineering Survey (IJCSES), vol.2, no.4.
  12. Taifei Zhan, Hongfang Yu & Lemin Li 2006, ‘A Novel Algorithm For Node-Encircling And Link Candidate P-cycles Design’, in WDM Mesh Network vol.29, no.7, pp.1227-1233.
  13. Zhenrong Zhang, Wen-De Zhong, & Biswanath Mukherjee 2004, ‘A Heuristic Method For Design Of Survivable WDM Networks With P-cycles’, IEEE Communications letters, vol.8, no.7.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2016-10-30

Issue

Volume 2, Issue 5, September-October-2016

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Dr. S. Umarani, Dr. T. Rama Chaithanya, M. Divya, " Deployment of P-Cycle in Optical Networks: A Data Mining Approach, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 5, pp.324-330, September-October-2016.