• Title, Summary, Keyword: Routing Algorithm

Search Result 1,318, Processing Time 0.051 seconds

Design and Implementation of a Genetic Algorithm for Global Routing (글로벌 라우팅 유전자 알고리즘의 설계와 구현)

  • 송호정;송기용
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.2
    • /
    • pp.89-95
    • /
    • 2002
  • Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

  • PDF

Design and Implementation of a Genetic Algorithm for Detailed Routing (디테일드 라우팅 유전자 알고리즘의 설계와 구현)

  • 송호정;송기용
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.3
    • /
    • pp.63-69
    • /
    • 2002
  • Detailed routing is a problem assigning each net to a track after global routing. The most popular algorithms for detailed routing include left-edge algorithm, dogleg algorithm, and greedy channel routing algorithm. In this paper we propose a genetic algorithm searching solution space for the detailed routing problem. We compare the performance of proposed genetic algorithm(GA) for detailed routing with that of greedy channel routing algorithm by analyzing the results of each implementation.

  • PDF

Performance Improvement on MPLS On-line Routing Algorithm for Dynamic Unbalanced Traffic Load

  • Sa-Ngiamsak, Wisitsak;Sombatsakulkit, Ekanun;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • /
    • pp.1846-1850
    • /
    • 2005
  • This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

  • PDF

A Study on the RSS Routing Algorithm for Asset Management System (자산관리 시스템을 위한 RSS 라우팅 알고리즘에 관한 연구)

  • Lee, Min-Goo;Kang, Jung-Hoon;Lim, Ho-Jung;Yoo, Jun-Jae;Yoon, Myung-Hyun
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.289-291
    • /
    • 2005
  • Even though a lot of routing algorithms have been proposed, an omnipotent algorithm of routing technique, which has optimal efficiency, does not exist. Therefore, A routing algorithm in a sensor network is an application oriented; the best effective routing algorithm depends on which application it is used to. In this paper, the routing algorithm is proposed for the purpose of monitoring a movement of Assets in office. This Paper proposes a new multi-hop routing algorithm, that is, RSS(Received Signal Strength) value which was used in a localization of sensor network is applied to routing algorithm.

  • PDF

A Wireless Location-Based Routing Algorithm in Multi-User Game Environments

  • Lee, Jong-Min;Kim, Seong-Woo;Lee, Jung-Hwa
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1733-1740
    • /
    • 2007
  • In this paper, we propose a wireless location-based routing algorithm which uses the location information of its neighbor nodes and a destination node. At first, the proposed routing algorithm forwards a packet to the X direction by selecting a closest node to its destination as a next hop in terms of the X coordinate until the packet reaches closely to the packet's destination. Then the packet is forwarded to the Y direction by selecting a closest node to its destination in terms of the Y coordinate. We use a back off mechanism in case that a next hop cannot be found using the proposed routing algorithm, which resolves loops while forwarding. The experimental results show that the proposed routing algorithm performs well like the existing routing algorithms Ad hoc On-demand Distance Vector and Greedy Perimeter Stateless Routing. It is expected to use the proposed routing algorithm in the digital battlefield of military environments and survival games of commercial environments.

  • PDF

A Novel Multi-Path Routing Algorithm Based on Clustering for Wireless Mesh Networks

  • Liu, Chun-Xiao;Zhang, Yan;Xu, E;Yang, Yu-Qiang;Zhao, Xu-Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1256-1275
    • /
    • 2014
  • As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

Enhanced Routing Algorithm for ZigBee using a Family Set of a Destination Node (목적지의 가족집합을 이용한 향상된 ZigBee 라우팅 알고리즘)

  • Shin, Hyun-Jae;Ahn, Sae-Young;Jo, Young-Jun;An, Sun-Shin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.12
    • /
    • pp.2329-2336
    • /
    • 2010
  • Hierarchical tree routing is a inefficient routing method of transmitting data in a wireless sensor network. Zigbee routing which is made to improve inefficiency of the hierarchical tree routing only fulfills the tree routing when a destination node don't exists in neighbor nodes of a router. We suggest a TFSR algorithm that is improved more than the zigbee routing. The TFSR algorithm generates a family set included a parent node and child nodes and over of a destination node, and uses this information. According to simulation results, the TFSR algorithm reduce routing costs over 30 percent in comparison with the hierarchical tree routing and the zigbee routing.

A Study of Survivable Alternate Routing Algorithm (생존성있는 대체 경로 라우팅 알고리즘 연구)

  • Park, Young-Chul
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.7
    • /
    • pp.535-539
    • /
    • 2007
  • We study an degree of alternativeness and a survivability of alternate routing algorithm in mobile ad-hoc tactical communication networks. The common channel signaling scheme is used and flood search routing algorithm is used for analysis. We also study a connectivity performance for flood search routing, restricted flooding and hybrid routing. From the results we expect low blocking probabilities with alternate routing and the conventional flood search routing shows better connectivity performance which results in high survivability.

Flow Holding Time based Advanced Hybrid QoS Routing Link State Update in QoS Routing

  • Cho, Kang Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.4
    • /
    • pp.17-24
    • /
    • 2016
  • In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

Implementation of Node Transition Probability based Routing Algorithm for MANET and Performance Analysis using Different Mobility Models

  • Radha, Sankararajan;Shanmugavel, Sethu
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.202-214
    • /
    • 2003
  • The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.