• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.144-152
• /
• 1996

Recently, as the demands for radio spectrum are growing and the number of cell sites is increasing rapidly, the spectrum engineering plays an important role in estimating frequency sharing and reuse. The radio propagation analysis is essential in the basic technology of radio network design such as deciding the service area and selecting the position of the base station. But, domestic propagation environment in which mountainous region is occupying over 70% of our terrain does not allow us to apply foreign studies which are deduced in highly different environments. Therefore, we need to have our propagation analysis system derived from our own terrain condition. In this paper, we propose the propagation prediction model which issuitable toour propagation environment, and also usinghis model, we implement thesimulator based on GIS(Geographic Information System)which can be applied to both spectrum engineering and radio propagation analysis. We showed that this simulator can well be applied to frequency assignment, propagation network design as well as other radio services. Considering the results of our analysis, we could guarantee the standard deviation of error between the measured data and predicted results as 5 to 7 dB.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.4
• /
• pp.246-255
• /
• 2010

There exist virtual machine scheduling delays in virtualized environment in which virtual machines share physical resources. Many resource management systems have been proposed to provide better application QoS through monitoring and analyzing application performance and resource utilization of virtual machines. However, those management systems don't consider virtual machine scheduling delays, result in incorrect application performance evaluation and QoS violations In this paper, we propose an application behavior analysis considering the scheduling delays, and a virtual machine priority allocation scheme based on the analysis to improve the application response time by minimizing the overall virtual machine scheduling delays.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1433-1442
• /
• 1997

Algorithm design is needed to optimized bandwidth which satisfy quality of service(QoS) requirements of vary traffic classes for Multimedia service in ATM networks. The diverse flow characteristics e.g., burstiness, bit rate and burst length, have to guarantee the different quality of service(QoS) requirements in Asynchronous Transfer Mode(ATM). The QoS parameter may be measured in terms of cell loss probability and maximum cell dely. In this paper, we consider the ATM networks which the virtual path(vip) concept is implemented by applying the Markov Modulated Deterministic Process method. We develop an efficient algorithm to computer the minimum capacity required to satisfy all the QoS requirements when multiple classes of on-off source are multiplexed on single VP. Using above the result, we propose a simple algorithm to determine the VP combination to achieve the near optimum of total capacity required for satisfying the individual QoS requirements. Numerical results are also presented to demonstrate the performance of the algorithm, when compared to the optimal total capacity required.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.956-966
• /
• 2004

Nowadays, NGN(Next Generation Network) is evolving into network with packet based QoS.\ulcorner This paper presents the recovery method as a selecting way of more efficient path in MPLS network that reduces the service interruption time. In order to increase the efficiency of usage of recovering resource which is one of major functions of disorder recovering, it opens the state information of each Node both to fault detector and bandwidth broker so that it reduces message transmission time for recovery when functional disorder occurs. in addition, by effective management and adjustment of required bandwidth of entire network depending on the changes of traffic load, it improves the efficiency of bandwidth usage. and in MPLS network supporting priority selection function, it allocates domains depending on the traffic relating to priority order to the entire network so that\ulcorner it efficiently allocates proper resources to the restoring process between the entry and the end for the traffic of high priority and for low priority traffic, it restores path oかy inside disordered domain. by doing this, it reduces resetting time and unnecessary massage transmission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6A
• /
• pp.445-454
• /
• 2005

To measure the performance of call quality, we have built the experiment environment and observed that the delay caused by encapsulation between internet and VoIP telephones is under 5ms at most. The major delay is assumed to be the time required to capsulate the packet for tunnelling of VPN. Because the difference of average delay time is under $4ms{\sim}5ms$, the difference of call quality between VoIP and VoIP telephone adopting VPN is negligible. We have concluded that the capsulation process between PAC and PNS is the major factor influencing the network load by changing the number of fames in a packet during communication Also, we have concluded that the most suitable frame numbers is tow or three by adding the frame numbers in a packet to obtain the suitable frames in a packet and setting up end-to-end delay under 150ms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8C
• /
• pp.645-654
• /
• 2012

In this paper, we consider a two-way relay (TWR) system, where two user nodes exchange their information within two transmission phases, by the help of a relay node adopting physical layer network coding. In the system, two users transmit their binary phase shift keying symbols simultaneously in the first phase, and the relay node decodes the XORed version of two user data and broadcasts it back to two users in the second phase. The performance of the system is analyzed in terms of the average end-to-end symbol error probability in Nakagami-m fading channels, for which a tight upper bound is derived in a closed form to provide an accurate and handy estimate on the performance. The results show that our upper bounds are almost indistinguishable from simulation results for various channel and system configurations. In addition, the optimal relay location and power allocation for various conditions can be obtained quickly with our analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.1
• /
• pp.19-27
• /
• 2014

As frequency resource has taken on greater importance, Cognitive Radio(CR) technology has been considered as the solution to improve spectrum utilization by allowing a secondary user to utilize a licensed band when the primary user is absent. So spectrum sensing is significant part of CR for high performance. Recently, cooperative spectrum sensing that secondary users share each sensing results is proposed to improve spectrum sensing accuracy. In this paper, OR rule based cooperative spectrum sensing scheme using reporting error probability which occurs in user to fusion center(FC) channel The simulation results show that proposed scheme mitigates false alarm probability limitation which appears in existing cooperative spectrum sensing scheme by restricting the number of cooperating users using reporting error probability.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.87-96
• /
• 2020

The multi function radar is searching target and tracking through resource management at the same time. Increasing resource allotment of track, if more targets and faster the renewal rate of track, lead to decreasing quota of searching resource in limited resource. When the resource of search are decreased, it becomes degrade searching performance such as revisit time, number of detecting chance and tracking etc. Degraded performance of search reduces guided missile defense probability in complex strategy such as ship self defense. In this paper, we developed a modeling and simulation (M&S) tool that uses own-ship model, radar model, target model and defense model for analysis of self defense in complex strategy. We analyzed influence of ship self defense in complex strategy according to various target environments and track performance.

• Journal of Internet Computing and Services
• /
• v.5 no.3
• /
• pp.25-33
• /
• 2004

Mobile IP Low Latency Handoffs(l) allow greater support for real-time services on a Mobile IP network by minimizing the period of time when a mobile node is unable to send or receive IP packets due to the delay in the Mobile IP Registration process. However, on Mobile IP network with AAA servers that are capable of performing Authentication, Authorization, and Accounting(AAA) services, every Registration has to be traversed to the home network to achieve new session keys, that are distributed by home AAA server, for a new Mobile IP session. This communication delay is the time taken to re-authentication the mobile node and to traverse between foreign and home network even if the mobile node has been previously authorized to old foreign agent. In order to reduce these extra time overheads, we present a method that performs Low Latency Handoffs without requiring further involvement by home AAA server. The method re-uses the previously assigned session keys. To provide confidentiality and integrity of session keys in the phase of key exchange between agents, it uses a key sharing method by gateway foreign agent that performs a trusted thirty party. The proposed method allows the mobile node to perform Low Latency Handoffs with fast as well as secure operation.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.113-130
• /
• 2006

Recently with the explosive growth of Internet applications, the attacks of hackers on network are increasing rapidly and becoming more seriously. Thus information security is emerging as a critical factor in designing a network system and much attention is paid to Network Intrusion Detection System (NIDS), which detects hackers' attacks on network and handles them properly However, the performance of current intrusion detection system cannot catch the increasing rate of the Internet speed because most of the NIDSs are implemented by software. In this paper, we propose a new high performance network intrusion using Network Processor. To achieve fast packet processing and dynamic adaptation of intrusion patterns that are continuously added, a new high performance network intrusion detection system using Intel's network processor, IXP1200, is proposed. Unlike traditional intrusion detection engines, which have been implemented by either software or hardware so far, we design an optimized architecture and algorithms, exploiting the features of network processor. In addition, for more efficient detection engine scheduling, we proposed task allocation methods on multi-processing processors. Through implementation and performance evaluation, we show the proprieties of the proposed approach.