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 10C, Issue 7 - Dec 2003
Volume 10C, Issue 6 - Oct 2003
Volume 10C, Issue 5 - Oct 2003
Volume 10C, Issue 4 - Aug 2003
Volume 10C, Issue 3 - Jun 2003
Volume 10C, Issue 2 - Apr 2003
Volume 10C, Issue 1 - Feb 2003
Volume 10, Issue 7 - 00 2003
Volume 10, Issue 5 - 00 2003
Volume 10, Issue 4 - 00 2003
Volume 10, Issue 3 - 00 2003
Volume 10, Issue 2 - 00 2003
Volume 10, Issue 1 - 00 2003
Selecting the target year
Using Staganography method for Protection of Caption Information in the Motion Picture
Ham, Jun-Sick ; Ryou, Hwang-Bin ; Hong, Seong-Sik ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 835~842
DOI : 10.3745/KIPSTC.2003.10C.7.835
The technical advancement in and the widespread expansion of use of the internet has recently led to an increase in high bandwidth multimedia data usage. This is largely due to an unfettered access to the internet. The intrinsic merit of the internet, however, brings about a side effect：multimedia date can easily be duplicated recklessly. This invokes the problem of intellectual property right violation. Focusing on this matter, multi-faceted studies are being conducted now. This paper aims to provide, by applying steganography and encryption methods into the SMIL files which supply subtitle data, the intellectual property protection of both motion picture and its subtitle data, as well as the integrity of the contents in question. In order to achieve the above goal, the authors show a particular method how to safely embed subtitle data into the given frames, after they separate subtitle data to encrypt them. By doing this, the authors suggests, the intellectual property right to the subtitle data as well as their integrity can be protected and achieved respectively. Besides, an integrity service for motion picture can be made.
An Extension of Data Flow Analysis for Detecting Polymorphic Script Virus
Kim, Chol-Min ; Lee, Hyoung-Jun ; Lee, Seong-Uck ; Hong, Man-Pyo ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 843~850
DOI : 10.3745/KIPSTC.2003.10C.7.843
Script viruses are easy to make a variation because they can be built easily and be spread in text format. Thus signature-based method has a limitation in detecting script viruses. In a consequence, many researches suggest simple heuristic methods, but high false-positive error is always being an obstacle. In order to overcome this problem, our previous study concentrated on analyzing data flow of codes and has low-false positive error, but still could not detect a polymorphic virus because polymorphic virus loads self body and changes it before make a descendent. We suggest a heuristic detection method which expands the detection range of previous method to include polymorphic script viruses. Expanded data flow analysis heuristic has an expanded grammar to detect Polymorphic copy Propagation. Finally, we will show the experimental result for the effectiveness of suggested method.
On a High-Speed Parallel-LM Binary Sequcence Generator
Lee, Hoon-Jae ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 851~856
DOI : 10.3745/KIPSTC.2003.10C.7.851
The LM generator is an improved summation generator with maximum period, near maximum linear complexity and maximum order of correlation immunity, and it has a property with the input-output correlation immunity In this paper, we propose the high-speed m-parallel LM-BSG and 8-parallel LM-BSG for detail as a design example. When compared with a conventional stream cipher, the properties of the proposed cipher exhibited the same crypto-degree (security) with a rt times faster processing.
Clustering Normal User Behavior for Anomaly Intrusion Detection
Oh, Sang-Hyun ; Lee, Won-Suk ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 857~866
DOI : 10.3745/KIPSTC.2003.10C.7.857
For detecting an intrusion based on the anomaly of a user`s activities, previous works are concentrated on statistical techniques in order to analyze an audit data set. However. since they mainly analyze the average behavior of a user`s activities, some anomalies can be detected inaccurately. In this paper, a new clustering algorithm for modeling the normal pattern of a user`s activities is proposed. Since clustering can identify an arbitrary number of dense ranges in an analysis domain, it can eliminate the inaccuracy caused by statistical analysis. Also, clustering can be used to model common knowledge occurring frequently in a set of transactions. Consequently, the common activities of a user can be found more accurately. The common knowledge is represented by the occurrence frequency of similar data objects by the unit of a transaction as veil as the common repetitive ratio of similar data objects in each transaction. Furthermore, the proposed method also addresses how to maintain identified common knowledge as a concise profile. As a result, the profile can be used to detect any anomalous behavior In an online transaction.
Secure Location Information Protection Scheme from the Network Provider and the third party in Mobile Communication Environments
Kim, Soon-Seok ; Lee, Chang-Hun ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 867~878
DOI : 10.3745/KIPSTC.2003.10C.7.867
In thls Paper, we Propose a new scheme, protecting information about the location of a mobile user against attacks from inside users of the mobile communication, especially the network providers. There have already been some proposals about how to protect location information of user in mobile communication environments〔1-5〕. Among them, Kesdogan et al.〔2, 3〕 proposed a new method, using so-called temporary pseudonyms and also described protection method against a passive and an active attack of network providers. However, the description of protection method against the active attack between the two is not clear. Moreover, there is an additional load that it should append a reachability manager〔1, 6〕 to the proposed system. Therefore, we propose a new scheme improving the above method of Kesdogan et al. and analyze its security and effectiveness.
A Divided Scope Web Cache Replacement Technique Based on Object Reference Characteristics
Ko, Il-Seok ; Leem, Chun-Seong ; Na, Yun-Ji ; Cho, Dong-Wook ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 879~884
DOI : 10.3745/KIPSTC.2003.10C.7.879
Generally we use web cache in order to increase performance of web base system, and a replacement technique has a great influence on performance of web cache. A web cache replacement technique is different from a replacement technique of memory scope, and a unit substituted for is web object Also, as for the web object, a variation of user reference characteristics is very great. Therefore, a web cache replacement technique can reflect enough characteristics of this web object. But the existing web caching techniques were not able to reflect enough these object reference characteristics. A principal viewpoint of this study is reference characteristic analysis, an elevation of an object hit rate, an improvement of response time. First of all we analyzed a reference characteristics of an web object by log analysis. And we divide web cache storage scope using the result of reference characteristics analysis. In the experiment result, we can confirm that performance of an object-hit ratio and a response speed was improved than a conventional technique about a proposal technique.
A Method of Selecting Core for the Shared-Tree based Multicast Routing
Hwang, Soon-Hwan ; Youn, Sung-Dae ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 885~890
DOI : 10.3745/KIPSTC.2003.10C.7.885
The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the internet. The CBT establishes a single shared tree for a multicast connection. The shared tree Is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT. The core placement method requires the knowledge of the network topology In this Paper, we propose a simple and effective method for selecting the core. This method requires the distance vector information. in addition, we used results that calculated sample correlation coefficient. And then we select suitable routing algorithm according to member`s arrangement states in muliticast group. we select core node that have minimum average cost or PIM-SM protocol is selected. The performance of this method is compared with several other methods by extensive simulations (i.e mean delay, maximum delay, and total cost). Our results shows that this method for Selecting Core is very effective.
Design and Performance Analysis of Dynamic QoS Control for RTP-based Multimedia Data Transmission
Moon, Young-Jun ; Ryoo, In-Tae ; Park, Gwang-Hoon ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 891~898
DOI : 10.3745/KIPSTC.2003.10C.7.891
This paper analyzes and proposes a scheme that improves the performance of the RTP that is developed to support the end-to-end transmission function and QoS monitor function for real-time multimedia data transmission. Although the existing RTP module supports real-time transmission, it has some problems in guaranteeing QoS parameters. To solve this problem, we propose a new Selective Repeat Adaptive Rate Control (SRARC). The SRARC can support QoS by referring to the data transmission status from the client and then classifying the network status into three levels. It selectively transmits multimedia data and dynamically controls transmission rates based on such information as bandwidth, packet loss rate, and latency that can be calculated in data transfer phase. To verify the SRARC, we implement it in real local area networks and compare the QoS parameters of the SRARC with those of the SR and RTP By the experimental results, the SRARC shows better performance in the aspects of bandwidth usage rate, packet loss rates, and transmission delays than the existing RTP schemes.
A Comparison of Three Fixed-Length Sequence Generators of Synthetic Self-Similar Network Traffic
Jeong, Hae-Duck J. ; Lee, Jong-Suk R. ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 899~914
DOI : 10.3745/KIPSTC.2003.10C.7.899
It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.
The Design and Implementation of Monitoring System for Grid Network
Ha, Ji-A ; Ahn, Seon-Gjin ; Chung, Jin-Wook ; Hwang, Il-Sun ; Kim, Kui-Nam ; Kim, Dong-Kyun ; Lee, Hyuk-Ro ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 915~922
DOI : 10.3745/KIPSTC.2003.10C.7.915
The Grid is an infrastructure to connect heterogeneous resources that are scattered over areas with high-speed network and to cooperate with each other. To support Grid applications, network resources should be managed, since the network has to be safe and reliable. The Grid Monitoring Architecture Working Group (GMAWG) of the Global Grid Forum (GGF) proposed an effective architecture to be scalable across wide-area networks and encompass a large number of heterogeneous resources. In this paper, we describe the design and implementation of Grid network monitoring system based on the GMA for practical network management. By this system, network operations center can form a management system flexibly and scalably for Grid network.
Bottleneck link bandwidth Measurement Algorithm for improving end-to-end transit delay in Grid network
Choi, Won-Seok ; Ahn, Seong-Jin ; Chung, Jin-Wook ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 923~928
DOI : 10.3745/KIPSTC.2003.10C.7.923
This paper proposes a bottleneck link bandwidth measurement algorithm for reducing packet transmission delay within the grid network. There are two methods for measuring bottleneck link bandwidth：Packet Pair algorithm and Paced Probes algorithm. They measure bottleneck link bandwidth using the difference in arrival times of two paced probe packets of the same size traveling from the same source to destination. In addition, they reduce the influences of cross traffic by pacer packet. But there are some problems on these algorithms：it`s not possible to know where bottleneck link occurred because they only focus on measuring the smallest link bandwidth along the path without considering bandwidth of every link on the path. So hop-by-hop based bottleneck link bandwidth measurement algorithm can be used for reducing packet transmission delay on grid network. Timestamp option was used on the paced probe packet for the link level measurement of bottleneck bandwidth. And the reducing of packet transmission delay was simulated by the solving a bottleneck link. The algorithm suggested in this paper can contribute to data transmission ensuring FTP and realtime QoS by detecting bandwidth and the location where bottleneck link occurred.
Design of the Security Cryptography File System Based on the Dynamic Linking Module on the Linux O.S
Jang, Seung-Ju ; Lee, Jeong-Bae ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 929~936
DOI : 10.3745/KIPSTC.2003.10C.7.929
We Propose the Suity Cryptography File System to encrypt or decrypt a plaintext or an encrypted tort by using the dynamic linking mechanism In the Linux kernel. The dynamic linking mechanism gives the flexibility of the kernel without changing the kernel. The Sorority Cryptography File System uses the blowfish algorithm to encrypt or decrypt a data. To overcome the overhead of the key server, I use key generating algorithm which is installed in the same Security Cryptography File System. The Security Cryptography file System is fitted into the Linux system.
Consideration about Traffic Characteristics of DV and MPEG2 Streams on IP over ATM
Lee, Jae-Kee ; Saito, Tadao ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 937~942
DOI : 10.3745/KIPSTC.2003.10C.7.937
In this paper, we measured and examined RTT delays and packet losses according to the changes of stationary loads for two typical stream-type traffics, a DV and a MPGE2 on the R＆D Gigabit Network testbed, JGN. As the result of our actual measurements, we realized that the packet size of stationary load have no effects on a DV and a MPGE2 stream on the very high-speed network(50Mbps, IP over ATM). When its bandwidth and stationary load exceeds 95％ of network bandwidth, packet losses appeared and RTT delay increased rapidly. Also we realized that the number and size of Receive ＆ Transmit buffer on the end systems have no effects on packet losses and RTT delays.
TCP Performance Improvement Scheme on Dynamic Wireless Environment over UMTS System
Kim, Nam-Ki ; Park, In-Yong ; Yoon, Hyun-Soo ;
The KIPS Transactions:PartC, volume 10C, issue 7, 2003, Pages 943~954
DOI : 10.3745/KIPSTC.2003.10C.7.943
The mobile telecommunication system has been growing exponentially after 1990s due to the high population in a city and the growth of mobile user. In this time, the current mobile system mainly concentrates on the voice communication. However, in the next generation, mobile users want to get very diverse services via mobile terminal such as the Internet access, web access, multimedia communication, and etc. For this reason, the next generation system, such as the UMTS (Universal Mobile Telecommunication Services) system, has to support the packet data service and it will play the major role in the system. By the way, since the Web service is based on TCP, most of the Internet traffic TCP traffic. Therefore, efficient transmission of TCP traffic will take very important role in the performance of packet data service. There are many researches about improving TCP performance over wireless network. In those schemes, the UMTS system adapts the link layer retransmission scheme. However, there are rarely studies about the exact performance of the link layer retransmission scheme in the face of dynamic changes of wireless environment over the UMTS system. The dynamic changes of wireless environment, such as wireless bandwidth, can degrade TCP performance directly. So, in this paper, we simulate and analyze the TCP performance in the UMTS system with dynamic wireless environments. Then, we propose a simple scheme for minimizing TCP performance degradation. As a result of simulation, we can find that when wireless environment is changed dynamically, the probability of TCP timeout is increased, and the TCP performance is degraded very much. In this situation, the proposed simple scheme shows good performance. It saves wireless resources and reduces the degradation of TCP performance without large overhead of the base station.