CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Fault Tolerant Algorithms for the Minimization of Blocking Probability in Optical Burst Switching Network

by Paramjeet Kaur, Hardeep Singh, Satinder Pal Ahuja
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 52 - Number 21
Year of Publication: 2012
Authors: Paramjeet Kaur, Hardeep Singh, Satinder Pal Ahuja
10.5120/8333-1845

Paramjeet Kaur, Hardeep Singh, Satinder Pal Ahuja . A Fault Tolerant Algorithms for the Minimization of Blocking Probability in Optical Burst Switching Network. International Journal of Computer Applications. 52, 21 ( August 2012), 11-15. DOI=10.5120/8333-1845

@article{ 10.5120/8333-1845,
author = { Paramjeet Kaur, Hardeep Singh, Satinder Pal Ahuja },
title = { A Fault Tolerant Algorithms for the Minimization of Blocking Probability in Optical Burst Switching Network },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 52 },
number = { 21 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 11-15 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume52/number21/8333-1845/ },
doi = { 10.5120/8333-1845 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:52:50.165216+05:30
%A Paramjeet Kaur
%A Hardeep Singh
%A Satinder Pal Ahuja
%T A Fault Tolerant Algorithms for the Minimization of Blocking Probability in Optical Burst Switching Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 52
%N 21
%P 11-15
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

One of the major concerns in the field of computer Network is how to Transfer large amount of data and Transfer that data without any congestion or faults. Optical Burst Switching networks are used today for the huge transfer of data. So, Fault Tolerance is an important Issue in the Optical burst switching network. Fault tolerant refers to the ability of the network to transfer the information at the same amount as if any type of fault occurs in the network. In any network there are number of path to reach from source to the destination so, first the calculation of shortest path must be required. Blocking probability is the parameter which is used for the calculation of the possibility of the particular path to be blocked. In the traffic engineering Engset formula is used for the calculation of the blocking probability in the network there are the finite population sources. This paper includes the designing of new algorithm for fault tolerant and comparison of Algorithm with already existed algorithms. This algorithm is based on the shortest path calculation, checking of the fault on the each path, Calculation of blocking on paths which are fault free then selects the path with the minimum blocking probability.

References
  1. Hardeep Singh, Dr. Jai Prakash, Dinesh Arora, Dr. Amit Wason (Sept. 2011) "Contention Mitigation in Optical Burst Switching using First-Fit, Random and Reserved Channel Scheduling" IJECT Vol. 2, Issue 3.
  2. Hardeep Singh, Dr. Jai Prakash, Dinesh Arora & Dr. Amit Wason (2011) "Fault Tolerant Congestion Based Algorithms in OBS Network", (IJE), Volume (5), Issue (5).
  3. Hardeep Singh, Dr. Jai Prakash, Dinesh Arora, Dr. Amit Wason(Nov. 2011) "Analysis of Blocking Probability in OBS Network", International journal of sciencetific and engineering research11,volume2,issue 11.
  4. MD. Shaminreza (2010) "Evaluation of brust rate of an optical burst switching (OBS) network with wavelength conversion capability".
  5. G. Ramesh, S. SundaraVadivelu (2009) "A Reliable and Fault-Tolerant Routing for Optical WDM Networks", (IJCSIS), Vol. 6, No. 2.
  6. D. Callegati, F. Matera, T. Franzl and C. Munoz (2009) "Report on Y2 activities and new integration optical network in Europe", FP7-ICT-216863/DEISUNIBO/ R/PU/D11. 2, 2009.
  7. X. Masip Bruin, M. German, A. Castro, E. Marin-Tordera, R. Serral-Gracia and E. gramping (2009) "The Minimum coincidence routing approach in wavelength-routed optical WDM networks", 978-1- 4244-4550-9/09, IEEE 2009.
  8. X. Masip-Bruin, M. German, A. Castro, E. Marin-Tordera, R. Serral-Gracia and E. grampin (2009) "The Minimum coincidence routing approach in wavelength-routed optical WDM networks", 978-1-4244-4550-9/09, IEEE 2009.
  9. J. Zhang, L. Song and B. Mukherjee (2007) "A Fault-Tolerant OBS Node Architecture with Resilient Buffers", Optical Communication (ECOC) 33rd European Conference and Exhibition, 978-3- 8007-3042-1, Sep. 2007.
  10. L. Kungmeng, D. Habibi, Q. V. Phung and H. N. Nguyen, "Dynamic Wavelength Routing in all-Optical Mesh Network", Asia-Pacific Conference on Communication, Perth, Western Australia,177-182. 0- 7803-9132-2/05, IEEE 2005.
  11. Dr. Farid Farahmand and Dr. Qiong (Jo) Zhang (2004) "Circuit Switching" Central Connecticut State University and Arizona State University at West Campus Optical Burst Switching Networks, IEEE Communications Society.
  12. Kaheel, A. (2004) "Analytical evaluation of blocking probability in optical burst switching networks" Communications, 2004 IEEE International Conference, vol. 3.
  13. D. Bisbal, I. D. Miguel, F. Gonzalez, J. Blas, J. C. aguado and M. Lopez (2004) "Dynamic Routing and wavelength Assignment in Optical Networks by Means of Genetic Algorithms", Photonic network Communication, Vol. 7, No. 1, 43-58, 2004.
  14. Zvi Rosberg, Hai Le Vu, Moshe Zukerman and Jolyon White(2003)"Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations", IEEE .
  15. Zvi Rosberg, Hai Le Vu, Moshe Zukerman (Sept. 2003) "Performance Analyses of Optical Burst-Switching Networks", IEEE journal on selected areas in communications, vol. 21, no. 7.
  16. Yang Chen, Hongyi Wu, Dahai Xu and Chunming Qiao (2003) "Performance Analysis of Optical Burst Switched Node with Deflection Routing" IEEE International Conference on, Volume: 2.
  17. Z. Rosberg, H. L. Vu, M. Zukerman and J. White (2003) "Blocking Probabilities of optical burst switching networks based on reduced load fixed point approximations", 0-7803-7753-2/03, IEEE-2003.
Index Terms

Computer Science
Information Sciences

Keywords

Optical burst switching network Shortest path Blocking probablity Congestion Fault tolerance Engset formula

Powered by PhDFocusTM