• Title/Summary/Keyword: Multiple Routing

Search Result 382, Processing Time 0.023 seconds

Augmenting Path Algorithm for Routing Telephone Calls Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.6
    • /
    • pp.77-81
    • /
    • 2016
  • This paper deals with the optimization problem that decides the routing of connection between multi-source and multi-sink. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with $O(mn)^2$ time complexity to solve the optimal solution for this problem. This paper suggests the simple method that assigns the possible call flow quantity to augmenting path of ($s_i,t_i$) city pair satisfied with demand of ($s_i,t_i$). The proposed algorithm can be get the same optimal solution as LP for experimental data.

A War-time Engineering Equipment's Assignment and Operation Model (전시 공병장비 할당 및 운용 모형)

  • Jae-Hyeong Lee;Moon-Gul Lee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.46 no.4
    • /
    • pp.294-303
    • /
    • 2023
  • During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows of required start and completion time. Our approach focused on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.

An Analysis of the Multicast models for the Internet (인터넷 상에서의 멀티캐스트 구현을 위한 프로토콜 분석 및 네트워크 모델)

  • 최성미;김상언홍경표
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.23-26
    • /
    • 1998
  • IP multicasting efficiently delivers a single datagram to multiple hosts. Its benefits have been demonstrated over the past six years on MBONE. Now, as the number of subnets in the MBONE are increased, the MBONE can no longer be managed as a single, flat routing domain. Its routing scalability must be improved. In this paper, to solve problem of routing scalability, serveral new multicast models for the internet are explained.

  • PDF

Differentiated Services Based Admission Control and Multi Path Routing Algorithm for IPv6

  • Farooq, Muhammad Omer;Aziz, Sadia
    • Journal of Information Processing Systems
    • /
    • v.5 no.2
    • /
    • pp.97-104
    • /
    • 2009
  • In this paper we propose a Differentiated Services Based Admission Control and Routing Algorithm for IPv6 (ACMRA). The basic DiffServ architecture lacks an admission control mechanism, the injection of more QoS sensitive traffic into the network can cause congestion at the core of the network. Our Differentiated Services Based Admission Control and Routing Algorithm for IPv6 combines the admission control phase with the route finding phase, and our routing protocol has been designed in a way to work alongside DiffServ based networks. The Differentiated Services Based Admission Control and Routing Algorithm for IPv6 constructs label switched paths in order to provide rigorous QoS provisioning. We have conducted extensive simulations to validate the effectiveness and efficiency of our proposed admission control and routing algorithm. Simulation Results show that the Differentiated Services Based Admission Control and Routing Algorithm for IPv6 provides an excellent packet delivery ratio, reduces the control packets' overhead, and makes use of the resources present on multiple paths to the destination network, while almost each admitted flow shows compliance with its Service Level Agreement.

Analysis of MANET's Routing Protocols, Security Attacks and Detection Techniques- A Review

  • Amina Yaqoob;Alma Shamas;Jawwad Ibrahim
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.6
    • /
    • pp.23-32
    • /
    • 2024
  • Mobile Ad hoc Network is a network of multiple wireless nodes which communicate and exchange information together without any fixed and centralized infrastructure. The core objective for the development of MANET is to provide movability, portability and extensibility. Due to infrastructure less network topology of the network changes frequently this causes many challenges for designing routing algorithms. Many routing protocols for MANET have been suggested for last few years and research is still going on. In this paper we review three main routing protocols namely Proactive, Reactive and Hybrid, performance comparison of Proactive such as DSDV, Reactive as AODV, DSR, TORA and Hybrid as ZRP in different network scenarios including dynamic network size, changing number of nodes, changing movability of nodes, in high movability and denser network and low movability and low traffic. This paper analyzes these scenarios on the performance evaluation metrics e.g. Throughput, Packet Delivery Ratio (PDR), Normalized Routing Load(NRL) and End To-End delay(ETE).This paper also reviews various network layer security attacks challenge by routing protocols, detection mechanism proposes to detect these attacks and compare performance of these attacks on evaluation metrics such as Routing Overhead, Transmission Delay and packet drop rates.

Virtual Source and Flooding-Based QoS Unicast and Multicast Routing in the Next Generation Optical Internet based on IP/DWDM Technology (IP/DWDM 기반 차세대 광 인터넷 망에서 가상 소스와 플러딩에 기초한 QoS 제공 유니캐스트 및 멀티캐스트 라우팅 방법 연구)

  • Kim, Sung-Un;Park, Seon-Yeong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.1
    • /
    • pp.33-43
    • /
    • 2011
  • Routing technologies considering QoS-based hypermedia services have been seen as a crucial network property in next generation optical Internet (NGOI) networks based on IP/dense-wavelength division multiplexing (DWDM). The huge potential capacity of one single fiber. which is in Tb/s range, can be exploited by applying DWDM technology which transfers multiple data streams (classified and aggregated IP traffics) on multiple wavelengths (classified with QoS-based) simultaneously. So, DWDM-based optical networks have been a favorable approach for the next generation optical backbone networks. Finding a qualified path meeting the multiple constraints is a multi-constraint optimization problem, which has been proven to be NP-complete and cannot be solved by a simple algorithm. The majority of previous works in DWDM networks has viewed heuristic QoS routing algorithms (as an extension of the current Internet routing paradigm) which are very complex and cause the operational and implementation overheads. This aspect will be more pronounced when the network is unstable or when the size of network is large. In this paper, we propose a flooding-based unicast and multicast QoS routing methodologies(YS-QUR and YS-QMR) which incur much lower message overhead yet yields a good connection establishment success rate. The simulation results demonstrate that the YS-QUR and YS-QMR algorithms are superior to the previous routing algorithms.

Improved Global Placement Technique to Relieve Routing Congestion (배선 밀집도를 완화하기 위한 개선된 광역배치 기법)

  • Oh, Eun-Kyung;Hur, Sung-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.431-435
    • /
    • 2008
  • Since previous work CDP(Congestion Driven Placement) [1] considers all possible directions to move every cell in nets which contribute highly to routing congestion, it consumes CPU time a lot. In this paper, we propose a faster global placement technique, so called ICDGP(Improved Congestion Driven Global Placement) to relieve the routing congestion. ICDGP uses the force-directed method to determine the target locations of the cells in the nets in the congested spots, and considers only to move the target location for each cell. If moving multiple cells simultaneously is considered better than moving each cell one by one it moves multiple cells simultaneously. By experimental results, ICDGP produces less congested placement than CDP does. Particularly, the CPU time is reduced by 36% on average.

A Dispatching and Routing Algorithm for Personal Rapid Transit by Considering Congestion (정체를 고려한 Personal Rapid Transit 배차 및 경로 계획 알고리즘)

  • Han, Chung-Kyun;Kim, Baek-Hyun;Jeong, Rag-Gyo;Ha, Byung-Hyun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.11
    • /
    • pp.1578-1586
    • /
    • 2015
  • Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

Energy Efficient Routing Protocol Based on PEGASIS in WSN Environment (WSN 환경에서 PEGASIS 기반 에너지 효율적 라우팅 프로토콜)

  • Byoung-Choul Baek;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.4
    • /
    • pp.579-586
    • /
    • 2023
  • A wireless sensor network (WSN) has limited battery power because it is used wirelessly using low-cost small sensors. Since the battery cannot be replaced, the lifespan of the sensor node is directly related to the lifespan of the battery, so power must be used efficiently to maximize the lifespan of the network. In this study, based on PEGASIS, a representative energy-efficient routing protocol, we propose a protocol that classifies layers according to the distance from the sink node and configures multiple chains rather than one chain. The proposed protocol can increase network lifespan by reducing the transmission distance between nodes to prevent unnecessary energy consumption.

Design of efficient location system for multiple mobile nodes in the wireless sensor network

  • Kim, Ki-Hyeon;Ha, Bong-Soo;Lee, Yong-Doo;Hong, Won-Kee
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.81-84
    • /
    • 2005
  • Various design schemes for network using wireless sensor nodes have been widely studied on the several application areas ranging from the real world information collection to environmental monitor. Currently, the schemes are focused on the design of sensor network for low power consumption, power-aware routing protocol, micro miniature operating system and sensor network middleware. The indoor localization system that identifies the location of the distributed nodes in a wireless sensor network requires features dealing with mobility, plurality and other environmental constraints of a sensor node. In this paper, we present an efficient location system to cope with mobility of multiple mobile nodes by designing a location handler that processes location information selectively depending on the nodes' density in a specific region. In order to resolve plurality of multiple mobile nodes, a routing method for the location system is also proposed to avoid the occurrence of overlapped location data.

  • PDF