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 1, Issue 2 - Dec 2000
Volume 1, Issue 1 - Nov 2000
Selecting the target year
A Study on Improving TCP Performance over ABR/UBR Services in ATM Network
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 1~10
ATM network technology is generally used for the solution of integrating multimedia service in high-speed Internet. In Internet protocol based on ATM services, If single cell is lost in ATM layer, the entire TCP packet will be lost. Therefore, TCP performance will be degraded. In order to reduce cell loss, when congestion occur, UBR+EPD mechanism is proposed to improve the throughput in TCP over UBR, and ER scheme is suggested in TCP over ABR. In this paper, we analyzed the performance improvement effect of UBR+EPD with FRR (Fast Retransmission and Recovery), the adjusting EPD threshold parameter (R), and variation of MTU (Maximum Transport Unit) size. As a result, through the analysis of performance, we know that the improved throughput and fairness are shown by the proposed scheme.
An Extensible Transaction Model for Real-Time Data Processing
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 11~18
In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.
Proposal and Performance Evaluation of A Scalable Scheduling Algorithm According to the Number of Parallel Processors
Gyung-Leen Park ; Sang Joon Lee ; BongKyu Lee ;
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 19~28
The scheduling problem in parallel processing systems has been a challenging research issue for decades. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target multiprocessor system. Duplication Based Scheduling (DBS) is a relatively new approach for solving the problem. The DBS algorithms are capable of reducing communication overhead by duplicating remote parent tasks on local processors. Most of DBS algorithms assume an availability of the unlimited number of processors in the system. Since the assumption may net hold in practice, the paper proposes a new scalable DBS algorithm for a target system with limited number of processors. It Is shown that the proposed algorithm with N available processors generates the same schedule as that obtained by the algorithm with unlimited number of processors, where N is the number of input tasks. Also, the performance evaluation reveals that the proposed algorithm shows a graceful performance degradation as the number of available processors in the system is decreased.
A Study on Predictive Traffic Control Algorithms for ABR Services
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 29~37
Asynchronous transfer mode is flexible to support multimedia communication services using asynchronous time-sharing and statistical multimedia techniques to the existing data communication area, ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates, In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals, The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series, The predicted congestion information is backward to the node, NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction, Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.
International Movement and Korea's Response of Electronic Commerce
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 38~48
At present, electronic commerce is relatively small, but it may crease on a large scale in the near future, the increasing use of electronic commerce over Internet raises question about issues in cyberspace, For that reason this study I identified several problems which currently represent an obstacle for the wider use of electronic commerce mechanisms over Internet and contemplated the international movements and Korea's response of electronic commerce on major issues, Eventually, in order to cope with Internet Round and ensure the stable growth of Electronic Commerce in Korea, the government needs to construct a predictable standards and Commercial environment, suitable to the both the situations of Electronic Commerce, for business conduct on the Internet.
A study on Implementation of English Sentence Generator using Lexical Functions
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 49~59
The majority of work done to date on natural language processing has focused on analysis and understanding of language, thus natural language generation had been relatively less attention than understanding, And people even tends to regard natural language generation CIS a simple reverse process of language understanding, However, need for natural language generation is growing rapidly as application systems, especially multi-language machine translation systems on the web, natural language interface systems, natural language query systems need more complex messages to generate, In this paper, we propose an algorithm to generate more flexible and natural sentence using lexical functions of Igor Mel'uk (Mel'uk ＆ Zholkovsky, 1988) and systemic grammar.
A Study on the Two-Dimensional Scheduling for Minimization of Moving Distance on the Remote Controllable Web-Camera
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 61~67
In case of the remote controllable web-camera that was took notice especially in internet real-time broadcasting systems, a great many clients connect the server of web-camera to request the service. So, the scheduling methods are important. Web-camera systems have used to the traditional FIFO(First In First Out) or SDF(Shortest Distance First) scheduling method. But they does not satisfy both the minimization of moving distance on the web-camera and the fairness on the users. In this paper, We propose the 2D scheduling method, As a result, the moving distance of the web-camera decreases compared with FIFO scheduling method. And the starvation state on the user's request does not happen compared with SDF scheduling method. Thus, if the remote controllable web-camera systems use the 2D scheduling method, they are satisfied with the minimization of moving distance on the remote controllable web-camera and the fairness on the users simultaneously. Therefore the user's satisfaction and the performance of the systems are improved.
Static Allocation of C++ Objects to CORBA-based Distributed Systems
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 69~88
One of the most important factors on the performance of the distributed systems is the effective distribution of the software components, There have been a lot of researches on partitioning and allocating the task-based system, while the studies on the allocating the objects of the object-oriented system into the distributed object environments are very little relatively. In this paper. we defines the graph model for partitioning the existing C++ application and allocating the C++ objects into CORBA-base distributed system, In addition, we propose a distributed object allocation algorithm based on this graph model. The performance of distributed systems is determined by the concurrency between objects, the load balance among the processors and the communication cost on the networks. To search for the solutions optimizing the above three factors simultaneously, the object allocation algorithm of this paper is based on the Niched Pareto Genetic Algorithm (NPGA). We performed the experiment on the typical C++ application and CORBA system to prove the effectiveness of our graph model and our object allocation algorithm.
Relevance Feedback for Content Based Retrieval Using Fuzzy Integral
Young Sik Choi ;
Journal of Internet Computing and Services, volume 1, issue 2, 2000, Pages 89~96
Relevance feedback is a technique to learn the user's subjective perception of similarity between images, and has recently gained attention in Content Based Image Retrieval. Most relevance feedback methods assume that the individual features that are used in similarity judgments do not interact with each other. However, this assumption severely limits the types of similarity judgments that can be modeled In this paper, we explore a more sophisticated model for similarity judgments based on fuzzy measures and the Choquet Integral, and propose a suitable algorithm for relevance feedback, Experimental results show that the proposed method is preferable to traditional weighted- average techniques.