• Title/Summary/Keyword: steady-state probability (SSP)

Search Result 2, Processing Time 0.016 seconds

Extended Service Filtering Technique for Overload Control of Televoting Service Required for the Specialized Resources of Intelligent Peripheral (지능형 정보제공 시스템의 특수 지원을 이용하여 제공되는 전화투표 서비스의 과부하 제어를 위한 확장된 서비스 필터링 기법)

  • Jeong, Gwang-Je
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1727-1738
    • /
    • 1996
  • This paper proposes a extended service filtering technique to solve overload control problems inService Con-trol Poin(SCP) due to Televoting (VOT) services with heavy traffic characteristics. Also, this paper compares this new technique with existing IN overload control lechniques, and calculate steady state call blocking probabilities in In under overload conditions. The proposed technique considers SCP overload and IN CS-1services such as VOT service that need to use the specialized resources of IP. This technique uses first an activating step which SCP sends service filtering request to SSP and IP for the start of service filtering. Then, in the filtering step SSP sendas filtering results to SCP periodically or each N-calls.Also,when filtering time-out timer expired or call counter value exceeded maximum number of calls,SSP stops service filtering,and sends ser-vice filteing response to SCP in the deactivating step. The application of this techique to VOT service defined in IN CS-1 service is investigated and analyzed by using an analytical VOT service model.In order to apply this technique to VOT service, this paper also discusses VOT service and the corresponding N architecture including Service Switching Point(SSP),SCP and IP. Then this paper also constructs an analytical VOT service model,and calculates SCP and SSP/IP(circuit)call blocking probablities.With the application of this new technique,this paper shows good performance enhancements in SCP call blocking probability.

  • PDF

Efficient Channel Assignment Scheme Based on Finite Projective Plane Theory

  • Chen, Chi-Chung;Su, Ing-Jiunn;Liao, Chien-Hsing;Woo, Tai-Kuo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.628-646
    • /
    • 2016
  • This paper proposes a novel channel assignment scheme that is based on finite projective plane (FPP) theory. The proposed scheme involves using a Markov chain model to allocate N channels to N users through intermixed channel group arrangements, particularly when channel resources are idle because of inefficient use. The intermixed FPP-based channel group arrangements successfully related Markov chain modeling to punch through ratio formulations proposed in this study, ensuring fair resource use among users. The simulation results for the proposed FPP scheme clearly revealed that the defined throughput increased, particularly under light traffic load conditions. Nevertheless, if the proposed scheme is combined with successive interference cancellation techniques, considerably higher throughput is predicted, even under heavy traffic load conditions.