Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Internet Computing and Services
Journal Basic Information
Journal DOI :
Korean Society for Internet Information
Editor in Chief :
Volume & Issues
Volume 5, Issue 6 - Dec 2004
Volume 5, Issue 5 - Oct 2004
Volume 5, Issue 4 - Oct 2004
Volume 5, Issue 3 - Jun 2004
Volume 5, Issue 2 - Apr 2004
Volume 5, Issue 1 - Feb 2004
Selecting the target year
Reengineering Legacy systems into Design Patterns of Component Base Design (CBD)
Kim Cuk-Boh ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 1~13
The effect of Application system with class units is not sufficient because of independency and reuse of Component elements due to component abstraction based on only source code. Therefore We need to apply design pattern approach to represent not only the problem abstraction but also information and relationship between system elements for generic solutions of specific domain, Also, it is essential to software reverse engineering acquiring the correct understandings of the system through examining the existing systems and utilizing the acquired knowledges as reusable resources. In this paper, the extraction algorithm with JAVA and the validity of applying reverse engineering with extracting design patterns from source codes of the existing object-oriented system; are devised. The architecture of automatic tool is designed and implemented for 1) automatic extraction of design patterns and 2) reuse tool for retrieving, editing and rebuilding of design patterns.
VOD Server using Web-Caching in Head-End-Network
Kim Backhyun ; Hwang Taejune ; Kim Iksoo ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 15~23
This paper presents distributive web-caching technique on the Head-End-Network (HNET) to solve excessive load of multimedia sever and inefficient use of network resources, The proposed web-caching is not concentration of load for a specific Head-End-Node(HEN), and it has advantage that there is no copy of a specific item on distributive HENs. This technique distributively stores on HENs partial streams of requested videos from clients connected to HENs and the order of store streams follows the order of request of identical video items from HENs. Thus, storing streams on each HEN that requests sevice are different. When a client requests the cached video on some HENs, the HEN that connects him receives streams in the order of store from HENs which stored them and it transmits them to him. These procedures are performed under the control of SA. This technique uses cache replacement algorithm that the combination of LFU, LRU and the last remove for the first stream of videos In order to reduce end-to-end delay.
An Effective Management Technique of Domain FA using Load Balancing in Mobile Computing Environment
Kim Yong-Chul ; Kim Yoon-jeong ; Chung Min-Gyo ; Lee Woong-Jae ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 25~32
Mobile computing environment makes it possible for computing activities to be maintained during movement even if a user changes its network point of attachment. Mobile IP is a standard protocol designed to be used in such mobile computing environment. However, Mobile IP has a drawback to incur a lot of handoff delays and waste network resources, since CoA(Care of Address) registration packets need to go through a HA(Home Agent) first whenever a mobile node moves. To solve this long-standing problem, this paper proposes a new scheme that, for infra-domain movement, efficiently performs local handoff without notifying the HA Specifically, based on the notion of load balance, the proposed scheme allows every FA(Foreign Agent) in a domain to become the root FA(also known as domain FA) dynamically, thus distributing the registration task into many other foreign agents. The dynamic root assignment through load balancing ultimately leads to fast network response due to less frequent transmission of registration packets.
Study of CMM base Information Technology company level estimation
Kim Tai-Dal ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 33~39
In this paper, so that government official in target extent of relevant shame capacitates CMM measuring achievement result by each process as quantitative because do standard, repeat and achieves gap analysis and estimation solidify knowledge management of information base enabling "Quality control, production management, cost control, integral management of knowledge", Solidify customer service through "high-quality, differentiation" of information. Establish administration and supervision item to reach 4 steps level in information ability measurement in formation to prove business efficiency through process optimization and improves formation maturity through voluntary effort of formation continuously. Suggested model who analyze and evaluates application in domestic SI specialty company.I specialty company.
Performance Evaluation of Multibuffered Multistage Interconnection Networks under Nonuniform Traffic Pattern
Mun Yongsong ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 41~49
Analytical performance evaluation is crucial for justifying the merit of the design of Multistage Interconnection Networks(MINs) in different operational conditions. While several analytical models have been proposed for the performance evaluation of MlNs, they are mainly for uniform traffics. Even the models for nonuniform traffics have various shortcomings. In this paper, an accurate model for the performance evaluation of multi buffered banyan-type MIN's under nonuniform traffic condition is obtained. The accuracy of proposed models are conformed by comparing with the results from simulation.
Proxy-Quorum Based Replication Control Schemes for Mobile Internet Systems
Byun Si-Woo ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 51~57
Mobile Internet allows users to request critical information and receive swift responses at any places, but mobile users could suffer from unreliable and ill-timed services due to the characteristics of wireless media, One way that reduces possibility of the unsatisfactory services is data replication. Data Replica1ion, however, inevitably induces the overhead of maintaining replica consistency which requires more expensive synchronization mechanism. We propose a new replicated data management scheme in distributed mobile environment, In order to alleviate negative impact of synchronization message overhead in fault-prone mobile Internet environment, we devise a new replication control scheme called proxy quorum consensus (PQC), PQC minimizes the message overhead by coordinating quorum access activities by means of proxy mediated voting (PMV) which exploits reliable proxy hosts instead of unreliable mobile hosts in voting process, We also propose a simulation model to show the performance of PQC. Based on the results of the performance evaluation, we conclude that PQC scheme outperforms the traditional schemes.
A Study on Frontal Face Detection Using Wavelet Transform
Rhee Sang-Brum ; Choi Young-Kyoo ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 59~66
Symmetry region searching can extract face region without a prior information in an image by using symmetric. However, this method requires a plenty of the computation time because the mask size to process symmetry region searching must be larger than the size of object such as eye, nose and mouth in face. in this paper, it proposed symmetric by using symmetry region searching and Wavelet Transform to reduce computation time of symmetry region searching, and It was applied to this method in an original image. To extract exact face region, we also experimented face region searching by using domain division in extraction region.
Design of an Efficient Concurrency Control Algorithms for Real-time Database Systems
Lee Seok-Jae ; Park Sae-Mi ; Kang Tae-ho ; Yoo Jae-Soo ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 67~84
Real-time database systems (RTDBS) are database systems whose transactions are associated with timing constraints such as deadlines. Therefore transaction needs to be completed by a certain deadline. Besides meeting timing constraints, a RTDBS needs to observe data consistency constraints as well. That is to say, unlike a conventional database system, whose main objective is to provide fast average response time, RTDBS may be evaluated based on how often transactions miss their deadline, the average lateness or tardiness of late transactions, the cost incurred in transactions missing their deadlines. Therefore, in RTDBS, transactions should be scheduled according to their criticalness and tightness of their deadlines, even If this means sacrificing fairness and system throughput, And It always must guarantee preceding process of the transaction with the higher priority. In this paper, we propose an efficient real-time scheduling algorithm (Multi-level EFDF) that alleviates problems of the existing real-time scheduling algorithms, a real-time concurrency control algorithm(2PL-FT) for firm and soft real-time transactions. And we compare the proposed 2PL F[ with AVCC in terms of the restarting ratio and the deadline missing ratio of transactions. We show through experiments that our algorithms achieve good performance over the other existing methods proposed earlier.
Pushback based Advanced ICMP Traceback Mechanism Against DDoS Attack
Lee Hyung-Woo ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 85~97
Distributed Denial-of-Service(DDoS) attack prevent users from accessing services on the target network by spoofing its origin source address with a large volume of traffic. The objective of IP Traceback is to determine the real attack sources, as well as the full path taken by the attack packets. Existing IP Traceback methods can be categorized as proactive or reactive tracing. Proactive tracing(such as packet marking and messaging) prepares information for tracing when packets are in transit. Reactive tracing starts tracing after an attack is detected. In this paper, we propose a "advanced ICMP Traceback" mechanism. which is based on the modified push back system. Proposed mechanism can detect and control DDoS traffic on router and can generate ICMP Traceback message for reconstructing origin attack source.ck source.
Personal Mutual Authentication System for Ubiquitous Wireless Environments
Kim Byung-Gi ; Hong Sang-Sun ; Jouhn Young-Keel ;
Journal of Internet Computing and Services, volume 5, issue 1, 2004, Pages 99~111
Two general security measures in computing networks are secure data transmission and user authentication, These problems are still critical in the wireless LAN environments. Thus security becomes most significant issue in personal network environments and ubiquitous networks based on wireless LANs. We purpose a new authentication system for these kind of environments, and coined it UPMA(Ubiquitous Personal Mutual Authen-tication) model. UPMA supports authenticating configurations which provides personal verification for each system. It guarantees secure communications through the session key setup, and provides mutual authentication by verifying each user and his/her station. UPMA solves security problems in ubiquitous networks without accessing authentication server, Instead it performs mutual authentication between terminals or between systems. It is a global authentication system which enables global roaming service through the Internet or other public networks, It can be used to guarantee safe and convenient access to a company Intranet or to a home network.