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
Numerical Formula and Verification of Web Robot for Collection Speedup of Web Documents
Kim Weon ; Kim Young-Ki ; Chin Yong-Ok ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 1~10
A web robot is a software that has abilities of tracking and collecting web documents on the Internet(l), The performance scalability of recent web robots reached the limit CIS the number of web documents on the internet has increased sharply as the rapid growth of the Internet continues, Accordingly, it is strongly demanded to study on the performance scalability in searching and collecting documents on the web. 'Design of web robot based on Multi-Agent to speed up documents collection ' rather than 'Sequentially executing Web Robot based on the existing Fork-Join method' and the results of analysis on its performance scalability is presented in the thesis, For collection speedup, a Multi-Agent based web robot performs the independent process for inactive URL ('Dead-links' URL), which is caused by overloaded web documents, temporary network or web-server disturbance, after dividing them into each agent. The agents consist of four component; Loader, Extractor, Active URL Scanner and inactive URL Scanner. The thesis models a Multi-Agent based web robot based on 'Amdahl's Law' to speed up documents collection, introduces a numerical formula for collection speedup, and verifies its performance improvement by comparing data from the formula with data from experiments based on the formula. Moreover, 'Dynamic URL Partition algorithm' is introduced and realized to minimize the workload of the web server by maximizing a interval of the web server which can be a collection target.
Channel-Based Scheduling Policy for QoS Guarantees in Wireless Links
Kim Jeong Geun ; Hong Een-Kee ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 11~20
Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.
A Method for Minimizing the Number of Clusters in Ad-Hoc Networks
Bang Sang-Won ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 21~30
In Ad-Hoc network, the cluster structure enables effective use of multiple channels, reduces the number of control messages, and increase the scalability of network, Also, it is employed for reducing the number of broadcast messages in an Ad-Hoc network. With the consideration of these advantages, it is desirable that a cluster structure keeps a few clusters in the network, Generally, the cluster formation scheme based on connectivity yields fewer clusters than the other schemes. However, the connectivity based scheme may yield even more clusters than the other schemes according to the network topology. In this paper, a cluster formation scheme dividing the cluster formation into two phases is proposed. In the first phase, the lowest connectivity host in neighborhood initiates the cluster formation. Then, an adjustment procedure for affiliating a lot of the lowest connectivity hosts is employed. In the second phase, the hosts which were not affiliated to the first phase clusters are grouped into one or more clusters through criterions of connectivity and host ID. As a result, the proposed scheme yields a fewer clusters compared with existing other schemes in fully distributed method. The simulation results proves that our scheme is better than LIDCP(3) and HCCP(3).
VoIP Planning and Evaluation through the Analysis of Speech Transmission Quality Based on the E-Model
Bae Seong Yong ; Kim Kwang Hoon ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 31~43
Voice over Internet Protocol (VoIP) is currently a popular research topic as a real time voice packet transmission method. But current Internet environment do not guarantee the quality of voice when we take a side view of delay, jitter and loss. Up to now, many voice based evaluation algorithms have been used to measure speech quality of VoIP systems. However, these algorithms have the defects that their results are different according to voice samples and some algorithms can not take network environment for speech transmission path. The E-model can be used to solve the problems of these algorithms. In this paper. we introduce VoIP planning guidelines through the various analysis of E-model which can model impairments of network quality as well as VoIP equipment quality systematically, We, also, show the evaluation method and results of speech transmission quality.
Security-intensified SSL VPN and WLCAPT Virtual Server Design
Jeong Eun-Hee ; Choi Eun-Sil ; Lee Byung-Kwan ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 45~58
This paper consists of two parts, One is the ECC( GF(2/sup m/)) algorithm to improve the security strength and the processing time of SSL VPN and the other is the WLCAPT algorithm instead of LSNAT for the security strength of virtual server. In general when corporates use SSL protocol in order to build VPN, they use RSA algorithm with the problem of security and processing time about authentication and confidentiality, In this paper, a shared public key is generated with ECSPK which uses ECC( GF(2/sup m/)) algorithm to improve the security and processing time instead of RSA In addition, WLCAPT algorithm proposed in this paper is applied to virtual server which resides in the server side and then after NAT translation, the actual server of headquarter is securely communicated with it.
Transmission Control of Video Data through Prediction and Shot Transition Detection
Lee Keun-Soo ; Kim Won ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 59~66
In this paper, we propose a transmission rate prediction method of video data. The proposed method checks shot transition characteristics after dividing MPEG video data into a GoP unit and then uses Kalman filter. It used algorithm to detect shot transition information by high speed in compressed domain in order to check a correct shot transition of video data and classified into a abrupt shot transition type and a gradual shot transition type. Information to have been classifying is used as factors of Kalman filter and predicts a transmission rate of video data. Also, the proposed method decreased processing time with detecting shot transition and predicting a transmission rate of video data in compressed domain. It predicted a transmission rate with 96.2- 97.6% in the experiment that used three kinds of 911 1frames of different video data.
An Implementation of the Multimedia Dynamic Authoring System based on Causality Model
Shin Hyun-san ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 67~77
In this paper, we implement the multimedia dynamic authoring system based on causality model. we define two specifications which support user to specify intuitively and naturally what he/she wants, The temporal specification describes causal-based temporal relationships between presentation objects, and the spatial specification describes relative layout structure among objects on the screen. Using the specifications, the system processes for multimedia documentation are one-dimensional string list, relational trees, such as temporal. spatial, and annotated composition tree generation phases.
A Study on Improvement of Face Recognition Rate with Transformation of Various Facial Poses and Expressions
Choi Jae-Young ; Whangbo Taeg-Keun ; Kim Nak-Bin ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 79~91
Various facial pose detection and recognition has been a difficult problem. The problem is due to the fact that the distribution of various poses in a feature space is mere dispersed and more complicated than that of frontal faces, This thesis proposes a robust pose-expression-invariant face recognition method in order to overcome insufficiency of the existing face recognition system. First, we apply the TSL color model for detecting facial region and estimate the direction of face using facial features. The estimated pose vector is decomposed into X-V-Z axes, Second, the input face is mapped by deformable template using this vectors and 3D CANDIDE face model. Final. the mapped face is transformed to frontal face which appropriates for face recognition by the estimated pose vector. Through the experiments, we come to validate the application of face detection model and the method for estimating facial poses, Moreover, the tests show that recognition rate is greatly boosted through the normalization of the poses and expressions
A Dynamic toad Redistribution Using Genetic Algorithm in Heterogeneous Systems
Lee Seong Hoon ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 93~101
In a receiver-initiated load redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light, Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load redistribution in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages. The performance of proposed algorithm shows better than that of the conventional algorithm through various experiments.
Cache Policies for WWW Sewers to Reduce Workload
Lim Jaehyun ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 103~110
In this paper we study and analyze the influence of caching strategies on the performance of WWW servers, We propose a new strategy called file type based caching that aims to obtain a well-balanced mixture between large and small files in the cache, and moreover, it provides good performance for both small and large file as expected, By using the type based caching good results are obtained for both the hit rate and the byte hit rate,
The Building of Incremental Interpreter Using Analyzing of Dynamic Semantics
Han Junglan ; Choi Sung ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 111~120
In order to increase the productivity of software, the research to reduce the total cost in software development environments is working, Considerable time is wasted waiting for a changed program in program development, however smell the change, to be edited and compiled and executed. In case of partial change, we need incremental interpreter for reexecuting the changed parts and its affected parts, In this paper, we implement the incremental interpreter by using analyzing dynamic semantics at execution time, We define a new IMPLO(IMPerative Language with Object) language using EBNF(Extended Backus Naur Form) notation and then, design and implement the incremental interpreter of this language by using action equations to describe the dynamic semantics,
A Quality Evaluation System of a Handwriting String by Global and Local Features
Kim Gye-Young ;
Journal of Internet Computing and Services, volume 5, issue 6, 2004, Pages 121~128
This paper proposes a quality evaluation system of a handwriting string written by electronic pen. For the purpose of the system, this paper describes how to retrieve reference data from a database, how to evaluate the quality of a handwiting string using global and local features. Also, it explains how to optionally recognize a grade of a handwriting string at using global and how to diagnose stroke order at using local. The quality can be evaluated in the case of different language between reference and input by the system. Therefore, we expect that the system is very useful not only for training on handwriting but also for learning a language.