• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.313-320
• /
• 2003

This paper design and implements a synchronized agent mechanism that be able to synchronize SFT (Slow Frequency Transaction) data among e-business processes in distributed environment. This synchronized agent system is adopted to use mobile agent to guarantee the interoperability of the distributed processes and to solve some problems at the client/server architecture and proposes a policy to synchronize data of e-business processes on the any platforms of distributed heterogeneous systems. The proposed synchronization policy is based on the time-stamp transaction with the system priority on the unicasting transportation.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.181-188
• /
• 2009

Transcoding is one of core techniques that implement VoD services according to QoS. But it consumes a lot of CPU resource. A transcoding proxy transcodes multimedia objects to meet requirements of various mobile devices and caches them to reuse later. In this paper, we propose a service policy that reduces the load of transcoding multimedia objects by degrading QoS in a transcoding proxy. Due to the tradeoff between QoS and the load of a proxy system, a transcoding proxy provides lower QoS than a client's requirement so that it can accomodate more clients.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.989-998
• /
• 2002

The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes m unfair service to users and increases the possibility of higher reneging rates. This paper proposes an leagued batching scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme given intervals based on the league which reflect the disk partitions service patterns and user requests. Experimental results of simulations show that the proposed scheme improves about 18 percentage of average waiting time comparing with those of conventional methods such as FCFS and MQL.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.279-286
• /
• 2005

As the mobile environment has been generalized, data synchronization with mobile devices or mobile device and PC/server is required. To deal with the problem, the consortium was established by the companies, such as Motorola, Ericsson, and Nokia, and released SyncML(Synchronization Markup Language) as a standard of industrial area for interoperating with data synchronization and various transmission protocol. But, in synchronization process, when more than two clients requested data synchronization, data conflict can be happened. This paper studies the various conflict reasons that can happen in data synchronization processes and groups them systematically Through the analyzed information, we compose the Change Log Information(CLI) that can keep track of the chased information about synchronization. And we suggest an operation policy using CLI. Finally, we design an algorithm and adapt the policy as a method for the safety and consistency of data.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.153-162
• /
• 1997

M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2852-2859
• /
• 1997

Video-On-Demand system provides electronic video rental services from remote video servers on a broadband communication networks. Most of proposed VOD systems are typically designed for one-to-one conncetion between a user and video server. Therefore, video server stream services to customers individually by allocating a dedicated transmission channel and a set of video server resources for each customer. However, it is inefficiency and wxpensive way when server support multiple users who access the same video stream with a dedicated video channel. Therefore, to achieve cost-effectiveness, batching have studied method that uses multicast communication to simultaneously service all users requesting the same video with a single video with a single video stream. However, the application of the multicast communication by batching detract from the VCR-like function and on-demand nature of the system. In this paepr, we propose a scheme that can support an interactive VCR for all user requesting the same video stream with batching. To reduce a server I/O and network bandwidth requirement, dynamic buffer is allocated to access node which has variable playout poit. Consequently, it makes possible interactive VCR operation as if customer uses true VOD system. Also, this scheme can just deliver a multicast stream without delay after an initial request or VCR action occurred. The policy can guarantee acceptable services to number of users at minimum cost.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.56-70
• /
• 2005

The results of location-dependent queries(LDQ) generally depend on the current locations of query issuers. Many mechanisms, e.g. broadcast scheme, hoarding, or racking policy, have been developed to improve the system peformance and provide better services, which are specialized for LDQs. Considering geographical adjacency of data and characteristics oi target area, caching policy and broadcast scheme affect the overall performance in LDQ. For this reason, we propose both the caching policy and broadcast scheme, which these features are reflected in. Based on the adjacency of data in LDQ, our broadcast scheme use Hilbert curve to cluster data. Moreover, in order to develop the caching policy suitable for LDQ on urban area, we apply the moving distance of a MH(Mobile Host) to our caching policy We evaluate the performance of the caching policy measuring the workload of MHs and the correctness of LDQ results and the performance of the broadcast scheme measuring the average setup-time of MHs in our experiments. Finally, we expect that our caching policy Provides more correct answers when executing LDQ in focal cache and leads significant improvement of the performance of MHs. It also seems quite probable that our broadcast scheme leads improvement of battery life of the MH.

• The Journal of Fisheries Business Administration
• /
• v.33 no.1
• /
• pp.1-18
• /
• 2002

The observer program is being utilized In various fishing areas and fisheries internationally and nationally due to the its expected effectiveness in fisheries management and the collection of bioeconomic data necessary in fisheries management policy. The timely gathered data by observers play substantially a major role in decision-making fisheries policy such as the change in management measures, the application of season closure and area closure and etc. The expected effectiveness of the observer program In fisheries management, generally mentioned, is that it would lead to the increase in stock size from which the level of harvest would consequently increases. This study is aimed to analyze this tentatively expected effectiveness of the observer program in fisheries management. The changes in stock size and the level of harvest over time are analyzed under the observer program assuming the fishermen bear the cost of the observer program by investigating the change in fisherman's fishing activity under the observer program and by combining this changed activity with the biological model. The level of fishing efforts of fishermen was decreased from the results of the increase in fishing cost caused by the observer cost and the decrease in catchable stock size restricted by observers. This reduced level of fishing efforts enables stock size to increase over time and therefore, the expected level of harvest increases as time goes on. Another benefit under the observer program is to reduce management costs from the fact that fishermen are responsible for the cost of the observer program and the avoidance cost of fisherman responding to the fisheries regulation could be eliminated from the surveillance of observer. Therefore, it may possible to accomplish the cost-efficient fisheries management policy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.898-901
• /
• 2005

In this paper, we design an authorization policy module which provides the safty and reliable authorization of the user to provide the resolution for authorization in distributed environments. PKI have been utilized much by an information security-based structure for Internet electronic commerce, it is developing X.509-based in various application field such as a network security. Especially, it provides good resolution for the authentication of the user in the situation not to meet each other, but it is not enough to provide the resolution of the authorization in distributed computing environments. In this paper, We provide AAS model, which can be used distributed resources by distributed users, and design AAS model which is an authorization policy module in the Linux-based Apache Web server.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1121-1132
• /
• 2021

Nowadays, it is more difficult to find people who do not use mobile devices such as smartphones and tablets. Contents that can be accessed at the touch of a finger is overflowing. However, the existing network has a structure in which it is difficult to efficiently respond to the problems caused by overflowing contents. In particular, the bottleneck problem that occurs when multiple users intensively request content from the server at the same time is a representative problem. To solve this problem, the CCN has emerged as an alternative to future networks. CCN uses the network bandwidth efficiently through the In-Network Cache function of the intermediate node to improve the traffic required for user to request to reach the server, to reduce response time, and to distribute traffic concentration within the network. I propose a cache policy that can improve efficiency in such a CCN environment.