• Title/Summary/Keyword: server performance

Search Result 1,690, Processing Time 0.027 seconds

A Level Group Streaming Technique for Interactive VOD based on P2P (P2P 기반 Interactive VOD를 위한 레벨 그룹 스트리밍 기법)

  • Kim, Jong-Gyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.955-962
    • /
    • 2008
  • Multicast Strategy is one of the cost-saving methods in the large scale VOD environment. However, it does involve complicated problems to implement VCR-like interactions for user's convenience in the multicast streaming system under considering the limited-server and the network's bandwidth in the multicast-transmission system. Therefore, the proper solution of settling such a problem is necessary. Thus, this paper which revised P2Patching[l] proposes LGST(Level Group Streaming Technique) which supports the VCR's function through cooperation among peers with heterogeneous bandwidth under the environment of P2P. This strategy can reduce latency by improving the acceptance of server and using the bandwidth of network efficiently. And for evaluate the proposed scheme's performance, I simulated the performance of streaming delivery topology and streaming quality in comparison with P2Patching. In evaluation to service request refusal ratio and service quality according to bandwidth decrement, the result of simulation shows that proposed LGST improves about $11{\sim}18%$ of performance than P2Patching. In the test of latency recovery according to fault probability and influence of VCR function operation duration, it shows similar performance.

Fuzzy BCMP Queueing Network Model for Performance Evaluation of Distributed Processing System (분산처리시스템의 성능평가를 위한 퍼지 BCMP 큐잉네트워크모델)

  • Chu, Bong-Jo;Jo, Jeong-Bok;U, Jong-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.39 no.1
    • /
    • pp.14-22
    • /
    • 2002
  • We propose the fuzzy BCMP queueing network model for the performance evaluation of distributed processing system with the ambiguous arrival rates of job, service requirements, and service rates of server by the network environments. This model is classified as the open and closed type whether or not the network accepts jobs from the system outside. We derived the measures for system performances such as the job average spending time, average job number in the system and server utilizations using fuzzy mean value analysis which can process the fuzzy factors for both types. Computer simulation was performed for verifying the effectiveness of derived equations of performance evaluation. The fuzzy BCMP queueing network model was evaluated according to the fuzzy arrival rates of job, the number of clients, and the fuzzy service requirements of job for each the open and closed type. The results were agreed with the predicted performance evaluations of the system.

Traffic-based Caching Algorithm and Performance Evaluation for QoS-adaptive Streaming Proxy Server in Wireless Networks (무선 환경에서 QoS 적응적인 스트리밍 프락시 서버를 위한 트래픽 기반 캐싱 알고리즘 및 성능 분석)

  • Kim, HwaSung;Kim, YongSul;Hong, JungPyo
    • Journal of Broadcast Engineering
    • /
    • v.10 no.3
    • /
    • pp.313-320
    • /
    • 2005
  • The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. Multimedia streams typically experience the high start-up delay due to the large protocol overhead, the delay, and the loss properties of the wireless networks. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

Performance Comparison and Analysis of Container-based Host Operating Systems for sending and receiving High-capacity data on Server Systems

  • Kim, Sungho;Kwon, Oeon;Kim, Jung Han;Byeon, JiHyeon;Hwang, Sang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.7
    • /
    • pp.65-73
    • /
    • 2022
  • Recently, as the Windows system supports the Windows subsystem for Linux (WSL), various researchers have studied to apply a docker container on various systems such as server systems, workstation system and so on. However, in various existing researchers, there is a lack of performance-related indicators to apply the system to each operating system (linux system and windows system). In this paper, we compared a performance comparison and analysis of container-based host operating systems. We configured experimental environments of operating systems for microsoft windows systems and linux systems based on a docker container support. In experimental results, the containers of linux systems reduced the average data latency of dataset 1-6 by 3.9%, 62.16%, 1552.38%, 7.27%, 60.83%, and 1567.2%, compared to the containers on microsoft windows systems.

A Study on the Development and Performance Improvement of Chatbot for Office Automation (행정업무 자동화 챗봇 개발 및 성능 향상에 관한 연구)

  • Park, Junsoo;Kim, Youngjun;Jung, Yoonkyo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.158-160
    • /
    • 2022
  • Many office workers spend a lot of time performing repetitive office tasks in inefficient ways. We developed a user-friendly chatbot system based on Kakaotalk to automate repetitive tasks and used the chatbot in the real workplace. In the process of operating the chatbot, if several people use the chatbot at the same time, the server was down or could not respond. To address these issues, we performed code migration of programs used by chatbot back-end servers and tried several ways to improve server performance such as database redesign and load balancing. To determine how much each method affects performance improvement, we measured total request per second and average latency. After that, we proposed ways to improve the problems of using the chatbot in the work environment.

  • PDF

A research on improving client based detection feature by using server log analysis in FPS games (FPS 게임 서버 로그 분석을 통한 클라이언트 단 치팅 탐지 기능 개선에 관한 연구)

  • Kim, Seon Min;Kim, Huy Kang
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.6
    • /
    • pp.1465-1475
    • /
    • 2015
  • Cheating detection models in the online games can be divided into two parts. The one is on client based model, which is designed to detect malicious programs not to be run while playing the games. The other one is server based model, which distinguishes the difference between benign users and cheaters by the server log analysis. The client based model provides various features to prevent games from cheating, For instance, Anti-reversing, memory manipulation and so on. However, being deployed and operated on the client side is a huge weak point as cheaters can analyze and bypass the detection features. That Is why the server based model is an emerging way to detect cheating users in online games. But the simple log data such as FPS's one can be hard to find validate difference between two of them. In this paper, In order to compensate for the disadvantages of the two detection model above, We use the existing game security solution log as well as the server one to bring high performance as well as detection ratio compared to the existing detection models in the market.

Subnet Generation Scheme based on Deep Learing for Healthcare Information Gathering (헬스케어 정보 수집을 위한 딥 러닝 기반의 서브넷 구축 기법)

  • Jeong, Yoon-Su
    • Journal of Digital Convergence
    • /
    • v.15 no.3
    • /
    • pp.221-228
    • /
    • 2017
  • With the recent development of IoT technology, medical services using IoT technology are increasing in many medical institutions providing health care services. However, as the number of IoT sensors attached to the user body increases, the healthcare information transmitted to the server becomes complicated, thereby increasing the time required for analyzing the user's healthcare information in the server. In this paper, we propose a deep learning based health care information management method to collect and process healthcare information in a server for a large amount of healthcare information delivered through a user - attached IoT device. The proposed scheme constructs a subnet according to the attribute value by assigning an attribute value to the healthcare information transmitted to the server, and extracts the association information between the subnets as a seed and groups them into a hierarchical structure. The server extracts optimized information that can improve the observation speed and accuracy of user's treatment and prescription by using deep running of grouped healthcare information. As a result of the performance evaluation, the proposed method shows that the processing speed of the medical service operated in the healthcare service model is improved by 14.1% on average and the server overhead is 6.7% lower than the conventional technique. The accuracy of healthcare information extraction was 10.1% higher than the conventional method.

Hierarchical Performance Modeling and Simulation of Scalable Computer System (확장성을 고려한 계층적 시스템 성능 모델 및 시뮬레이션)

  • 김흥준
    • Journal of the Korea Society for Simulation
    • /
    • v.4 no.2
    • /
    • pp.1-16
    • /
    • 1995
  • The performance of a computer system depends on the system architecture and workload, and the high performance required in many applications can be achieved by the scalability of the system architecture and workload. This paper presents scalable workload, a performance metric of scalable speedup and hierarchical modeling for the scalable computer system as well as the development of the object-oriented simulator spmplC++ Which is an advanced C++ version of the discrete event-driven simulation environment smplE. In addition, this paper presents two examples of applying scalable speedup, hierarchical modeling and simulator smplC++ to analyze the performance effect of the sclcbility in a multiprocessor system and a network-based client/server system.

  • PDF

Experiments of Search Query Performance for SQL-Based Open Source Databases

  • Min, Meekyung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.10 no.2
    • /
    • pp.31-38
    • /
    • 2018
  • As the use of open source databases grows, so does need to evaluate, the performance of search queries for these databases. This paper compares the search query performance of SQL-based open source databases with commercial databases through experiments. The targets are MySql, MariaDB, and MS-SQL Server. In this study, the execution time of various types of search queries are measured. Also, search query performance was experimented according to change of index and number of tuples. Experimental results show that SQL-based open source databases have the potential to replace commercial databases when indexes are used and the number of tuples is not very large.

Improving Performance of Multi-Paths Multistage Interconnection Network (다중-경로 다단계 상호연결 네트워크의 성능 개선)

  • Kim, Baek-Hyeon;U, Yo-Seop;Kim, Ik-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.5
    • /
    • pp.1212-1218
    • /
    • 1999
  • This paper proposes a new multipath interconnection network(MIN) structure for improving performance which uses widely in the design of multiprocessing, ATM system and VOD server. For improving performance such as passthrough ratio and packet latency, it proposes new routing method which routes one of the collided packets into the i+1-th switching stage of the adding Banyan MIN network when it occurred collision at the i-th switching stage of the basic MIN again when they collide each other. The new improved performance MIN network has been compared with MBSF, TBSF and PBSF structured MIN network from the viewpoint of passthrough ratio and the number of switching stage vs. passthrough ratio. It is shown to improve a performance and to be a simple structure which reducing the number of switching stage of adding MIN in comparison with other structured MIN including TBSF.

  • PDF