• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.1
• /
• pp.65-72
• /
• 2007

This paper aims to provide information to generate a statistical load model of an educational server by analyzing workload of an e-Learning sewer at Dankook University. The result of the analysis shows file size distribution, access frequency and transmission volume for each file type, access interval, changes in preference and clients access rate by networks. In particular, it had different results from previous studies about video file's size distribution and file distribution based on access frequency. This is because the characteristics of e-learning are influenced by using authoring tools for making into video file and by freeing the number of students who register for a course. The result in this paper can be used as a basic data for studies designed to improve e-learning system architecture and server performance.

• 대한공업교육학회지
• /
• v.33 no.1
• /
• pp.265-281
• /
• 2008

The objective of this study is to show practice example let student experience about concurrent servers based multi-processes and multi-thread among the principles of data communication in ICT(information and communications technology). For this, we first implement multi-process server(fork server) and multi-thread server(thread server), and multi-thread client(thread client), Secondly, for experimental environment, we developed small ethernet networks and measure data transfer time with relation to the number of users. Experimental results show that mean transfer time of thread server is less than that of fork server by 20~61 % on average. Furthermore, it is found that the difference of data transfer time between fork server and thread server is proportional to that of the number of users. Main reason of performance difference dues to the difference between process forking time and thread creation time. We can also find that context switching for process and thread affects the load of web server. Our presentation and experimental results can be applied to used as the educational practice materials with which student can experience data communication principles.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.105-108
• /
• 2000

As Internet and WWW grow rapidly, the role of web servers is getting more important, and the number of users in a few popular site is also explosively increasing. Load balancing in clustered web server systems is important task to utilize whole system effectively, so dynamic load balancing is required to overcome the limit of static load balancing. In this paper, we propose two dynamic load balancing schemes, and analyzed load model and Performance improvement and also compare existing load balancing methods and IP filtering method. In case of load balancing with threshold, little extra traffic was required for better performance, but in case of load balancing with load weight, we found that the performance mainly depends on information exchange rate.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.264-268
• /
• 2007

This article presents the performance evaluation case study of circuit-switched WCDMA R5MSC(Mobile Switching Center) Server and CS-MGW(Circuit Switched Media Gateway) in 3'rd generation mobile telecommunication (UMTS : Universal Mobile Telecommunication System). The presented work adopted circuit switching scenarios recommended by 3GPP(Third Generation Partnership Project) and terrestrial spectrum calculation parameters and its values defined in ITU-R M.2023 and M.1390 to do the case study on performance evaluation of circuit switched system (R5 MSC Server and CS-MGW) in WCDMA core network. This paper describes test results by using simulator which substitutes for wireless section (MS, Node-B, RNC).

• Journal of Computing Science and Engineering
• /
• v.9 no.3
• /
• pp.134-141
• /
• 2015

In on-demand multimedia streaming systems, streaming techniques are usually combined with proxy caching to obtain better performance. The patch streaming technique has no start-up latency inherent to it, but requires extra bandwidth to deliver the media data in patch streams. This paper proposes a proxy caching technique which aims at reducing the bandwidth cost of the patch streaming technique. The proposed approach determines media prefixes with high patching cost and caches the appropriate media prefix at the proxy/local server. Herein the scheme is evaluated using a synthetically generated media access workload and its performance is compared with that of the popularity and prefix-aware interval caching scheme (the prefix part) and with that of patch streaming with no caching. The bandwidth saving, hit ratio and concurrent number of clients are used to compare the performance, and the proposed scheme is found to perform better for different caching capacities of the proxy server.

• 한국컴퓨터산업교육학회:학술대회논문집
• /
• 2003.11a
• /
• pp.17-22
• /
• 2003

The surge of Internet traffic makes the bottleneck nowadays. This problem can be reduced by substituting the media of network, routers and switches with more high-performance goods. However, we focused radically the server performance of processing the service requests. We prepose the method improving performance of server in the Linux kernel stack. This accelerator accepts the requests from many clients, and processes them using not user threads but kernel thread. To do so, we can reduce the overhead caused by frequent calling of system calls and the overhead of context switching between threads. Furthermore, we implement CPN(Coloured Petri Net) model. By using the CPN model criteria, we can analyze the characteristics of operation times in addition to the reachability of system. Benchmark of the system proves the model is valid.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.643-646
• /
• 2002

In this paper, we analyse the performance of the system connected with several networks, that is, the system has one bulk input and several server by using queueing model - G $I^{⒳}$/M/c/N. in this paper we investigate some parameters from steady state probability and examine the average waiting time and blocking probability from those parameters.s.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.977-981
• /
• 2000

The traditional client-server model RPC and mobile agents have been used for interprocess communication between processes in different hosts. The performances of two mechanisme were analyzed in the literature [4, 6, 9]. But the security services which extensively affect the performance of systems because of low speed have not been considered. We propose two performance models considering the security services for the RPC and the mobile agent Through the analysis of the models, we show that the execution time of the mobile agent takes less than the RPC In the environment considering security services.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.203-211
• /
• 2013

Due to the rapid growth of mobile devices and applications, mobile cloud computing is becoming an important platform in the development of cloud services. However, the mobile cloud computing is facing many challenges in terms of the computing resources and communications. One of them is the performance issue between mobile devices and cloud server. In the paper, we implemented a hadoop-based android mobile application, called mobile TPC-C, and used it for evaluating the performance aspect between mobile devices and cloud server. The mobile TPC-C was implemented based on the existing TPC-C, to make it possible to execute on top of android mobile devices. The performance measurement using mobile TPC-C was executed on various transactions while changing the number of mobile clients. By comparing it to the evaluation on the personal PC, we tried to point out the important aspects affecting the performance improvement between mobile clients and cloud server.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.