• Title/Summary/Keyword: 최적비용

Search Result 2,058, Processing Time 0.032 seconds

Optimal ELAN Configuration for Scaling Broadcast Traffic in a LAN Emulation Network (LANE망에서의 scalable한 broadcast traffic 관리를 위한 최적 ELAN 구성방법)

  • 손종희;김도훈;차동완
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.691-694
    • /
    • 2000
  • 기존 LAN 환경에서 인터넷을 이용한 멀티미디어 실시간 전송과 같은 QoS 보장형 서비스에 대한 요구가 증대되면서, 고속의 ATM 기술을 LAN에 적용하는 기술들이 등장하였다. LANE(LAN Emulation)은 그러한 기술 대안들 중에서 campus network와 enterprise network에 많이 보급되고 있는 기술이다. 그러나 이러한 급격한 LANE 도입에 비하여 이의 효과적인 운용에 대한 연구는 많지 않은 실정이다. 본 논문에서는 LANE을 도입한 campus network의 최적 운영방안에 대하여 논한다. Broadcast 데이터 트래픽 관리에서 발생하는 규모성(Scalability) 문제로 인하여 전체 LANE망은 여러 개의 ELAN으로 나뉘어 관리된다. 이 때 하나의 ELAN은 마치 단위 LAN로써, Broadcast 데이터의 전송범위를 제한한다. 즉, 서로 다른 ELAN에 속하는 노드간에는 Broadcast 방식으로 데이터를 전송할 수 없게 된다. 그런데, IPX 등을 사용하는 대화형 시뮬레이션 게임 등과 같은 응용프로그램에서는 Broadcast 방식이 이용되므로, 서로 다른 ELAN에 속하는 노드간의 데이터 전송은 불가능하게 되거나 별도의 복잡한 과정을 개입시켜야 하는 비용이 발생한다. 따라서 규모성 문제해결을 위한 ELAN 구성(configuration)에는 위와 같은 비용이 수반된다. 본 연구에서는 LANE망을 여러 개의 ELAN으로 분할하는 경우에 블로킹(blocking) 되는 Broadcast 트래픽 규모를 해당 ELAN 구성의 비용으로 간주한다. 이 경우에 규모성을 고려한 ELAN의 최적 구현방안(optimal configuration)은 ELAN 구성을 위한 기술적 제약하에서 블로킹되는 Broadcast 트래픽을 최소화시키는 문제로 요약된다. 이는 다시 그래프 분할문제(graph partition problem)의 변형된 형태로 모형화 될 수 있다. 본 논문에서는 이러한 사항들을 고려하여 제시된 수리적 모형을 대상으로, genetic algorithm을 이용하여 최적 ELAN 구성을 위한 여러 파라미터들의 효과를 살펴보고, 이러한 결과들이 LANE 운영과 관련하여 가지는 함축적인 의미를 고찰한다.

  • PDF

Study on The Optimal Software Release Time Methodology (소프트웨어 치적 배포시기 결정 방법에 대한 고찰)

  • 이재기;박종대;남상식;김창봉
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.2
    • /
    • pp.26-37
    • /
    • 2003
  • An optimal software release, which is related to the development cost, error detection and correction under the various operation systems, is a critical factor for managing project. This paper described optimal software release issues to predict the release time of large switching system with the system stability point of view and evaluated a timely supply of target system, proper utilization of resources under the software reliability valuation basis. Finally, Using initial failure data, based on the exponential reliability growth model methodology, optimal release time, and analysis of failure data during the system testing and managing methodologies were presented.

Optimal Operation Control for Energy Saving in Water Reuse Pumping System (에너지절감을 위한 물 재이용 펌프시스템의 최적운전 제어)

  • Boo, Chang-Jin;Kim, Ho-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.5
    • /
    • pp.2414-2419
    • /
    • 2012
  • This paper presents an optimal operation control method for energy saving in the water reuse pumping system. A predictive horizon switching strategy is proposed to implement an optimal operation control and a linear programming (LP) algorithm is used to solve optimal problems in each time step. Energy costs are calculated for electricity on both TOU in the light, heavy, and maximum load time period and peak charges. The optimal operation in water reuse pumping systems is determined to reduce the TOU and peak costs. The simulation results show a power energy saving for water reuse pumping systems and power stability improvement.

Development of A Turn Label Based Optimal Path Search Algorithm (Turn Label 기반 최적경로탐색 알고리즘 개발)

  • Meeyoung Lee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.23 no.2
    • /
    • pp.1-14
    • /
    • 2024
  • The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

Calculation of optimal design flood using cost-benefit analysis with uncertainty (불확실성이 고려된 비용-편익분석 기법을 도입한 최적설계홍수량 산정)

  • Kim, Sang Ug;Choi, Kwang Bae
    • Journal of Korea Water Resources Association
    • /
    • v.55 no.6
    • /
    • pp.405-419
    • /
    • 2022
  • Flood frequency analysis commonly used to design the hydraulic structures to minimize flood damage includes uncertainty. Therefore, the most appropriate design flood within a uncertainty should be selected in the final stage of a hydraulic structure, but related studies were rarely carried out. The total expected cost function introduced into the flood frequency analysis is a new approach for determining the optimal design flood. This procedure has been used as UNCODE (UNcertainty COmpliant DEsign), but the application has not yet been introduced in South Korea. This study introduced the mathematical procedure of UNCODE and calculated the optimal design flood using the annual maximum inflow of hydroelectric dams located in the Bukhan River system and results were compared with that of the existing flood frequency. The parameter uncertainty was considered in the total expected cost function using the Gumbel and the GEV distribution, and the Metropolis-Hastings algorithm was used to sample the parameters. In this study, cost function and damage function were assumed to be a first-order linear function. It was found that the medians of the optimal design flood for 4 Hydroelectric dams, 2 probability distributions, and 2 return periods were calculated to be somewhat larger than the design flood by the existing flood frequency analysis. In the future, it is needed to develop the practical approximated procedure to UNCODE.

Reliability-Based Optimum Design of High-Speed Railway Steel Bridges Considering Bridge/Rail Longitudinal Analysis and Bridge/Vehicle Dynamic Effect (교량/궤도 종방향 해석 및 교량/차량 동적영향을 고려한 고속철도 강교량의 신뢰성 최적설계)

  • Lee, Jong-Soon;Ihm, Yeong-Rok
    • Journal of the Korean Society for Railway
    • /
    • v.12 no.6
    • /
    • pp.974-982
    • /
    • 2009
  • To improve the effectiveness and economics the bridge design methodology considering the bridge/rail longitudinal analysis and bridge/vehicle dynamic effect suggested in this study. The reliability-based Life-Cycle Costs(LCC) effective optimum design is applied to a 2-main steel girder bridge, 5$\times$(1@50m) for comparison with conventional design, initial cost optimization and equivalent LCC optimization. As a result of the optimum design based on reliability, it may be stated that the design of High-Speed railway bridges considering the bridge/rail longitudinal analysis and bridge/vehicle dynamic effect are more efficient than typical existing bridges and LCC optimization without respect to bridge/rail longitudinal analysis and bridge/vehicle dynamic effect. The result of optimization design considering the interaction, design methodology suggested in this study, is higher than result of initial cost optimization design in initial cost, but that has the advantage than result of initial cost optimization design in expected LCC.

Decision of optimal incentives and total order quantity with consideration of return rate of remanufacturing product (재생산 제품의 회수율을 고려한 최적 인센티브 및 총 주문량 결정)

  • Lee, Yong-Hyun;Lee, Chul-Ung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.8
    • /
    • pp.165-176
    • /
    • 2011
  • In this paper, we develop the cost minimization model to select two incentives and total order quantity with consideration of remanufacture company's return incentive. Return rate is sensitive to the incentive that the manufacture company offers. Using a EOQ(Economic Order Quantity) model of a cost minimization, we show concavities of the model about two incentives and total order quantity respectively. According to the proposed algorithm using the concavities, we find out the optimized incentive prices and total order quantity. Through numerical study, we examine sensitive analysis of the incentive price and order quantity for each parameter when the return rate is sensitive to incentive. Company lessens incentive to reduce total price. However, this makes the total price increase due to a diminution of return quantity. We expect that domestic or overseas remanufacture businesses are able to decide optimal incentive and total order quantity by this research.

Comparison of Optimization Techniques in Cost Design of Stormwater Drainage Systems (우수관망 시스템 설계에 있어서의 최적화기법의 비교)

  • Kim, Myoung-Su;Lee, Chang-Yong;Kim, Tae-Jin;Lee, Jung-Ho;Kim, Joong-Hoon
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.6 no.2 s.21
    • /
    • pp.51-60
    • /
    • 2006
  • The objective of this research is to develop a least cost system design method for branched storm sewer systems while satisfying all the design constraints using heuristic techniques such as genetic algorithm and harmony search. Two sewer system models have been developed in this study. The SEWERGA and SEWERHS both determine the optimal discrete pipe installation depths as decision variables. Two models also determine the optimal diameter of sewer pipes using the discrete installation depths of the pipes while satisfying the discharge and velocity requirement constraints at each pipe. Two models are applied to the example that was originally solved by Mays and Yen (1975) using their dynamic programming(DP). The optimal costs obtained from SEWERGA and SEWERHS are about 4% lower than that of the DP approach.

Optimal Life Cycle design of Water Pipe System using Genetic Algorithm (상수관망 최적 생애주기 설계를 위한 유전알고리즘의 적용)

  • Lee, Seungyub;Yoo, Do Guen;Jung, Donghwi;Kim, Joong Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.6
    • /
    • pp.4216-4227
    • /
    • 2015
  • In this study, a model is developed based on Life Cycle Energy Analysis (LCEA) method with Genetic Algorithm (GA) to determine optimal diameter of Water Distribution System (WDS). For hydraulic analysis the EPANET2.0 program is linked with developed model, pipe-aging equation and pipe-breakage equation are built in to developed model to simulate pipe change through life cycle. The model is then applied to two sample WDSs for optimal energy design. After determining optimal diameter for each WDS, the total cost is calculated based on determined diameter and compared with well-known optimal diameter set of each WDS. Results show that optimal energy design of WDSs through the developed model can be an alternative option for optimal design of WDSs for reducing energy with lower in cost.

Allocation Algorithm for Distributed Database Systems (분산 데이터베이스에서 할당 알고리즘의 설계)

  • Lee, Soon-Mi
    • Annual Conference of KIPS
    • /
    • 2003.05c
    • /
    • pp.1647-1650
    • /
    • 2003
  • 분산 데이터베이스 시스템에서 데이터의 할당이란 릴레이션이 분할되어 생성된 프래그먼트들을 여러 사이트에 분산시키는 것을 의미한다. 최적의 데이터 할당이란 할당에 소요되는 비용을 최소화시키는 할당 해를 찾는 것이라고 할 수 있는데, 본 논문에서는 저장, 질의 처리 및 전송 비용을 고려한 데이터 할당 함수를 정의하였다. 본 논문에서 정의한 할당 함수에서는 전송비용을 갱신 전송 비용과 검색 전송 비용으로 나누어서 산출하도록 정의하였다.

  • PDF