• Title/Summary/Keyword: 밸런싱

Search Result 399, Processing Time 0.024 seconds

An Intra-path Load Balancing Method based on both the Bottleneck State of Path and the Bandwidth Avaliability of Link (경로 병목상태와 링크 대역폭 가용도 기반 경로 부하 밸런싱 방법)

  • Kim, Tae-Joon
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.3
    • /
    • pp.409-418
    • /
    • 2009
  • Providing Quality-of-Service (QoS) guarantee requires for each router on the path of a traffic flow not to violate the flow's delay budget allocated to itself. Since the amount of load being offered to the router is determined by the budget, some imbalance in load among routers on the path may be alleviated by means of adjusting the budget. The equal allocation applied to the resource reservation protocol (RSVP) is simple to implement, but it has the drawback of a poor resource utilization. A load balancing method in which the delay budget being allocated to a router depends on its load state was developed to improve the drawback, but it's too complex to apply to the RSVP. This paper proposes an intra-path load balancing method not only applicable to the RSVP but also more effective in improving the drawback. The proposed method first partitions the end-to-end delay bound of a flow to routers by the RSVP and then let them adjust their budgets according to both the bottleneck state of the path and their links' bandwidth availabilities. The results of the simulation applying the proposed method to an evaluation network showed that the proposed method may provide the gain of 4 ${\sim}$ 17 % compared to that in the legacy one in terms of the number of maximally admittable flows.

  • PDF

Fuzzy Based Selection Technique for Character Action in Came Balancing (Game Balancing에서 Fuzzy를 이용한 캐릭터 액션 선택)

  • Hyun, Hye-Jung;Kim, Tae-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.1
    • /
    • pp.81-88
    • /
    • 2008
  • In the game balancing. it is so difficult to choose suitable arms among various actions, or arms and to accurately calculate to which level we adjust the balance. The fuzzy method can be properly used in a particular environment which cannot be correctly processed in mathematics or in lessening the time-consuming problems during the accurate number crunching. Because a variety of actions, relations with opponents. previous battle experiences etc. are not easy to be reflected in every occasion, the fuzzy method could be useful in these cases. When the balancing is needed. the data which have been played to that Point are processed by the fuzzy function and calculated to adapt intensity to each action. The ability of characters is regulated in this process. To demonstrate the efficiency of this method. I would like to make clear the excellence of fuzzy method through the following five experiments; a case with invariable ability adjustment, a case adjusted by a randomly chosen action, a case with the strongest weapon selection. a case with the weakest weapon selection and a case with the fuzzy method application.

  • PDF

UAV-MEC Offloading and Migration Decision Algorithm for Load Balancing in Vehicular Edge Computing Network (차량 엣지 컴퓨팅 네트워크에서 로드 밸런싱을 위한 UAV-MEC 오프로딩 및 마이그레이션 결정 알고리즘)

  • A Young, Shin;Yujin, Lim
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.12
    • /
    • pp.437-444
    • /
    • 2022
  • Recently, research on mobile edge services has been conducted to handle computationally intensive and latency-sensitive tasks occurring in wireless networks. However, MEC, which is fixed on the ground, cannot flexibly cope with situations where task processing requests increase sharply, such as commuting time. To solve this problem, a technology that provides edge services using UAVs (Unmanned Aerial Vehicles) has emerged. Unlike ground MEC servers, UAVs have limited battery capacity, so it is necessary to optimize energy efficiency through load balancing between UAV MEC servers. Therefore, in this paper, we propose a load balancing technique with consideration of the energy state of UAVs and the mobility of vehicles. The proposed technique is composed of task offloading scheme using genetic algorithm and task migration scheme using Q-learning. To evaluate the performance of the proposed technique, experiments were conducted with varying mobility speed and number of vehicles, and performance was analyzed in terms of load variance, energy consumption, communication overhead, and delay constraint satisfaction rate.

Grid-based Biological Data Mining using Dynamic Load Balancing (동적 로드 밸런싱을 이용한 그리드 기반의 생물학 데이터 마이닝)

  • Ma, Yong-Beom;Kim, Tae-Young;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.2
    • /
    • pp.81-89
    • /
    • 2010
  • Biological data mining has been noticed as an issue as the volume of biological data is increasing extremely. Grid technology can share and utilize computing data and resources. In this paper, we propose a hybrid system that combines biological data mining with grid technology. Especially, we propose a decision range adjustment algorithm for processing efficiency of biological data mining. We obtain a reliable data mining recognition rate automatically and rapidly through this algorithm. And communication loads and resource allocation are key issues in grid environment because the resources are geographically distributed and interacted with themselves. Therefore, we propose a dynamic load balancing algorithm and apply it to the grid-based biological data mining method. For performance evaluation, we measure average processing time, average communication time, and average resource utilization. Experimental results show that this method provides many advantages in aspects of processing time and cost.

A Dynamical Load Balancing Method for Data Streaming and User Request in WebRTC Environment (WebRTC 환경에 데이터 스트리밍 및 사용자 요청에 따른 동적로드 밸런싱 방법)

  • Ma, Linh Van;Park, Sanghyun;Jang, Jong-hyun;Park, Jaehyung;Kim, Jinsul
    • Journal of Digital Contents Society
    • /
    • v.17 no.6
    • /
    • pp.581-592
    • /
    • 2016
  • WebRTC has quickly grown to be the world's advanced real-time communication in several platforms such as web and mobile. In spite of the advantage, the current technology in WebRTC does not handle a big-streaming efficiently between peers and a large amount request of users on the Signaling server. Therefore, in this paper, we put our work to handle the problem by delivering the flow of data with dynamical load balancing algorithms. We analyze the request source users and direct those streaming requests to a load balancing component. More specifically, the component determines an amount of the requested resource and available resource on the response server, then it delivers streaming data to the requesting user parallel or alternately. To show how the method works, we firstly demonstrate the load-balancing algorithm by using a network simulation tool OPNET, then, we seek to implement the method into an Ubuntu server. In addition, we compare the result of our work and the original implementation of WebRTC, it shows that the method performs efficiently and dynamically than the origin.