• Title/Summary/Keyword: Information flow

Search Result 5,764, Processing Time 0.029 seconds

A Fast and Scalable Mobile Flow Management Method for IP-Based Mobile Networks (IP 기반 네트워크에서 빠르고 확장성이 용이한 플로우 이동성 관리 방법)

  • Yim, Taihyong;Kyung, Yeunwoong;Nguyen, Tri Minh;Hong, Giwon;Park, Jinwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.1
    • /
    • pp.8-16
    • /
    • 2014
  • In this paper, we propose a fast and scalable flow mobility management scheme based on the flow-based stateful routing for the IP-based mobile networks. The proposed scheme employees the crossover flow routers as mobility anchors to perform the distributed flow-based mobility management of the moving terminals, while aims to reduce the long handoff delay and the processing overhead of the existing IP packet routing. We evaluated the performance of the proposed scheme and verified the superior performance of the proposed scheme by comparing with the results of IP-based mobility management schemes.

Extraction of Watershed Information using GIS and Diurnal Flow Change in the Rapids and Pool by the Nature-Friendly River Work (GIS를 이용한 유역정보 추출 및 여울과 소의 치수적 복원을 위한 일중 수치해석)

  • Kang, Sang-Hyeok
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.32 no.5
    • /
    • pp.517-522
    • /
    • 2010
  • The riffle and pool play an important role for composing river front, but very little information was used for river restoration considering flood control. In this paper extensive field investigation was carried out to estimate hydraulic processes in the pool. Furthermore diurnal stratification model was developed and applied to assess flow change in pool. The physical mechanism of water flow including diurnal processes was well simulated, the results show that diurnal variation of water flow in the pool about 2 m depth is governed by the level of mixing due to density flow. These effort will be useful to guide field data collection work and to understand primary production.

A Fair Scalable Inter-Domain TCP Marker for Multiple Domain DiffServ Networks

  • Hur, Kyeong;Eom, Doo-Seop
    • Journal of Communications and Networks
    • /
    • v.10 no.3
    • /
    • pp.338-350
    • /
    • 2008
  • The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

A Matched Filter with Two Data Flow Paths for Searching Sychronization in DSSS (DSSS 동기탐색을 위한 이중 데이터 흐름 경로를 갖는 정합필터)

  • Song Myong-Lyol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1A
    • /
    • pp.99-106
    • /
    • 2004
  • In this Paper, the matched filter for searching initial synchronization in DSSS (direct sequence spread spectrum) receiver is studied. The matched filter with a single data flow path is described which can be presented by HDL (Hardware Description Language). In order to improve the processing time of operations for the filter, equations are arranged to represent two data flow paths and the associated hardware model is proposed. The model has an architecture based on parallelism and pipeline for fast processing, in which two data flow paths with a series of memory, multiplier and accumulator are placed in parallel. The performance of the model is analyzed and compared with the matched filter with a single data flow path.

Numerical Analysis on the $2^{nd}$ Discharae-passase In Reciprocating Compressor (왕복동식 수소압축기의 2단 토출통로 유동해석)

  • Lee, G.H.;Rahman, M. Sq.;Kim, C.P.;Joung, T.W.;Jeong, H.M.;Chung, H.S.
    • Journal of Power System Engineering
    • /
    • v.13 no.3
    • /
    • pp.27-32
    • /
    • 2009
  • Numerical analysis information of a complex discharge-passage will be very useful to improve hydrogen compression system. General information about an internal gas flow is presented by numerical analysis approach. Relating with hydrogen compressing system, which have an important role in hydrogen energy utilization, this should be a useful tool to observe the flow quickly and clearly. Flow characteristic analysis, including pressure and turbulence kinetic energy distribution of hydrogen gas from cylinder going to the chamber of a reciprocating compressor are presented in this paper. Discharge-passage model is designed based on real model of hydrogen compressor. Pressure boundary conditions are applied considering the real condition of operating system. The result shows pressure and turbulence kinetic energy are not distributed uniformly along the passage of the hydrogen compressing system. Path line or particles tracks help to demonstrate flow characteristics inside the passage. The existence of vortices and flow direction can be precisely predicted. Based on this result, the design improvement should be done. Consequently, development of the better hydrogen compressing system will be achieved.

  • PDF

Experimental Study on Heat Transfer with Swirling Flow in a Cylindrical Annuli (원형동심관내 선회유동의 열전달에 대한 실험적 연구)

  • Chang, Tae-Hyun;Kil, Sang-Cheol;Lee, Kwon-Soo
    • Journal of the Korean Society of Visualization
    • /
    • v.8 no.1
    • /
    • pp.53-60
    • /
    • 2010
  • Experimental investigations were conducted to study the characteristics of turbulent swirling flow in an axisymmetric annuli. Swirl angle measurements were performed using a flow visualization technique using smoke and dye liquid for Re=60,00080,000. Using the two-dimensional particle image velocimetry method, we found the time-mean velocity distribution and turbulent intensities in water with swirl for Re=20,000, 30,000, and 40,000 along longitudinal sections. Neutral points occurred for equal axial velocity at y/(R-r)=0.70.75, and the highest axial velocity was recorded near y/(R-r)=0.9. Negative axial velocity was observed near the convex tube along X/(D-d)=3~23. Another experimental study was performed to investigate heat transfer characteristics of turbulent swirling flow in an axisymmetric annuli. Static pressure, and local flow temperature were measured using tangential inlet condition and the friction factors and Nusselt number were calculated for several Reynolds numbers.

Managing Flow Transfers in Enterprise Datacenter Networks with Flow Chasing

  • Ren, Cheng;Wang, Sheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1519-1534
    • /
    • 2016
  • In this paper, we study how to optimize the data shuffle phase by leveraging the flow relationship in datacenter networks (DCNs). In most of the clustering computer frameworks, the completion of a transfer (a group of flows that can enable a computation stage to start or complete) is determined by the flow completing last, so that limiting the rate of other flows (not the last one) appropriately can save bandwidth without impacting the performance of any transfer. Furthermore, for the flows enter network late, more bandwidth can be assigned to them to accelerate the completion of the entire transfer. Based on these characteristics, we propose the flow chasing algorithm (FCA) to optimize the completion of the entire transfer. We implement FCA on a real testbed. By evaluation, we find that FCA can not only reduce the completion time of data transfer by 6.24% on average, but also accelerate the completion of data shuffle phase and entire job.

Container Flow Management in Port Logistics Based on BPM Framework

  • Nisafani, Amna Shifia;Park, Jaehun;Bae, Hyerim;Yahya, Bernardo Nugroho
    • Journal of Information Technology and Architecture
    • /
    • v.9 no.1
    • /
    • pp.1-10
    • /
    • 2012
  • To promote process effectiveness and efficiency, it is necessary that port logistics employ automated equipments for handling containers. There exists a system for automatically managing the container flow, called Control Module. However, it has limitation to assign the execution order to the machine and monitor the container flow in real time process. Business process management (BPM) provides a suitable and effective framework to address this problem including controlling and monitoring the flow of each container. Since the nature of container handling process is different with the common process in BPM that is conducted by human performer, it is necessary to adjust the BPM framework in the domain of port logistic management. This study presents a BPM framework corresponds with both human-based and machine-based activity to enhance the efficiency of port process flow including container flow. This framework is introduced as an integrated approach and mechanism of BPM application into the container handling system for the purpose of port logistics process automation.

An Adaptive Block Matching Motion Estimation Method Using Optical Flow (광류를 이용한 적응적인 블록 정합 움직임 추정 기법)

  • Kim, Kyoung-Kyoo;Park, Kyung-Nam
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.1
    • /
    • pp.57-67
    • /
    • 2008
  • In this paper, we present an adaptive block matching motion estimation using optical flow. In the proposed algorithm, we calculate the temporal and spatial gradient value for each pixel value from tile differential filter, and estimate the optical flow which is used to decide the location and the size of the search region from the gradient values by least square optical flow algorithm. In particular, the proposed algorithm showed a excellent performance with fast and complex motion sequences. From the computer simulation for various motion characteristic sequences. The proposed algorithm shows a significant enhancement of PSNR over previous blocking matching algorithms.

  • PDF

Spatial Multilevel Optical Flow Architecture-based Dynamic Motion Estimation in Vehicular Traffic Scenarios

  • Fuentes, Alvaro;Yoon, Sook;Park, Dong Sun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5978-5999
    • /
    • 2018
  • Pedestrian detection is a challenging area in the intelligent vehicles domain. During the last years, many works have been proposed to efficiently detect motion in images. However, the problem becomes more complex when it comes to detecting moving areas while the vehicle is also moving. This paper presents a variational optical flow-based method for motion estimation in vehicular traffic scenarios. We introduce a framework for detecting motion areas with small and large displacements by computing optical flow using a multilevel architecture. The flow field is estimated at the shortest level and then successively computed until the largest level. We include a filtering parameter and a warping process using bicubic interpolation to combine the intermediate flow fields computed at each level during optimization to gain better performance. Furthermore, we find that by including a penalization function, our system is able to effectively reduce the presence of outliers and deal with all expected circumstances in real scenes. Experimental results are performed on various image sequences from Daimler Pedestrian Dataset that includes urban traffic scenarios. Our evaluation demonstrates that despite the complexity of the evaluated scenes, the motion areas with both moving and static camera can be effectively identified.