• Title/Summary/Keyword: Server selection algorithm

Search Result 28, Processing Time 0.022 seconds

Development of Control System for 2MW Direct Drive Wind Turbine (2MW급 직접구동형 풍력터빈 제어시스템 개발)

  • Moon, Jun-Mo;Jang, Jeong-Ik;Yoon, Kwang-Yong;Joe, Gwang-Myung;Lee, Kwon-Hee
    • Journal of Wind Energy
    • /
    • v.2 no.1
    • /
    • pp.90-96
    • /
    • 2011
  • The purpose of this paper is to describe the control system for optimal performance of 2MW gearless PMSG wind turbine system, and to afford some techniques of the algorithm selection and design optimization of the wind turbine control system through analysis of load calculation and control characteristic. Wind turbine control system is composed of the main control system and remote control and monitoring system. The main control system is industrial PC based controller, and the remote control and monitoring system is a server based computer system. The main control system has a supervisory control of the wind turbine with operation procedures and power-speed control through the torque control by pitch angle. There are some applications to optimize the wind turbine system at the starting mode with increasing of rotor speed, and cut-in operating mode to prevent trundling cut-in and cut-out, a gain scheduling of pitch PID controller, torque scheduling and limitation of generation power by temperature limitation or remote command by remote control and monitoring system. Also, the server operation program of the remote control and monitoring system and the design of graphical display are described in this paper.

An Adaptive Proximity Route Selection Method in DHT-Based Peer-to-Peer Systems (DHT 기반 피어-투-피어 시스템을 위한 적응적 근접경로 선택기법)

  • Song Ji-Young;Han Sae-Young;Park Sung-Yong
    • The KIPS Transactions:PartA
    • /
    • v.13A no.1 s.98
    • /
    • pp.11-18
    • /
    • 2006
  • In the Internet of various networks, it is difficult to reduce real routing time by just minimizing their hop count. We propose an adaptive proximity route selection method in DHT-based peer-to-peer systems, in which nodes select the nぉe with smallest lookup latency among their routing table entries as a next routing node. Using Q-Routing algorithm and exponential recency-weighted average, each node estimates the total latency and establishes a lookup table. Moreover, without additional overhead, nodes exchange their lookup tables to update their routing tables. Several simulations measuring the lookup latencies and hop-to-hop latency show that our method outperforms the original Chord method as well as CFS' server selection method.

Many-objective joint optimization for dependency-aware task offloading and service caching in mobile edge computing

  • Xiangyu Shi;Zhixia Zhang;Zhihua Cui;Xingjuan Cai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.5
    • /
    • pp.1238-1259
    • /
    • 2024
  • Previous studies on joint optimization of computation offloading and service caching policies in Mobile Edge Computing (MEC) have often neglected the impact of dependency-aware subtasks, edge server resource constraints, and multiple users on policy formulation. To remedy this deficiency, this paper proposes a many-objective joint optimization dependency-aware task offloading and service caching model (MaJDTOSC). MaJDTOSC considers the impact of dependencies between subtasks on the joint optimization problem of task offloading and service caching in multi-user, resource-constrained MEC scenarios, and takes the task completion time, energy consumption, subtask hit rate, load variability, and storage resource utilization as optimization objectives. Meanwhile, in order to better solve MaJDTOSC, a many-objective evolutionary algorithm TSMSNSGAIII based on a three-stage mating selection strategy is proposed. Simulation results show that TSMSNSGAIII exhibits an excellent and stable performance in solving MaJDTOSC with different number of users setting and can converge faster. Therefore, it is believed that TSMSNSGAIII can provide appropriate sub-task offloading and service caching strategies in multi-user and resource-constrained MEC scenarios, which can greatly improve the system offloading efficiency and enhance the user experience.

A Peer Load Balancing Method for P2P-assisted DASH Systems (P2P 통신 병용 DASH 시스템의 피어 부하 분산 방안 연구)

  • Seo, Ju Ho;Kim, Yong Han
    • Journal of Broadcast Engineering
    • /
    • v.25 no.1
    • /
    • pp.94-104
    • /
    • 2020
  • Currently media consumption over fixed/mobile Internet is mostly conducted by adaptive media streaming technology such as DASH (Dynamic Adaptive Streaming over HTTP), which is an ISO/IEC MPEG (Moving Picture Experts Group) standard, or some other technologies similar to DASH. All these heavily depend on the HTTP caches that ISPs (Internet Service Providers) are obliged to provide sufficiently to make sure fast enough Web services. As a result, as the number of media streaming users increases, ISPs' burden for HTTP cache has been greatly increased rather than CDN (Content Delivery Network) providers' server burden. Hence ISPs charge traffic cost to CDN providers to compensate for the increased cost of HTTP caches. Recently in order to reduce the traffic cost of CDN providers, P2P (Peer-to-Peer)-assisted DASH system was proposed and a peer selection algorithm that maximally reduces CDN provides' traffic cost was investigated for this system. This algorithm, however, tends to concentrate the burden upon the selected peer. This paper proposes a new peer selection algorithm that distributes the burden among multiple peers while maintaining the proper reduction level of the CDN providers' cost. Through implementation of the new algorithm in a Web-based media streaming system using WebRTC (Web Real-Time Communication) standard APIs, it demonstrates its effectiveness with experimental results.

An Image-based Augmented Reality System for Multiple Users using Multiple Markers (다수 마커를 활용한 영상 기반 다중 사용자 증강현실 시스템)

  • Moon, Ji won;Park, Dong woo;Jung, Hyun suk;Kim, Young hun;Hwang, Sung Soo
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.10
    • /
    • pp.1162-1170
    • /
    • 2018
  • This paper presents an augmented reality system for multiple users. The proposed system performs ar image-based pose estimation of users and pose of each user is shared with other uses via a network server. For camera-based pose estimation, we install multiple markers in a pre-determined space and select the marker with the best appearance. The marker is detected by corner point detection and for robust pose estimation. the marker's corner points are tracked by optical flow tracking algorithm. Experimental results show that the proposed system successfully provides an augmented reality application to multiple users even when users are rapidly moving and some of markers are occluded by users.

Study of Multiple Interface Control and Dynamic Delivery Model for Seamless Mobile Transportation

  • Lee, Seon-Ung;Moon, Il-Young
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.4
    • /
    • pp.399-404
    • /
    • 2010
  • We propose a seamless IPTV transport technology of mobile device. This technology uses multiple interfaces of wireless communication on mobile device. This proposal for transportation of mobile IPTV contents is more mobile and adaptable than other wireless technologies that are currently being used. Algorithm of proposed technology is as follow. When the signal strength of the connected wireless network interface of mobile device is getting lower than specified level, another wireless network interface is connected to continue downloading the IPTV contents in advance. Another connection is maintained until the signal strength of the first connected interface is stable or the interface is connected to another base station (or AP) that have good signal strength. For more seamless services, we consider classifying the packets of mobile IPTV and using dynamic content quality select techniques. Dynamic content quality selection is based on notifying transfer rate to the content delivery network (CDN) server. The proposed technology is expected to use efficiently with both mobile IPTV and the transportation of mobile P2P/P4P.

Non-Interactive Oblivious Transfer Protocol based on EIGamal in WAP (WAP에서 사용 가능한 ElGamal 기반의 비대화형 불확정 전송 프로토콜)

  • 정경숙;홍석미;정태충
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.1
    • /
    • pp.11-18
    • /
    • 2003
  • As the Internet moves to mobile environment, one of the most serious problems for the security is to required a new security Protocol with safety and efficiency. To solve the problem. we Propose a new Protocol that reduces the communication franc and solves the problem associated with the private security keys supplied by the trusted third party. The protocol is a non-Interactive oblivious transfer protocol, based on the EIGamal public-key algorithm. Due to its Non-Interactive oblivious transfer protocol, it can effectively reduce communication traffic in server-client environment. And it is also possible to increase the efficiency of protocol through the mechanism that authentication probability becomes lower utilizing a challenge selection bit. The protocol complexity becomes higher because it utilizes double exponentiation. This means that the protocol is difficult rather than the existing discrete logarithm or factorization in prime factors. Therefore this can raise the stability of protocol.

GIS Information Generation for Electric Mobility Aids Based on Object Recognition Model (객체 인식 모델 기반 전동 이동 보조기용 GIS 정보 생성)

  • Je-Seung Woo;Sun-Gi Hong;Dong-Seok Park;Jun-Mo Park
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.23 no.4
    • /
    • pp.200-208
    • /
    • 2022
  • In this study, an automatic information collection system and geographic information construction algorithm for the transportation disadvantaged using electric mobility aids are implemented using an object recognition model. Recognizes objects that the disabled person encounters while moving, and acquires coordinate information. It provides an improved route selection map compared to the existing geographic information for the disabled. Data collection consists of a total of four layers including the HW layer. It collects image information and location information, transmits them to the server, recognizes, and extracts data necessary for geographic information generation through the process of classification. A driving experiment is conducted in an actual barrier-free zone, and during this process, it is confirmed how efficiently the algorithm for collecting actual data and generating geographic information is generated.The geographic information processing performance was confirmed to be 70.92 EA/s in the first round, 70.69 EA/s in the second round, and 70.98 EA/s in the third round, with an average of 70.86 EA/s in three experiments, and it took about 4 seconds to be reflected in the actual geographic information. From the experimental results, it was confirmed that the walking weak using electric mobility aids can drive safely using new geographic information provided faster than now.