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
Design and Implementation of P2P-Based Data Service System to Reduce Server Load
이광현 ; 전형수 ; 유철중 ; 장옥배 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 615~615
Recently, as interest in Home networking is increased, research about multimedia clip service is gone. Because of the limit to bandwidth of home network, the problem of server traffic is increased by transferring many multimedia data through Client-Sewer Way for long. The data share network system applied is designed and implemented to solve this problem. P2P is connected directly between clients and exchanges data without going through a sewer. We implemented platform-independent System using Java and applied P2P skill to reduce server traffic.
Handling of IP Version for Interworking IP Transport and ATM Transport Mechanisms in a Radio Access Network
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 627~627
In this paper, we investigate the interworking method between three transport mechanisms, that is, ATM transport, Ipv₄ transport and Ip/sub v6/ transport, where these mechanisms are wholly used in a Mobile RAN (Radio Access Network). The proposed interworking method, called Triple Capable Node, is to implement three transport mechanisms simultaneously in a single node so that the node can communicate directly to other nodes having various transport mechanisms by using one of three transport mechanisms. In addition, we propose a dynamic algorithm which selects one among multiple transport mechanisms at run time in order to achieve better communication performance.
An Implementation of Java based MPEG-4 System
강기정 ; 홍충선 ; 이대영 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 637~637
In this paper, an implementation example of Java based MPEG-4 system that follows MPEG-4 standard protocols in order to provide multimedia-messaging service is introduced. The multimedia-messaging service is a wireless LAN based wired and wireless service that delivers multimedia contents including video and audio information. Detailed Methods to develop a MPEG-4 system like technology of MPEG-4 system implementation, definition for wired and wireless multimedia service, DMIF implementation, and mp4 file Parsing are described.
Performance Analysis of TCP using DSR Routing Protocols in Ad-hoc Mobile Network
박승섭 ; 육동철 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 647~647
Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other supporting communication facilities (such as base stations, etc.). Therefore, the topology of an Ad-hoc network frequently changes due to the movement of mobile host, which nay lead to sudden packet loss. Recently, the large amount of research has focused on the routing protocols needed in such an environment. In this paper, TCP Reno, Sack, and Tahoe versions are analysed using DSR protocol which is the representative On-Demand routing protocol in Ad-hoc wireless network. As the result of this simulation, we know that TCP Reno relatively has higher throughput than that of Sack and Tahoe, and TCP Reno has more stable performance than that of TCP Tahoe and Sack, regardless of the speed of mobile node and the size of topology.
A Study on Service Recovery QoS Rerouting Algorithm Based on PFC
한정수 ; 정진욱 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 655~655
The focus of quality-of-service routing has been on the routing of a single path satisfying specified QoS constraints. However upon failure of a node or link on the path, a new path (backup path) satisfying the constraints has to be established. This paper proposed the fault recovery QoS Rerouting algorithms to recovery the service of applications under fault environment of network. For this, we describes the generation method of PFC (Protection Fundamental Cycle) protecting all of network nodes and suggests path selection algorithms using minimization rerouting cost problem and analyzes the performances of these.
Key Exchange and Key Recovery System in Wireless Communications using Key Escrow
주미리 ; 원동호 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 665~665
Wireless communications require the cryptography system which satisfies a opposite purpose as safety and efficiency. In this paper we proposed the efficient key distribution system satisfying in wireless communication using escrow in order to satisfy the requirements. We supplemented the key recovery function to prevent side effects of cryptography and it is possible to check verification. Also, transmitted information is a little so that the system is efficient. The proposed key recovery method can be applicable to various application fields.
Hierarchical Inter-domain Load Balanced QoS Routing
홍종준 ; 김승훈 ; 이균하 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 671~671
In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources′costs for precomputation schemes in hierarchical routing is proposed, and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And these schemes make possible both global network resources′ utilization and also load balancing.
Minimum Variable Bandwidth Allocation over Group of Pictures for MPEG Video Transmission
곽준원 ; 이면재 ; 송하윤 ; 박도순 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 679~679
The transmission of prerecorded and compressed video data without degradation of picture quality requires video servers to cope with large fluctuations in bandwidth requirement. Bandwidth smoothing techniques can reduce the burst of a variable-bit rate stream by prefetching data at a series of fixed rates and simplifying the allocation of resources in the video servers and the network. In this paper, the proposed smoothing algorithm results in the optimal transmission plans for (1) the smallest bandwidth requirements, (2) the minimum number of changes in transmission rate, and (3) the minimum amount of the server process overhead. The advantages of the proposed smoothing algorithm have been verified through the comparison with the existing smoothing algorithms in diverse environments.
Design and Implementation of J2ME-based Wired/Wireless Interworking Mobile Wallet
박남제 ; 송유진 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 687~687
Together with the activation of wireless Internet, the interest for various integrated methods of the existing wired and wireless e-commerces is on the rise. For the integrated wired and wireless e-commerce, firstly, the optimized security and authentication under the radio communication environment should be decided. And also the user-friendly usage is important. In this paper, we designed and implemented wired and wireless interworking Mobile Wallet on terminal that can be used through both wired and wireless methods by developing electronic wallet module for electronic payment using MIDP (Mobile Information Device Profile) based on J2ME (Java 2 Micro Edition). The characteristics of mobile wallet implemented in this paper provide the stability through encoding/decoding payment information and on-line usage on wired/wireless environments through downloading electronic wallet. In addition, we also present safe and convenient payment method for e-commerce based on wired/wireless Internet.
A Context Free Grammar based Algorithm for Generating Playable Transcoding Paths of the Multimedia Presentation with Different End-to-End QoS
전성미 ; 임영환 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 699~699
Since various terminals and different networks get involved in playing of a multimedia presentation, the case that the presentation QoS at a destination should be different from the QoS of multimedia data at a source occurs frequently. For playing the multimedia presentation, the multimedia data at a source should be transcoded into the multimedia data satisfying the QoS required at the terminal. The problem of generating the transcoding path is that, for a given multimedia presentation, different transcoding paths depending the terminal and networks should be generated. That is, a fixed transcoding path cannot be applied to a multimedia presentation. Instead, whenever the terminal and network to play the presentation get determined, a proper transcoding path should be regenerated automatically. In this paper, the algorithm for generating the transcoding path and the method for checking the playability of the generated path are proposed. The generating algorithm adopted the technique of Context Free Grammar in describing the set of transcoding resources and a user′s transcoding rules in order to utilize the well-known compiler techniques. For the playability check, a method of computing the transcoding time and the delay time between data units are proposed. Finally all the proposed methods were implemented in the stream engine, called Transcore and the presentation-authoring tool, called VIP, we had developed. And the test results with a sample scenario were presented at the last.
An Efficient Load Balancing Technique in Cluster Based VOD Servers using the Dynamic Buffer Partitioning
권춘자 ; 김영진 ; 최황규 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 709~709
Cluster based VOD systems require elaborate load balancing and buffer management techniques in order to ensure real-time display for multiuser concurrently. In this paper, we propose a new load balancing technique based on the dynamic buffer partitioning in cluster based VOD servers. The proposed technique evenly distribute the user requests into each service node according to its available buffer capacity and disk access rate. In each node, the dynamic buffer partitioning technique dynamically partitions the buffer to minimize the average waiting time for the requests that access the same continuous media. The simulation results show that our proposed technique decreases the average waiting time by evenly distributing the user requests compared with the exiting techniques and then increases the throughput in each node. Particularly under the overloaded condition in the cluster server, the simulation probes that the performance of the proposed technique is better two times than the Generalized Interval Caching based technique.
Implementation and Experiments of IPv6-based Multicast Application over TEIN (TransEurasia Information Network)
인민교 ; 이승윤 ; 박기식 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 719~719
In the paper, we describe the IPv6-based multicast videoconferencing tool and it′s experimental results by using TEM (TransEurasia Information Network) which is connected between Korea and Europe recently. And we explain the efficient configuration method of IPv6 multicast as well as IPv6 configured tunneling in between Korea and Europe.
A Genetic Algorithm Application to Scalable Management of Multimedia Broadcast Traffic in ATM LANE Network
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 725~725
Presented is a Genetic Algorithm (GA) for dynamic partitioning an ATM LANE(LAN Emulation) network. LANE proves to be one of the best solutions to provide guaranteed Quality of Service (QoS) for mid-size campus or enterprise networks with minor modification of legacy LAN facilities. However, there are few researches on the efficient LANE network operations to deal with scalability issues arising from broadcast traffic delivery. To cope with this scalability issue, proposed is a decision model named LANE Partitioning Problem (LPP) which aims at partitioning the entire LANE network into multiple Emulated LANs (ELANS), each of which works as an independent virtual LAN.
A Design of Resource Reservation Mechanism with Micro Host Mobility
고광신 ; 차우석 ; 안재영 ; 조기환 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 733~733
It has been known that the host mobility feature has very significant impact on the QoS (Quality of Service), which is usually required to a real-time multimedia application. The existing QoS support mechanisms to provide the real-time services to fixed network environment, like as RSVP, are inadequate to accommodate the mobile hosts which can frequently change their point of attachments to the fixed network. So, MRSVP (Mobile RSVP) protocol has been proposed to reduce the impacts of host mobility on QoS guarantees, in which a mobile host needs to make advance resource reservations at multiple locations it may possibly visit during the lifetime of the connection. This paper proposes a dynamic dual anchor node (DDAN) architecture which integrates the MRSVP and RSVP tunnel, in addition to the Mobile IP Regional Registration protocol. By limiting the resource reserved in local area, it preserves the lower level of resource reservation, but provides approximately the same degree of QoS support as the existing MRSVP.
The Two Window-Based Marking Algorithm For Enhancing Fairness of Assured Services in a Differentiated Services Network
조병규 ; 이성근 ; 강의성 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 743~743
In recent research for the Internet, many studies have investigated the Diffserv AS architecture that can provide Quality of Service. However, this architecture still lacks the qualification to provide full use of the bandwidth to the customer In this paper, we propose the TS2W3C (Time Sliding Two Window Three Color) marking algorithm to improve the fair share of bandwidth by enhancing the TSW (Time Sliding Window) marking algorithm. Our proposed mechanism provides the bandwidth relatively more fairly than the TSW mechanism.
An Efficient Authentication Mechanism Using Regional Registration in Mobile IP Network
장성은 ; 박정민 ; 채기준 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 749~749
As Internet access through mobile devices is increasing, Mobile IP is the protocol to provide the mobility of a host on the existing IP. It is important to provide secure authentication when mobile node register with home agent through the foreign agent each time it moves. In this paper, we propose the authentication mechanism using a regional registration. The proposed authentication mechanism reduce frequent home registration in regional movement. The simulation results show that the proposed authentication reduces the total registration time and is more efficient than conventional registration mechanism.
Design Issues and QoS Negotiation Protocol Model for Networked Multimedia Systems
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 757~757
This Paper describes our experiences with the design and implementation of a networked multimedia information management system in an object-oriented framework for distributed multimedia applications, and an integrated QoS-resource negotiation protocol which has been applied to a video server in our networked multimedia infrastructure. The salient features of our framework to support efficient multimedia streaming are explained. Next the paper explores the challenges faced in integrating the proposed QoS negotiation policy into the framework.
Detection of Unknown Malicious Scripts Using Static Analysis
이성욱 ; 배병우 ; 이형준 ; 조은선 ; 홍만표 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 765~765
Analyzing the code using static heuristics is a widely used technique for detecting unknown malicious codes. It decides the maliciousness of a code by searching for some fragments that had been frequently found in known malicious codes. However, in script codes, it tries to search for sequences of method calls, not code fragments, because finding such fragments is much difficult. This technique makes many false alarms because such method calls can be also used in normal scripts. Thus, static heuristics for scripts are used only to detect malicious behavior consisting of specific method calls which is seldom used in normal scripts. In this paper. we suggest a static analysis that can detect malicious behavior more accurately, by concerning not only the method calls but also parameters and return values. The result of experiments show that malicious behaviors, which were difficult to detect by previous works, due to high false positive, will be detected by our method.
The Implementation of Policy Management Tool Based on Network Security Policy Information Model
김건량 ; 장종수 ; 손승원 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 775~775
This paper introduces Policy Management Tool which was implemented based on Policy Information Model in network suity system. Network security system consists of policy terror managing and sending policies to keep a specific domain from attackers and policy clients detecting and responding intrusion by using policies that policy server sends. Policies exchanged between policy server and policy client are saved in database in the form of directory through LDAP by using Policy Management Tool based on network security policy information model. NSPIM is an extended policy information model of IETF′s PCIM and PCIMe, which enables network administrator to describe network security policies. Policy Management Tool based on NSPIM provides not only policy management function but also editing function using reusable object, automatic generation function of object name and blocking policy, and other convenient functions to user.
Analysis of Adaptive Cycle Packet Drop and Non-Adaptive Cycle Packet Drop for Congestion Control in Internet
김수연 ; 강현국 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 783~783
Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) are applying stricter drop precedence than that of RIO algorithm. Especially, the ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. And we executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying strict drop precedence policy, we get better performance on priority levels. The results show that the proposed algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than RIO and the NCPD algorithm.
Location Management Using Static Cache & Carry in Mobile Networks
임순영 ; 구용완 ;
The KIPS Transactions:PartC, volume 9, issue 5, 2002, Pages 789~789
Even when users are moving, a major problem in such a mobile networks is how to locate mobile clients. Two major operations are involved in managing a mobile client′s location : the location registration operation and the call tracking operation. The past methods can only minimize the cost of one of these two operations, but not both. The contribution of this paper is to propose strategy that minimize the costs of both operations simultaneously. Our performance analysis proves that the proposed strategies are superior to the past methods.