• Title/Summary/Keyword: server performance

Search Result 1,690, Processing Time 0.047 seconds

Path selection algorithm for multi-path system based on deep Q learning (Deep Q 학습 기반의 다중경로 시스템 경로 선택 알고리즘)

  • Chung, Byung Chang;Park, Heasook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.1
    • /
    • pp.50-55
    • /
    • 2021
  • Multi-path system is a system in which utilizes various networks simultaneously. It is expected that multi-path system can enhance communication speed, reliability, security of network. In this paper, we focus on path selection in multi-path system. To select optimal path, we propose deep reinforcement learning algorithm which is rewarded by the round-trip-time (RTT) of each networks. Unlike multi-armed bandit model, deep Q learning is applied to consider rapidly changing situations. Due to the delay of RTT data, we also suggest compensation algorithm of the delayed reward. Moreover, we implement testbed learning server to evaluate the performance of proposed algorithm. The learning server contains distributed database and tensorflow module to efficiently operate deep learning algorithm. By means of simulation, we showed that the proposed algorithm has better performance than lowest RTT about 20%.

An Efficient Data Nigration/Replication Scheme in a Large Scale Multimedia Server (대규모 멀티미디어 서버에서 효율적인 데이터 이동/중복 기법)

  • Kim, Eun-Sam
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.37-44
    • /
    • 2009
  • Recently, as the quality of multimedia data gets higher, multimedia servers require larger storage capacity and higher I/O bandwidth. In these large scale multimedia servers, the load-unbalance problem among disks due to the difference in access frequencies to multimedia objects according to their popularities significantly affects the system performance. To address this problem, many data replication schemes have been proposed. In this paper, we propose a novel data migration/replication scheme to provide better storage efficiency and performance than the dynamic data replication scheme which is typical data replication scheme employed in multimedia servers. This scheme can reduce the additional storage space required for replication, which is a major defect of replication schemes, by decreasing the number of copies per object. The scheme can also increase the number of concurrent users by increasing the caching effect due to the reduced lengths of the intervals among requests for each object.

A New Conference Information Data Model in SIP based Distributed Conference Architecture (SIP 기반 분산형 컨퍼런스 구조에서의 새로운 컨퍼런스 정보 데이터 모델)

  • Jang, Choon-Seo;Lee, Ky-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.85-91
    • /
    • 2009
  • The centralized conference architecture has a restriction in scalability due to the performance reduction as the number of conference participants increases. To solve this problem several distributed conference architectures have been studied recently. In these architectures new conference servers are added dynamically to the conference environment. In this paper, We have proposed a new conference information data model which can be used in these distributed conference architectures. In our newly proposed conference information data model. several components has been added for exchanging conference information between primary conference server and multiple secondary conference servers. We also proposed a procedure of conference information exchange between these conference servers. And the management of conference informations and SIP(Session Initiation Protocol) notifications to the total conference participants can be processed distributedly with these conference servers, therefore the load to the primary conference server can be decreased by using this method. The performance of our proposed model has been evaluated by experiments.

Performance Testing of Satellite Image Processing based on OGC WPS 2.0 in the OpenStack Cloud Environment (오픈스택 클라우드 환경 OGC WPS 2.0 기반 위성영상처리 성능측정 시험)

  • Yoon, Gooseon;Kim, Kwangseob;Lee, Kiwon
    • Korean Journal of Remote Sensing
    • /
    • v.32 no.6
    • /
    • pp.617-627
    • /
    • 2016
  • Many kinds of OGC-based web standards have been utilized in the lots of geo-spatial application fields for sharing and interoperable processing of large volume of data sets containing satellite images. As well, the number of cloud-based application services by on-demand processing of virtual machines is increasing. However, remote sensing applications using these two huge trends are globally on the initial stage. This study presents a practical linkage case with both aspects of OGC-based standard and cloud computing. Performance test is performed with the implementation result for cloud detection processing. Test objects are WPS 2.0 and two types of geo-based service environment such as web server in a single core and multiple virtual servers implemented on OpenStack cloud computing environment. Performance test unit by JMeter is five requests of GetCapabilities, DescribeProcess, Execute, GetStatus, GetResult in WPS 2.0. As the results, the performance measurement time in a cloud-based environment is faster than that of single server. It is expected that expansion of processing algorithms by WPS 2.0 and virtual processing is possible to target-oriented applications in the practical level.

A Study on Secure Cooperative Caching Technique in Wireless Ad-hoc Network (Wireless Ad-hoc Network에서 보안 협력 캐싱 기법에 관한 연구)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.3
    • /
    • pp.91-98
    • /
    • 2013
  • Node which plays the role of cache server does not exist in the wireless ad-hoc network consisting of only mobile nodes. Even if it exists, it is difficult to provide cache services due to the movement of nodes. Therefore, the cooperative cache technique is necessary in order to improve the efficiency of information access by reducing data access time and use of bandwidth in the wireless ad-hoc network. In this paper, the whole network is divided into zones which don't overlap and master node of each zone is elected. General node of each zone has ZICT and manages cache data to cooperative cache and gateway node use NZCT to manage cache information of neighbor zone. We proposed security structure which can accomplish send and receive in the only node issued id key in the elected master node in order to prepare for cache consistent attack which is vulnerability of distributed caching techniques. The performance of the proposed method in this paper could confirm the excellent performance through comparative experiments of GCC and GC techniques.

Performance Analysis of Service Model in Parallel VOD system (병렬 VOD 시스템에서 서비스 모델의 성능분석)

  • Nam, Jeong-Yim;Nam, Ji-Seung
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.1105-1108
    • /
    • 2005
  • Media service model is divided into 3 models that are Client Pull, Server Push, and IPP(Interleaving Pull & Push) model. In most single VOD(Video On Demand) environment, Client Pull model was sufficient to play the movie Because most media contents has a low bitrate and resolution. But according to an increment of the demand of the high definition media, Client Pull model is not sufficient. Parallel VOD environment is made of several of VOD servers and provides the parallel media stream simultaneously for one client. We compared and analyzed the performance of service models with respect to network delay and data size in buffer in the single and parallel VOD environment and we found that IPP service model keeps the least network delay and stable client buffer state in the parallel VOD environment.

  • PDF

Development of a CUBRID-Based Distributed Parallel Query Processing System

  • Kim, Hyeong-Il;Yang, HyeonSik;Yoon, Min;Chang, Jae-Woo
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.518-532
    • /
    • 2017
  • Due to the rapid growth of the amount of data, research on bigdata processing has been highlighted. For bigdata processing, CUBRID Shard is able to support query processing in parallel way by dividing the database into a number of CUBRID servers. However, CUBRID Shard can answer a user's query only when the query is required to gain accesses to a single CUBRID server, instead of multiple ones. To solve the problem, in this paper we propose a CUBRID based distributed parallel query processing system that can answer a user's query in parallel and distributed manner. Finally, through the performance evaluation, we show that our proposed system provides 2-3 times better performance on query processing time than the existing CUBRID Shard.

A Testbed of Performance Evaluation for Fingerprint Based WLAN Positioning System

  • Zhao, Wanlong;Han, Shuai;Meng, Weixiao;Zou, Deyue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.6
    • /
    • pp.2583-2605
    • /
    • 2016
  • Fingerprint positioning is a main stream and key technique for seamless positioning systems. In this paper, we develop a performance evaluation testbed for fingerprint based Wireless Local Area Network (WLAN) positioning system. The testbed consists of positioning server, positioning terminal, Access Point (AP) units, positioning accuracy analysis system and testing scenarios. Different from other testbeds tended to focus on testing in same situation, in the proposed testbed, a couple of scenarios are set to test the positioning system including indoor and outdoor environments. Handset-side positioning mode and network-side positioning mode are provided simultaneously. Variety of motion models, such as static model, low-speed model and high-speed model are considered as well as different positioning algorithms. Finally, some implementation cases are analyzed to verify the credibility of the testbed.

Sensitivity of M/M/c Retrial Queue with Respect to Retrial Times : Experimental Investigation (M/M/c 재시도대기체계에서 재시도시간의 민감성에 대한 실험적 고찰)

  • Shin, Yang-Woo;Moon, Dug-Hee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.2
    • /
    • pp.83-88
    • /
    • 2011
  • The effects of the moments of the retrial time to the system performance measures such as blocking probability, mean and standard deviation of the number of customers in service facility and orbit are numerically investigated. The results reveal some performance measures related with the number of customers in orbit can be severely affected by the fourth or higher moments of retrial time.

3D Scanning Embedded System Design (3D 스캐닝 임베디드 시스템 설계)

  • Hong, Seonhack;Cho, Kyungsoon
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.4
    • /
    • pp.49-56
    • /
    • 2017
  • It is the approach of embedded system design that finds 3D scanning technology to analyze a real object or environment to collect data on its shape and appearance. 3D laser scanning developed during the last half of 20th century in an attempt to accurately recreate the surfaces of various objects. 1960s, early scanners used lights, cameras, and projectors to carry out the scanning in the lacks of performance which encountered many difficulties with shiny, mirroring, or transparent objects. The 3D scanning technology has leveled-up with helpful of embedded software platform research and design. In this paper, First we designed the hardware of laser/camera setup and turntable moving part which is the base of object. Second, we introduced the process of scanning 3D data with software and analyzed the resulting scanned image on the web server. Last, we made the 3D scanning embedded device with 3D printing model and experimented the 3D scanning performance with Raspberry Pi.