• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권3호
• /
• pp.891-910
• /
• 2021

Previous QoS-aware service composition methods mainly focus on how to generate composite service with the optimal QoS efficiently for a single request. However, in the real application scenarios, there are multiple service requests and multiple service providers. It is more important to compose services with suboptimal QoS and maintain the load balance between services. To solve this problem, in this paper, we propose a service composition method, named as dynamically change and balancing composition method (DCBC). It assumes that the QoS of service is not static, and the services can adjust the value of QoS to gain more opportunities to be selected for composition. The method mainly includes two steps, which are the preprocessing step and the service selection step. In the preprocessing step, a backward global best QoS calculation is performed which regarding the static and dynamic QoS respectively; then guided by the global QoS, the feasible services can be selected efficiently in the service selection step. The experiments show that the DCBC method can not only improve the overall quality of composite services but also guarantee the fulfill ratio of requests and the load balance of services.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.651-669
• /
• 2013

In this paper, we study a novel routing algorithm based on load balancing for multi-channel wireless mesh networks. In order to increase the network capacity and reduce the interference of transmission streams and the communication delay, on the basis of weighted cumulative expected transmission time (WCETT) routing metric this paper proposes an improved routing metric based on load balancing and channel interference (LBI_WCETT), which considers the channel interference, channel diversity, link load and the latency brought by channel switching. Meanwhile, in order to utilize the multi-channel strategy efficiently in wireless mesh networks, a new channel allocation algorithm is proposed. This channel allocation algorithm utilizes the conflict graph model and considers the initial link load estimation and the potential interference of the link to assign a channel for each link in the wireless mesh network. It also utilizes the channel utilization percentage of the virtual link in its interference range as the channel selection standard. Simulation results show that the LBI_WCETT routing metric can help increase the network capacity effectively, reduce the average end to end delay, and improve the network performance.

• 한국정보처리학회논문지
• /
• 제2권5호
• /
• pp.768-776
• /
• 1995

스타형의 분산 컴퓨터 시스템에서는 중앙노드의 처리능력이 주변노드들의 처리 능 력에 비해 클 수가 있고 또 각 노드의 작업도착률은 서로 다를 수 있다. 따라서 작업 전송을 위한 송신자 기준과 수신자 기준의 선택에 따라 부하분산의 성능은 크게 달라 진다. 하지만 이종의 분산 컴퓨터 시스템에서 최적 송신자 및 수신자 기준의 설정은 매우 어렵다. 본 논문에서는 동적부하분산을 위하여 고정 임계값 대신에 노드의 평균 응답시간이나 작업의 기대응답시간과 같은 동적 기준을 사용하는 효율적인 위치 결정 부하 분산 정책을 제안한다.

• ETRI Journal
• /
• 제41권2호
• /
• pp.197-206
• /
• 2019

Software-defined networking (SDN) is a modern approach for current computer and data networks. The increase in the number of business websites has resulted in an exponential growth in web traffic. To cope with the increased demands, multiple web servers with a front-end load balancer are widely used by organizations and businesses as a viable solution to improve the performance. In this paper, we propose a load-balancing mechanism for SDN. Our approach allocates web requests to each server according to its response time and the traffic volume of the corresponding switch port. The centralized SDN controller periodically collects this information to maintain an up-to-date view of the load distribution among the servers, and incoming user requests are redirected to the most appropriate server. The simulation results confirm the superiority of our approach compared to several other techniques. Compared to LBBSRT, round robin, and random selection methods, our mechanism improves the average response time by 19.58%, 33.94%, and 57.41%, respectively. Furthermore, the average improvement of throughput in comparison with these algorithms is 16.52%, 29.72%, and 58.27%, respectively.

• Industrial Engineering and Management Systems
• /
• 제3권2호
• /
• pp.116-122
• /
• 2004

This paper presents a process plan selection model with multiple objectives. The process plans for all parts should be selected under multiple objective environment as follows: (1) minimizing the sum of machine processing and material handling time of all the parts considering realistic shop factors such as production volume, processing time, machine capacity, and capacity of transfer device. (2) balancing the load between machines. A multiple objective mathematical model is proposed and an evolutionary algorithm with the adaptive recombination strategy is developed to solve the model. To illustrate the efficiency of proposed approach, numerical examples are presented. The proposed approach is found to be effective in offering a set of satisfactory Pareto solutions within a satisfactory CPU time in a multiple objective environment.

• 한국작물학회:학술대회논문집
• /
• 한국작물학회 2022년도 추계학술대회
• /
• pp.219-219
• /
• 2022

Granule-bound starch synthase I (GBSSI), encoded by the waxy gene, is responsible for the accumulation of amylose during the development of starch granules in rice endosperm. Despite many findings on waxy alleles, the genetic diversity and evolutionary studies are still not fully explored regarding their functional effects. Comprehensive evolutionary analyses were performed to investigate the genetic variations and relatedness of the GBSSI gene in 374 rice accessions composed of 54 wild accessions and 320 bred cultivars (temperate japonica, tropical japonica, indica, aus, aromatic, and admixture). GBSS1 coding regions were analyzed from a VCF file retrieved from whole-genome resequencing data, and eight haplotypes were identified in the GBSSI coding region of 320 bred cultivars. The genetic diversity indices revealed the most negative Tajima's D value in the tropical-japonica, followed by the aus and temperate-japonica, while Tajima's D values in indica were positive, indicating balancing selection. Diversity reduction was noticed in temperate japonica (0.0003) compared to the highest one (wild, 0.0044), illustrating their higher genetic differentiation by F_ST-value (0.604). The most positive Tajima's D value was observed in indica (0.5224), indicating the GBSSI gene domestication signature under balancing selection. In contrast, the lowest and negative Tajima's D value was found in tropical japonica (-0.5291), which might have experienced a positive selection and purified due to the excess of rare alleles. Overall, our study offers insights into haplotype diversity and evolutionary fingerprints of GBSSI. It ako provides genomic information to increase the starch content of cooked rice.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2002년도 춘계학술대회
• /
• pp.91-97
• /
• 2002

In this thesis presents line balancing problems of two-sided and mixed model assembly line widely used in practical fields using genetic algorithm for reducing throughput time, cost of tools and fixtures and improving flexibility of assembly lines. Two-sided and mixed model assembly line is a special type of production line where variety of product similar in product characteristics are assembled in both sides. This thesis proposes the genetic algorithm adequate to each step in tow-sided and mixed model assembly line with suitable presentation, individual, evaluation function, selection and genetic parameter. To confirm proposed genetic algorithm, we apply to increase the number of tasks in case study. And for evaluation the performance of proposed genetic algorithm, we compare to existing algorithm of one-sided and mixed model assembly line. The results show that the algorithm is outstanding in the problems with a larger number of stations or larger number of tasks.

• 대한안전경영과학회지
• /
• 제4권2호
• /
• pp.83-101
• /
• 2002

In this thesis presents line balancing problems of two-sided and mixed model assembly line widely used in practical fields using genetic algorithm for reducing throughput time, cost of tools and fixtures and improving flexibility of assembly lines. Two-sided and mixed model assembly line is a special type of production line where variety of product similar in product characteristics are assembled in both sides. This thesis proposes the genetic algorithm adequate to each step in tow-sided and mixed model assembly line with suitable presentation, individual, evaluation function, selection and genetic parameter. To confirm proposed genetic algorithm, we apply to increase the number of tasks in case study. And for evaluation the performance of proposed genetic algorithm, we compare to existing algorithm of one-sided and mixed model assembly line. The results show that the algorithm is outstanding in the problems with a larger number of stations or larger number of tasks.

• 인터넷정보학회논문지
• /
• 제10권2호
• /
• pp.65-73
• /
• 2009

IEEE802.11 무선랜은 공항과 같은 공공의 장소에서 널리 사용되고 있으며 캠퍼스나 회사의 네트워킹 영역을 증대하고 있고, 최근 메쉬 네트워크나 다른 3세대 이동 통신 네트워크과의 통합 형태의 네트워크를 구성하기 위한 중요 기술로 주목 받고 있다. 무선랜 환경에서의 액세스 포인트(AP) 간 로드 밸런싱 문제는 효율적인 자원 관리나 트래픽의 QoS 지원을 위해 중요한 문제이지만, 기존 연구들에서는 노드가 네트워크에 진입하는 시점이나 로밍 시점에 로드 밸런싱을 위한 AP 선택에 초점을 맞추고 있다. 본 논문에서는 AP의 가용성 모니터링을 통해 진정한 의미의 로드 밸런싱을 위한 AP-개시 플로우 리다이렉션 메커니즘을 제안한다. AP 자신의 가용자원이 거의 사용하게 되면, 즉 특정 임계치 이상 사용하게 되면, 자신이 서비스하고 있는 노드가 로밍 가능한 이웃 AP들에게 그들의 가용자원에 관하여 쿼리를 하여 entropy나 chi-square와 같은 통계적인 방법을 이용하여 AP 간 트래픽 분포도에 대해 계산하고, 리다이렉트할 플로우들을 결정하여 선택된 노드들을 트리거하여 플로우 리다이렉션을 수행한다. 시뮬레이션 결과, 제안된 플로우 리다이렉션 메커니즘이 다양한 측면에서의 성능향상을 입증할 수 있었다.

• 한국정보통신학회논문지
• /
• 제24권4호
• /
• pp.515-521
• /
• 2020

최근 데이터 트래픽은 다양한 산업 발전으로 인해 폭발적으로 증가하여 기존 네트워크의 효율성 감소, 과부화 등의 문제를 야기한다. 이러한 문제를 해결하기 위해 가상화 기법을 이용하며 다양한 서비스에 최적화된 네트워크를 제공하는 네트워크 슬라이싱이 주목받고 있다. 본 논문에서는 credit value를 이용하여 자원할당을 하는 방안에 대해 제안한다. 기존 클러스터링 기법을 이용한 방안에서는 다양한 서비스에 대한 할당 요청이 들어올 때마다 클러스터 선정하기 위한 연산이 수행된다. 반면에 제안 방안에서는 클러스터의 잔여 사용량과 balancing을 이용하여 credit value를 설정하여 클러스터 선정에 필요한 연산을 수행하지 않고 slice request를 처리할 수 있도록 하였다. 제안 방안을 검증하기 위해 processing time과 balancing simulation을 진행하였다. 그 결과, 제안된 방안의 processing time 및 오차율은 clustering 기법만 사용한 방안보다 각각 약 13.72%, 약 7.96% 감소하였다.