• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.53-62
• /
• 2011

With the steady growth of mobile technology and applications, demand for more storage in mobile devices has also increased. A lightweight block-level protocol, Internet Advanced Technology Attachment (iATA), has been developed to deliver a cost-effective storage network solution for mobile devices to obtain more storage. This paper seeks to contribute to designing and implementing Load Balancing (LB), Network Monitoring (NM) and Write Replication (WR) modules to improve the protocol's scalability and data availability. LB and NM modules are invoked to collect system resources states and current network status at each associate node (server machine). A dynamic weight factor is calculated based on the collected information and sent to a referral server. The referral server is responsible to analyze and allocate the most ideal node with the least weight to serve the client. With this approach, the client can avoid connecting to a heavily loaded node that may cause delays in subsequent in-band I/O operations. Write replication is applied to the remaining nodes through a WR module by utilizing the Unison file synchronization program. A client initially connected to node IP A for write operations will have no hindrances in executing the relevant read operations at node IP B in new connections. In the worst case scenario of a node crashing, data remain recoverable from other functioning nodes. We have conducted several benchmark tests and our results are evaluated and verified in a later section.

• International journal of advanced smart convergence
• /
• v.4 no.2
• /
• pp.38-45
• /
• 2015

Peer-to-Peer(P2P) systems are generally classified into two categories; hybrid and pure P2P. Hybrid systems have a single central index server keeping the details of shared information, so that undesirable effects such as heavy load on that server and lack of fault-tolerance can be caused. Pure P2P causes the other problems such as message flooding and scalability although it shows high degree of fault-tolerance. Recently, mobile agent-based distributed computing has been receiving wide attention for its potential to support disconnected operations, high asynchrony, and thus saving network bandwidth. In this paper, a new scheme of peer coordination is proposed for a decentralized P2P network with self-organizing structure. We deployed mobile agents for incorporating the advantages of usage of mobile agents into our P2P network. Proposed P2P network has both advantages of hybrid and pure P2P. The problems of heavy load on the server and lack of fault-tolerance are improved by using multiple special peers called super-peers. And the problems of pure P2P can be reduced by using mobile agents.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.507-514
• /
• 2005

This paper presents a partially decentralized passive replication algorithm for deterministic servers in message-passing distributed systems. The algorithm allows any backup server, not necessarily the primary server, to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery sequence number of the request from the primary. Thanks to thus desirable feature, the algorithm with conventional load balancing techniques can efficiently avoid extreme load conditions on the primary. Therefore, it can provide better scalability of deterministic and replicated sewer systems than traditional passive replication algorithms. Simulation results indicate that the proposed algorithm can reduce $16.5\%{\~}52.3\%$ of the average response time of a client request compared with the traditional ones.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.259-273
• /
• 2009

Most of large-scale distributed file systems decouple a metadata operation from read and write operations for a file. In the distributed file systems, a certain server named a metadata server (MDS) maintains metadata information in file system such as access information for a file, the position of a file in the repository, the namespace of the file system, and so on. But, the existing systems used restrictive metadata management schemes, because most of the distributed file systems designed to focus on the distributed management and the input/output performance of data rather than the metadata. Therefore, in the existing systems, the metadata throughput and expandability of the metadata server are limited. In this paper, we propose a new non-shared metadata management scheme in order to provide the high metadata throughput and scalability for a cluster of MDSs. First, we derive a dictionary partitioning scheme as a new metadata distribution technique. Then, we present a load balancing technique based on the distribution technique. It is shown through various experiments that our scheme outperforms existing metadata management schemes in terms of scalability and load balancing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1113-1122
• /
• 1999

In this paper, we propose MSS(Multicast Synchronization Server) and QCS(QoS Conversion Server) models that can support IP multicast and QoS(Quality of Service) over the ATM network more efficiently. In the MSS model, it is possible to establish shortcut VCs(Virtual Circuits) among all hosts in the ATM network and to transfer multicast data at high speed. Also the MSS model is more scalable, because the number of inter-cluster VCs needed in the MSS model is less than that of EARTH. In the QCS model, ATM switch is modified to support one QoS service and best effort service through the one point-to-multipoint VC at the same time so required network resources are reduced, and dedicated server is used for QoS conversion to accept heterogeneous receivers more efficiently. In this Paper, the proposed MSS model and QCS model have solved both efficiency problem and scalability problem. It is proved through the comparison of the VCs required in each model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.547-550
• /
• 2017

With the deployment of Internet of Things (IoT) services, the interest of smart building management system is rapidly increased. However, existing smart building management system has some limitations such as single point of failure, scalability, processing delay by using the centralized service platform server. To overcome these limitations, in this paper, the distributed server based smart building management scheme is proposed. In the proposed scheme, it is possible to provide fast and efficient IoT services, regardless of the scale of smart building, by using the distributed server of each floor. From the numerical analysis, it is shown that the proposed scheme provides better performance than the existing centralized scheme in terms of stability of database and service processing delay.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.275-279
• /
• 2004

In this paper, a large-scale, wide-area storage system based on IP is proposed which is under development. OASIS is a storage system enforced with very high-scalability up to hundreds and thousands of clients over IP network, and it is able to extend the service to the wide area network. For this purpose, we adopt an storage interconnection technology based on IP, the object based storage technology and a clustered server architecture which provides high-scalability and availability to our system. This system can be utilized to provide network storage service which gains more reality with the incoming FTTH and WiBro services.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.117-125
• /
• 2003

The proposed mechanism has an group management server, which manages the information about both the receivers and the senders. Any receiver can dynamically join/leave the multicast VC. The signaling overload due to group membership changes is not concentrated on the sender, but it is distributed to many receivers for the scalability improvement. The associated signaling messages propagates from the receivers to the ATM switch dedicated to the multicast VC, and hence no signaling overload exists in the shared links there is no latency for the receiver to wait. Our proposed scheme is superior in the view of scalability, the efficiency and the latency to other schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5419-5436
• /
• 2016

Enhancing the performance of computing systems has been an important topic since the invention of computers. The leading-edge technologies of multicore and virtualization dramatically influence the development of current IT systems. We study performance attributes of response time (RT), throughput, efficiency, and scalability of a virtualized Web system running on a multicore server. We build virtual machines (VMs) for a Web application, and use distributed stress tests to measure RTs and throughputs under varied combinations of virtual cores (VCs) and VM instances. Their gains, efficiencies and scalabilities are also computed and compared. Our experimental and analytic results indicate: 1) A system can perform and scale much better by adopting multiple single-VC VMs than by single multiple-VC VM. 2) The system capacity gain is proportional to the number of VM instances run, but not proportional to the number of VCs allocated in a VM. 3) A system with more VMs or VCs has higher physical CPU utilization, but lower vCPU utilization. 4) The maximum throughput gain is less than VM or VC gain. 5) Per-core computing efficiency does not correlate to the quality of VCs or VMs employed. The outcomes can provide valuable guidelines for selecting instance types provided by public Cloud providers and load balancing planning for Web systems.

• Journal of Broadcast Engineering
• /
• v.6 no.3
• /
• pp.225-233
• /
• 2001

Real-time video communication applications over Internet should be able to support such functionality as scalability because of the unpredictable and varying channel bandwidth between server and client. To accommodatethe wide variety of channel bitrates, a new scalable coding tool, namely the Fine Granular Scalability (FGS) coding tool has been reduce the adopted In the MPEG-4 video standard. This paper presentsa new FGS algorithm with matching Pursuit that can reduce the computational complexity of ordinal matching pursuit-based algorithm. The Proposed coding algorithm can make trade-off between Picture Quality and computationalcomplexity. Our simulation result shows that the proposed algorithm can reduce the computational cumplexity up to 1/5 compared to the conventional FGS method while retaining a similar picture quality.