Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 110 for “"blocking probability"”.

  1. Performance of a new cellular channel assignment scheme including handoffs

    … studied through computer simulations in terms of blocking probabilities and handoff activities. A comparison of blocking probabilities between the proposed scheme and some existing channel assignment schemes is made. In the no handoff case, the proposed scheme can significantly improve the …

    ubc Repository record for Performance of a new cellular channel assignment scheme including handoffs (opens in a new tab) Download PDF for Performance of a new cellular channel assignment scheme including handoffs (opens in a new tab)

  2. An examination of single link failure in an optical network with full grooming

    … on using small cycles to form backup routes. The blocking probability of connections in a network thus protected is compared against the networks blocking probability if protected by a p-Cycle. Simulations showed that the more spread out backup capacity had lower blocking probability than a …

    iastate Repository record for An examination of single link failure in an optical network with full grooming (opens in a new tab)

  3. Analysis and design of optical burst switching networks

    … scheduling algorithms for enhancing the blocking probability in OBS networks. QoS provisioning is a major research problem in OBS networks. This is mainly because of the absence of the concept of "packet queues" in OBS networks. This thesis proposes two approaches for QoS provisioning in …

    ubc Repository record for Analysis and design of optical burst switching networks (opens in a new tab) Download PDF for Analysis and design of optical burst switching networks (opens in a new tab)

  4. Performance Analysis for Supporting Ultra-Reliable Low-Latency Communications in Advanced Wireless Networks

    … (SINR) coverage probability at physical layers and the average blocking probabilitiy at link layers. The impact of network densification on the blocking probability, which is of practical interest to carriers, is studied with numerical results. Specifically, …

    carleton Repository record for Performance Analysis for Supporting Ultra-Reliable Low-Latency Communications in Advanced Wireless Networks (opens in a new tab)

  5. Grade of service of a telephone exchange.

    … exchange. The analytical models used are (a) the probability linear graph for lost calls and (b) the traffic flow graph for delayed calls. Both of these models are expressed in terms of the congestion functions of the sub-units of the switching system in the exchange. When these models are used, …

    ottawa-retro Repository record for Grade of service of a telephone exchange. (opens in a new tab)

  6. PF-OBS: A proportionally fair congestion avoidance algorithm for Optical Burst Switching networks

    … control method, called PF-OBS, which limits the blocking probability in OBS networks. PF-OBS uses a utility maximization approach to congestion control. The method assigns prices to congested links. Ingress nodes receive bandwidth proportionally to the price they are willing to pay. The resulting …

    ottawa-retro Repository record for PF-OBS: A proportionally fair congestion avoidance algorithm for Optical Burst Switching networks (opens in a new tab)

  7. Network configurations for seamless support of CDMA soft handoffs between cell-clusters

    … I is proposed to reduce the handoff blocking probability by lengthening the handoff transition time. Configuration II expands each cell-cluster by some layers of cells which overlap with adjacent cell-clusters, thus enabling the use of different inter-cluster handoff regions for …

    ubc Repository record for Network configurations for seamless support of CDMA soft handoffs between cell-clusters (opens in a new tab) Download PDF for Network configurations for seamless support of CDMA soft handoffs between cell-clusters (opens in a new tab)

  8. Power of d choices for large-scale bin packing: a loss model

    … arriving jobs to the servers to minimize the probability that an arriving job does not find the required amount of resource at the server, i.e., the goal is to minimize blocking probability. Our motivation arises from the design of cloud computing systems in which the jobs are virtual machines …

    uiuc Repository record for Power of d choices for large-scale bin packing: a loss model (opens in a new tab)

  9. Routing and protection issues in optical WDM mesh networks

    … not only the complexity of problem but also the blocking probability in the networks. Our objective is to maintain the blocking probability as low as possible and minimise the investment required by placing WCs only at a minimum number of nodes. This problem is referred to as Sparse Wavelength …

    edithcowan Repository record for Routing and protection issues in optical WDM mesh networks (opens in a new tab)

  10. Impact of Blockages on Mobile Users in 5G Millimeter-Wave Cellular Systems

    … significant fluctuation in the handover (HO) probability. Thus, the foreseen mm-wave communication gains are achieved at the expense of varying HO probability. Therefore, the impact of blockages on the HO probability for a user with mobility is a crucial performance factor that needs to be …

    concordia Download PDF for Impact of Blockages on Mobile Users in 5G Millimeter-Wave Cellular Systems (opens in a new tab)

  11. Access size and order in queueing systems

    … access multiples are discussed and compared. Blocking probability curves for slipped multiple access order are generated. Cost of access is discussed. Cost per erlang curves, from which optimum access size is determined, are generated. Algorithms for generating these curves are developed. A …

    vt Repository record for Access size and order in queueing systems (opens in a new tab)

  12. Evaluation of roaming and download times in universal cellular/wireless LAN systems

    … the roaming acquisition time and system resource blocking probability, mobile station resource blocking probability, packet successful transmission probability over wireless channel and signaling bit rate over the universal base station channel in different cases and design scenarios are analyzed. …

    concordia Download PDF for Evaluation of roaming and download times in universal cellular/wireless LAN systems (opens in a new tab)

  13. PROBABILISTIC SHANNEL RESERVATION FOR MOBILE CELLULAR NETWORKS

    … in which channel reservation is based on the probability of handoff from one cell to another has been proposed as a more flexible and dynamic means of providing handoff priority in mobile micro/picocellular networks in which frequent handoff events are to be expected. The handoff probability …

    nus Repository record for PROBABILISTIC SHANNEL RESERVATION FOR MOBILE CELLULAR NETWORKS (opens in a new tab) Download file for PROBABILISTIC SHANNEL RESERVATION FOR MOBILE CELLULAR NETWORKS (opens in a new tab)

  14. Traffic lifetime-aware routing considering dynamic grooming in WDM networks

    … topology with the objective to minimize the blocking probability of connection requests. Paths are selected among a candidate set of paths chosen by the grooming policy and utilization of some resources is referred as constraints. Moreover, since lightpath is logical link in virtual topology, …

    nus Repository record for Traffic lifetime-aware routing considering dynamic grooming in WDM networks (opens in a new tab) Download file for Traffic lifetime-aware routing considering dynamic grooming in WDM networks (opens in a new tab)

  15. Call Admission Control in Wireless Mesh Networks

    … total revenue gain in WMNs environment, total blocking probability and per class blocking probability in PMIPv6 networks.

    kings Repository record for Call Admission Control in Wireless Mesh Networks (opens in a new tab) Download PDF for Call Admission Control in Wireless Mesh Networks (opens in a new tab)

  16. Dynamic optical multicast routing in sparse-splitting WDM networks

    … our algorithm outperforms in load balancing and blocking probability performances. Experiments have also shown that the method of limiting the number of wavelengths each forest can occupy, termed as forest trimming, can be utilized to improve the blocking probability performance. It has also been …

    ottawa-retro Repository record for Dynamic optical multicast routing in sparse-splitting WDM networks (opens in a new tab)

  17. Protection and Restoration for Wavelength division Multiplexing Optical Networks

    … metrics used were backup resource ratio and blocking probability. The results obtained indicate that the novel restoration and protection routing algorithms have an improved performance when measured with the selected performance metrics (backup resource ratio and blocking probability), over …

    nwu-za Repository record for Protection and Restoration for Wavelength division Multiplexing Optical Networks (opens in a new tab)

  18. Μηχανισμοί διαλειτουργικότητας σε πολυ-υπηρεσιακά δίκτυα επόμενης γενιάς

    … node regarding the systemic weighted average blocking probability and throughput takes place. Targeting to optimize the performance in relation to blocking probability and throughput, an advanced connection admission control mechanism is presented. It is based on delay variation and it is …

    greece Repository record for Μηχανισμοί διαλειτουργικότητας σε πολυ-υπηρεσιακά δίκτυα επόμενης γενιάς (opens in a new tab)

  19. A modified M/G/1/N system and its application

    … is studied as a Markov Chain and the limiting probability distributions are obtained. The explicit form sorution for the queue length distribution, blocking probability, waiting time distribution as well as the busy period are derived through the Laplace-Stieltjes transform method. These …

    njit Repository record for A modified M/G/1/N system and its application (opens in a new tab)

Page 1 of 6