• Title/Summary/Keyword: call handling performance

Search Result 17, Processing Time 0.026 seconds

The Forwarding Channel of a BTS in IS-95 CDMA Cellular Network

  • Kwag, Min-kok;Jung, Duk-in;Shin, In-Cheol
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.990-994
    • /
    • 2000
  • The design of LAI(Local Area Identifier), the first paging area for searching the mobile terminal has a close relation with the performance of paging channel in CDMA cellular network. This paper discusses the performance of the forward channel of IS-95 CDMA standard, known as the paging through the related messages such as call control message, channel assignment message. Modeling and simulation work were conducted to quantify the performance of paging channel in terms of traffic handling capacity and blocking levels. This result serves as illustrative guidelines for the proper engineering of common control channel, which has a major impact on the overall performance of cellular network.

  • PDF

A Study on the Performance Analysis of Inter-Processor Communication Network for Digital Switching System (대용량 전자교환기 내부통신망 성능 분석에 관한 연구)

  • 최진규;이충근;이태원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.7
    • /
    • pp.1335-1345
    • /
    • 1994
  • In this paper, the performance analysis of Inter-Processor Communication Network(IPCN) in a large-capacity digital switching system, TDX-10, is presented. The simulation model of IPCN is developed using discrete event model of SLAM II. The simulation results of maximum buffer length and mean waiting times at each node, and utilization of D-bus are derived. Finally, the maximum call handling capacity of IPCN is obtained by taking link speed into consideration.

  • PDF

Performance of a time slot searching mechanism in multi-rate circuit switching system

  • Roh, Seung-Kye;Kook, Kwang-Ho;Lee, Jae-Sup;Chung, Min-Young;Sung, Dan-Keun
    • Korean Management Science Review
    • /
    • v.10 no.1
    • /
    • pp.127-137
    • /
    • 1993
  • The blocking probabilities of nx64Kb/s multi-slot calls are generally much higher than that of single slot calls. In order to improve these blocking probabilities of multi-slot calls, we propose a scheme which searches the different numbers of time slots for different types of calls. We analyze the performance of our scheme in a double-buffered time-space-time switching network which accommodates multi-slot calls as well as single-slot calls. The proposed method yields the reduced blocking probabilities, the increased traffic handling capacity and teh reduced CPU processing load, compared with those of the conventional methods.

  • PDF

Design and Performance Analysis of ISDN Switching Systems for Frame Relay Service (프레임 릴레이 서비스를 위한 ISDN 교환시스템의 설계 및 성능 분석)

  • Jang, Jae-Deuk;Kim, Jin-Tae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.501-511
    • /
    • 1996
  • Typical integrated service digital network(ISDN) switching systems have several shortcomings including cumulated long call set-up delay and difficulty in higher speed packet communication. The problems come from the nature of X.25 packet swiching technique used in the systems. In this thesis, to solve the above problems, the use of frame relay service within the TDX-10 ISDN switching system is proposed and a frame handling susbsystem(FHS) is designed in order to support the high speed frame relay service in the TDX-10 switching systems. In the proposed TDX-10 architecture, the 64 Kbps packet communication can be executed more ef- ficiently and high speed packet communication is allowed. To measure theperformance characteristics of the proposed systemand to compare the performance with that of the proposed system is superior to that of the existion system and to compare the performance with that of the proposed system is superior to that of the existing system. The proposed switching system offers a seamless evolutionalry path from Narrowband-ISDNto Broadband-ISDNsince itallows anefficient channelutilization and speed packet communication.

  • PDF

Performance Analysis of Population-Based Bandwidth Reservation Scheme with Various Request Reservation Ratios (요청 예약 비율에 따른 Population-Based Bandwidth Reservation 구조의 성능 분석)

  • Kwon, Se-Dong;Han, Man-Yoo;Park, Hyun-Min
    • The KIPS Transactions:PartC
    • /
    • v.9C no.3
    • /
    • pp.385-398
    • /
    • 2002
  • To accommodate the increasing number of mobile terminals in the limited radio spectrum, wireless systems have been designed as micro/picocellular architectures for a higher capacity. This reduced coverage area of a cell has caused a higher rate of hand-off events, and the hand-off technology for efficient process becomes a necessity to provide a stable service. Population-based Bandwidth Reservation(PBR) Scheme is proposed to provide prioritized handling for hand-off calls by dynamically adjusting the amount of reserved bandwidth of a cell according to the amount of cellular traffic in its neighboring cells. We analyze the performance of the PBR scheme according to the changes of a fractional parameter, f, which is the ratio of request reservation to the total amount of bandwidth units required for hand-off calls that will occur for the next period. The vague of this parameter, f should be determined based on QoS(Quality of Service) requirement. To meet the requirement the value of Parameter(f) must be able to be adjusted dynamically according to the changing traffic conditions. The best value of f can be determined by a function of the average speed of mobile stations, average call duration, cell size, and so on. This paper considers the average call duration and the cell size according to the speed of mobile stations. Although some difference exists as per speed, in the range of 0.4 $\leq$ f $\leq$ 0.6, Blocking Probability, Dropping Probability and Utilization show the best values.

Effect of Terminal Layouts on the Performance of Marine Terminals for Mega-containerships

  • Imai, Akio;Nishimura, Etsuko;Papadimitriou, Stratos
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.2
    • /
    • pp.165-171
    • /
    • 2006
  • The appearance of over 10,000 TEU containerships (so called Mega-containerships) is determined. In order to operate these ships effectively, the number of these calling ports will diminish, and then feeder ships will transport cargoes from the hub-ports where mega-containerships call to the destination ports. In the hub-ports, handling containers for mega-containerships become huger, thus it is important for terminals to deal with cargo handling as soon as possible. However, the present terminal layout might have the limitation of maximum throughput per time unit. And then the transit time at the ports become longer. Therefore, we investigate the effect on some different terminal layouts with new alternatives. Actually, we discuss the ship-to-berth allocation at some adjacent berths for mega-containerships on three types of terminal layouts. First one is the conventional type consisted by some linear berths, most container terminals in the world are normally this type. Second one is the indented type consisted by linear berths and indented berths which we can handle from both sides of mega-containership simultaneously. Third one is the floating type consisted by linear berths and the floating berth. On this type, mega-containerships can moor between linear and floating berths. The merits of this type are that we can also handle from both sides of mega-containerships simultaneously, and ships can go through between linear berth and floating berths. Thus it is easier for ships to moor and leave berths. Under such assumptions, we examine the numerical experiments. In most cases, the total service times on the indented type are the longest among three types, these on the floating type are the next longer. Those reasons are that these layouts have the differences of berth occupancy obtained by the time and space axes, and whether the precedence constraints of ship service order needs or not.

  • PDF

Design and Implementation of Service Control Point(SCP) for a Next-Generation Intelligent Network based on Internet Environment (인터넷 환경에서의 차세대 지능망 적용을 위한 SCP설계 및 구현)

  • Lee, Ji-Young;Kim, Yeon-Joong;Ma, Young-Sik;Kim, Dong-Ho;An, Sun-Shin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.4
    • /
    • pp.336-349
    • /
    • 2001
  • Intelligent Network (IN) is an architectural framework for the rapid and uniform provision of advanced services. Therefore, Next-generation IN platform should support fast service handling, the dynamic adaptation of various services according to various requirements of users. In this paper, we design and implement the Service Control Point (SCP) that is based on the Internet environment. Especially, we consider the service flexibility, the dynamic distribution of service and propose a set of mechanisms to optimize the performance of this platform. This SCP consists of the platform kernel to control intemal operations, tbe service manager to control all of services, SLPI (Service Logic processing Program Instance) manager to manage each service, and SLPI to handle service interaction. In addition, we propose the Service Creation Environment (SCE) to create easily services on the implemented platfonn and show the example of Call Forwarding service operated on this platform.

  • PDF