The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] reduced load approximation(2hit)

1-2hit
  • Performance Analysis for Channel Borrowing without Locking Schemes with Multimedia Services and Cut-off Priority

    Bong Dae CHOI  Gyoung Il CHAE  Jinmin CHUNG  

     
    PAPER-Wireless Communication Switching

      Vol:
    E83-B No:9
      Page(s):
    2077-2086

    We investigate traffic performance of CBWL schemes with multimedia services on non-homogeneous cellular network in which cut-off priority is given to handoff calls. Two generic routing schemes are analyzed: one is the randomized routing and the other is the least loaded routing. The performance measures that we focus on are the new call blocking probabilities and the handoff failure probabilities. To evaluate blocking probabilities of interest, we construct a generalized access network whose blocking probabilities are same as ones for CBWL systems. For analysis of generalized access network, we apply the reduced load approximation. The computational complexity and memory requirements of proposed algorithm are linear so that we can use this algorithm to approximate blocking probabilities of CBWL systems of large size. The proposed approximations are tested on a number of simple examples. Numerical results for 12 cells and 36 cells networks are given. The comparison between approximation and simulation results shows that the proposed approximation method is quite accurate.

  • Call Blocking Probabilities of Asymmetric Multi-Connection Circuit Groups with Bandwidth Negotiation and Reservation

    Hajime NAKAMURA  Toshikane ODA  

     
    PAPER

      Vol:
    E78-B No:4
      Page(s):
    551-562

    The recent progress of B-ISDN signaling systems has enabled networks to handle calls which require a wide variety of ATM connection sets. This paper is concerned with the circuit group which handles calls requesting asymmetric forward and backward multi-connections, and has the capability of both bandwidth negotiation and bandwidth reservation as a traffic control for enhancing call blocking performance. A model of the circuit group is first established focusing on the call level characteristics of the group, and then a method based on the reduced load approximation and an approximate analysis of a multirate group is proposed for calculating approximate blocking probabilities. The accuracy of the approximation method is evaluated numerically by comparing with an exact method and simulation. Further the impact of bandwidth negotiation and reservation on call blockings is examined based on numerical examples.