• Title/Summary/Keyword: Call Setup time

Search Result 42, Processing Time 0.029 seconds

Location tracking using cache in distributed call processing architecture for PCS (PCS를 위한 분산 호 처리 구조(DCPA)에서 캐쉬를 이용한 위치 추적)

  • 박선영;이원열;한기준
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.8
    • /
    • pp.27-36
    • /
    • 1997
  • In this paper, we propose a locating strategy using a cache based on the distributed call processing stucture. In our stategy, each originating call server, withc is responsible for call setup, has a cache to memorize the service ratio of call server which serves the called terminal.We present performance comparison of the proposed strategy with the existing strategy via simulation. We can reduce the cost for call setup because the originating call server can simpley establish a call without tracing the location of the called terminal. The proposed strategy also reduceds network loads caused by signaling at call setup time and lessens the frequency of queries for the database systems which can be a bottleneck when it serves many subscriber.

  • PDF

Impact of Call Setup Time on UPT Performance Based on AIN Platform

  • Baik, In-Kywan;Jo, Jun-Mo;Kim, Sung-Un;Jung, Sin-Il
    • Journal of Korea Multimedia Society
    • /
    • v.1 no.2
    • /
    • pp.249-255
    • /
    • 1998
  • This paper analyzes the impact of Call Setup Time on UPT performance based on the AIN platform. Call Setup Time is used as the performance parameter. In implementing UPT based on the AIN platform, the geographical location of VLR affects network performance. In order to find an optimum location of VLR among three different types of structures, i.e. VLR is located close to Service Switching Point and Cell Site Controller and located at Service Control Point, each Call Setup Time on proposed time delay model is calculated and compared. Network performance is analyzed by changing the number of STP in No.7 signaling network in UPT and the utilization ratio, $\rho$, for SSP, STP and SCP.

  • PDF

The Performance Analysis for Call Processing of the IMS Based Multimedia Service In BcN (BcN에서 IMS기반 멀티미디어 서비스의 호 처리 성능 분석)

  • Lee, Dong-Hyeon;Kim, Hyun-Jong;Choi, Seong-Gon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.117-124
    • /
    • 2008
  • In this paper, the call setup performance of the CSCF(Call Session Control function) that manages the session control in providing the IMS(IP Multimedia subsystem)-based multimedia service in the BcN(Broadband convergence Network) is analyzed. While the performance related with the call/session of the SIP-Based voice service is analysed, the study for the call recessing performance of the IMS-based multimedia service is insufficient. In this paper, as, the processing capacity and subscriber number of CSCF were changed, the call setup delay time according to the session setup procedure of IMS was measured using the M/M/1 queuing model and OPNET simulation. The experimental results show that the sudden increased delay showed up in case the session establishment requirement ratio of total users over 13% of the CSCF processing capacity. Therefore, the user number and capacity of CSCF suitable for the session establishment delay threshold can be calculated or estimated.

Distributed processing for the Load Minimization of an SIP Proxy Server (SIP 프록시 서버의 부하 최소화를 위한 분산 처리)

  • Lee, Young-Min;Roh, Young-Sup;Cho, Yong-Karp;Oh, Sam-Kweon;Hwang, Hee-Yeung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.4
    • /
    • pp.929-935
    • /
    • 2008
  • As internet telephony services based on Session initiation Protocol (SIP) enter the spotlight as marketable technology, many products based on SIPs have been developed and utilized for home and office telephony services. The call connection of an internet phone is classified into specific call connections and group call connections. Group call connections have a forking function which delivers the message to all of the group members. This function requires excessive message control for a call connection and creates heavy traffic in the network. In the internet cail system model. most of the call-setup messages are directed to the proxy server during a short time period. This heavy message load brings an unwanted delay in message processing and. as a result, call setup can not be made. To solve the delay problem, we simplified the analysis of the call-setup message in the proxy server, and processed the forking function distributed for the group call-setup message. In this thesis, a new system model to minimize the load is proposed and the subsequent implementation of this model demonstrates the performance improvement.

A Protocol Compression Scheme for Improving Call Processing of Push-To-Talk Service over IMS (IMS망에서 PTT서비스의 통화 처리 성능 향상을 위한 프로토콜 압축 기법)

  • Jung, In-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.2
    • /
    • pp.257-271
    • /
    • 2009
  • In this paper, we propose a protocol compression scheme for enhancing the performance of call processing of PTT(Push-to-Talk) which is one of the important services in IMS(IP Multimedia Subsystem), a next generation integrated wired/wireless packet communication network. To service the PTT on an IMS network, it should use the same call setup procedure as legacy Mobile and TRS(Trunked Radio System) networks and have a fast call setup time and enough communication bandwidth because a number of terminals should be able to exchange same data in real time. The proposed A+SigComp scheme reduces the initial call setup delay of SIP by about 10%, which is used by PTT service for call setup. In addition, the A+ROHC scheme is proposed to compress the header of RTP packets transferred during PTT voice transmission and, as a result, about 5% of increase in communication efficiency is observed.

  • PDF

Cache Algorithm in Reverse Connection Setup Protocol(CRCP) for effective Location Management in PCS Network (PCS 네트워크 상에서 효율적인 위치관리를 위한 역방향 호설정 캐쉬 알고리즘(CRCP)에 관한 연구)

  • Ahn, Yun-Shok;An, Seok;Bae, Yun-Jeong;Jo, Jea-Jun;Kim, Jae-Ha;Kim, Byung-Gi
    • Proceedings of the KIEE Conference
    • /
    • 1998.11b
    • /
    • pp.630-632
    • /
    • 1998
  • The basic user location strategies proposed in current PCS(Personal Communication Services) Network are two-level Database strategies. These Databases which exist in the Signalling network always maintain user's current location information, and it is used in call setup process to a mobile user. As the number of PCS users are increasing, this strategies yield some problem such as concentrating signalling traffic on the Database, increasing Call setup Delay, and so on. In this paper, we proposed RCP(Reverse Connection setup Protocol) model, which apply RVC(Reverse Virtual Call setup) algorithm to PCS reference model, and CRCP(Cache algorithm in RCP) model, which adopt Caching strategies in the RCP model. When Cache-miss occur, we found that CRCP model require less miss-penalty than PCS model. Also we show that proposed models are always likely to yield better performance in terms of reduced Location Tracking Delay time.

  • PDF

QoS Based Routing Algorithm with Crank-Back Ability

  • Kanthavong, Somphone;Tangtisanon, Prakit;Lertwatechakul, Mayuree
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2413-2417
    • /
    • 2003
  • This paper proposes an improvement of a QoS based routing protocol. The hierarchical source routing algorithm[4] was improved by including of the Crank-Back algorithm[2]. The Crank-Back capability is the ability to solve the problem of selecting the wrong route because of using unsynchronized routing information in the ingress router. In order to reduce time of reversing the call-setup process back to the ingress router, spare-route information is included with a call-setup packet. Spare-route information could be used by every router to find the next appropriated link itself when insufficient resource of the selected link was found. The proposed algorithm improves the performance of the source routing call-setup process significantly.

  • PDF

Study on improvement of Performance of Call of IP PBX embeded using the Cashing Method (캐싱을 이용한 임베디드 IP PBX의 통화지연 개선에 관한 연구)

  • Kim, Sam-Taek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.6
    • /
    • pp.21-28
    • /
    • 2008
  • In this paper, we proposed an algorithm that reduces call setup time between the IP PBXs installed in the main office and several branch offices. In the IP PBXs installed in branch offices, we prepare some internal memory spaces, and they keep the frequently used extension numbers and the corresponding IP PBX's addresses. In order to call an extension number registered to the other remote IP PBX from an extension number registered to the local IP PBX, the local PBX searches for the destined extension from its internal memory first. If the extension is found, then the local PBX uses its corresponding IP PBX address stored along with the extension, instead of making a query to the main office's IP PBX. By this technique, we could shorten the average call setup time and verified it by an experiment.

  • PDF

An Experiment on On-Demand Circuit Provisioning in SONET/SDH ASON Networks (지능형 광 전달망에서의 on-demand 회선 생성 성능 분석 실험)

  • Nga, Kinh Thi Thuy;Kim, Byung-Jae;Lee, Yong-Gi;Kang, Min-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2005.08a
    • /
    • pp.174-179
    • /
    • 2005
  • In the SONET/SDH based ASON, one VC3 connection contains 21 VC12 calls. Hence, it can serve up to 21 VC12 calls. When a new VC12 call arrives, if there exists at least one available VC3 connection in the network, that VC12 call is severed immediately. However, if there is no available VC3 connection, that VC12 call has to wait a certain time, called setup latency, for the a new VC3 connection to be established. This is inconvenient for the customers. On the other hand, if there are more VC3 connections than the network requires, this can waste network resources. In this paper, we proposed the solution for these problems. In order to reduce the number of VC12 calls which have to wait, we setup a new VC3 before all VC12 time slots are occupied. Furthermore, to avoid the waste of the network resources, we do not establish all VC3 connections at the same time, but do establish step by step.

  • PDF

Performance Analysis of Cal1 Arrival History-Based Location Update Algorithm (호도착기록에 기반한 위치갱신 알고리즘의 성능 분석)

  • Lee, Jong-Min;Kwon, Bo-seob;Maeng, Seung-Ryoul
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.381-388
    • /
    • 2003
  • Location tracking is used to keep track of the location information of a mobile terminal in an idle state for a cail setup between mobile terminals. In this paper, we introduce a location update algorithm based on the call arrival history, which is appropriate for a variable call arrival rate over time. The location tracking strategy which uses the proposed algorithm can find changes in the call arrival rate by maintaining a call arrival history of a mobile terminal, from which a mobile terminal can calculate an appropriate timeout interval for a variable call arrival rate. We show that the proposed scheme is appropriate for a variable call arrival rate by presenting a simple analytical model and analytical results to investigate its performance for both a fixed and a variable call arrival rate.