• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.293-298
• /
• 2004

To satisfy the requirements for QoS and acceptance ratio of the users using multimedia content service, it is required to control mechanism for QoS assurance and allocation of the stream server' resources based on CoS(Class of Service). To compare performance of the algorithm, we have classified the user by two classes (super class, base class) and control the acceptance ratio of user's requests by user's class information. We have experimented the test of network resources and test of processing time under server/client environment and agent environment. MA-URFA based on agent increases the acceptance ratio of super class and utilization ratio of network resources.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.677-684
• /
• 2008

We propose an grid-based research system that replays the experiment by storing and reusing the previous experiment result data in performing remote experiment from a distance. The proposed system was designed for the real-time hybrid test facility which is being built in Korea Construction Engineering Development(KOCED) Project. To provide users with various data, the experiment result data are maintained by the distributed streaming servers based on the publish/subscribe paradigm. Based on the data characteristics of our project, we compared analyzed the performance of the one-streaming-server case and the distributed-multiple-streaming-server case.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.3
• /
• pp.685-703
• /
• 2024

Cloud computing provides each consumer with a large-scale computing tool. Different Cyber Attacks can potentially target cloud computing systems, as most cloud computing systems offer services to many people who are not known to be trustworthy. Therefore, to protect that Virtual Machine from threats, a cloud computing system must incorporate some security monitoring framework. There is a tradeoff between the security level of the security system and the performance of the system in this scenario. If strong security is needed, then the service of stronger security using more rules or patterns is provided, since it needs much more computing resources. A new way of security system is introduced in this work in cloud environments to the VM on account of resources allocated to customers are ease. The main spike of Fog computing is part of the cloud server's work in the ongoing study tells the step-by-step cloud server to change the tremendous measurement of information because the endeavor apps are relocated to the cloud to keep the framework cost. The cloud server is devouring and changing a huge measure of information step by step to reduce complications. The Medical Data Health-Care (MDHC) records are stored in Cloud datacenters and Fog layer based on the guard intensity and the key is provoked for ingress the file. The monitoring center sustains the Activity Log, Risk Table, and Health Records. Cloud computing and Fog computing were combined in this paper to review data movement and safe information about MDHC.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.79-85
• /
• 2013

In SIP(Session Initiation Protocol) environment, the presence server should process SIP SUBSCRIBE request messages including multiple presence resources addresses from users, and also precess massive notification messages from the subscribed presence resources. The load of the presence server increases as number of users increase, and it limits system extendability. Therefore a new multiple presence servers architecture has been suggested in this research. In this architecture presence servers can be added dynamically and each server's load can be controlled effectively as number of users increase. Each presence server can monitor current load status of entire presence system by using presence event notification package which newly has been suggested in this paper. When a particular presence server's load increases over predefined limit, the presence service processing is distributed by selecting a server which has the smallest load, or by generating a new server dynamically. In this system the overall load of the entire system can be controlled optimally and extendability of the system can be increased. For this purpose a new presence event notification package and presence information data format have been suggested. The performance of the proposed system has been evaluated by experiments. They shows 44.3% increase in SUBSCRIBE message processing time, and 43.1% increase in Notification message processing time.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.627-636
• /
• 2005

This paper presents a PC cluster-based distributed video on demand (VOD) server that minimizes the load of the interconnection network by adopting channel bonding-based MVIA and the interval cache algorithm Video data is distributed to the disks of each server node of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large volume of video data transferred. We adopt two techniques to reduce the load of the interconnection network. First, an Msupporting channel bonding technique is adopted for the interconnection network. n which is a user-level communication protocol that reduces the overhead of the TCP/IP protocol in cluster systems, minimizes the time spent in communicating. We increase the bandwidth of the interconnection network using the channel bonding technique with MThe channel bonding technique expands the bandwidth by sending data concurrently through multiple network cards. Second, the interval cache reduces traffic on the interconnection network by caching the video data transferred from the remote disks in main memory Experiments using the distributed VOD server of this paper showed a maximum performance improvement of $30\%$ compared with a distributed VOD server without channel bonding-based MVIA and the interval cache, when used with a four-node PC cluster.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.598-612
• /
• 2004

Client requests have increased with the improvement of network resources at client side, whereas network resources at server side could not keep pace with the increased client request. Therefore, it is primary factor of the Qos that efficiently utilize network resources at server side. In this paper, we proposed a new model that peer-to-peer transfer scheme for partial multimedia stream based on CIWP which it decrease server network bandwidth by utilizing client disk resources saves additional server network resources. Especially, adapting Threshold_Based Multicast scheme guarantees to do that data transfer within clients never exceed service time of previous peer by restriction of which data size transferring from previous peer less than data size transferring from server. Peer-to-peer transfer within clients is limited in same group classified as ISPs. Our analytical result shows that proposed scheme reduces appling network resources at server side as utilizing additional client disk resource. furthermore, we perform various simulation study demonstrating the performance gain through comparing delay time and proportion of waiting requesters. As a result, when we compared to Threshold_Based Multicast scheme, the proposed scheme reduces server network bandwidth by 35%.

• Journal of the Korean Society of Radiology
• /
• v.8 no.1
• /
• pp.43-49
• /
• 2014

PACS is needed medical imaging with large-capacity storage device. Slower transmission degrades the performance of the PACS. Thus, the image read by the reading of the long-term stored image without compromising the quality of the video, which does not affect future readings in the range will be compressed and stored. Compression and video storage, and video transport Noise generated during storage and transmission of medical images and the resulting loss of information that occurs when the monitor output from many problems. The study estimates server display monitor and client display monitor of philips DSA system, and suggests that the evaluation and improvement about PSNR, process from server display signal obtaining to client display monitor. P company DSA is used in the test. Two monitors that are $1280{\times}1024$ pixel monitor of P company and 1536x2048 pixel monitor of Wide are used displaying angiography picture. MARO-view is taken in PACS program, and Visual $C^{++}$ is taken as accomplishing PSNR measurement program. As a result of experiment, no change in No 1, 3 of PSNR appear that there is no error in telephotograph and display. In terms of compressibility, low compressibility has small change of definition, and there was not remarkable drawback of compressibility which has little change in definition.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.75-82
• /
• 2015

Major corporations and portals have implemented a link server that connects Content Management Systems (CMS) to the physical address of content in a database (DB) to support efficient content use in web-based environments. In particular, a link server automatically connects the physical address of content in a DB to the content URL shown through a web browser screen, and re-connects the URL and the physical address when either is modified. In recent years, the number of users of digital content over the web has increased significantly because of the advent of the Big Data environment, which has also increased the number of link validity checks that should be performed in a CMS and a link server. If the link validity check is performed through an existing URL-based sequential method instead of petabyte or even etabyte environments, the identification rate of dead links decreases because of the degradation of validity check performance; moreover, frequent link checks add a large amount of workload to the DB. Hence, this study is aimed at providing a link server that can recognize URL link deletion or addition through analysis on the B-tree-based Information Identifier count per interval based on a large amount of URLs in order to resolve the existing problems. Through this study, the dead link check that is faster and adds lower loads than the existing method can be performed.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.915-920
• /
• 2005

In this paper we expanded a existing web based B2B system to support users in low speed network. To guarantee shared dat a consistency between clients and a server, we proposed a method of data change detection by using a time stamp tree and the performance analysis of the proposed method was proved by a simulation. Under the worst condition that leaf nodes of a times tamp tree were changed uniform distribution, the simulation result showed that the proposed method was more efficient than a sequential detection until the percentage of changed nodes were below $15\%$. According to our observation, the monthly average of data change was below $7\%$ on a web-based construction MRO B2B system or a company A from April 2004 to August 2004. Therefore the Proposed method improved performance of data change detection in practice. The proposed method also reduced storage consumption in a server because it didn't require a server to store replicated data for every client.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.289-300
• /
• 2014

Cloud computing helps users to save a significant amount of cost that is related to infrastructure investment, management, and maintenance. In this paper, we study the conversion planning from campus legacy web servers into an integrated cloud computing web server system. We also analyze the conversion profit when campus web servers are integrated into a cloud computer. We first investigate the cost of legacy system model of campus web servers operated by individual laboratories, departments, institutes and so on. Next, we set up a cloud computer model for the integrated web services meeting the same performance requirements. Then, we derive the conversion profit. From the result of the derivation, we see that the conversion can be effectively applied to and adopted by mid or large sized campuses and similar institutions that provide web services.