Academic Journals Database
Disseminating quality controlled scientific knowledge

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

Author(s): Paramjeet Kaur | Hardeep Singh | Satinder Pal Ahuja

Journal: International Journal of Computer Applications
ISSN 0975-8887

Volume: 52;
Issue: 21;
Start page: 11;
Date: 2012;
Original page

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

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.
Affiliate Program     

Tango Rapperswil
Tango Rapperswil