A Unifying Approach to Determine the Blocking Probability for Four Models in the Multicast Three-Stage Clos Network

2008 ◽  
Author(s):  
Yu Fan ◽  
Gu Nai-jie ◽  
Liu Yan-jun
Keyword(s):  
Blocking Probability ◽  
Clos Network

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

User-Driven Network Selection during Vertical Handover in 4G Networks

2017 ◽  
Vol 10 ◽  
pp. 1
Author(s):  
Abubakar Muhammad Miyim ◽  
Mahamod Ismail ◽  
Rosdiadee Nordin
Keyword(s):  
Blocking Probability ◽  
Service Selection ◽  
Vertical Handover ◽  
Network Selection ◽  
Selection Strategy ◽  
Intelligent Network ◽  
Decision Algorithm ◽  
Radio Access ◽  
Service Application ◽  
Multi Access

The importance of network selection for wireless networks, is to facilitate users with various personal wireless devices to access their desired services via a range of available radio access networks. The inability of these networks to provide broadband data service applications to users poses a serious challenge in the wireless environment. Network Optimization has therefore become necessary, so as to accommodate the increasing number of users’ service application demands while maintaining the required quality of services. To achieve that, the need to incorporate intelligent and fast mechanism as a solution to select the best value network for the user arises. This paper provides an intelligent network selection strategy based on the user- and network-valued metrics to suit their preferences when communicating in multi-access environment. A user-driven network selection strategy that employs Multi-Access Service Selection Vertical Handover Decision Algorithm (MASS-VHDA) via three interfaces; Wi-Fi, WiMAX and LTE-A is proposed, numerically evaluated and simulated. The results from the performance analysis demonstrate some improvement in the QoS and network blocking probability to satisfy user application requests for multiple simultaneous services.

Multi-hop traffic grooming routing and wavelength assignment using split light trail in WDM all optical mesh networks

2021 ◽  
pp. 1-14
Author(s):  
Sampa Rani Bhadra ◽  
Ashok Kumar Pradhan ◽  
Utpal Biswas
Keyword(s):  
Mesh Networks ◽  
Blocking Probability ◽  
Wavelength Assignment ◽  
End User ◽  
Network Resources ◽  
Wdm Network ◽  
Optical Wdm ◽  
All Optical ◽  
User Access ◽  
Optical Mesh Networks

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity.

Limitation of Erlang B Traffic Model in Elastic Optical Network for Blocking Probability Estimation

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Ujjwal ◽  
Jaisingh Thangaraj
Keyword(s):  
Blocking Probability ◽  
Optical Network ◽  
Constant Load ◽  
Traffic Model ◽  
Service Rate ◽  
Service Provisioning ◽  
Connection Request ◽  
Elastic Optical Network ◽  
Simulation Results ◽  
Single Path

Abstract In this paper, an algorithm for multipath connection provisioning in elastic optical network (EON) has been proposed. Initially, the algorithm prefers the single-path routing for service provisioning. But when single-path routing is not adequate to serve a dynamic connection, the algorithm switches to the connection request fragmentation. Its computation is based on the parameters such as capacity_constant and capacity_allowed to fragment the connection request on disjoint paths. Simulation results clearly state that the proposed algorithm performs well in service provisioning as compared to the traditional single-path routing algorithms and improves the average network throughput. Thereafter, we have investigated the limitation of Erlang B traffic model in EON for calculation of link blocking probability using routing and spectrum assignment (RSA) algorithm. It is verified by the following two ways: (i) effect on the blocking probability in case of constant load and (ii) effect of slot width on the blocking probability. Our simulation results indicate that in EON due to dynamic RSA, blocking probability is not constant in case of proportionate varying of call arrival and service rate giving constant load and blocking probability depends on the number of slots per link, but in Erlang B traffic model blocking probability is always constant in case of constant load and it considers wavelength per link instead of slots per link. This is attributed to the fact that Erlang B traffic model fails to calculate blocking probability accurately in EON. We have computed the carried traffic on 14 nodes, 21-link National Science Foundation Network (NSFNET) topology.

Sign in / Sign up

Export Citation Format

Share Document