• 제목/요약/키워드: Link Flow

검색결과 372건 처리시간 0.026초

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium

  • Sung, Ki-Seok;Rakha, Hesham
    • Management Science and Financial Engineering
    • /
    • 제15권1호
    • /
    • pp.51-69
    • /
    • 2009
  • A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

Window Flow 제어기능을 가진 음성/데이타 패킷통신망의 성능해석 (Performance Analysis of an Integrated Voice/Data Packet Communication Network with Window Flow Control)

  • 손수현;은종관
    • 한국통신학회논문지
    • /
    • 제11권4호
    • /
    • pp.227-236
    • /
    • 1986
  • 본 논문에서는 window flow 제어기능을 가진 음성과 데이터가 집적된 패킷 통신망을 폐쇄 multichain queueing 시스템으로 modeling하고 평균치해석 방법으로 성능을 분석하였다. 서로 다른 priority 등급을 가진 여러가지 메시지를 전송하기 위한 패킷망 성능해석을 위해서 본 논문에서는 평균치해석과 effective capacity개념에 의한 성능해석 방법을 사용하였다. 구체적으로 각 노드에서의 평균 buffer 점유율, virtual channel의 link throughput의 이용도, 각 메세지의 평균지연시간등 망의 통계적 특성들을 이론으로 분석하고 simulation으로 검증하였다. 제안된 해석방법을 사용할 경우 link의 데이타의 상태를 10%이내의 정확도로 예측할 수 있고 음성 메시지와 외부 데이타의 상태는 5% 이내으 ㅣ정확도로 예측할 수 있다.

  • PDF

플로우 유지 시간을 기반으로 한 링크 상태 갱신 알고리즘 (Flow Holding Time based Link State Update Algorithm)

  • 조강홍
    • 한국컴퓨터정보학회논문지
    • /
    • 제14권5호
    • /
    • pp.133-139
    • /
    • 2009
  • 본 논문에서는 QoS 라우팅에서 링크 상태 갱신 메시지(LSU)의 오버 헤드를 감소시키면서 QoS 라우팅 알고리즘의 성능저하에는 거의 영향을 미치지 않는 플로우 유지 시간을 기반으로 한 링크상태 갱신 알고리즘을 제안하였다. 제안하는 알고리즘은 링크 상태 갱신 메시지의 개수를 감소시키기 위해 플로우의 유지 시간에 대한 통계적 정보를 사용하였다. 제안하는 알고리즘의 성능 평가를 위해 실제 네트워크와 유사한 MCI 네트워크상에서 라우팅 실패율과 링크 당 평균 링크 상태 갱신 메시지의 개수를 성능 평가 항목으로 하여 시뮬레이션을 수행하였다. 성능 평가를 위해 기존에 제시된 다른 링크 상태 갱신 알고리즘을 구현하여 제안하는 알고리즘의 우수성을 확인하였다.

MODELS AND SOLUTION METHODS FOR SHORTEST PATHS IN A NETWORK WITH TIME-DEPENDENT FLOW SPEEDS

  • Sung, Ki-Seok;Bell, Michael G-H
    • Management Science and Financial Engineering
    • /
    • 제4권2호
    • /
    • pp.1-13
    • /
    • 1998
  • The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

  • PDF

77K에서 트랜지스터 특성을 나타내는 링크의 제작 (Fabrication of the weak link with the the Transistor Characteristics in 77 K)

  • 강형곤;임성훈;고석철;주철원;한병성
    • 한국전기전자재료학회:학술대회논문집
    • /
    • 한국전기전자재료학회 2001년도 하계학술대회 논문집
    • /
    • pp.921-926
    • /
    • 2001
  • The link for the Superconducting Flux Flow Transistor (SFFT) which is based on the flux flow has been fabricated by the ICP etching methods. The channel width and the thickness of the SFFT were a 3 ${\mu}$m and about 300 nm, respectively. The superconducting characteristic of the link was measured by the x-ray diffraction and the E.D.S.. The SFFT etched by ICP showed an I-V characteristic like the three terminal transistor.

  • PDF

지하공간 침수해석모형과 연계한 도시침수해석 통합모형 (Integration Model for Urban Flood Inundation Linked with Underground Space Flood Analysis Model)

  • 이창희;한건연
    • 한국수자원학회논문집
    • /
    • 제40권4호
    • /
    • pp.313-324
    • /
    • 2007
  • 비정형격자 기반의 수치해석모형을 이용하여 지하공간침수해석모형을 개발하였다. 본 모형은 지하공간의 흐름 특성을 link-node 시스템에 의해 해석하고, 계단 및 벽구조물 등의 지하공간 구조물 배치 영향을 고려한 침수해석을 수행할 수 있다. 흐름은 두가지로 구분하며, 하나는 두 개의 인접한 격자가 지하공간에서의 지하철 노선에 해당되어 수로형 흐름을 나타내는 경우이고, 다른 하나는 지하공간에서의 지하철 노선 이외의 지점 및 지하상가 등으로 물이 확산되는 위어형 흐름인 경우이다. ArcGIS 시스템의 Visual Basic Application을 이용하여 Dual-Drainage 침수해석 모형과 지하공간침수해석 모형이 통합하였다. 개발된 통합모형은 홍수관계기관이 침수 발생이 예상되는 지점에서 홍수피해 방지를 위해 배수시스템의 용량에 대한 재설계 흑은 확장 등과 같은 대책을 수립하는데 도움을 줄 수 있고, 침수위험지도작성 및 홍수경감대책을 수립하는데 이용될 수 있다.

BTMSM/O2 유량변화에 따른 SiOCH 박막 결합모드의 2차원 상관관계 특성 (Properties of SiOCH Thin Film Bonding Mode by BTMSM/O2 Flow Rates)

  • 김종욱;황창수;김홍배
    • 한국전기전자재료학회논문지
    • /
    • 제21권4호
    • /
    • pp.354-361
    • /
    • 2008
  • The dielectric characteristics of low-k interlayer dielectric materials was fabricated by plasma enhanced chemical vapor deposition (PECVD). BTMSM precursor was evaporated and introduced with the flow rates from 16 sccm to 25 sccm by 1sccm step in the constant flow rate of 60 sccm $O_2$ in process chamber. Manufactured samples are analyzed components by measuring FT/IR absorption lines. Decomposition each Microscopic structures through two-dimensional correlation analysis about mechanisms for the formation of SiOCH in $SiOCH_3$, Si-O-Si and Si-$CH_3$ bonding group and analyzed correlation between the micro-structure of each group. It is a tendency that seems to be growing of Si-O-Ci(C) bonding group and narrowing of Si-O-$CH_3$ bonding group relative to the increasing flow-rate BTMSM. The order of changing sensitivity about changes of flow-rate in Si-O-Si(C) bonding group is cross link mode$(1050cm^{-1})$ $\rightarrow$ open link mode$(1100cm^{-1})\rightarrow$ cage link mode $(1140cm^{-1})$.

An Improved Method for Evaluating Network-Reliability with Variable Link-Capacities

  • Lee, Chong-Hyung;Lee, Seung-Min
    • Communications for Statistical Applications and Methods
    • /
    • 제13권3호
    • /
    • pp.577-585
    • /
    • 2006
  • This paper presents a method for reliability evaluation of a telecommunication network with variable link-capacities when the simple paths of the network are known. The LP-EM, suggested by Lee and Park (2001), identifies a composite path as a subnetwork and adds only a minimal set of links at each step which gives maximal increase on the maximum capacity flow of the subnetwork. Thereby the LP-EM reduces the possible occurrence of redundant composite paths significantly over other existing methods. Based on the LP-EM, our method further reduces the possible redundancy by identifying such simple paths that could give no increase of maximum capacity flow on the current subnetwork and excluding those simple paths from consideration in the process of constructing composite paths.

고속 라우터를 위한 Drop-tail방식의 공정한 대역할당 알고리즘 (A Fair Drop-tail Bandwidth Allocation Algorithm for High-speed Routers)

  • 이원일;윤종호
    • 한국통신학회논문지
    • /
    • 제25권6A호
    • /
    • pp.910-917
    • /
    • 2000
  • Because the random early detection(RED) algorithm deals all flows with the same best-effort traffic characteristic, it can not correctly control the output link bandwidth for the flows with different traffic characteristics. To remedy this problem, several per-flow algorithms have been proposed. In this paper, we propose a new per-flow type Fair Droptail algorithm which can fairly allocate bandwidth among flows over a shared output link. By evenly allocating buffers per flow, the Fair Droptail can restrict a flow not to use more bandwidth than others. In addition, it can be simply implemented even if it employs the per-flow state mechanism, because the Fair Droptail only keeps each information of flow in active state.

  • PDF

FD FAN에서 기어식 베인 댐퍼의 성능개선에 관한 연구 - 생산 및 구조 융합형 기술 - (A Study on Performance Improvement of Gear Type Vane Damper in FD Fan - Productivity Increases & Construction Improvement -)

  • 장성철;한상호;김진우
    • 한국생산제조학회지
    • /
    • 제19권1호
    • /
    • pp.134-139
    • /
    • 2010
  • In this study, we developed the gear type vane damper replacing the link type through gear design using Finite Element Analysis(FEA). FEA about the pinion and the vane shaft in the boss of gear type damper for quality improvement was accomplished. We analyzed fluid flow according to angular displacement. Catched the problem of the torque and backlash bring to the pinion as structure improvement of the forced draft fan(FD FAN). Finally, we compared the gear driving result with simulation. It is the objective of the present study to identify a nonlinear flow rate control of gear type vane damper and to suggest a damper shape with a linear flow rate control. This study is related to the development of gear type vane damper change link type in forced draft fan.