• Title/Summary/Keyword: traffic flows

Search Result 344, Processing Time 0.021 seconds

A Novel Adaptive Routing Algorithm for Delay-Sensitive Service in Multihop LEO Satellite Network

  • Liu, Liang;Zhang, Tao;Lu, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3551-3567
    • /
    • 2016
  • The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

A Probabilistic Sampling Method for Efficient Flow-based Analysis

  • Jadidi, Zahra;Muthukkumarasamy, Vallipuram;Sithirasenan, Elankayer;Singh, Kalvinder
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.818-825
    • /
    • 2016
  • Network management and anomaly detection are challenges in high-speed networks due to the high volume of packets that has to be analysed. Flow-based analysis is a scalable method which reduces the high volume of network traffic by dividing it into flows. As sampling methods are extensively used in flow generators such as NetFlow, the impact of sampling on the performance of flow-based analysis needs to be investigated. Monitoring using sampled traffic is a well-studied research area, however, the impact of sampling on flow-based anomaly detection is a poorly researched area. This paper investigates flow sampling methods and shows that these methods have negative impact on flow-based anomaly detection. Therefore, we propose an efficient probabilistic flow sampling method that can preserve flow traffic distribution. The proposed sampling method takes into account two flow features: Destination IP address and octet. The destination IP addresses are sampled based on the number of received bytes. Our method provides efficient sampled traffic which has the required traffic features for both flow-based anomaly detection and monitoring. The proposed sampling method is evaluated using a number of generated flow-based datasets. The results show improvement in preserved malicious flows.

TRaffic-Aware Topology Control Algorithm in Wireless Sensor Networks (무선 센서 네트워크에서 트래픽 정보를 이용한 토폴로지 제어 기법)

  • Jung, Yeon-Su;Choi, Hoon;Baek, Yun-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.510-517
    • /
    • 2008
  • In wireless sensor networks, a number of nodes deployed in dense manner should be self-configured to establish a topology that provides communication and sensing coverage under stringent energy constraints. To establish an efficient topology, we propose the TRaffic-Aware Topology control (TRAT) algorithm that reduces energy dissipation by considering total amount of data flows in the network. Our algorithm controls the number of active nodes with traffic information and adjusts nodal transmission power by estimating amount of data flows. According to the result, the proposed algorithm shows about 30% better performance than the other methods in terms of energy efficiency.

An Analysis of Travel Pattern for Hazardous Materials Transportation on Expressway through Origin-Destination Flows Estimation (고속도로 링크별 통행량 추정을 통한 위험물질 수송차량 통행행태 분석)

  • Hong, Jungyeol;Kim, Yoonhyuk;Park, Dongjoo
    • Korean Journal of Hazardous Materials
    • /
    • v.6 no.2
    • /
    • pp.68-76
    • /
    • 2018
  • This study aims to provide a methodological framework to estimate the travel demand of hazardous materials transporting vehicles by link and analyze daily traffic patterns on an expressway to develop safety roadway management strategies. Traffic volume of hazardous material vehicles is counted through the on-site investigation at twenty-five tollgates on the expressway, and their demands by a link are predicted through origin-destination flows estimation. The result shows that the number of the domestic hazardous materials vehicles is approximately 51,207 vehicles per day and it indicates that hazardous materials transport vehicles account for 1.5% of total daily traffic on the internal expressway and 6.2% of total cargo traffic volumes. This study roughly estimated how many hazardous materials vehicles pass through the expressway segment. Thus it is expected to be utilized for establishing a systematic highway management strategy in the future by calculating the traffic volume of the hazardous material vehicles traveling on the interstate expressway.

A Variable Demand Traffic Assignment Model Based on Stable Dynamics (안정동력학에 의한 가변수요 통행배정모형)

  • Park, Koo-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.1
    • /
    • pp.61-83
    • /
    • 2009
  • This study developed a variable demand traffic assignment model by stable dynamics. Stable dynamics, suggested by Nesterov and do Palma[19], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with the user equilibrium model, which is based on the arc travel time function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on congestion. It is therefore expected to be a useful analysis tool for transportation planners. In this study, we generalize the stable dynamics into the model with variable demands. We suggest a three stage optimization model. In the first stage, we introduce critical travel times and dummy links and determine variable demands and link flows by applying an optimization problem to an extended network with the dummy links. Then we determine link travel times and path flows in the following stages. We present a numerical example of the application of the model to a given network.

A Global TraHlc Conool Architecture For Isolating Network Attacts h Highspeed Intemet Backbone Networle (인터넷 백본망상에서 네트워크 공격 고립을 위한 전역 트래픽 제어 구조)

  • 노병희
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5B
    • /
    • pp.491-497
    • /
    • 2004
  • In this Paper, we W a Hovel global traffic control architecture to isolate malicious network attacks and protect network infrastructure in Internet backbone networks. Unlike existing methods based on individual packets or flows, since the proposed detection and control methods are operated on the aggregate traffic level, the computational complexity can k significantly reduced, and they are applicable to develop a global defense architecture against network attack. Experimental results show that the proposed scheme can detect the network attack symptoms very exactly and quickly and protect the network resources as well as the normal traffic flows very efficiently.

A Study on Optimal Traffic Signal Controls in Urban Street Networks (도시 가로망에서의 최적교통신호등 결정모형의 실용화에 관한 연구)

  • 이승환
    • Journal of Korean Society of Transportation
    • /
    • v.5 no.1
    • /
    • pp.3-23
    • /
    • 1987
  • Traffic signal control problems in urban street networks are formulated in two ways. In the formulations network flows are assumed to satisfy the user route choice criterion. the first formulation which is called implicit substiuation incorporates user route behavior implicitly in the objective function by recognizing the dependence of the link flows on the signal variables. On the other hands, the second one which is called 'penalty formulation' consists in expressing the route choice conditions in the form of a single nonlinear constraint. Approximate solution algorithm for each of the formulations was investigated in detail and computer codes were written to examine key aspects of each algorithm. A test was done on a network which is small in size but sufficiently complex in representing real-world traffic conditions and the test result shows that both algorithms produce converged solutions. It is recommended, however, that further studies should be done in order to compare the performance of each algorithm more in depth.

  • PDF

Meeting the Demands for Major International Traffic Flows through Railnet Austria's Maintenance and Capacity Planning Regime

  • Herbacek, R.;Petri, K.;Ertl, B.
    • International Journal of Railway
    • /
    • v.1 no.4
    • /
    • pp.134-142
    • /
    • 2008
  • Serving as a strategic crossing point for major corridors in Central Europe, Railnet Austria's Infrastructure Network incurs continual increases in international traffic flows and is therefore subject to accumulating traffic congestion with potential restrictions to infrastructure access. This imposes challenges towards preserving open access to Railnet Austria's existing railway network and hinders quality infrastructure service during maintenance, repair, and upgrading. Through Railnet Austria's experiences, the economic viability of a railway network can be sustained through maintaining open access with good quality service of planned trainpaths, thus representing new challenges for future infrastructure maintenance and capacity planning. Railnet Austria's Capacity Management Department has proven that these challenges can be accommodated more effectively through recent technological developments in data warehousing and software development.

  • PDF

Application-Level Traffic Monitoring and an Analysis on IP Networks

  • Kim, Myung-Sup;Won, Young-J.;Hong, James Won-Ki
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.22-42
    • /
    • 2005
  • Traditional traffic identification methods based on wellknown port numbers are not appropriate for the identification of new types of Internet applications. This paper proposes a new method to identify current Internet traffic, which is a preliminary but essential step toward traffic characterization. We categorized most current network-based applications into several classes according to their traffic patterns. Then, using this categorization, we developed a flow grouping method that determines the application name of traffic flows. We have incorporated our method into NG-MON, a traffic analysis system, to analyze Internet traffic between our enterprise network and the Internet, and characterized all the traffic according to their application types.

Performance Analysis of IP Packet over MPLS Domain (MPLS 영역에서 IP Packet의 성능 분석)

  • 박상준;박우출;이병호
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.29-32
    • /
    • 2000
  • MPLS stands for “Multi-protocol Label Switching”. It's a layer 3 switching technology aimed at greatly improving the packet forwarding performance of the backbone routers in the Internet or other large networks. We compare the performance of unlabeled IP traffic and labeled IP traffic. In this paper, by varying the packet rate and measuring throughput of the flows we analyze the performance of labeled IP packet traffic and unlabeled IP packet traffic in IP over MPLS.

  • PDF