• Title/Summary/Keyword: routing modeling

Search Result 130, Processing Time 0.025 seconds

An Analysis of the Rainfall-Runoff of Natural Watershed Using the Hydraulic Routing Method (수리학적 추적 방법을 이용한 자연하천의 강우유출 해석)

  • Kwon, Hyun-Han;Moon, Young-Il
    • Journal of Korea Water Resources Association
    • /
    • v.38 no.7 s.156
    • /
    • pp.555-564
    • /
    • 2005
  • In this study, a simple rainfall-runoff model was proposed by using the hydraulic routing model that requires relatively few parameters. The parameters of this model were estimated by the watershed characteristics data, and were applied to the Soyang watershed and Ui stream watershed by using the kinematic wave for overland flow and dynamic wave routing for channel routing. In order to demonstrate validity, the proposed approach was compared to the HEC-1 model for the Soyang watershed. As the results of modeling have shown, the hydraulic model shows reasonable results similar to that of the HEC-1 model. This model also represents good results for the Ui stream watershed. Hence, even if this model is a simple rainfall-runoff model using general methodology, it is competitive to the natural watershed. However, it is still difficult to estimate the roughness coefficient and the catchment width, and therefore this model is in need of such supplements.

Joint Channel Assignment and Multi-path Routing in Multi-radio Multi-channel Wireless Mesh Network

  • Pham, Ngoc Thai;Choi, Myeong-Gil;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.6
    • /
    • pp.824-832
    • /
    • 2009
  • Multi-radio multi-channel Wireless Mesh Network requires an effective management policy to control the assignment of channels to each radio. We concentrated our investigation on modeling method and solution to find a dynamic channel assignment scheme that is adapted to change of network traffic. Multi-path routing scheme was chosen to overwhelm the unreliability of wireless link. For a particular traffic state, our optimization model found a specific traffic distribution over multi-path and a channel assignment scheme that maximizes the overall network throughput. We developed a simple heuristic method for channel assignment by gradually removing clique load to obtain higher throughput. We also presented numerical examples and discussion of our models in comparison with existing research.

  • PDF

Flow Assignment and Packet Scheduling for Multipath Routing

  • Leung, Ka-Cheong;Victor O. K. Li
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.230-239
    • /
    • 2003
  • In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

A Study on Modeling and Algorithm for WDM VWP Network Design (WDM VWP 네트워크 설계 모형 및 알고리즘 연구)

  • Lee, Hee-Sang;Hong, Sung-Pil;Song, Hae-Goo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.296-305
    • /
    • 2000
  • Virtual wavelength path (VWP) is the optical path when a wavelength conversion is possible in a wavelength division multiplexing (WDM) network that is transmission infrastructure for the next generation high speed backbone networks. To achieve efficient design for VWP networks, we must consider VWP routing, wavelength assignment, and wavelength conversion while satisfying many technical constraints of the WDM networks. In this study we propose an integrated model for efficient VWP design in WDM networks. We also develope a 3-phase algorithm, each of which deals with routing, wavelength assignment and route and wavelength reassignment, respectively. In our computational experiments, phase 1 algorithm can solve the problem to the optimality for medium size test networks. Phase 2 algorithm is an efficient heuristic based on a reduced layered network and can give us an effective wavelength assignment. Finally, phase 3 algorithm reconfigure VWP routing and its wavelength assignment to concentrate wavelength conversion nodes in the suggested VWP network.

  • PDF

A Connection Entropy-based Multi-Rate Routing Protocol for Mobile Ad Hoc Networks

  • Hieu, Cao Trong;Hong, Choong-Seon
    • Journal of Computing Science and Engineering
    • /
    • v.4 no.3
    • /
    • pp.225-239
    • /
    • 2010
  • This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.

Adaptive Multi-routing Protocol for a High Mobility MANET (변동성이 높은 이동 애드 혹 네트워크를 위한 적응적 다중 라우팅 프로토콜 적용 기법)

  • Deepak, G.C.;Heo, Ung;Choi, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.103-110
    • /
    • 2008
  • When there is uncertainty in topological rate of change, motility model and terrain condition, the performance severely degrades in MANET. The concept of transition of routing protocol on the fly according to the network parameters such as coverage, connectivity and mobility etc. may counterbalance the problems stated above. The mathematical modeling of feedback parameters has been derived, and the architecture for the multi-routing protocol system providing an adaptation from one routing protocol to another is also investigated. This paper is extensively devoted on the analysis of mobility, connectivity and their effects on the network and finally transition into another routing protocol according to them.

A Method for the Selection of Underwater Multimedia Routing Protocol Stack based on the Similarity Model (유사성 모델 기반의 수중 다중매체 통신 라우팅 프로토콜스택 선택방법)

  • Shin, DongHyun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.1
    • /
    • pp.61-71
    • /
    • 2022
  • When communication such as light, radio wave, or magnetic field is used underwater, the communication distance is very short, so sound waves are mainly used. However, by combining the strengths of each medium and communicating, stable communication may be possible. Underwater multi-media communication requires a protocol stack that supports it, which is very complex. To this end, this paper proposes a standard protocol stack and modeling technique to enable easy protocol stack modeling for the purpose. In fact, in this paper, a random model was created and analyzed through the proposal of modeling elements and similarity measurement methods, and as a result, it was analyzed that it was very helpful in creating a new model based on a standard model.

Power Distribution Network Modeling using Block-based Approach

  • Chew, Li Wern
    • Journal of the Microelectronics and Packaging Society
    • /
    • v.20 no.4
    • /
    • pp.75-79
    • /
    • 2013
  • A power distribution network (PDN) is a network that provides connection between the voltage source supply and the power/ground terminals of a microprocessor chip. It consists of a voltage regulator module, a printed circuit board, a package substrate, a microprocessor chip as well as decoupling capacitors. For power integrity analysis, the board and package layouts have to be transformed into an electrical network of resistor, inductor and capacitor components which may be expressed using the S-parameters models. This modeling process generally takes from several hours up to a few days for a complete board or package layout. When the board and package layouts change, they need to be re-extracted and the S-parameters models also need to be re-generated for power integrity assessment. This not only consumes a lot of resources such as time and manpower, the task of PDN modeling is also tedious and mundane. In this paper, a block-based PDN modeling is proposed. Here, the board or package layout is partitioned into sub-blocks and each of them is modeled independently. In the event of a change in power rails routing, only the affected sub-blocks will be reextracted and re-modeled. Simulation results show that the proposed block-based PDN modeling not only can save at least 75% of processing time but it can, at the same time, keep the modeling accuracy on par with the traditional PDN modeling methodology.

Modeling and Simulation of Fuzzy based Propagation Limiting Method for message routing in Wireless Sensor Networks (무선 센서 네트워크에서 메시지 라우팅을 위한 퍼지 기반 전달 영역 제한 기법의 모델링 및 시뮬레이션)

  • Chi, Sang-Hoon;Lee, Hae-Young;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.4
    • /
    • pp.29-39
    • /
    • 2006
  • Sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. A number of routing protocols to transmit the data between the base station and sensor nodes have been proposed. Intanagonwiwat et al. proposed the directed diffusion in which the base station sends interest messages and waits for data from the nodes in the specific regions. Since the directed diffusion propagates every interest message to whole nodes in the network, it causes energy dissipation of nodes. In this paper, we propose a novel data propagation method, which limits the data transmission area according to a threshold value for reducing the energy consumption in the network. A fuzzy logic is exploited to determine the threshold value by considering the energy and density of all the deployed nodes. The simulation models are designed and implemented based on DEVS formalism which is theoretically well grounded means of expressing discrete event simulation models.

  • PDF

A Study on the Development Automatic Placement/Routing System in the PCB (인쇄회로기판 자동배치/배선 시스템 개발에 관한 연구)

  • Kim, Hyun-Gi;Woo, Kyong-Hwan
    • The KIPS Transactions:PartA
    • /
    • v.11A no.4
    • /
    • pp.267-276
    • /
    • 2004
  • The modeling methods of routing region used in the automatic placement/routing system are a grid and non-grid. Because the gird method is curbed by its size and a board if the electrical and physical elements on PCB are of small quantity, it has many memories. Therefore, it has demerit which decreases the speed of automatic placement/routing. The Shape-based type, non-grid method, makes the shapes exist as an in dividual element in a memory by using a region-processing method. Each individual element needs very small memory since it has its unique data size. Therefore, this paper aimed to develope the automatic placement/routing system which can automatically place and route the PCB without dissipation of memory at a high speed. To this aim, the auction algorithm method was applied which can make the memories be most rapidly reached from the original point to various destinations. Also, this system was developed by the Visual C++ in the Widows environment of IBM Pentium computer in order to use it in an individual PC system.