• Title/Summary/Keyword: Dynamic Network

Search Result 3,195, Processing Time 0.036 seconds

Improvement of GPON MAC Protocol for IP TV Service (IPTV 서비스를 위한 GPON 핵심 MAC 기술 개발)

  • Lee, Seung-Kun;Jang, Jong-Wook;Bae, Moon-Han
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.51-54
    • /
    • 2008
  • PON(Passive Optical Network) is the promising technology applicable to TPS(Triple Play Service). To improve process the packet, MAC(Multiple Access Control) is the most important technology in the PON. The core of MAC is DBA(Dynamic Bandwidth Assignment), it classifies SR-DBA(Status Report DBA) and NSR-DBA(Non Status Report DBA). But GPON DBA is using BPON's DBA, so it's bad in network efficiency. This study develop BR(Borrow-Refund)-DBA for improve network efficiency and prompt process. For take the gauge of performance evaluation, estimate about throughput, fairness and queue delay in SR-DBA and NSR-DBA environment

  • PDF

Optimization of Transportation Problem in Dynamic Logistics Network

  • Chung, Ji-Bok;Choi, Byung-Cheon
    • Journal of Distribution Science
    • /
    • v.14 no.2
    • /
    • pp.41-45
    • /
    • 2016
  • Purpose - Finding an optimal path is an essential component for the design and operation of smart transportation or logistics network. Many applications in navigation system assume that travel time of each link is fixed and same. However, in practice, the travel time of each link changes over time. In this paper, we introduce a new transportation problem to find a latest departing time and delivery path between the two nodes, while not violating the appointed time at the destination node. Research design, data, and methodology - To solve the problem, we suggest a mathematical model based on network optimization theory and a backward search method to find an optimal solution. Results - First, we introduce a dynamic transportation problem which is different with traditional shortest path or minimum cost path. Second, we propose an algorithm solution based on backward search to solve the problem in a large-sized network. Conclusions - We proposed a new transportation problem which is different with traditional shortest path or minimum cost path. We analyzed the problem under the conditions that travel time is changing, and proposed an algorithm to solve them. Extending our models for visiting two or more destinations is one of the further research topics.

A Study for a Capacitated Facility Location Problem on a Tree Structured Network (나무구조를 갖는 네트워크상에서의 제한용량이 있는 입지설정문제에 관한 연구)

  • Cho, Geon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.3
    • /
    • pp.250-259
    • /
    • 2001
  • Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

  • PDF

Optimal Routing Path Selection Algorithm in Ad-hoc Wireless Sensor Network (Ad-hoc 센서 네트워크를 위한 최적 라우팅 경로 설정 알고리즘)

  • Jang In-Hun;Sim Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.6
    • /
    • pp.736-741
    • /
    • 2005
  • The highly popular algorithm to determine routing path for the multi-hopping wireless sensor network is DSR(Dynamic Source Routing), which is one of the Demand-Driven way to makes the route only when there is a request for sending data. However, because DSR attaches the route's record on the sending packet, the bigger number of sensor node is, the heavier packet in DSR becomes. In this paper, we try to propose the new optimal routing path selecting algorithm which does not make the size of packet bigger by using proper routing table even though the number of sensor node increases, and we try to show our algorithm is more stable and reliable because it is based on the cost function considering some network resources of each sensor node such as power consumption, mobility, traffic in network, distance(hop) between source and destination.

Performance Evaluation of control and management protocol for Dynamic lightpath setup based GMPLS network (GMPLS 기반의 동적 경로 설정을 위한 제어 및 관리 프로토콜 성능 평가)

  • Kim Kyoung-Mok;Oh Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.12
    • /
    • pp.9-14
    • /
    • 2004
  • As the internet traffic type and size have bun diversified in recent years, the GMPLS-based distributed control and management protocol have surfaced as a serious issue for dynamic optical lightpath setup. In this reason, we investigated and analyzed network performance and protocols using global information-based link state approach and local information based link state approach. We calculated connection setup time, required control bandwidth and setup blocking probability that made from network update period and threshold metrics according to traffic arrival rate. The evaluated results will be used in broadband network and adopted for high speed network in the future widely.

Dynamic-size Multi-hop Clustering Mechanism in Sensor Networks (센서 네트워크에서의 동적 크기 다중홉 클러스터링 방법)

  • Lim, Yu-Jin;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.875-880
    • /
    • 2005
  • One of the most important issues in the sensor network with resource-constrained sensor nodes is prolonging the network lifetime by efficiently utilizing the given energy of nodes. The most representative mechanism to achieve a long-lived network is the clustering mechanism. In this paper, we propose a new dynamic-size multi-hop clustering mechanism in which the burden of a node acting as a cluster head(CH) is balanced regardless of the density of nodes in a sensor network by adjusting the size of a cluster based on the information about the communication load and the residual energy of the node and its neighboring nodes. We show that our proposed scheme outperforms other single-hop or fixed-size multi-hop clustering mechanisms by carrying out simulations.

An Enhanced Handoff Support Based on Network-based Mobility Management Protocol (향상된 핸드오프를 지원하는 망 기반의 이동성 지원 방안)

  • Lee, Sung-Kuen;Jeon, You-Chan;Lim, Tae-Hyong;Park, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.1-9
    • /
    • 2009
  • In this paper, we propose an enhanced handoff support scheme based on network-based mobility management protocol, Proxy Mobile IPv6 (PMIPv6), which is actively standardized by the IETF NETLMM working group. By utilizing the dynamic virtual hierarchy network architecture between mobile access gateways (MAGs), the proposed scheme can support network scalability and reliability to wireless access network. In addition, we propose pre-authentication process based on the policy store (PS) to support a fast and seamless handoff. We evaluate the performance of the proposed scheme in terms of handoff delay and end-to-end delay thru computer simulation. Thru, various computer simulation results, we verified the superior performance of the proposed scheme by comparing with the results of other schemes.

Application of Flow Network Models of SINDA/FLUIN $T^{TM}$ to a Nuclear Power Plant System Thermal Hydraulic Code

  • Chung, Ji-Bum;Park, Jong-Woon
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1998.05a
    • /
    • pp.641-646
    • /
    • 1998
  • In order to enhance the dynamic and interactive simulation capability of a system thermal hydraulic code for nuclear power plant, applicability of flow network models in SINDA/FLUIN $T^{™}$ has been tested by modeling feedwater system and coupling to DSNP which is one of a system thermal hydraulic simulation code for a pressurized heavy water reactor. The feedwater system is selected since it is one of the most important balance of plant systems with a potential to greatly affect the behavior of nuclear steam supply system. The flow network model of this feedwater system consists of condenser, condensate pumps, low and high pressure heaters, deaerator, feedwater pumps, and control valves. This complicated flow network is modeled and coupled to DSNP and it is tested for several normal and abnormal transient conditions such turbine load maneuvering, turbine trip, and loss of class IV power. The results show reasonable behavior of the coupled code and also gives a good dynamic and interactive simulation capabilities for the several mild transient conditions. It has been found that coupling system thermal hydraulic code with a flow network code is a proper way of upgrading simulation capability of DSNP to mature nuclear plant analyzer (NPA).

  • PDF

Analyzing the Ecosystem of the Domestic Online Game Industry : Focusing on the Linkage between Developers and Publishers (국내 온라인 게임 산업 생태계 분석 : 개발사-퍼블리셔 관계를 중심으로)

  • Chun, Hoon;Lee, Hakyeon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.2
    • /
    • pp.138-150
    • /
    • 2016
  • This study aims to analyze the structure and characteristics of the domestic online game industry using network analysis. In particular, two-mode network analysis is employed to measure the network structure, centrality, and cluster for two types of online game platforms, online games and mobile games, from 1996 to 2014. We also conduct a dynamic analysis to capture the structural changes in the ecosystem by internal and external environmental changes before and after turning point for each online game platform. It is revealed that the online game econsystem has the higher number of clusters and higher concentration ratio than those of mobile game ecosystem. In dynamic analysis, both platforms exhibit similar trends over time with the increasing number of clusters, enlargement of largest cluster's size, and decreasing concentration ratio. This study is expected to provide fruitful implications for strategic decision making of online game companies and policy making for the online game industry.

Neural Network-based FMCW Radar System for Detecting a Drone (소형 무인 항공기 탐지를 위한 인공 신경망 기반 FMCW 레이다 시스템)

  • Jang, Myeongjae;Kim, Soontae
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.6
    • /
    • pp.289-296
    • /
    • 2018
  • Drone detection in FMCW radar system needs complex techniques because a drone beat frequency is highly dynamic and unpredictable. Therefore, the current static signal processing algorithms cannot show appropriate detection accuracy. With dynamic signal fluctuation and environmental clutters, it can fail to detect a drone or make false detection. It affects to the radar system integrity and safety. Constant false alarm rate (CFAR), one of famous static signal process algorithm is effective for static environment. But for drone detection, it shows low detection accuracy. In this paper, we suggest neural network based FMCW radar system for detecting a drone. We use recurrent neural network (RNN) because it is the effective neural network for signal processing. In our FMCW radar system, one transmitter emits FMCW signal and four-way fixed receivers detect reflected drone beat frequency. The coordinate of the drone can be calculated with four receivers information by triangulation. Therefore, RNN only learns and inferences reflected drone beat frequency. It helps higher learning and detection accuracy. With several drone flight experiments, RNN shows false detection rate and detection accuracy as 21.1% and 96.4%, respectively.