• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.11-14
• /
• 2007

The Embedded Linux System has been developed as a system which can be used with a processor of low efficiency and small-sized memory. Unlike the usual Linux and Windows web server, it has some limitations in the install of application programs, compatibility and scalability when transferring data through web server in real-time. In this paper, we present a real-time remote monitoring system which is very useful to the embedded linux system. The presented system use Java Script without the additional programs at the Embedded Linux System web server and confirm the efficiency of the system through the existing real-time remote monitoring techniques.

• Journal of information and communication convergence engineering
• /
• v.2 no.2
• /
• pp.106-109
• /
• 2004

This study designs a load balancer via direct routing that share a virtual service on a single IP address in the Linux system and suggests an efficient load balancing method to improve transmission speed in the web server cluster environment. It will increase performance and scalability with fast packet transfer and removing bottleneck problem by using TCP Splicing and Content-Aware Distributor method. This method is expected to be the noticeable technology that provides an important interface, which make application services for e-commerce effectively be applied to high-speed network infrastructure. At this time, it is required to study further on the optimum balancing method in the web server cluster environment so as to apply the hybrid (optimum load balancing method by software and hardware) method and improve the reuse of security cession based on high-speed TCP connections.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1428-1434
• /
• 2006

In this paper, we propose the scheme solving privacy infringement in RFID systems with improving the scalability of back-end server. With RFID/USN becoming important subject, many approaches have been proposed and applied. However, limits of RFID, low computation power and storage, make the protection of privacy difficult. The Hash Chain scheme has been known as one guaranteeing forward security, confidentiality and indistinguishability. In spite of that, it is a problem that requires much of computation to identify tags in Back-End server. In this paper, we introduce an efficient key search method, the Hellman Method, to reduce computing complexity in Back-End server. Hellman Method algorism progresses pre-computation and (re)search. In this paper, after applying Hellman Method to Hash chain theory, We compared Preservation and key reference to analyze and apply to parallel With guaranteeing requistes of security for existing privacy protecting Comparing key reference reduced computation time of server to reduce computation complex from O(m) to $O(\frac{m{^2/3}}{w})$ than the existing form.

• The Journal of the Korea Contents Association
• /
• v.8 no.5
• /
• pp.1-8
• /
• 2008

The centralized conference architecture, one of the conference architectures in SIP(Session Initiation Protocol) environment, is widely used as it has the advantage of conference management and control. However it has been limited in scalability. Therefore we have proposed an efficient distributed conference architecture to improve scalability of centralized conference model. In our architecture, if the number of conference participants exceeds the predefined maximum number, a new conference server is added to the conference dynamically. In this case, the focus of existing server acts as primary focus and the focus of added server acts as secondary focus, and dynamic reallocation of participants between servers is done to equally divide the loads. This process is repeated as the number of conference participants increases. For this behavior, we have proposed procedure of adding the conference server, SIP call signal exchange, signaling procedure for RTP(Real Time Transport Protocol) sessions between conference servers, and procedure of conference event package between conference servers. The performance of our proposed model is evaluated by experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.762-777
• /
• 2014

With the increasing usage of cloud applications such as MapReduce and social networking, the amount of data traffic in data center networks continues to grow. Moreover, these appli-cations follow the incast traffic pattern, where a large burst of traffic sent by a number of senders, accumulates simultaneously at the shallow-buffered data center switches. This causes severe packet losses. The currently deployed TCP is custom-tailored for the wide-area Internet. This causes cloud applications to suffer long completion times towing to the packet losses, and hence, results in a poor quality of service. An Explicit Congestion Notification (ECN)-based approach is an attractive solution that conservatively adjusts to the network congestion in advance. This legacy approach, however, lacks scalability in terms of the number of flows. In this paper, we reveal the primary cause of the scalability issue through analysis, and propose a new congestion-control algorithm called FaST. FaST employs a novel, virtual congestion window to conduct fine-grained congestion control that results in improved scalability. Fur-thermore, FaST is easy to deploy since it requires only a few software modifications at the server-side. Through ns-3 simulations, we show that FaST improves the scalability of data center networks compared with the existing approaches.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.42-48
• /
• 2002

Many web-based simulation environments have been proposed to create models and execute simulation through the Web. Although web-based simulation has the advantage of utilizing many computers connected to Internet, overhead of the web server and heavy traffic caused by Java RMI degrade the performance and scalability of simulation. In this paper, we design and implement web-based distributed simulator using Java for the scalability and performance. In addition, we can apply the proposed simulator to create model server and client engines in online game. We apply the proposed simulator to simulate ATM switch queueing model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.352-354
• /
• 2010

Recently, the efficient management system for large-scale sensor data has been required due to the increasing deployment of large-scale sensor networks. In previous studies, sensor data was managed by distributed database system which built in a single server or a grid server. Thus, it has disadvantages such as low scalability, and high cost of building or managing the system. In this paper, we propose a cloud-based sensor data management system with low cast, high scalability, and efficiency. The proposed system can be work with the application of a variety of platforms, because processed results are provided through REST-based web service.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.1
• /
• pp.89-99
• /
• 2017

Many works have attempted to solve the scalability, the availability, and the low-latency problems of peer-to-peer (P2P) live video streaming; yet, the problems still remain. While tree-based systems are vulnerable to churn, the mesh-based systems suffer from high delay and overhead. The DHT-aided chunk-driven overlay (DCO) [1] tried to tackle these problems by using the distributed hash table (DHT), which structures into a mesh-based overlay to efficiently share the video segment. However, DCO fully depends on the capacity of the users' device which is small and unstable, i.e., the users' device may leave and join the network anytime, and the video server's bandwidth can be insufficient when the number of users joining the network suddenly increases. Therefore, cloud assist is introduced to overcome those problems. Cloud assist can be used to enhance the availability, the low-latency, and the scalability of the system. In this paper, the DHT is used to maintain the location of the streaming segments in a distributed manner, and the cloud server is used to assist other peers when the bandwidth which required for sharing the video segment is insufficient. The simulation results show that by using the threshold and cloud assist, the availability and the low-latency of the video segments, and the scalability of the network are greatly improved.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.89-91
• /
• 1998

현대 사회의 정보 요구 증가와 편리함의 추구는 정보통신 기술의 발달과 함께 멀티미디어 데이터 서비스를 급증 시켰다. NOD 데이터의 경우 이러한 요구에 부합하므로, 많은 사용자를 가지게 될 것이며, 그에 따른 제반 요건으로 서버 구현에서 scalability, availability, reliability 등이 중요한 요건이다. 따라서 이러한 요건을 멀티미디어 데이터 특성을 이용한 저장 방법으로 만족시키려는 많은 연구가 있다. 그러나 NOD 시스템에 대한 연구는 미흡한 실정이며 clustered 환경에서의 New 데이터에 대한 연구는 거의 없다. VOD 데이터에 적합한 것으로 알려진 일반적인 저장 방법이 NOD 데이터에 반드시 적합한 것이 아니며, 본 논문에서는 기존에 연구된 데이터 저장 방법 중에서 NOD 데이터의 small volume, skewed popularity distribution 등의 특성을 고려하여 clustered storage server환경에 맞는 striping 정책을 찾는다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.252-259
• /
• 1999

This paper describes the development of cluster-aware application that provides advanced services such as automatic failover, faster error recovery, easy administration and scalability in clustering environment. For These, total system architecture and algorithm are proposed. For the verification this paper, socket application and cluster resource DLL, administration DLL for the application are implemented and tested. Using the microsoft cluster server, The individual failed services was relocated from one server to another. The result shows that allows applications on the original server to continue running, unaffected tv the failed service.