• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.121-128
• /
• 2005

Recently, as the research of effective resource management for supporting of various next generation internet service, the admission control mechanisms using the dynamic provisioning methods in differentiated service networks are studied. However, even though admission control mechanism is applied to the network, there exits the unfairness of call blocking probability among the different bandwidth requested services. In this paper, we propose the new admission control policy heuristic algorithm that provides fairness of call blocking probability between the large bandwidth requested service and the small bandwidth requested service. The simulation results show that the proposed algorithm provides not only blocking probability fairness but also high bandwidth utilization.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.814-821
• /
• 2005

본 연구에서는 인터넷전화의 잠재 가입자를 대상으로 이들의 전화 사용 행태 및 사회-인구 통계적 특성 검토하여 이를 인터넷전화의 가입 확률로 연결하는 모형을 개발한다. 이때 가입 예측모형은 설문결과에 이산 프로빗 모형을 적용함으로써 구축하였다. 모형의 결과에 따르면 인터넷전화서비스 가입에 통계적으로 유의한 영향을 미치는 변수는 월 전화요금, 월 전화사용회수, 채택하고 있는 전화요금제, 현재 가입 중인 전화회사, 가구 의사결정자의 나이 등인 것으로 분석되었다. 또한 위의 각 요인의 부호는 관련 분야의 전문가들의 일반적인 견해 및 상식과 일치하는 것으로 나타났다.

• 한국데이터정보과학회:학술대회논문집
• /
• 2001.10a
• /
• pp.79-86
• /
• 2001

본 논문에서는 민감한 양적 정보를 얻기 위한 조사에서 응답자들이 정직하게 응답하기를 꺼리는 질문들에 대하여 응답자의 비밀을 노출시키기 않고서 양적 정보에 대한 보다 정확한 정보를 얻을 수 있는 양적 확률화응답기법을 인터넷 상에서 사용할 수 있도록 구현하고자 한다. 본 시스템에 DB 환경에 바탕을 두어 기존의 온라인 설문조사 시스템 및 질적 확률화응답기법과 연계하여 자료를 공유할 수 있을 뿐만 아니라 독립된 스팟 서베이(spot survey)가 가능하도록 구현하고자 한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.1
• /
• pp.9-15
• /
• 2005

Congestion control is an important research area in computer network. In this paper, I provided strategy of congestion pricing with differentiated services. And, suggested forecasting model of access that considered differentiated pricing, delay time, satisfaction using logistic regression. In a forecasting model of access with logistic regression technique, it is shown that coefficient of determination using suggested model is $70.7\%$.

• Journal of Internet Computing and Services
• /
• v.14 no.2
• /
• pp.61-71
• /
• 2013

Until now, there have been various studies against Internet worms. Most of intrusion detection and prevention systems against Internet worms use detection rules, but these systems cannot respond to new Internet worms. For this reason, a malicious process control system which uses the fact that Internet worms multicast malicious packets was proposed. However, the greater the number of servers to be protected increases the cost of the malicious process control system, and the probability of detecting Internet worms attacking only some predetermined IP addresses is low. This paper presents a security framework that can reduce the cost of the malicious process control system and increase the probability of detecting Internet worms attacking only some predetermined IP addresses. In the proposed security framework, virtual machines are used to reduce the cost of control servers and unused IP addresses are used to increase the probability of detecting Internet worms attacking only some predetermined IP addresses. Therefore the proposed security framework can effectively respond to a variety of new Internet worms at lower cost.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.11-17
• /
• 2009

Blind equalization techniques have been used in multipoint communication on which the research on the internet has focused. In this paper, a criterion of minimizing Euclidian Distance between two PDFs for adaptive blind equalizers has been presented. In order for ED expressed with Parzen PDFs to be minimized, we propose to use a set of randomly generated desired symbols at the receiver so that the PDF of the generated symbols matches that of the transmitted symbols. From the simulation results, the proposed method has shown superior error performance even in severe channel environments in which CMA has shown severe performance degradation. This indicates that the proposed algorithm can be considered relatively insensitive to ESR variations compared to CMA. As a field of ITL, ED minimization using Parzen PDFs has shown possibilities of being successfully applied to blind equalization.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.145-150
• /
• 2010

In this paper, the performance of cognitive radio network is analyzed in terms of Erlang capacity. To improve the Erlang capacity with respect to primary user (PU) and secondary user (SU) traffic, we propose an efficient radio resource management scheme utilizing the buffer for new SUs and interrupted SUs. Markov model is developed, and analyzed to derive the performances of the proposed spectrum sharing scheme in both primary system and secondary system. To determine the Erlang capacity region, the blocking probability, the forced termination probability and the non-completion probability are calculated. Simulation results provide insight into the advantages of the buffer utilization. It is observed that the supportable traffic loads of PU and SU can be increased significantly according to the buffer length.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.21-27
• /
• 2019

In this paper, we investigate the secrecy outage probability when using a partial relay selection scheme in cooperative communication systems based on decode-and-forward with multi-relay. It is assumed that both the receiving node and the eavesdropping node receive signals at both the transmitting node and the relaying node. The two received signals are used to obtain the diversity gain using the MRC scheme. In this paper, we compute the theoretical formula of secrecy outage probability and compare the theoretical value with the simulation value to prove that equation is valid. The simulation results show how the secrecy outage probability varies with the number of relays.

• Journal of Internet Computing and Services
• /
• v.14 no.1
• /
• pp.9-14
• /
• 2013

The criterion of zero-error probability provides a limitation on error probability functions being used for adaptive systems when the error samples are shifted by the influence of DC-bias noise. In this paper, we employ a bias term in the error distribution and propose a new criterion of the biased zero-error probability with error being zero. Also, by maximizing the proposed criterion on expanded filter structures, a supervised adaptive algorithm has been derived. From the simulation results of supervised equalization, the algorithm based on the proposed criterion yielded zero-centered and highly concentrated error samples without disturbance in the environments of strong impulsive and DC-bias noise.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.59-66
• /
• 2015

A stochastic modeling approach as a mathematical method for workflow intelligence is widely used for analyzing and simulating workflow models in the literature. In particular, as a resource-centric modeling approach, this paper proposes a stochastic model to represent work-handover relationships between performers in a workflow-supported social network. Calculating probabilities for the work-handover relationships are determined by two types of probabilities. One is the work-transition probability between activities, and the other is the task assignment probability between activities and performers. In this paper, we describe formal definitions of stochastic workflow models and stochastic work-handover relationship models, as well. Then, we propose an algorithm for extracting a stochastic work-handover relationship model from a stochastic workflow model. As a consequence, the proposed model ought to be useful in performing resource-centric workflow simulations and model-log comparison analyses.