BITS Faculty Publications

Permanent URI for this communityhttp://localhost:4000/handle/123456789/1867

Browse

Has files: NoSubject: search.filters.subject.Blocking probability

Search Results

Now showing 1 - 9 of 9
  • No Thumbnail Available
    Item
    Finite Queueing Model with Multitask Servers and Blocking
    (Scientific & Academic Publishing, 2012) Shekhar, Chandra
    This paper deals with a Markovian queueing system having a multi-task service counters and finite queue in front of each counter. The total service of a customer is completed in three stages provided by two servers at three counters. The first server (S1) can serve the counter I and III alternatively, whereas second server (S2) provides the service at counter II. The server (S1) gives the priority to the customers waiting for stage third for the service at counter III since they are in last phase of service completion. The steady state queue size distribution has been obtained. The expressions for mean number of customers in the system, average queue length and blocking probability have been obtained. Sensitivity analysis has been carried out to study the effect of variation of different parameters.
  • No Thumbnail Available
    Item
    Preemptive mobile assisted and guard channel based handoff queuing scheme
    (IEEE, 2011) Joshi, Sandeep
    Mobility is an important aspect of any time, any where next generation wireless communication networks. Handoff supports this mobility of the users and allows them to move from one cell to another without service interruption or degradation and in true sense makes a user mobile. Handoff failure results in forced termination of an ongoing call so the handoff requests need to be prioritized over originating call requests. This paper discusses a preemptive scheme which uses channel reservation for handoff requests as well as allows ongoing non-real time calls to be preempted by real-time handoff calls arriving in the network. Handoff decisions are assumed to be Mobile-Assisted and hence calls are handed over to Base stations with good-quality signals. Markov chain model of the proposed scheme has been designed and dropping and blocking probabilities of the calls arriving at the network have been computed.
  • No Thumbnail Available
    Item
    Performance analysis of optical burst switching (OBS) network using fiber delay line: A simulation approach
    (IEEE, 2012) Chaubey, V.K.; Chamola, Vinay
    One of the key problems in the application of optical burst switching (OBS) network is to overcome the performance degradation due to contention. Contention takes place when two or more incoming bursts are directed to the same output line. This problem can be solved in time domain by incorporating fiber delay lines (FDLs) in the switch architecture. In the present paper a mathematical model has been proposed to estimate the blocking probability of an OBS network in presence of FDLs. The proposed work has further been extended to find out the effect of fiber non-idealities on the performance of OBS network. The performance of the proposed model has been evaluated using MATLAB simulations. Simulation results demonstrate that significant performance gains in optical-burst switching are achievable when FDLs are employed as optical buffers for contention resolution
  • No Thumbnail Available
    Item
    Routing and wavelength assignment in WDM network using IWD based algorithm
    (IEEE, 2016) Chaubey, V.K.
    In this paper, we consider the Routing and Wavelength Assignment problem in WDM optical networks. We consider the dynamic traffic and assume that in each optical fiber the number of wavelengths has fixed. In this paper, our attempt is to minimize the call connection blocking ratio using Intelligent Water Drops (IWD) Algorithm for RWA problem in an optical network. The IWD algorithm employed has modified to take into consideration the congestion and length information during the routing decision process for the optimal routes of primary lightpath establishments. Inspired by natural water drops principles, we propose a modified IWD algorithm for RWA problem in the dynamic WDM networks with improved blocking performance. Simulation results show that IWD based RWA problem can significantly achieve a lower blocking ratio performance than the traditional routing strategies.
  • No Thumbnail Available
    Item
    Priority based wavelength routed WDM networks: A queuing theory approach
    (Proquest, 2009-05) Chaubey, V.K.
    The present paper proposes a new model for priority assignment to the incoming call connection request for all optical WDM communication, adopting standard queuing theory concept. The model has been proposed for three different levels of call connection priorities, categorizing them into three types of signals as type0, type1 and type2 according to increasing priority, and generation probabilities of P 0, P 1 and P 2 respectively. The traffic at the node will be serviced according to the priority leveled on the header of the assigned packets. A traffic throughput model has been developed to evaluate the blocking probability of three types of connection requests.
  • No Thumbnail Available
    Item
    Performance Analysis of All-Optical WDM Network with Wavelength Converter Using Erlang C Traffic Model
    (Springer, 2010) Chaubey, V.K.
    In this paper we have analyzed the performance of an all-optical WDM network for different parameters, such as number of channels, number of wavelengths associated, number of hops between source to destination etc. To establish a light path between two nodes wavelength continuity is a big constraint and to avoid this problem either wavelength converter or optical delay line or both may be used. Wavelength converter will convert the wavelength of the incoming signal into a desired wavelength at the output and the optical delay line will hold the incoming signal for a certain time. In this paper we considered that the network is equipped with wavelength converter and the traffic through the network is Erlang-C type. A mathematical model for the same has been devised and its performance has been analyzed with an investigation on collective impacts of various traffic parameters on transmission.
  • No Thumbnail Available
    Item
    Design and Simulation of Intelligent Optical WDM Switching Node Based on Erlang Traffic Model
    (Scientific Research, 2010) Chaubey, V.K.
    In this paper we propose a new architectural switching nodes consisting of two processing nodes that follow Erlang B and Erlang C traffic respectively. The developed model is used to best utilize the given number of output channels to achieve the least blocking probability. An appropriate mathematical model has been further devised and its call blocking probability has been enunciated. Performance of the model has been evaluated for different values of blocking probabilities. It has been observed that the performance of the network is well satisfactory for different design parameters.
  • No Thumbnail Available
    Item
    Comparative Analysis of Wavelength Conversion and Segmentation Based Dropping Method as a Contention Resolution Scheme in Optical Burst Switching (OBS) Network
    (Elsevier, 2012) Chaubey, V.K.
    Optical burst switching (OBS) is a promising switching technology for realization of terabit optical network. However, the lack of optical processing capability results in increased blocking probability and limits the network performance. Efficient contention resolution is therefore necessary. OBS networks are usually implemented using efficient contention resolution protocols like wavelength conversion, burst dropping etc. Wavelength conversion is the process of converting a wavelength on an incoming channel to another wavelength on the outgoing channel. In burst segmentation dropping scheme, rather than dropping the entire burst during contention, the burst may be broken into multiple segments, and only the overlapping segments are dropped. Comparative analysis between wavelength conversion and segmentation-based burst dropping techniques in optical burst switched network has been presented in this paper. Appropriate mathematical models have been developed to calculate call connection probabilities for both the techniques and results are validated through proper simulations
  • No Thumbnail Available
    Item
    A novel multi-path data transmission algorithm for wavelength routed optical WDM networks
    (IEEE, 2011) Shekhawat, Virendra Singh; Chaubey, V.K.
    This paper investigates the traffic handling capability of wavelength routed optical WDM (Wavelength Division Multiplexing) network, exploiting multi-path transmission under a proposed adaptive link weight algorithm. Data transmission through multiple paths improves the connection probability by reducing the wavelength hold time on a link. Further it reduces traffic load on bottleneck links by distributing traffic over multiple paths in the network. The proposed algorithm uses multiple edge disjoint paths to mitigate the congestion problem through load balancing and improves the reliability. We study the effectiveness of the proposed algorithm using network simulation and estimate the call blocking probability for the given resources through a single and multi-path transmission to establish the superiority of the latter approach.