Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartC
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 9C, Issue 6 - Dec 2002
Volume 9C, Issue 5 - Oct 2002
Volume 9C, Issue 4 - Aug 2002
Volume 9C, Issue 3 - Jun 2002
Volume 9C, Issue 2 - Apr 2002
Volume 9C, Issue 1 - Feb 2002
Volume 9, Issue 6 - 00 2002
Volume 9, Issue 5 - 00 2002
Volume 9, Issue 1 - 00 2002
Selecting the target year
Security Analysis of Diffie-Hellman based Standard Key Agreement Protocols
김경진 ; 김성덕 ; 심경아 ; 원동호 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 799~799
According to the wide-spread of information transmission system over network, the use of cryptographic system to provide the integrity of transmitted message over network is increasing and the importance of that is emphasized. Because the security of the cryptographic system totally relies on the key, key management is a essential part of cryptographic system. A number of key agreement protocols have been proposed to far, but their rigorous security analysis is still open. In this paper, we analyze the features of Diffie-Hellman based standard key agreement protocols and provide the security analysis of those protocols against several kinds of active attacks.
Proposing a PRNG based on a block cipher and cryptanalyzing its security
송정환 ; 현진수 ; 구본욱 ; 장구영 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 809~809
Cryptographic applications, such as data confidentiality and authentication, must be used for secure data communications. PRNG(Pseudo-Random Number Generator) is a basic cryptographic component which is supposed to be satisfied by criteria that we provable security and randomness properties. PRNG it used for generating an initial value or key value of cipher and security of whole cryptographic module depends on the security of PRNG. In this paper, we introduce an PRNG based on a block cipher and prove their security.
The Design & Analysis of Time-Stamp Protocol with H-Binary Tree
정경원 ; 도경화 ; 전문석 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 817~817
We want to find a timestamping method which improves efficient performance and have high-level security to send secured messages in the digital signature and the law of e-commerces. Our paper shows a H-binary tree of time stamp to use a time stamp protocol with high suity and performance in the packets of sending messages. We implement and analyze the protocols, show to compare with previous RSA methods. Our proposed protocol has O(log n) time complexity and high-performance.
A Study on Generalization of Security Policies for Enterprise Security Management System
최현희 ; 정태명 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 823~823
Enterprise security management system proposed to properly manage heterogeneous security products is the security management infrastructure designed to avoid needless duplications of management tasks and inter-operate those security products effectively. In this paper, we propose the model of generalized security policies. It is designed to help security management build invulnerable security policies that can unify various existing management infrastructures of security policies. Its goal is not only to improve security strength and increase the management efficiency and convenience but also to make it possible to include different security management infrastructures while building security policies. In the generalization process of security policies. we first diagnose the security status of monitored networks by analyzing security goals, requirements, and security-related information that security agents collect. Next, we decide the security mechanisms and objects for security policies, and then evaluate the properness of them on the basis of security goals, requirements and a policy list. With the generalization process, it is possible to integrate heterogeneous security policies and guarantee the integrity of them by avoiding conflicts or duplications among security policies. And further, it provides convenience to manage many security products existing in large networks.
Anomaly Intrusion Detection based on Association Rule Mining in a Database System
박정호 ; 오상현 ; 이원석 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 831~831
Due to the advance of computer and communication technology, intrusions or crimes using a computer have been increased rapidly while tremendous information has been provided to users conveniently Specially, for the security of a database which stores important information such as the private information of a customer or the secret information of a company, several basic suity methods of a database management system itself or conventional misuse detection methods have been used. However, a problem caused by abusing the authority of an internal user such as the drain of secret information is more serious than the breakdown of a system by an external intruder. Therefore, in order to maintain the sorority of a database effectively, an anomaly defection technique is necessary. This paper proposes a method that generates the normal behavior profile of a user from the database log of the user based on an association mining method. For this purpose, the Information of a database log is structured by a semantically organized pattern tree. Consequently, an online transaction of a user is compared with the profile of the user, so that any anomaly can be effectively detected.
Learning Algorithm of Dynamic Threshold in Line Utilization based SARIMA model
조강홍 ; 안성진 ; 정진욱 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 841~841
We applies a seasonal ARIMA model to the timely forecasting in a line utilization and its confidence interval on the base of the past data of the line utilization that QoS of the network is greatly influenced by. And this paper proposes the learning algorithm of dynamic threshold in line utilization using the SARIMA model. We can find the proper dynamic threshold in timely line utilization on the various network environments and provide the confidence based on probability. Also, we have evaluated the validity of the proposed model and estimated the value of a proper threshold on real network. Network manager can overcome a shortcoming of original threshold method and maximize the performance of this algorithm.
Performance Evaluation of AAL Type 2
권세동 ; 한만유 ; 박현민 ; 주우석 ; 전종훈 ; 이강선 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 847~847
Cellular network applications are growing drastically and this requires a fast and efficient transport method between the base station and the mobile switching center. One possible solution is to use ATM links. The low data rate and small-sized packets in the typical cellular applications imply that significant amount of link bandwidth would be wasted, if this small sized packet is carried by one ATM cell. For efficient operation for such cellular and low bit rate applications, a new type of ATM Adaptation Layer, AAL Type 2, has been proposed. In this paper, the principles of AAL Type 2 are briefly described along with the introduction of other alternatives which have formed the basis for this new AAL. The result from the simulation to study the performance of the AAL Type 2 is discussed from the view point of packet delay and ATM cell use efficiency. Due to the variable size of packets in this application, the fairness issue in serving variable sized packets is also discussed along with the effect of fair queueing algorithm implemented at AAL Type 2.
Performance Analysis of Turbo Code with Block Interleaver using Hopping Method
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 857~857
Channel coding is one of the most important things to improve digital communications. In this paper, we analyze the performance of turbo code with block interleaver using hopping algorithm (i. e., non-linear interleaver) for high speed multi-media service. The input and output of conventional block interleaver is achieved by the order of column and row, but hoping algorithm is achieved by hopping the column and row that increase the minimum distance and average distance between the nearest data dually. To verify and compare the performance of an proposed method the computer simulation have been performed using turbo code in gaussian channel environment.
Analysis of Average Waiting Time and Average Turnaround Time in Web Environment
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 865~865
HTTP (HyperText Transfer Protocol) is a transfer protocol used by the World Wide Web distributed hypermedia system to retrieve the objects. Because HTTP is a connection oriented protocol, it uses TCP (Transmission control Protocol) as a transport layer. But it is known that HTTP interacts with TCP badly. it is discussed about factors affecting the performance or HTTP over TCP, the transaction time obtained by the per-transaction TCP connections for HTTP access and the TCP slow-start overheads, and the transaction time for T-TCP (Transaction TCP) which is one or methods improving the performance or HTTP over TCP. Average waiting time and average turnaround time are important parameters to satisfy QoS (Quality of Service) of end users. Formulas for calculating two parameters are derived. Such formulas can be used for the environment in which each TCP or T-TCP transaction time is same or different. Some experiments and computational experiences indicate that the proposed formulas are well acted, can be applied to the environment which the extension of bandwidth is necessary, and time characteristics of T-TCP are superior to that of TCP. Also, the load distribution method of web server based on the combination of bandwidths is discussed to reduce average waiting time and average turnaround time.
Routing and Reliable Transmission of Active Packets in W Networks
윤보영 ; 채기준 ; 남택용 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 875~875
The active packets unlike traditional IP packets should be executed at each active node along their path. To execute the active program at each active node, the active packets for an active program should go through the same active nodes and all packets are delivered without any loss. This paper presents the new active engine for every active packet which execute an active program to be routed through the same intermediate active nodes and to be delivered reliably. Proposed active engine requires fewer changes to existing IP protocols and guarantees the reliable delivery of the active packets. Moreover, even if the sender does not have any information about the intermediate nodes every active packet is routed through the same intermediate active nodes. The simulation results show that proposed active engine achieves an efficient transmission with high data delivery and low communication overhead compared with the other existing transmission protocols.
QoS controlled handoff by SNMP information-based routing in active network
장한이 ; 박수현 ; 백두권 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 883~883
Mobile IP has been designed only to maintain communications as they move from place to place, so it doesn't guarantee Quality of Service (QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile environment, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS -2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.c
Load Balancing in MPLS Networks
김세린 ; 송정화 ; 이미정 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 893~893
MPLS enables efficient explicit routing, and thus provides great advantages in supporting traffic engineering. Exploiting this capability, we Propose a load balancing scheme which deploys a multipath routing. It is named LBM (Load Balancing in MPLS networks), and targets at efficient network utilization as well as performance enhancement. LBM establishes multiple LSP (Label Switched Path)s between a pair of ingress-egress routers, and distributes traffic over these LSPs at the new level. Its routing decision is based on both the length and the utilization of the paths. In order to enhance the efficiency of a link usage, a link is limited to be used by shorter paths as its utilization becomes higher Longer paths are considered to be candidate alternative paths as the utilization of shorter paths becomes higher. Simulation experiments are performed in order to compare the performance of LBM to that of static shortest path only scheme as well as the other representative dynamic multipath traffic distribution approaches. The simulation results show that LBM outperforms the compared approaches, and the performance gain is more significant when the traffic distribution among the ingress-egress pairs is non-uniform.
Design and Implementation of an Edge Router having ATM and Ethernet Interfaces using the Programmable Ethernet Packet Processor
박재형 ; 김미희 ; 이유경 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 903~903
As the edge router provides the facility that it is capable of interworking with various kinds of networks, the forwarding engine should have the flexibility processing the corresponding types of frames from such network interfaces. In order to support the flexibility, we design and implement a prototype of edge router with ATM and Ethernet interfaces based on the programmable Ethernet packet processor Our forwarding engine handles and forwards the frames from ATM interfaces by using loop-back functionality of Ethernet packet processor. The performance of our edge router is evaluated by experiments throughout its performance of forwarding engine and tested by interworking with another kinds of routers.
Design and Evaluation of an Adaptive Distributed Dynamic Location Management Algorithm for Wireless Mobile Networks
천성광 ; 배인한 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 911~911
An important issue in the design of future Personal Communication Service (PCS) networks is the efficient management of location information. In this paper, we propose an adaptive distributed dynamic location management algorithm that stores the position of the mobile terminal in k of the n location information databases (LIDs). The proposed algorithm chooses adaptively k. replication factor according to both the space locality of LIDs in wireless mobile networks and the location query popularity to local mobile terminal from remote mobile terminals. The performance of proposed algorithm is evaluated by both an analytical model and a simulation. Based on the results of performance evaluation, we know that the performance of the proposed algorithm is better than that of Krishnamurthi's algorithm regardless of call-mobility ratio.
A Design and Performance Evaluation of Multicast Scheduling Algorithm using the State Information of Receivers in the WDM Broadcast Networks
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 919~919
In this paper, new multicast scheduling algorithms are proposed for the WDM single-hop broadcast-and-select networks. The existing multicast scheduling algorithms are focused on the partitioning a multicast group into several subgroups to reduce the delay time of each receiver. These partitioning algorithms are grouping method of the receivers already tuned to the transmitter's wavelength. However, these algorithms ignore the state of receivers, which leads to increase the number of subgroups and the delay time. Therefore, 1 propose two new multicast scheduling algorithms called H_EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. The performance of proposed algorithms are evaluated through the computer simulation. They show the better performance comparing with the existing multicast scheduling algorithm.
Distributed Call Admission Control for Multimedia Service in Micro-Cell Environment
정일구 ; 황의석 ; 이형우 ; 조충호 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 927~927
In order to provide various multimedia services in a wireless network, the call admission control for wireless channels should be resolved at the time of call setup and handoff by moving mobile terminal. In this paper. we propose a reliable DCAC( Distributed Call Admission Control)scheme using virtual cluster concept. The proposed DCAC scheme considers the state of 1/sup st/ and 2/sup nd/ adjacent cells to provide a reliable call handling. The proposed scheme is analyzed by simulations and mathematical methods.l
QoS Routing Protocol using multi path in Unidirectional Mobile Ad Hoc Networks
강경인 ; 박경배 ; 유충렬 ; 정찬혁 ; 이광배 ; 김현옥 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 935~935
It is the Mobile Ad Hoc Networks that constituted with serveral mobile node that can communicate with other mobile nodes. Until now, there were no routing protocols considering such as Multimediadata, VOD (Video On Demand), which is required of lots of bandwidth in Mobile Ad Hoc Network, io we are in the need of QoS (Quality of Service)routing protocol to transmit the data packets faster and more accurate. Also, there are an unidirectional links due to asymmetric property of mobile terminals or current wireless environments on practical mobile ad hoc networks. However, at present, the existing mobile ad hoc routing protocols are implemented to support only bidirectional links. In this paper, we propose the Advanced Routing routing protocol in order to implement a new routing protocol, which is fit to mobile ad hoc networks containing unidirectional links and to support QoS service. For the performance evaluation, we use NS-2 simulator of U.C. Berkeley. We could get not only increased received data rate and decreased average route discovery time, but also network load decreases with compared Best effort service.
Performance Improvments of Inter-System Handoff for IMT-2000
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 945~945
For a successful inter-system handoff, several important issues must be handled and additional new features must be considered. This paper focuses on the cellular structure of small cells which are required for the high density of population and a handoff scheme designed between two heterogenous networks. Incase of inter-system handoff (ISHO), the time required to complete the handoff can vary and depends on the structure of networks. And also the transmission of additional signals can increase the probability of failure for ISHO. Here we propose the sub-boundary cell base station (Sub-BBS) to alleviate the role of the BBS. The Sub-BBS is adjacent to BBS in the same regional mobile network. When the mobile terminal enters Sub-BBS, the network starts finding a new route and after entering BBS, it initiates the transformation process. The proposed scheme significantly reduces the ISHO failure rate compared to the existing one which is the most recent and known as efficient.
An Adaptive Multimedia Synchronization Scheme for Media Stream Delivery in Multimedia Communication
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 953~953
Rel-time application programs have constraints which need to be met between media-data. It is client-leading synchronization that is absorbing variable transmission delay time and that is synchronizing by feedback control and palyout control. It is the important factor for playback rate and QoS if the buffer level is normal or not. This paper, The method of maintenance buffer normal state transmits in multimedia server by appling feedback of filtering function. And synchronization method is processing adaptive playout time for smooth presentation without cut-off while media frame is skip. When audio frame which is master media is in upper threshold buffer level we decrease play out time gradually, low threshold buffer level increase it slowly.
Web Caching using File Type
임재현 ; 이준연 ;
The KIPS Transactions:PartC, volume 9, issue 6, 2002, Pages 961~961
This paper proposes a new access method which is to considered the high variability in World Wide Web and manage the web cache space. Instead of using a single cache, we divide a cache and store all documents according to their file types. Proposed method was compares with current cache management policies using LFU, LRU and SIZE base algorithm. Using two different workload, we show the improvement hitting ratio and byte hitting ratio through simulating on the file type caching