• Title/Summary/Keyword: Dynamic network analysis

Search Result 744, Processing Time 0.022 seconds

Network Calibration and Validation of Dynamic Traffic Assignment with Nationwide Freeway Network Data of South Korea (고속도로 TCS 자료를 활용한 동적노선배정의 네트워크 정산과 검증)

  • Jeong, Sang-Mi;Kim, Ik-Ki
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.4
    • /
    • pp.205-215
    • /
    • 2008
  • As static traffic assignment has reached its limitation with ITS policy applications and due to the increase of interest in studies of ITS policies since the late 1980's, dynamic traffic assignment has been considered a tool to overcome such limitations. This study used the Dynameq program, which simulates route choice behavior by macroscopic modeling and dynamic network loading and traffic flow by microscopic modeling in consideration of the feasibility of the analysis of practical traffic policy. The essence of this study is to evaluate the feasibility for analysis in practical transportation policy of using the dynamic traffic assignment technique. The study involves the verification of the values estimated from the dynamic traffic assignment with South Korea's expressway network and dynamic O/D data by comparing results with observed link traffic volumes. This study used dynamic O/D data between each toll booth, which can be accurately obtained from the highway Toll Collection System. Then, as an example of its application, exclusive bus-lane policies were analyzed with the dynamic traffic assignment model while considering hourly variations.

A Visualization Based Analysis on Dynamic Bandwidth Allocation Algorithms for Optical Networks

  • Kamran Ali Memon;Khalid Husain Mohmadani ;Saleemullah Memon;Muhammad Abbas;Noor ul Ain
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.8
    • /
    • pp.204-209
    • /
    • 2023
  • Dynamic Bandwidth Allocation (DBA) methods in telecommunication network & systems have emerged with mechanisms for sharing limited resources in a rapidly growing number of users in today's access networks. Since the DBA research trends are incredibly fast-changing literature where almost every day new areas and terms continue to emerge. Co - citation analysis offers a significant support to researchers to distinguish intellectual bases and potentially leading edges of a specific field. We present the visualization based analysis for DBA algorithms in telecommunication field using mainstream co-citation analysis tool-CiteSpace and web of science (WoS) analysis. Research records for the period of decade (2009-2018) for this analysis are sought from WoS. The visualization results identify the most influential DBA algorithms research studies, journals, major countries, institutions, and researchers, and indicate the intellectual bases and focus entirely on DBA algorithms in the literature, offering guidance to interested researchers on more study of DBA algorithms.

Defense Strategy of Network Security based on Dynamic Classification

  • Wei, Jinxia;Zhang, Ru;Liu, Jianyi;Niu, Xinxin;Yang, Yixian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.5116-5134
    • /
    • 2015
  • In this paper, due to the network security defense is mainly static defense, a dynamic classification network security defense strategy model is proposed by analyzing the security situation of complex computer network. According to the network security impact parameters, eight security elements and classification standard are obtained. At the same time, the dynamic classification algorithm based on fuzzy theory is also presented. The experimental analysis results show that the proposed model and algorithm are feasible and effective. The model is a good way to solve a safety problem that the static defense cannot cope with tactics and lack of dynamic change.

Dynamic analysis of short circulation with OPR prediction used neural network (Neural network을 이용한 OPR예측과 short circulation 동특성 분석)

  • Jeon, Jun-Seok;Yeo, Yeong-Gu;Park, Si-Han;Gang, Hong
    • Proceedings of the Korea Technical Association of the Pulp and Paper Industry Conference
    • /
    • 2004.04a
    • /
    • pp.86-96
    • /
    • 2004
  • Identification of dynamics of short circulation during grade change operations in paper mills is very important for the effective plant operation. In the present study a prediction method of One Pass Retention(OPR) is proposed based on the neural network. The present method is used to analyze the dynamics of short circulation during grade change. Properties of the product paper largely depend upon the change in the OPR. In the present study the OPR is predicted from the training of the network by using grade change operation data. The results of the prediction are applied to the modeling equation to give flow rates and consistencies of short circulation.

  • PDF

A Source Code Cross-site Scripting Vulnerability Detection Method

  • Mu Chen;Lu Chen;Zhipeng Shao;Zaojian Dai;Nige Li;Xingjie Huang;Qian Dang;Xinjian Zhao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.6
    • /
    • pp.1689-1705
    • /
    • 2023
  • To deal with the potential XSS vulnerabilities in the source code of the power communication network, an XSS vulnerability detection method combining the static analysis method with the dynamic testing method is proposed. The static analysis method aims to analyze the structure and content of the source code. We construct a set of feature expressions to match malignant content and set a "variable conversion" method to analyze the data flow of the code that implements interactive functions. The static analysis method explores the vulnerabilities existing in the source code structure and code content. Dynamic testing aims to simulate network attacks to reflect whether there are vulnerabilities in web pages. We construct many attack vectors and implemented the test in the Selenium tool. Due to the combination of the two analysis methods, XSS vulnerability discovery research could be conducted from two aspects: "white-box testing" and "black-box testing". Tests show that this method can effectively detect XSS vulnerabilities in the source code of the power communication network.

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.

Formulating Analytical Solution of Network ODE Systems Based on Input Excitations

  • Bagchi, Susmit
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.455-468
    • /
    • 2018
  • The concepts of graph theory are applied to model and analyze dynamics of computer networks, biochemical networks and, semantics of social networks. The analysis of dynamics of complex networks is important in order to determine the stability and performance of networked systems. The analysis of non-stationary and nonlinear complex networks requires the applications of ordinary differential equations (ODE). However, the process of resolving input excitation to the dynamic non-stationary networks is difficult without involving external functions. This paper proposes an analytical formulation for generating solutions of nonlinear network ODE systems with functional decomposition. Furthermore, the input excitations are analytically resolved in linearized dynamic networks. The stability condition of dynamic networks is determined. The proposed analytical framework is generalized in nature and does not require any domain or range constraints.

Analysis for Ad Hoc Routing Protocol based-on Dynamic Source Routing (Dynamic Source Routing 기반의 Ad Hoc Routing Protocol 분석)

  • 이광재;김탁근;김동일;최삼길
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.121-124
    • /
    • 2001
  • Dynamic Source Route(DSR) protocol is a simple and efficient routing protocol designed specially for use of the multi-hop Ad Hoc Network. DSR allows the network to be completely self-organized and self-configured without the need for any existing infrastructure or administration. DSR protocol consists of the two mechanisms of Router discovery and Router Maintenance, works entirely On-demand in all aspects. In this paper, we will present the performance of DSR protocol on the multi-hop wireless Ad Hoc Networks, illustrate it with simulation, and then analysis the algorism of DSR.

  • PDF

A Performance Analysis of DPA(Dynamic Priority Assignment) MAC Protocol for traffic QoS Improvement on HFC-CATV Network (HFC-CATV 망에서 트래픽 QoS 향상을 위한 DAP MAC 프로토콜 성능분석)

  • Lee, Su-Youn
    • Convergence Security Journal
    • /
    • v.11 no.1
    • /
    • pp.3-10
    • /
    • 2011
  • This paper proposes DPA(Dynamic Priority Assignment) MAC protocol to improve the traffic QoS on the HFC-CATV(Hybrid Fiber Coax CAble TeleVision) network. In results, DPA MAC protocol is the best performance compare with to IEEE 802.14a MAC in mean request delay, mean access delay. Also, the paper prove a reliability of proposed protocol through comparison between performance analysis and simulation result of DAP MAC protocol.

Formal Analysis of Distributed Shared Memory Algorithms

  • Muhammad Atif;Muhammad Adnan Hashmi;Mudassar Naseer;Ahmad Salman Khan
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.4
    • /
    • pp.192-196
    • /
    • 2024
  • The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.