• Title/Summary/Keyword: server performance

Search Result 1,690, Processing Time 0.029 seconds

Spatial Data Service Based on RIA for Mobile Environment (모바일 환경을 위한 RIA 기반 공간 데이터 서비스)

  • Lee, Jae-Il;Kim, Ji-Ho;Oh, Byoung-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.4
    • /
    • pp.56-64
    • /
    • 2009
  • As the Internet has been improved to Web 2.0, it introduces new approaches including Rich Internet Application (RIA) technology such as Flash, AJAX, Silverlight, etc. The RIA which is platform independent technology allows applications to provide rich client-side interfaces, and allows the browser to interact with users without communication to server. In this paper, we propose a method of spatial data service based on RIA technology. Internet map service using spatial data generally requires rich client-side interfaces and various interactions. These features can be provided by the RIA. The proposed method uses Flash developed by Macromedia as RIA technology. It can be applicable on any platform including mobile environment. The spatial data server makes Flash file known as SWF (Shock Wave File) with manipulation code for map and spatial data that is requested by user, and send it to the web browser. Once the web browser receives a SWF, client SWF manipulates user interactions, such as zooming and panning, without communication with server. Experiments that execute the application on various web browsers including mobile web browser and measure time of map interaction are carried out to compare with traditional bitmap based WMS (Web Map Service). As a result of experiments, we have confirmed improvement of interactivity and performance with RIA approach.

  • PDF

SPQI: An Efficient Continuous Range Query Indexing Structure for a Mobile Environment (SPQI: 이동 환경에서 연속 범위 질의에 대한 효율적인 색인 구조)

  • Lee, JongHyeok;Jung, HaRim;Youn, Hee Yong;Kim, Ung-Mo
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.70-75
    • /
    • 2015
  • In this paper, we explore the efficient processing of continuous range queries over a huge number of moving objects, each of which retrieves the moving objects that are currently located within a geographic query region of interest. The moving objects should continually communicate with the server to report their current locations, so as to keep the results of the continuous range queries up-to-date. However, this increases the server workload and involves a enormous amount of communication as the number of continuous range queries and the moving objects becomes enormous. In this paper, we adopt an approach where we leverage available memory and computational resources of the moving objects in order to resolve these problems. To this end, we propose a query indexing structure, referred to as the Space Partitioning Query Index(SPQI), which enables the server to efficiently cooperate with the moving objects for processing continuous range queries. SPQI improves system performance in terms of server workload and communication cost. Through simulations, we show the superiority of SPQI.

Fast Distributed Network File System using State Transition Model in the Media Streaming System (미디어 스트리밍 시스템에서의 상태 천이 모델을 활용한 고속 분산 네트워크 파일 시스템)

  • Woo, Soon;Lee, Jun-Pyo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.145-152
    • /
    • 2012
  • Due to the large sizes of streaming media, previous delivery techniques are not providing optimal performance. For this purpose, video proxy server is employed for reducing the bandwidth consumption, network congestion, and network traffic. This paper proposes a fast distributed network file system using state transition model in the media streaming system for efficient utilization of video proxy server. The proposed method is composed of three steps: step 1. Training process using state transition model, step 2. base and decision probability generation, and step 3. storing and deletion based on probability. In addition, storage space of video proxy server is divided into each segment area in order to store the segments efficiently and to avoid the fragmentation. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, the proposed method provides the lowest user start-up latency and the highest bandwidth saving significantly.

Optimal TCP Segment Size for Mobile Contents Server Access over Wireless Links of Cellular Networks (이동통신망에서의 모바일 컨텐츠 서버 통신을 위한 최적의 TCP 세그먼트 길이)

  • Lee, Goo-Yeon;Jeong, Choong-Kyo;Kim, Hwa-Jong;Lee, Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.12 s.354
    • /
    • pp.31-41
    • /
    • 2006
  • Internet access from mobile phones over cellular networks suffer from severe bandwidth limitations and high bit error rates over wireless access links. Tailoring TCP connections to best fit the characteristics of this bottleneck link is thus very important for overall performance improvement. In this work, we propose a simple algorithm in deciding the optimal TCP segment size to maximize the utilization of the bottleneck wireless TCP connection for mobile contents server access, taking the dynamic TCP window variation into account. The proposed algorithm can be used when the product of the access rate and the propagation time is not large. With some numerical examples, it is shown that the optimal TCP segment size becomes a constant value when the TCP window size exceeds a threshold. One can set the maximum segment size of a wireless TCP connection to this optimal segment size for mobile contents server access for maximum efficiency on the expensive wireless link.

A Consolidated Wireless Internet Proxy Server Cluster Architecture (통합형 무선 인터넷 프록시 서버 클러스터 구조)

  • Kwak Hu-Keun;Chung Kyu-Sik
    • The KIPS Transactions:PartA
    • /
    • v.13A no.3 s.100
    • /
    • pp.231-240
    • /
    • 2006
  • In this paper, wireless internet proxy server clusters are used for the wireless internet because their caching, distillation, and clustering functions are helpful to overcome the limitations and needs of the wireless internet. TranSend was proposed as a clustering based wireless internet proxy server but it has disadvantages; 1) its scalability is difficult to achieve because there is no systematic way to do it and 2) its structure is complex because of the inefficient communication structure among modules. In our former research, we proposed the CD-A structure which can be scalable in a systematic way but it also has disadvantages; its communication structure among modules is partly complex. In this paper, we proposed a consolidated scheme which has a systematic scalability and an efficient communication structure among modules. We performed experiments using 16 PCs and experimental results show 196% and 40% performance improvement of the proposed system compared to the TranSend and the CD-A system, respectively.

Study on Collecting Server Information through Banner Grabbing (배너 그래빙을 통한 서버 정보 수집에 관한 연구)

  • Kang, HongGoo;Kim, HyeonHak;Lee, HyunSeung;Lee, Sang-jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.6
    • /
    • pp.1317-1330
    • /
    • 2017
  • To collect server information and construct network map enable us to prevent security breach, prepare for national cyber warfare and make effective policies. In this paper, we analyze well-known network scanners, Nmap and ZMap, and construct network map using banner grabbing. We use multiple threads in order to increase scanning speed and arrange IP lists by specific order to reduce the load on information gathering targets. Also, we applied performance tests to compare the real-time banner grabbing tool with the existing network scanners. As a result, we gathered server information from domestic and overseas servers and derived a risk index based on the collected database. Although there are slight differences among countries, we can identify the risky situation that many users in every country are exposed to several security breaches.

Real-Time Face Recognition System using PDA (PDA를 이용한 실시간 얼굴인식 시스템 구현)

  • Kwon Man-Jun;Yang Dong-Hwa;Go Hyoun-Joo;Kim Jin-Whan;Chun Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.5
    • /
    • pp.649-654
    • /
    • 2005
  • In this paper, we describe an implementation of real-time face recognition system under ubiquitous computing environments. First, face image is captured by PDA with CMOS camera and then this image with user n and name is transmitted via WLAN(Wireless LAN) to the server and finally PDA receives verification result from the server The proposed system consists of server and client parts. Server uses PCA and LDA algorithm which calculates eigenvector and eigenvalue matrices using the face images from the PDA at enrollment process. And then, it sends recognition result using Euclidean distance at verification process. Here, captured image is first compressed by the wave- let transform and sent as JPG format for real-time processing. Implemented system makes an improvement of the speed and performance by comparing Euclidean distance with previously calculated eigenvector and eignevalue matrices in the learning process.

Study of Load Balancing Technique Based on Step-By-Step Weight Considering Server Status in SDN Environment (SDN 환경에서 서버 상태를 고려한 단계적 가중치 기반의 부하 분산 기법 연구)

  • Jae-Young Lee;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.6
    • /
    • pp.1087-1094
    • /
    • 2023
  • Due to the development of technologies, such as big data, cloud, IoT, and AI, The high data throughput is required, and the importance of network flexibility and scalability is increasing. However, existing network systems are dependent on vendors and equipment, and thus have limitations in meeting the foregoing needs. Accordingly, SDN technology that can configure a software-centered flexible network is attracting attention. In particular, a load balancing method based on SDN can efficiently process massive traffic and optimize network performance. In the existing load balancing studies in SDN environment have limitation in that unnecessary traffic occurs between servers and controllers or performing load balancing only after the server reaches an overload state. In order to solve this problem, this paper proposes a method that minimizes unnecessary traffic and appropriate load balancing can be performed before the server becomes overloaded through a method of assigning weights to servers in stages according to server load.

Development of a complex failure prediction system using Hierarchical Attention Network (Hierarchical Attention Network를 이용한 복합 장애 발생 예측 시스템 개발)

  • Park, Youngchan;An, Sangjun;Kim, Mintae;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.4
    • /
    • pp.127-148
    • /
    • 2020
  • The data center is a physical environment facility for accommodating computer systems and related components, and is an essential foundation technology for next-generation core industries such as big data, smart factories, wearables, and smart homes. In particular, with the growth of cloud computing, the proportional expansion of the data center infrastructure is inevitable. Monitoring the health of these data center facilities is a way to maintain and manage the system and prevent failure. If a failure occurs in some elements of the facility, it may affect not only the relevant equipment but also other connected equipment, and may cause enormous damage. In particular, IT facilities are irregular due to interdependence and it is difficult to know the cause. In the previous study predicting failure in data center, failure was predicted by looking at a single server as a single state without assuming that the devices were mixed. Therefore, in this study, data center failures were classified into failures occurring inside the server (Outage A) and failures occurring outside the server (Outage B), and focused on analyzing complex failures occurring within the server. Server external failures include power, cooling, user errors, etc. Since such failures can be prevented in the early stages of data center facility construction, various solutions are being developed. On the other hand, the cause of the failure occurring in the server is difficult to determine, and adequate prevention has not yet been achieved. In particular, this is the reason why server failures do not occur singularly, cause other server failures, or receive something that causes failures from other servers. In other words, while the existing studies assumed that it was a single server that did not affect the servers and analyzed the failure, in this study, the failure occurred on the assumption that it had an effect between servers. In order to define the complex failure situation in the data center, failure history data for each equipment existing in the data center was used. There are four major failures considered in this study: Network Node Down, Server Down, Windows Activation Services Down, and Database Management System Service Down. The failures that occur for each device are sorted in chronological order, and when a failure occurs in a specific equipment, if a failure occurs in a specific equipment within 5 minutes from the time of occurrence, it is defined that the failure occurs simultaneously. After configuring the sequence for the devices that have failed at the same time, 5 devices that frequently occur simultaneously within the configured sequence were selected, and the case where the selected devices failed at the same time was confirmed through visualization. Since the server resource information collected for failure analysis is in units of time series and has flow, we used Long Short-term Memory (LSTM), a deep learning algorithm that can predict the next state through the previous state. In addition, unlike a single server, the Hierarchical Attention Network deep learning model structure was used in consideration of the fact that the level of multiple failures for each server is different. This algorithm is a method of increasing the prediction accuracy by giving weight to the server as the impact on the failure increases. The study began with defining the type of failure and selecting the analysis target. In the first experiment, the same collected data was assumed as a single server state and a multiple server state, and compared and analyzed. The second experiment improved the prediction accuracy in the case of a complex server by optimizing each server threshold. In the first experiment, which assumed each of a single server and multiple servers, in the case of a single server, it was predicted that three of the five servers did not have a failure even though the actual failure occurred. However, assuming multiple servers, all five servers were predicted to have failed. As a result of the experiment, the hypothesis that there is an effect between servers is proven. As a result of this study, it was confirmed that the prediction performance was superior when the multiple servers were assumed than when the single server was assumed. In particular, applying the Hierarchical Attention Network algorithm, assuming that the effects of each server will be different, played a role in improving the analysis effect. In addition, by applying a different threshold for each server, the prediction accuracy could be improved. This study showed that failures that are difficult to determine the cause can be predicted through historical data, and a model that can predict failures occurring in servers in data centers is presented. It is expected that the occurrence of disability can be prevented in advance using the results of this study.

A Network Storage LSI Suitable for Home Network

  • Lim, Han-Kyu;Han, Ji-Ho;Jeong, Deog-Kyoon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.4 no.4
    • /
    • pp.258-262
    • /
    • 2004
  • Storage over Ethernet (SoE) is a network storage architecture that allows direct attachment of existing ATA/ATAPI devices to Ethernet without a separate server. Unlike SAN, no server computer intervenes between the storage and the client hosts. We propose a SoE disk controller (SoEDC) amenable to low-cost, single-chip implementation that processes a simplified L3/L4 protocol and converts commands between Ethernet and ATA/ATAPI, while the rest of the complex tasks are performed by the remote hosts. Thanks to simple architecture and protocol, the SoEDC implemented on a single $4mm{\times}4mm$ chip in 0.18um CMOS technology achieves maximum throughput of 55MB/s on Gigabit Ethernet, which is comparable to that of a high-performance disk storage locally attached to a host computer.