• Title/Summary/Keyword: 다중경로진입

Search Result 7, Processing Time 0.024 seconds

Load Balancing in MPLS Networks (MPLS 네트워크에서의 부하 분산 방안)

  • Kim, Sae-Rin;Song, Jeong-Hwa;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.893-902
    • /
    • 2002
  • MPLS enables efficient explicit routing, and thus provides great advantages in supporting traffic engineering. Exploiting this capability, we Propose a load balancing scheme which deploys a multipath routing. It is named LBM (Load Balancing in MPLS networks), and targets at efficient network utilization as well as performance enhancement. LBM establishes multiple LSP (Label Switched Path)s between a pair of ingress-egress routers, and distributes traffic over these LSPs at the new level. Its routing decision is based on both the length and the utilization of the paths. In order to enhance the efficiency of a link usage, a link is limited to be used by shorter paths as its utilization becomes higher Longer paths are considered to be candidate alternative paths as the utilization of shorter paths becomes higher. Simulation experiments are performed in order to compare the performance of LBM to that of static shortest path only scheme as well as the other representative dynamic multipath traffic distribution approaches. The simulation results show that LBM outperforms the compared approaches, and the performance gain is more significant when the traffic distribution among the ingress-egress pairs is non-uniform.

Route Optimization for Emergency Evacuation and Response in Disaster Area (재난지역에서의 대피·대응 동시수행을 위한 다중목적 긴급대피경로 최적화)

  • Kang, Changmo;Lee, Jongdal;Song, Jaejin;Jung, Kwangsu
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.34 no.2
    • /
    • pp.617-626
    • /
    • 2014
  • Lately, losses and damage from natural disasters have been increasing. Researchers across various fields in Korea are trying to come up with a response plan, but research for evacuation plans is still far from satisfactory. Hence this paper proposes a model that could find an optimized evacuation route for when disasters occur over wide areas. Development of the model used methods including the Dijkstra shortest path algorithm, feasible path method, genetic algorithm, and pareto efficiency. Computations used parallel computing (SPMD) for high performance. In addition, the developed model is applied to a virtual network to check the validity. Finally the adaptability of the model is verified on a real network by computating for Gumi 1stNational Industrial Complex. Computation results proved that this model is valid and applicable by comparison of the fitness values for before optimization and after optimization. This research can contribute to routing for responder vehicles as well as planning for evacuation by objective when disasters occur.

Collision-free Flight Planning for Cooperation of Multiple Unmanned Aerial Vehicles (다중 무인 항공기의 협동 작업을 위한 무 충돌 비행 계획)

  • Park, Jae-Byung
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.49 no.2
    • /
    • pp.63-70
    • /
    • 2012
  • The collision-free flight planning method based on the extended collision map is proposed for cooperation of multiple unmanned aerial vehicles (UAVs) in a common 3-dimensional workspace. First, a UAV is modeled as a sphere, taking its 3-D motions such as rolling into consideration. We assume that after entering the common workspace, the UAVs move along their straight paths until they depart from the workspace, and that the priorities of the UAVs are determined in advance. According to the assumptions, the collision detection problem between two spheres in $R^3$ can be reduced into the collision detection problem between a circle and a line in $R^2$. For convenience' sake and safety, the collision regions are approximated by collision boxes. Using the collision boxes, the entrance times of the UAVs are scheduled for collision avoidance among the UAVs. By this way, all UAVs can move in the common workspace without collisions with one another. For verifying the effectiveness of the proposed flight planning method, the simulation with 12 UAVs is carried out.

Passenger Flow Analysis at Transit Connecting Path (철도 환승 연결로에서의 여객 유동 해석)

  • Nam, Seongwon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.10
    • /
    • pp.415-420
    • /
    • 2020
  • Crowd flows occur in metropolitan railway transit stations, terminals, multiple buildings, and stadiums and are important in ensuring the safety as well as smooth flow of pedestrians in these facilities. In this study, the author developed a new computational analysis method for crowd flow dynamics and applied it to models of transit connecting paths. Using the analysis method, the potential value of the exit was assigned the smallest value, and the potential value of the surrounding grids gradually increased to form the overall potential map. A pathline map was then constructed by determining the direction vector from the grid with large potential value to the grid and small potential. These pathlines indicate basic routes of passenger flow. In all models of the analysis object, the pedestrians did not move to the first predicted shortest path but instead moved using alternative paths that changed depending on the situation. Even in bottlenecks in which pedestrians in both directions encountered each other, walking became much smoother if the entry time difference was dispersed. The results of the analysis show that a method for reducing congestion could be developed through software analysis such as passenger flow analysis without requiring hardware improvement work at the railway station.

A feedback effect assessment of the routes to hydrogen (수소생산 경로의 평가: 피드백 효과 모델)

  • Kim, Seong-Ho;Kim, Tae-Woon
    • 한국신재생에너지학회:학술대회논문집
    • /
    • 2006.06a
    • /
    • pp.47-50
    • /
    • 2006
  • 현재의 화석연료-기반 사회에서는 지구 온난화와 고유가 추세가 야기하는 경제적 피해, 에너지 안보우려, 세계 평화 위협 등에 자주 노출되고 있는 실정이다. 세계 각국은 이러한 화석연료 에너지원을 대체하는 환경-청정하고 기술-신뢰할 수 있으며 경제-감당할 수 있는 에너지 공급원인 수소를 기반으로 하는 미래의 수소-기반 사회로의 진입에 노력하고 있다. 특히, 청정한 에너지 운반체인 수소의 생산 기술 상업화가 더욱 더 절실히 요구되고 있다. 이 예비 연구에서는 이산화탄소 포획/저장 기술과 결합된 다양한 수소 생산 기술의 정량적인 예비 비교 평가가 수행되었다. 예비적인 비교 평가 기준으로 1) 이산화탄소 배출량: 2) 에너지 이용률; 3) 토지 점유율: 4) 수소 생산비용 등이 고려되었다. 이러한 기준에 따라 수소 생산 기술 가운데 네 가지 예비 기술 대안인 1) 원자력: 2) LNG; 3) 석탄: 4) 태양광 등이 비교되었다. 대안 기술의 비교 평가 체제로 계층 망형 구조-기반 되먹임 모델이 개발되었다. 이러한 수소생산 기술의 우선순위 선정 결과는 개별 대안 기술의 상대적인 장단점 및 기술적인 갭을 정량적으로 인식하는 데에 활용될 수 있다. 그러므로 이 예비 연구는 수소 생산 기술 연구자나 수소 경제 기획자한테 뿐만 아니라 이산화탄소 포획/저장 기술 개발자한테 도움이 되리라 본다.

  • PDF

A Study on Effectiveness and Warrant Analysis for Two-Way Left-Turn Lanes (양방향 좌회전차로(TWLTLs) 적용효과 분석 및 설치준거 연구)

  • Bae, Gwang-Su;Sim, Gwan-Bo;Song, Chang-Yong
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.6
    • /
    • pp.65-77
    • /
    • 2007
  • A two-way left-turn lane is a continuous center left-turn lane that could be used as a deceleration and refuge area for both directions of left-turning vehicles. TWLTL's have been used effectively for access management treatment when applied to a highway that has wide-spread left turning traffic demand and a high-density of side streets. In this study, an effective analysis was carried out using a computer-based simulation tool, VISSIM, in order to evaluate performance and safety effects of TWLTLs and develop a warrant. In conclusion, the results indicated that there was a remarkable decrease of through and left-turning vehicle travel time delay on the main road and improvement of traffic safety.

Automatic Node Configuration Protocol for Small Sized Mobile Ad-Hoc Networks (소규모 이동 애드혹 네트워크에서의 자동 노드 설정 프로토콜)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.1
    • /
    • pp.100-109
    • /
    • 2005
  • A Mobile Ad-Hoc Network (MANET) supports a multi-hop wireless network without any prepared base station (BS). The MANET is capable of building a mobile network automatically without any help from DHCP servers for address allocation or routers to forward or route messages. Many routing protocols have been proposed for the MANET, but these specify the most optimized or shortest path from a source to a destination, and they assume that nodes are pre-configured before communication. To make up for this, address allocation algorithms, such as MANETConf [1] and prophet address allocation algorithm [2], have been proposed. Especially, MANETConf proposes address allocation algorithm with duplication address check. In this paper, we present a dynamic node configuration protocol based on 2-tierd hierarchical network architecture for mobile ad-hoc network, modified from [1]. Especially, it reduces the number of broadcast message exchange between nodes when a new node somes into a network, which lessens network overhead, remarkably. This protocol is based on two-tired structure, and it ensures address allocation with simple duplication address defection mechanism.