• Journal of Electrical Engineering and Technology
• /
• 제8권6호
• /
• pp.1251-1260
• /
• 2013

This paper presents the optimal scheduling of hourly consumption in a residential community (community, neighborhood, etc.) based on real-time electricity price. The residential community encompasses individual residential loads, communal (shared) loads, and local generation. Community-aggregated loads, which include residential and communal loads, are modeled as fixed, adjustable, shiftable, and storage loads. The objective of the optimal load scheduling problem is to minimize the community-aggregated electricity payment considering the convenience of individual residents and hourly community load characteristics. Limitations are included on the hourly utility load (defined as community-aggregated load minus the local generation) that is imported from the utility grid. Lagrangian relaxation (LR) is applied to decouple the utility constraint and provide tractable subproblems. The decomposed subproblems are formulated as mixed-integer programming (MIP) problems. The proposed model would be used by community master controllers to optimize the utility load schedule and minimize the community-aggregated electricity payment. Illustrative optimal load scheduling examples of a single resident as well as an aggregated community including 200 residents are presented to show the efficiency of the proposed method based on real-time electricity price.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.401-403
• /
• 2012

In this paper, we introduce a multipath congestion control algorithm for audio/video streaming, called MPSQRT. MPSQRT is derived from single-path Square-Root TCP (SQRT TCP) designed for multimedia streaming, where a lower variation of sending rate is important. Based on the fluid model of SQRT for single-path, we extend it towards spreading concurrently packets across multiple paths ensuring load-balancing and fairness to SQRT at shared bottleneck. Through simulations, we evaluate the proposed protocol under various network conditions.

• 한국컴퓨터정보학회논문지
• /
• 제10권4호
• /
• pp.249-257
• /
• 2005

CSMA/CA 프로토콜에 기반을 둔 DCF를 사용하여 공유 전송 매체 접근을 제어하는 IEEE 802.11 프로토콜은 현재 가장 많이 사용되고 있는 무선 랜 표준이다. 본 논문에서는 이러한 802.11 무선 랜에서 유한 트래픽 조건과 최종 백오프 단계에서 전송에 실패한 패킷에 대한 손실을 가정하여 스테이션의 상태에 대한 마코프 모델을 제안하고 임의의 시점에서의 전송 확률을 구하는 알고리즘과 채널 전송 처리 방법을 유도한다. 또한 시뮬레이션을 통하여 모델을 검증하고, 패킷 손실이 없는 경우와 성능을 비교한다.

• 대한치과기공학회지
• /
• 제29권1호
• /
• pp.93-101
• /
• 2007

The purpose of this study is to evaluate the effect of three different oblique mechanical loading to occlusal surfaces of posterior implant partial dentures on the stress distributions in surrounding bone, using 3-dimensional finite element method. A 3-dimensional finite element model of a posterior implant partial dentures composed of three unit implants, simplified 3 gold alloy crown and supporting bone was developed according to the design of AVANA self tapping implant for this study. Three kinds of surface distributed oblique loads(300 N) are applied to following occlusal surfaces in the three crowns; 1) All occlusal surfaces in the three crown(load of 300 N was shared to three crown), 2) Occlusal surface of centered crown (load of 300 N was applied to a centered crown), 3) Occlusal surface of proximal crown(load of 300 N was applied to a distal proximal crown). In the results, 141 MPa of maximum von Mises stress was calculated at third loading condition and 98 MPa of minimum von Mises stress was calculated at first loading condition. From the results, location and type of occlusive loading conditions are important for the safety of supporting bone.

• 한국컴퓨터정보학회논문지
• /
• 제12권3호
• /
• pp.51-58
• /
• 2007

확장성에서 장점을 가지고 있는 비공유 병렬 프로세서 구조는 병렬 데이터베이스 시스템에서 많이 적용되고 있는 구조이다. 그러나 비공유 병렬 프로세서 구조는 데이터의 분포가 전체 프로세서에게 균일하게 분포되어 있지 않을 경우에는 일부 프로세서에게 부하가 집중되고 이로 인한 성능의 감소가 불가피하게 되는 단점이 있다. 특히 부하의 불균형 정도가 심한 경우에 조인 연산을 수행할 때 이런 성능 감소의 단점은 두드러진다. 본 논문은 비공유 병렬 프로세서 구조에서 부하의 불균형 정도가 심한 경우에도, 조인 연산을 실시하기 전에 부하 불균형을 고려함으로써 성능 감소를 최소화하고, 메모리의 대용량화를 이용하여 성능을 높인 조인 알고리즘을 제시한다. 또한 알고리즘의 성능 분석을 위한 분석 모델을 제시하며, 분석 모델을 통하여 데이터 불균형 문제를 해결하기 위한 다른 알고리즘과의 성능을 비교한다.

• Structural Engineering and Mechanics
• /
• 제45권6호
• /
• pp.759-777
• /
• 2013

In this paper, a topology optimization method based on the element independent nodal density (EIND) is developed for continuum solids with multiple load cases and multiple constraints. The optimization problem is formulated ad minimizing the volume subject to displacement constraints. Nodal densities of the finite element mesh are used a the design variable. The nodal densities are interpolated into any point in the design domain by the Shepard interpolation scheme and the Heaviside function. Without using additional constraints (such ad the filtering technique), mesh-independent, checkerboard-free, distinct optimal topology can be obtained. Adopting the rational approximation for material properties (RAMP), the topology optimization procedure is implemented using a solid isotropic material with penalization (SIMP) method and a dual programming optimization algorithm. The computational efficiency is greatly improved by multithread parallel computing with OpenMP to run parallel programs for the shared-memory model of parallel computation. Finally, several examples are presented to demonstrate the effectiveness of the developed techniques.

• 디지털산업정보학회논문지
• /
• 제10권3호
• /
• pp.35-40
• /
• 2014

Many researches have been conducted to achieve improvement in distributed system that connects multiple computer systems via communication lines. Among others, the load balancing and file migration are considered to have significant impact on the performance of distributed system. The dynamic file migration algorithm common in distributed processing system involved complex calculations of decision function necessary for file migration and required migration of control messages for the performance of decision function. However, the performance of this decision function puts significant computational strain on computer. As one single network is shared by all computers, more computers connected to network means migration of more control messages from file migration, causing the network to trigger bottleneck in distributed processing system. Therefore, it has become imperative to carry out the research that aims to reduce the number of control messages that will be migrated. In this study, the learning automata was used for file migration which would requires only the file reference-related information to determine whether file migration has been made or determine the time and site of file migration, depending on the file conditions, thus reflecting the status of current system well and eliminating the message transfer and additional calculation overhead for file migration. Moreover, mathematical model for file migration was described in order to verify the proposed model. The results from mathematical model and simulation model suggest that the proposed model is well-suited to the distributed system.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.224-226
• /
• 2005

Grid computing enables the fundamental computing shift from a localized resource computing model to a fully-distributed virtual organization with shared resources. In the grid computing environment, grid users usually get access rights by mapping their credential to local account. The mapped total account is temporally belongs to grid user. So, data on the secondary storage, which is produced by grid operation, can increase the load of system administration or can issue grid user's privacy. In this paper, we design a data management system for grid user to cover these problems. This system implements template account mechanism and manages local grid data.

• 인터넷정보학회논문지
• /
• 제7권1호
• /
• pp.151-164
• /
• 2006

CSMA/CA 프로토콜에 기반을 둔 DCF를 사용하여 공유 전송 매체 접근을 제어하는 IEEE 802.11 프로토콜은 현재 가장 많이 사용되고 있는 무선랜 표준이다. 이 논문에서는 802.11 기반 무선랜에서 서로 다른 특성을 가지는 두 가지 유형의 데이터에 대하여 백오프 윈도우 사이즈와 재전송 메카니즘을 달리하는 서비스 차별화를 제안하고 유한 트래픽 조건 아래서 스테이션의 상태에 대한 마코프 모형을 제시한 후, 전송 확률을 구하는 알고리즘과 채널 전송처리율을 유도한다. 또한 다양한 시스템 설정 하에서 시뮬레이션을 통한 모형 검증과 성능 평가를 실시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4023-4043
• /
• 2016

Network virtualization has been regarded as a core attribute of the Future Internet. In a network virtualization environment (NVE), multiple heterogeneous virtual networks can coexist on a shared substrate network. Thus, a substrate network failure may affect multiple virtual networks. In this case, it is increasingly critical to provide survivability for the virtual networks against the substrate network failures. Previous research focused on mechanisms that ensure the resilience of the virtual network. However, the resource efficiency is still important to make the mapping scheme practical. In this paper, we study the survivable virtual network embedding mechanisms against substrate link and node failure from the perspective of improving the resource efficiency. For substrate link survivability, we propose a load-balancing and re-configuration strategy to improve the acceptance ratio and bandwidth utilization ratio. For substrate node survivability, we develop a minimum cost heuristic based on a divided network model and a backup resource cost model, which can both satisfy the location constraints of virtual node and increase the sharing degree of the backup resources. Simulations are conducted to evaluate the performance of the solutions. The proposed load balancing and re-configuration strategy for substrate link survivability outperforms other approaches in terms of acceptance ratio and bandwidth utilization ratio. And the proposed minimum cost heuristic for substrate node survivability gets a good performance in term of acceptance ratio.