• Title/Summary/Keyword: traffic routes

Search Result 329, Processing Time 0.031 seconds

Performance evaluations of a link state update mechanism considering traffic variation (트래픽 변화를 고려한 링크 상태 업데이트 알고리즘의 성능 분석)

  • Choi Seung-hyuk;Jung Myoung Hee;Chung Min Young;Yang Mijeong;Kim Tae Il;Park Jaehyung
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2005.11a
    • /
    • pp.13-18
    • /
    • 2005
  • Routers determine routing path considering network topology and link state information for providing QoS (quality of service) guarantee. Therefore, it is important that routers know link state information to calculate routing path. However, if routers generate link state update messages inordinately, their router performance are reduced due to the process of link state update messages. On the other side, in case that link state information is not updated appropriately, route setup requests can be rejected even though there exist routes. In this paper, we propose an algorithm to improve router performance and evaluate the proposed algorithm performance compare with conventional algorithm by simulations.

  • PDF

A Study on New Cell Switch Fabric for Increasing the Performance of ATM Switching Systems (ATM 교환 시스템의 성능향상을 위한 새로운 셀 스위치 구조 연구)

  • 정진태;이옥재;전병실
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.3
    • /
    • pp.12-23
    • /
    • 1997
  • In this paper, we propose a new cell switch fabric for increasing the performance of ATM switching systems. Proposed switching network consists of a sorting network and a routing network. Both of these are multistage networks where each stage performs a fixed permutation on the incoming lines, and then routes them through a clumn of 2x2 switching elements. It is designed for distributing inputs and parallel processing to reduce the hardware complexity and obtain high performance of switching network. The structure and the operation of th eswitching network aredescribed and the performanceof the switching network is anlyzed under uniform traffic models. In this result, though the size of proposed network is increased the large scale, it has always the same throughput as the that of genral output queueing system with N=2. So, it is found that our proposed network is appropriate for the high apeed and lrger size of ATM switching systems.

  • PDF

Safety-Economic Decision Making Model of Tropical Cyclone Avoidance Routing on Oceans

  • Liu, Da-Gang;Wang, De-Qiang;Wu, Zhao-Lin
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2006.10a
    • /
    • pp.144-153
    • /
    • 2006
  • In order to take TC forecasts from different observatories into consideration, and make quantitative assessment and analysis for avoiding TC routes from the view of safety and cost, a new safe-economic decision making method of TC avoidance routing on ocean was put forward. This model is based on combining forecast of TC trace based on neural networks, technical method to determine the future TC wind and wave fields, technical method of fuzzy information optimization, risk analysis theory, and meteorological-economic decision making theory. It has applied to the simulation of MV Tianlihai's shipping on ocean. The result shows that the model can select the optimum plan from 7 plans, the selected plan is in accordance with the one selected by experienced captains.

  • PDF

A Low Overhead, Energy Efficient, Sink-initiated Multipath Routing Protocol for Static Wireless Sensor Networks

  • Razzaque, Md. Abdur;Hong, Choong Seon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.1167-1169
    • /
    • 2009
  • Multipath routing in wireless sensor networks has been proven to provide with increased data delivery ratio, security, robustness to node and link failures, network throughput, etc. However, the energy cost for multiple routes construction and their maintenance is very high. This paper proposes a sink-initiated, node-disjoint multipath routing protocol for static wireless sensor networks that significantly minimizes the route construction messages and thereby saves the critical batter energy of sensor nodes. It also distributes the traffic load spatially over many nodes in the forwarding paths, which ensures balanced energy consumption in the network and thereby increases the network lifetime. The simulation results show that it decreases the routing overhead as well as the standard deviation of nodes' residual energies.

Study of Optimization of Ground Vehicles Routes Aiming to Reduce Operational Costs and to Contribute to a Sustainable Development with the Reduction of Carbon Dioxide in the Atmosphere

  • Clecio, A.;Thomaz, F.;Hereid, Daniela
    • The Journal of Economics, Marketing and Management
    • /
    • v.4 no.1
    • /
    • pp.1-8
    • /
    • 2016
  • The purpose of this paper is to discuss the methodology of optimizing delivery route scheduling using a capacity integer linear programming problem model developed to a previous case study. The methodology suggests a two-stage decision: the first, automatic, where the manager will obtain guidance generated by the solution of the linear programming model, later they could use post-optimization techniques to fine tune to the best operational solution. This study has the goal to reduce the size of service companies' ground transportation fleets, aiming not only to reduce costs and increase competitive advantages but also to lower levels of air pollution and its consequences, traffic and, therefore, the levels of carbon dioxide, allowing for a reduction in envir onmental disasters.

Real time geographic routing in sensor networks (센서 네트워크의 실시간 지리 정보 라우팅)

  • Trang, Cao Minh;Kong, Hyung-Yun;Hwang, Yun-Kyeong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.1195-1198
    • /
    • 2007
  • In this paper we study the problem of real time support in wireless sensor networks and propose a Real time Geographic Routing Protocol (ReGeo) which routes a packet towards the destination based on a compromise between distance and queue count to reduce traffic concentration wherever it has been determined to be too high and uses Gradient Table to store the route satisfying the delay constraints. We describe our prototype implementation of ReGeo Routing in TOSSIM - a TinyOS mote simulator. The simulation results show that the proposed routing protocol not only increases the packet delivery ratio but also keeps overall End to End Delay under a bounded value.

A Study on the Axial Dependence of the Traffic Distribution Function (통항분포함수 축방향 의존성에 관한 연구)

  • Yoo, Sang-Lok;Gang, Sang-Geun
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.21 no.2
    • /
    • pp.179-187
    • /
    • 2015
  • The purpose of this study is to identify the aspect that the traffic distribution function changes, according to the direction of the datum line and the horizontal and vertical positions of the datum point applied when it is calculated. Targeting routes at the entrance of Mokpo Harbor, this study tested using AIS survey data of January 2013 the effects of the three variables-direction of the datum line(${\theta}$), horizontal position($\mathfrak{L}_H$) and vertical position($\mathfrak{L}_V$) on mean ($\bar{x}$) and standard deviation (${\delta}$). The test result showed that $\bar{x}$ and ${\delta}$ were changed according to the change of ${\theta}$, because the extracted sample data were changed according to ${\theta}$; and the changes of $\bar{x}$ and ${\delta}$ according to ${\theta}$ were drawn as the relation of the sine function' sum. In addition, it was found that setting up ${\theta}$ that the change value of ${\delta}$ becomes the least as the direction of the datum line was valid, to determine the optimum passage distribution function on complex waters with multiple branches of route. The result of this study is expected to be used as basic data to understand maritime traffic flow based on more quantified data of normal distribution and make decisions related to maritime traffic safety management.

State-Aware Re-configuration Model for Multi-Radio Wireless Mesh Networks

  • Zakaria, Omar M.;Hashim, Aisha-Hassan Abdalla;Hassan, Wan Haslina;Khalifa, Othman Omran;Azram, Mohammad;Goudarzi, Shidrokh;Jivanadham, Lalitha Bhavani;Zareei, Mahdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.146-170
    • /
    • 2017
  • Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.

Research for establishing a model of optimizing civilian withdrawal plan for the border area (접경지역 최적 주민철수 계획수립을 위한 모형 연구)

  • Jung, Jae Hwan;Yun, Ho Yeong;Jeong, Chang Soon;Kim, Kyung Sup
    • Journal of the Society of Disaster Information
    • /
    • v.14 no.2
    • /
    • pp.219-229
    • /
    • 2018
  • Purpose: This research proposes an optimization model for effective evacuation routing and scheduling of civilians near the border area when full-scale war threats heighten. Method: To reflect the reality, administrative unit network is created using Kruscal's Algorithm, Harmony Search, CCRP based on the geographical features, population, and traffic data of real cities, and then, optimal civilian evacuation routes are found. Results: Optimal evacuation routes and schedules are computed by repetitive experiments, and it is found that the scenario that minimizes the average civilian evacuation time is effective for the civilian evacuation plan. Conclusion: By using the civilian evacuation plan this research proposes, at the time of establishing the actual civilian evacuation plan, quantitative analysis is used for the effective plan making rather than only depending.

A Study on the Optimal Urban Bus Network Design Using the Set Covering Theory (Set Covering 이론을 이용한 시내버스 최적노선망 구축에 관한 연구)

  • 이승재;최재성;백혜선
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.2
    • /
    • pp.137-147
    • /
    • 1999
  • This paper studies on the optimal bus network design in the framework of the set covering theory. The theory enables to cover passenger's loading and alighting areas as the set, and maximize the covering set as much as possible. In other words, it calculates the minimal set of the bus routes for covering whole bus passengers demand. After the optimal set of the bus routes is generated by the set covering theory, multimodal traffic equilibrium assignment is used for evaluating the generated set in terms of passenger's mode and route choice behavior. Whilst most previous works on it have been based on analyzing a specific route in a limited area, this study seeks to optimize the whole bus network.

  • PDF