• Title/Summary/Keyword: server performance

Search Result 1,690, Processing Time 0.038 seconds

Design and Implementation of Smart Gardening System Using Real-Time Visualization Algorithm Based on IoT (IoT 기반 실시간 시각화 알고리즘을 이용한 스마트가드닝 시스템 설계 및 구현)

  • Son, Soo-A;Park, Seok-Cheon
    • Journal of Internet Computing and Services
    • /
    • v.16 no.6
    • /
    • pp.31-37
    • /
    • 2015
  • Data generated from sensors are exploding with recent development of IoT. This paradigm shift requires various industry fields that demand instant actions to analyze the arising data on a real-time basis, along with the real-time visualization analysis. As the existing visualization systems, however, perform visualization after storing data, the response time of the server cannot guarantee the ms-level processing that is close to real-time. They also have a problem of destroying data that can be major resources as they do not possess the process resources. Therefore, a smart gardening system that applies a real-time visualization algorithm using IoT sensing data under a gardening environment was designed and implement in this study. The response time of the server was measured to evaluate the performance of the suggested system. As a result, the response speed of the suggested real-time visualization algorithm was guaranteeing the ms-level processing close to real-time.

Developing Advanced Location-Based Route-Search Service for Smart-phones (진보된 스마트폰용 위치 기반 경로 검색 서비스 개발)

  • Pak, Woo-Guil;Lim, Sung-Man;Oh, Han-Joon;Yu, Kwang-Hyun;Kwon, Min-Young;Lee, Hee-Seung;Choi, Young-June
    • Journal of Internet Computing and Services
    • /
    • v.12 no.4
    • /
    • pp.173-180
    • /
    • 2011
  • Various smart-phone applications for location-based service are enabled through mobile communications such as 3G and WiFi. We have developed MARS, an advanced location-based route-search application based on the Android platform. It provides three functions: route-registration, route-search, and route-evaluation. These functions are dynamically maintained by a web server, a database server, and user mobile terminals. As users can update location information using their smart-phone devices, servers provide the information and allow users to add, modify, and remove their own information as well as adding comments to others, while existing map services do not support direct inputs from users. We show our implementation process and demonstration of its operations. We also show the comparison results with existing services. Through these results, we can confirm that MARS can achieve better performance.

Measurement-Based Adaptive Statistical Admission Control Scheme for Video-On-Demand Servers (주문형 비디오 서버를 위한 실측 기반 적응형 확률 승인 제어 기법)

  • Kim, In-Hwa;Kim, Jeong-Won;Lee, Seung-Won;Chung, Ki-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3794-3803
    • /
    • 2000
  • In a Video-on-Demand system, admission control that is used to serve multimedia data efficiently has to be perfonned by an accurate grasp of the condition of surplus resources. Most of all. we need to adaptable admission control mechanism because the disk has irregular response time caused by external elements of disk, and also has high deviation of amount demanded. In previous admission control schemes, they determined whether a new user is granted or not through a theoretical value. Although they based on the measurement, they left much to be desired in dealing with the service state. Measurement ~based statistical admission control scheme, as we su~~ested in this research, perfonns 2 processes of off-line process and on-line process in real service environment. Through this processes, we can grasp the accurate resource state of system and adaptive!y detennine the admission according to circumstances. Therefore, it can guarantee both maximum resource utilization and QoS(Quality of Service). On performance evaluations, we show that the video server can utilize maximum resource utilization with QoS guarantee through precision of perfonnance by measurement and adaptable admission control according to the requested bandwidth.

  • PDF

Multicast Group Partitioning Algorithm using Status or Receivers in Content Delivery WDM Network (콘텐츠 전달 WDM망에서 수신기의 상태를 고려한 멀티캐스트 그룹화 알고리즘)

  • Kyohong Jin;Jindeog Kim
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1256-1265
    • /
    • 2003
  • Content Delivery Network(CDN) is a mechanism to deliver multimedia content to end users on behalf of web content providers. Provider's content is distributed from content server to a set of delivery platforms located at Internet Service Providers(ISPs) through the CDN in order to realize better performance and availability than the system of centralized provider's servers. Existing work on CDN has primarily focused on techniques for efficiently multicasting the content from content server to the delivery platforms or to end users. Multimedia contents usually require broader bandwidth and accordingly WDM broadcast network has been highly recommended for the infrastructure network of CDN. In this paper, we propose methods for partitioning a multicast group into smaller subgroups using the previous status of receivers. Through the computer simulation, we show that proposed algorithm are useful to reduce the average receiver's waiting time and the number of transmissions.

  • PDF

Dynamic Hybrid Patching for the Efficient Use of VOD Server's Network-I/O Bandwidth (VOD 서버의 네트워크 입출력 대역폭의 효율적인 사용을 위한 동적 혼성 패칭)

  • Ha, Sook-Jeong;Lee, Kyung-Sook;Kim, Jin-Gyu
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.4
    • /
    • pp.502-508
    • /
    • 2005
  • This paper proposes a dynamic hybrid patching technique that can improve the performance of VOD systems by adopting the advantages of both greedy patching and grace patching to use a VOD server's limited network-I/O bandwidth. The proposed technique uses grace patching to the requests for the videos, arrival intervals of which are smaller than the size of patching window, and uses greedy patching to the rest requests. In addition, proposed patching technique expands the latest particular patching multicast into a regular multicast for a new request. In result, the patching multicast data for the new request can be the data from the beginning to the skew point of the video and the holding time of a dispatched channel can exceedingly decrease. Simulation results confirm that the proposed technique is better than grace patching in terms of defection rate and average service latency.

  • PDF

Network structure for Shared Virtual Environments (가상 공유 공간을 위한 네트워크 구조)

  • Choi, Hwal-Ian;Lee, Arthur
    • Journal of the Korea Computer Graphics Society
    • /
    • v.4 no.1
    • /
    • pp.89-100
    • /
    • 1998
  • A multi-user virtual reality system supports shared environments for concurrent accesses by multiple users. The performance of these systems depends heavily on the network environments. This paper experiments an effective network model for shared virtual environments. This model has a middle layer called groups placed between the server and its clients, and the tasks of server are distributed to these groups. Using groups solves some of the problems of existing systems such as lack of scalability, message overheads, and latency due to message passing among locally communicating entities in the virtual environment. Some experiments show lower overhead than existing distributed virtual environment systems in WAN as well as LAN environments. This model also supports a method that can be used to construct application specific network environments using message handler which allows user-defined message formats.

  • PDF

Smartphone Real Time Streaming Service using Parallel TCP Transmission (병렬 TCP 통신을 이용한 스마트폰 실시간 스트리밍 서비스)

  • Kim, Jang-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.937-941
    • /
    • 2016
  • This paper proposed an efficient multiple TCP mechanism using Android smartphones for remote control video Wi-Fi stream transmission via network communications in real time. The wireless video stream transmission mechanism can be applied in various area such as real time server stream transmissions, movable drones, disaster robotics and real time security monitoring systems. Moreover, we urgently need to transmit data in timely fashion such as medical emergency, security surveillance and disaster prevention. Our parallel TCP transmission system can play an important role in several area such as real time server stream transmissions, movable drones, disaster robotics and real time security monitoring systems as mentioned in the previous sentence. Therefore, we designed and implemented a parallel TCP transmission (parallel stream) for an efficient real time video streaming services. In conclusion, we evaluated proposed mechanism using parallel TCP transmission under various environments with performance analysis.

Enhancement of Sampling Based DDoS Detecting System for SDN (소프트웨어 정의 네트워크를 위한 샘플링 기반 서비스거부공격 탐지 시스템 개선)

  • Nguyen, Sinhngoc;Choi, Jintae;Kim, Kyungbaek
    • Annual Conference of KIPS
    • /
    • 2017.04a
    • /
    • pp.315-318
    • /
    • 2017
  • Nowadays, Distributed Denial of Service (DDoS) attacks have gained increasing popularity and have been a major factor in a number of massive cyber-attacks. It could easily exhaust the computing and communicating resources of a victim within a short period of time. Therefore, we have to find the method to detect and prevent the DDoS attack. Recently, there have been some researches that provide the methods to resolve above problem, but it still gets some limitations such as low performance of detecting and preventing, scope of method, most of them just use on cloud server instead of network, and the reliability in the network. In this paper, we propose solutions for (1) handling multiple DDoS attacks from multiple IP address and (2) handling the suspicious attacks in the network. For the first solution, we assume that there are multiple attacks from many sources at a times, it should be handled to avoid the conflict when we setup the preventing rule to switches. In the other, there are many attacks traffic with the low volume and same destination address. Although the traffic at each node is not much, the traffic at the destination is much more. So it is hard to detect that suspicious traffic with the sampling based method at each node, our method reroute the traffic to another server and make the analysis to check it deeply.

Method to Support Handover for Service Continuity based on IMS in Wireless LAN (무선랜 환경에서 서비스 연속성 지원을 위한 IMS 기반 핸드오버 지원 방안)

  • Kim, Kam-Yong;Kim, Hwa-Suk;Choi, Seong-Gon
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.9
    • /
    • pp.79-87
    • /
    • 2010
  • This paper proposes a L3 handover method to minimize packet loss for supporting service continuity to IMS Terminal which has a single WLAN interface. The existing IMS based handover solution is able to support handover between different access networks in case that a terminal has multiple interfaces. That is, WLAN terminals need multiple interfaces to connect with one or more access networks. This proposed method configures IP address for the terminal in target WLAN previously by using Candidate Access Router Discovery(CARD) mechanism. Also, in the proposed method, service continuity server performs L3 connection establishment in target WLAN and registration to IMS server instead of the terminal. And then session control mechanism based on SIP is performed to support service continuity. We analyzed handover latency and signaling cost in the proposed method and existing method to show the improved performance by the proposed method.

Implementation of a Large-scale Web Query Processing System Using the Multi-level Cache Scheme (계층적 캐시 기법을 이용한 대용량 웹 검색 질의 처리 시스템의 구현)

  • Lim, Sung-Chae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.669-679
    • /
    • 2008
  • With the increasing demands of information sharing and searches via the web, the web search engine has drawn much attention. Although many researches have been done to solve technical challenges to build the web search engine, the issue regarding its query processing system is rarely dealt with. Since the software architecture and operational schemes of the query processing system are hard to elaborate, we here present related techniques implemented on a commercial system. The implemented system is a very large-scale system that can process 5-million user queries per day by using index files built on about 65-million web pages. We implement a multi-level cache scheme to save already returned query results for performance considerations, and the multi-level cache is managed in 4-level cache storage areas. Using the multi-level cache, we can improve the system throughput by a factor of 4, thereby reducing around 70% of the server cost.