• Journal of Information Processing Systems
• /
• 제17권3호
• /
• pp.518-536
• /
• 2021

Studies and applications related to unidirectional flow are gaining attention from researchers across disciplines in the recent years. Flow can be viewed as a concept, where the material, fluid, people, air, and electricity are moving from one node to another over a transportation network, water network, or through electricity distribution systems. Unlike other networks such as computer networks, most of the flow networks are visible and have strong material existence and are responsible for the flow of materials with definite shape and volume. The flow of electricity is also unidirectional, and also share similar features as of flow of materials such as liquids and air. Generally, in a flow network, every node in the network participates and contributes to the efficiency of the network. In this survey paper, we would like to evaluate and analyze the depth and application of the acyclic nature of unidirectional flow in several domains such as industry, biology, medicine, and electricity. This survey also provides, how the unidirectional flow and flow networks play an important role in multiple disciplines. The study includes all the major developments in the past years describing the key attributes of unidirectional flow networks, including their applications, scope, and routing methods.

• 한국경영과학회지
• /
• 제20권1호
• /
• pp.35-54
• /
• 1995

Routing in ATM network is set up by combination of both virtual path routing and virtual channel routing. While virtual channel is similar concept to virtual circuit of data networks, virtual path is a special concept which is not used in traditional data networks. Virtual path can rearrange in structure and size by simply changing virtual path routing tables and giving the network the capability to eash allocate network resources according to the demand needs. This paper provides reconfiguration models of virtual path network which give the bandwidth of link and the routing path for each traffic class. The reconfiguration models are network optimization problems of multicommodity network flow type. The numerical examples are also included.

• 한국습지학회지
• /
• 제18권2호
• /
• pp.148-153
• /
• 2016

하도 홍수추적과 관련하여 하천에서의 시 공간적 홍수파를 해석하는데 수리학적 방법과 수문학적 방법이 일반적으로 많이 이용되어 왔다. 수문학적 홍수추적 방법은 수리학적 방법에 비해 수행하기에는 비교적 간단하면서도 합리적인 정확성을 지닌다. 수문학적 홍수추적 방법 중 광범위하게 적용되어지고 있는 Muskingum 모형의 중요 변수인 저류상수는 유하시간과 매우 유사한 값을 가진다. 이러한 점에 착안하여 본 연구에서는 저류상수를 산정하기 위해 HEC-RAS를 이용한 유하시간을 산정하고, 하도거리, 하도경사, 유량 자료를 이용하여 유하시간에 대한 비선형 회귀곡선식을 개발하였다. 비선형 회귀곡선에 의해서 산정된 저류상수를 Muskingum 모형에 대입하여 구한 유출량은 HEC-RAS 1차원 부정류 모의를 적용하여 산정된 유출량과 비교하였다. 이와 함께 본 연구에서는 가중인자에 대한 영향 및 상하류 사이의 구간 분할에 대해서 검토하였는데, 그 결과 가중인자 값이 클수록 첨두홍수량이 올라가는 것으로 나타났으며, 구간 분할을 많이 할수록 RMSE가 감소하는 것으로 나타났다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• pp.135-139
• /
• 2003

Sensor networks consist of sensor nodes with small-size, low-cost, low-power, and multi-functions to sense, to process and to communicate. Minimizing power consumption of sensors is an important issue in sensor networks due to limited power in sensor networks. Clustering is an efficient way to reduce data flow in sensor networks and to maintain less routing information. In this paper, we propose a multi-hop clustering mechanism using global and local ID to reduce transmission power consumption and an efficient routing method for improved data fusion and transmission.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• pp.140-144
• /
• 2003

A sensor network consists of many low-cost, low-power, and multi-functional sensor nodes. One of most important issues in of sensor networks is to increase network lifetime, and there have been researches on the problem. In this paper, we propose a routing mechanism to prolong network lifetime, in which each node adjusts its transmission power to send data to its neighbors. We model the energy efficient routing with power control and present an algorithm to obtain the optimal flow solution for maximum network lifetime. Then, we derive an upper bound on the network lifetime for specific network topologies.

• 한국정보통신학회논문지
• /
• 제6권1호
• /
• pp.36-40
• /
• 2002

Routing algorithm uses metric to choose the route of Least cost to destination network, the best suited routing investigates all routes to the shortest destination among networks and is decided on the route given the minimum metric. This paper analyzed packet flow for setting up the best fitted path on the same network using RIP and EIGRP as the distance vector algorithm and measured the Link-efficiency.

• 한국경영과학회지
• /
• 제14권2호
• /
• pp.53-66
• /
• 1989

The Public Vehicle Routing Problem (PVRP) is to find the minimum total cost routes of M or less Public-Vehicles to traverse the required arcs(streets) at least once, and return to their starting depot on a directed network. In this paper, first, a mathematical model is formulated as minimal cost flow model with illegal subtour elimination constraints, and with the fixed cost and routing cost as an objective function. Second, an efficient branch and bound algorithm is developed to obtain an exact solution. A subproblem in this method is a minimal cost flow problem relaxing illegal subtour elimination constraints. The branching strategy is a variable dichotomy method according to the entering nonrequired arcs which are candidates to eneter into an illegal subtour. To accelerate the fathoming process, a tighter lower bound of a candidate subproblem is calculated by using a minimum reduced coast of the entering nonrequired arcs. Computational results based on randomly generated networks report that the developed algorithm is efficient.

• Journal of Information Processing Systems
• /
• 제5권2호
• /
• pp.97-104
• /
• 2009

In this paper we propose a Differentiated Services Based Admission Control and Routing Algorithm for IPv6 (ACMRA). The basic DiffServ architecture lacks an admission control mechanism, the injection of more QoS sensitive traffic into the network can cause congestion at the core of the network. Our Differentiated Services Based Admission Control and Routing Algorithm for IPv6 combines the admission control phase with the route finding phase, and our routing protocol has been designed in a way to work alongside DiffServ based networks. The Differentiated Services Based Admission Control and Routing Algorithm for IPv6 constructs label switched paths in order to provide rigorous QoS provisioning. We have conducted extensive simulations to validate the effectiveness and efficiency of our proposed admission control and routing algorithm. Simulation Results show that the Differentiated Services Based Admission Control and Routing Algorithm for IPv6 provides an excellent packet delivery ratio, reduces the control packets' overhead, and makes use of the resources present on multiple paths to the destination network, while almost each admitted flow shows compliance with its Service Level Agreement.

• 상하수도학회지
• /
• 제12권2호
• /
• pp.127-139
• /
• 1998

The objectives of this study is at the development of the channel routing model which can be used for flood prediction. Among the routing models, the hydraulic technique of the implicit scheme in the dynamic equation is selected to route the unsteady varied flow in the open channel. The channel routing model is catchment runoff which computed by the conceptual and transfer function model. The conceptual and transfer function model can simulate the catchment runoff accurately. As a result of investigating the channel routing model, the optimal weighting factor ${\theta}$ which fixes two points between time line is chosen, and also, the optimal error tolerance which satisfies computing time and converge of solution is determined in this study.

• 전기전자학회논문지
• /
• 제16권1호
• /
• pp.45-50
• /
• 2012

본 논문은 설계 흐름의 초기 단계에서 SoC의 라우팅 밀집도를 빠르고 정확하게 예측하는 방법론을 제안한다. 라우팅 과정에서 발생하는 과도한 밀집 현상은 라우팅 실패를 야기하고, 물리 설계를 처음부터 다시하게 되는 불필요한 시간을 소모하게 한다. 설계 초기단계에서 라우팅 밀집도를 정확하게 예측하는 것은 성공적인 물리 설계를 이끌어 내며, 전체 설계 시간에 소모되는 비용을 최소화시킨다. 제안된 방법은 블록 수준 플로어플랜 단계에서 블록 간/블록 내부 인터커넥트, 가상으로 합성된 파워/클록 네트워크를 사용해서 정교한 라우팅 밀집도를 예측한다.