• 제목/요약/키워드: optimal network model

검색결과 1,020건 처리시간 0.024초

큐잉 네트워크 모델을 적용한 저장용량 분석 시뮬레이션 (Simulation of Storage Capacity Analysis with Queuing Network Models)

  • 김용수
    • 한국컴퓨터정보학회논문지
    • /
    • 제10권4호
    • /
    • pp.221-228
    • /
    • 2005
  • 데이터 저장장치는 서버의 내부나 근처에 있는 것으로 인식되어 왔으나 네트워크 기술의 발달로 저장장치 시스템은 주 전산기와 원거리에 떨어져 존재할 수 있게 되었다. 인터넷 시대에 데이터 량의 폭발적인 증가는 데이터를 저장하는 시스템과 이를 전송하는 시스템의 균형 있는 발전을 요구하고 있으며 SAN(Storage Area Network)이나 NAS(Network Attached Storage)은 이러한 요구를 반영하고 있다. 저장장치로부터 최적의 성능을 도출하기 위해서 복잡한 저장 네트워크의 용량과 한계를 파악하는 것이 중요하다. 파악된 데이터는 성능 조율의 기초가 되고 저장장치의 구매 시점을 결정하는데 사용될 수도 있다. 본 논문에서는 저장 네트워크 시스템의 큐잉 네트워크를 통한 분석적 모델을 제시한 다음, 이의 시뮬레이션하여 분석적 모델이 정당하다는 것을 입증한다.

  • PDF

그린투어리즘 및 공공서비스 기반의 지속가능한 농촌도로노선의 최적계획에 관한 연구 (A Study on Optimal Planning of Sustainable Rural Road Path based on Infrastructure for Green-Tourism and Public Service)

  • 김대식;정하우
    • 농촌계획
    • /
    • 제11권1호
    • /
    • pp.1-8
    • /
    • 2005
  • The purpose of this study is to develop a simulation model of rural road path for infrastructure of green-tourism and public service in rural areas. This study makes an objective function for moving cost minimization considering car travel time according to road characteristics, which can route the optimal shortest road paths between the center places and all rear villages, based on GIS coverages of road-village network for connecting between center places and rural villages as input data of the model. In order to verify the model algorithm, a homogeneous hexagonal network, assuming distribution of villages with same population density and equal distance between neighborhood villages on a level plane area, was tested to simulate the optimal paths between the selected center nodes and the other rear nodes, so that the test showed reasonable shortest paths and road intensity defined in this study. The model was also applied to the actual rural area, Ucheon-myun, which is located on Hoengsung-gun, Kangwon-do, with 72 rural villages, a center village (Uhang, 1st center place) in the area, a county conte. (Hoengsung-eup, 2nd center place), and a city (Wonju, 3rd center place), as upper settlement system. The three kinds of conte. place, Uhang, Hoengsung-eup, and Wonju, were considered as center places of three scenarios to simulate the optimal shortest paths between the centers and rural villages, respectively. The simulation results on the road-village network with road information about pavement and width of road show that several spans having high intensity of road are more important that the others, while some road spans have low intensity of road.

Traffic based Estimation of Optimal Number of Super-peers in Clustered P2P Environments

  • Kim, Ju-Gyun;Lee, Jun-Soo
    • 한국멀티미디어학회논문지
    • /
    • 제11권12호
    • /
    • pp.1706-1715
    • /
    • 2008
  • In a super-peer based P2P network, the network is clustered and each cluster is managed by a special peer, which is called a super-peer. A Super-peer has information of all the peers in its cluster. This type of clustered P2P model is known to have efficient information search and less traffic load than unclustered P2P model. In this paper, we compute the message traffic cost incurred by peers' query, join and update actions within a cluster as well as between the clusters. With these values, we estimate the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.

  • PDF

도시침수 저감을 위한 최적 우수관망 설계 모형 (An Optimal Sewer Layout Model to Reduce Urban Inundation)

  • 이정호;김중훈;전환돈
    • 한국수자원학회논문집
    • /
    • 제44권10호
    • /
    • pp.777-786
    • /
    • 2011
  • 우수관망의 최적 설계에 관한 기존의 연구 모형들은 설계강우에 대하여 관거의 연결, 관경 및 관 경사 등을 최소의 비용을 목적으로 최적화하여 왔다. 그런데 우수관망에서의 관거 내의 흐름은 관경, 관 경사와 특히 관망의 구성 형태에 따라서크게달라진다. 기존의최적우수관망설계모형들은설계유량을만족시키는것에국한되었으며, 설계기준을초과하는 강우에 따른 침수의 발생은 관망의 설계에 어떠한 고려도 되지 않았다. 본 연구에서는 우수관망을 구성함에 있어서 관거 내 흐름을 분산시키고 제어함을 목적으로 한다. 이것은 관망 구성에 따른 관거 내 흐름의 중첩효과를 제어함으로써 가능하며, 이러한 흐름의 제어를 통하여 설계기준을 초과하는 강우에 대해서 우수관망에서의 내수침수 발생은 저감될 수 있다. 본 연구에의 최적 우수관망 설계 모형(Optimal Sewer Layout Model, OSLM)은 내수침수 발생을 저감시키기 위해 흐름의 중첩효과를 고려하여 관거 내 흐름을 분산시키고 제어하기 위하여 개발되었다. 이 모형은 최적화를 위하여 유전자알고리즘(Genetic Algorithm, GA)를 이용하였으며, 수리학적 분석을 위하여 SWMM(Storm Water Management Model)을 연계하였다. 모형의 적용은 유역면적 44 ha의 서울시 하계 배수분구에 이루어졌으며, 현재의 우수관망 구성에 대하여 도출된 최적 우수관망에서는 지속기간 30분의 설계강우에 대하여 7.1%의 유출구 첨두유출량 감소와 20년 빈도의 지속기간 1시간 초과강우에 대하여 24.2%의 침수 발생량 저감 효과를 나타내었다.

Estimation for Autoregressive Models with GARCH(1,1) Error via Optimal Estimating Functions.

  • Kim, Sah-Myeong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제10권1호
    • /
    • pp.207-214
    • /
    • 1999
  • Optimal estimating functions for a class of autoregressive models with GARCH(1,1) error are discussed. The asymptotic properties of the estimator as the solution of the optimal estimating equation are investigated for the models. We have also some simulation results which suggest that the proposed optimal estimators have smaller sample variances than those of the Conditional least-squares estimators under the heavy-tailed error distributions.

  • PDF

신경망 모형을 이용한 달천의 수질예측 시스템 구축 (Construction of System for Water Quality Forecasting at Dalchun Using Neural Network Model)

  • 이원호;전계원;김진극;연인성
    • 상하수도학회지
    • /
    • 제21권3호
    • /
    • pp.305-314
    • /
    • 2007
  • Forecasting of water quality variation is not an easy process due to the complicated nature of various water quality factors and their interrelationships. The objective of this study is to test the applicability of neural network models to the forecasting of the water quality at Dalchun station in Han River. Input data is consist of monthly data of concentration of DO, BOD, COD, SS and river flow. And this study selected optimal neural network model through changing the number of hidden layer based on input layer(n) from n to 6n. After neural network theory is applied, the models go through training, calibration and verification. The result shows that the proposed model forecast water quality of high efficiency and developed web-based water quality forecasting system after extend model

초고속 망 구축을 위한 최적 망모형 분석 연구 (Analysis of the optimum model for constructing superhigh network)

  • 전찬욱;고남영
    • 한국정보통신학회논문지
    • /
    • 제6권8호
    • /
    • pp.1216-1222
    • /
    • 2002
  • 본 연구에서는 앞으로 전개될 광대역 멀티미디어 서비스위주의 광대역 초고속 정보통신망 구축에 가장 핵심적인 사항인 광가입자망 구성에 있어서 가입자망을 경제적이며, 지역특성에 맞는 최적광가입자망을 구축하기 위한 망의 구성방안을 제시하고자 한다 최적의 초고속 가입자망 구축을 위해 격자모형에서 성형과 링형을 노드당 비용측면과, 전송거리에 따라 다양한 환경에서 측정, 비교·분석하여 최적의 초고속망 구축방안을 제시하였다.

Novel Pre-pushing & Downloading Model in Mobile Peer-assisted Streaming Network

  • Lin, Fuhong;Zhou, Xianewi;Chen, Changjia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권12호
    • /
    • pp.3135-3148
    • /
    • 2013
  • The popularization of streaming networks and mobile devices brings a new kind of network called mobile peer-assisted streaming network. In this network, service provider not only offers downloading services, but also pre-pushes resources to users for caching. Users can download their demanded resources while working as servers for uploading the cached data. Also the mobile characteristic makes high package losing probability in this network. So we study how the service provider pre-pushes or the user downloads resources efficiently and effectively while considering the package losing in this paper. We build utility models for service provider and user, and solve the models using Bellman's theory to achieve Nash Equilibrium which shows the service provider's optimal pre-pushing speed and user's optimal downloading speed. The numerical simulation demonstrates the efficiency and effectiveness of our proposed pre-pushing and downloading scheme by comparing to the traditional scheme.

양방향 흐름을 고려한 물류시스템의 최적화 모델에 관한 연구 (A Study on a Stochastic Material Flow Network with Bidirectional and Uncertain Flows)

  • 황흥석
    • 산업공학
    • /
    • 제10권3호
    • /
    • pp.179-187
    • /
    • 1997
  • The efficiency of material flow systems in terms of optimal network flow and minimum cost flow has always been an important design and operational goal in material handling and distribution system. In this research, an attempt was made to develop a new algorithm and the model to solve a stochastic material flow network with bidirectional and uncertain flows. A stochastic material flow network with bidirectional flows can be considered from a finite set with unknown demand probabilities of each node. This problem can be formulated as a special case of a two-stage linear programming problem which can be converted into an equivalent linear program. To find the optimal solution of proposed stochastic material flow network, some terminologies and algorithms together with theories are developed based on the partitioning and subgradient techniques. A computer program applying the proposed method was developed and was applied to various problems.

  • PDF

Optimal synthesis and design of heat transfer enhancement on heat exchanger networks and its application

  • Huang, Zhao-qing
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
    • /
    • pp.376-379
    • /
    • 1996
  • Synthesis for qualitative analysis in connection with quantitative analysis from the pinch design method, EVOP and Operations Research is proposed for the optimal synthesis of heat exchanger networks, that is through of the transportation model of the linear programming for synthesizing chemical processing systems, to determine the location of pinch points, the stream matches and the corresponding heat flowrate exchanged at each match. In the second place, according to the optimization, the optimal design of heat transfer enhancement is carried on a fixed optimum heat exchanger network structure, in which this design determines optimal operational parameters and the chosen type of heat exchangers as well. Finally, the method of this paper is applied to the study of the optimal synthetic design of heat exchanger network of constant-decompress distillation plants.

  • PDF