Network Load Based Analysis of Blocking Probability in WDM Network

Sukhadeve, Aditya Y (2015) Network Load Based Analysis of Blocking Probability in WDM Network. MTech thesis.

[img]
Preview
PDF
1445Kb

Abstract

Arrangement of expansible quality of service (QoS) attestation on wavelength division multiplexing (WDM) is a crucial and perplexing problem of the cutting threshold internet. From the essential performance parameters the blocking probability (BP) computation is a QoS adept in WDM network. This method of BP computation in a wavelength routed optical network (WRON) is presented, keep in mind that blocking-probability computation used only to a network that is remain same where, traffic demands arrive, wait for a convinced time, and finally dispense, so that the total traffic intensity for a time is same i.e. remain unchanged. For an active optical network (AON), despite the fact we lag behind that traffic loads will reach, wait for a fixed time, and afterword dispense, same we taken into account that the normalized intensity of traffic existing of a network is going to increase gradually with time as the number of users receiving on the typical network and also growth in their networking essentials towards large bandwidth uses, extended holding time uses, etc. Hence, blocking probability computation try not to use meanwhile traffic is not fixed. Otherwise, we have to take into account of "exhaustion probability," having a time duration, lastly we anticipated that the network is to run into capacity exhaust. The realization traffic distribution of network performs to achieve an exact blocking performance. So the BP for each available link having a shortest path or having a large weight in a sorted order taken into account, in the network the connection and node relation for the traffic between each link is dependant. The usefulness of this technique is to be applicable in low load region, exact, faster compare to other techniques. Furthermore, this technique is more useful to calculate the estimation of blocking probability per node as well as for the network.

Item Type:Thesis (MTech)
Uncontrolled Keywords:WDM, WRON, RWA, Network load, blocking probability, Disjoint Path, Shortest Path
Subjects:Engineering and Technology > Electronics and Communication Engineering > Wireless Communications
Engineering and Technology > Electronics and Communication Engineering
Engineering and Technology > Electronics and Communication Engineering > Artificial Neural Networks
Divisions: Engineering and Technology > Department of Electronics and Communication Engineering
ID Code:7909
Deposited By:Mr. Sanat Kumar Behera
Deposited On:16 Sep 2016 14:42
Last Modified:16 Sep 2016 14:42
Supervisor(s):Das, S K

Repository Staff Only: item control page