• Title/Summary/Keyword: Process Routing

Search Result 381, Processing Time 0.027 seconds

The Design of PCB Automatic Routing System using the Shortest Path (최단경로를 이용한 PCB 자동 배선 시스템 설계)

  • 우경환;이용희;임태영;이천희
    • Proceedings of the IEEK Conference
    • /
    • 2001.06b
    • /
    • pp.257-260
    • /
    • 2001
  • Routing region modeling methods for PCB auto-routing system in Shape based type(non-grid method) used region process type and the shape located in memory as a individual element, and this element consumed small memory due to unique data size. In this paper we design PCB(Printed Circuit Board) auto-routing system using the auction algorithm method that 1) Could be reached by solving the shortest path from single original point to various destination, and 2) Shaped based type without any memory dissipation with the best speed. Also, the auto-routing system developed by Visual C++ in Window environment, and can be used in IBM Pentium computer or in various individual PC system.

  • PDF

SNMP Based Routing Process for Hand Handoff (Fast Handoff를 위한 SNMP 기반의 라우팅 프로세스)

  • 유상훈;박수현;백두권
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2003.11a
    • /
    • pp.139-144
    • /
    • 2003
  • Mobile Node has to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). Fast Handoff is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to quarantee QoS as a main issue in mobile IP research area. Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

  • PDF

Modified PSO Based Reactive Routing for Improved Network Lifetime in WBAN

  • Sathya, G.;Evanjaline, D.J.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.139-144
    • /
    • 2022
  • Technological advancements taken the health care industry by a storm by embedding sensors in human body to measure their vitals. These smart solutions provide better and flexible health care to patients, and also easy monitoring for the medical practitioners. However, these innovative solutions provide their own set of challenges. The major challenge faced by embedding sensors in body is the issue of lack of infinite energy source. This work presents a meta-heuristic based routing model using modified PSO, and adopts an energy harvesting scheme to improve the network lifetime. The routing process is governed by modifying the fitness function of PSO to include charge, temperature and other vital factors required for node selection. A reactive routing model is adopted to ensure reliable packet delivery. Experiments have been performed and comparisons indicate that the proposed Energy Harvesting and Modified PSO (EHMP) model demonstrates low overhead, higher network lifetime and better network stability.

The Case Study for Path Selection Verification of IGP Routing Protocol (IGP 라우팅 프로토콜의 경로선택 검증을 위한 구현 사례)

  • Kim, No-Whan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.197-204
    • /
    • 2014
  • RIP, EIGRP, OSPF are the interior gateway protocol for sending and receiving routing information among routers in AS(Autonomous System). Various path selection methods using the metric in regard to them have been studied recently but there are few examples that the contents learners understand theoretically are verified by the practice. The Best Path is determined by calculating the Cost value based on the relevant topology of each routing protocol. After implementing the virtual network, it is certain that the results tracking and verifying the relevant path selection of each routing protocol are consistent with the Best Path. If methods suggested in this paper are applied properly, the relevant path selection process of routing protocol can be understood systematically. And it is expected that the outstanding results of learning will be able to be achieved.

Power/Clock Network-Aware Routing Congestion Estimation Methodology at Early Design Stage (설계 초기 단계에서 전력/클록 네트워크를 고려한 라우팅 밀집도 예측 방법론)

  • Ahn, Byung-Gyu;Chong, Jong-Wha
    • Journal of IKEEE
    • /
    • v.16 no.1
    • /
    • pp.45-50
    • /
    • 2012
  • This paper proposes the methodology to estimate the routing congestion of modern IC quickly and accurately at the early stage of the design flow. The occurrence of over-congestion in the routing process causes routing failure which then takes unnecessary time to re-design the physical design from the beginning. The precise estimation of routing congestion at the early design stage leads to a successful physical design that minimizes over-congestion which in turn reduces the total design time cost. The proposed estimation method at the block-level floorplan stage measures accurate routing congestion by using the analyzed virtual interconnections of inter/intra blocks, synthesized virtual power/ground and clock networks.

Pipe Routing using Reinforcement Learning on Initial Design Stage (선박 초기 설계 단계에서의 강화학습을 이용한 배관경로 설계)

  • Shin, Dong-seon;Park, Byeong-cheol;Lim, Chae-og;Oh, Sang-jin;Kim, Gi-yong;Shin, Sung-chul
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.57 no.4
    • /
    • pp.191-197
    • /
    • 2020
  • Pipe routing is a important part of the whole design process in the shipbuilding industry. It has a lot of constraints and many tasks that should be considered together. Also, the result of this stage affects follow-up works in a wide scope. Therefore, this part requires skilled designers and a lot of time. This study aims to reduce the workload and time during the design process by automating the pipe route design on initial stage. In this study, the reinforcement learning was used for pipe auto-routing. Reinforcement learning has the advantage of dynamically selecting routes, unlike existing algorithms. Therefore, it is suitable for the pipe routing design in ship design process which is frequently modified. At last, the effectiveness of this study was verified by comparing pipelines which were designed by piping designer and reinforcement learning results.

Method for Distributed Routing of a Personal Rapid Transit Vehicle using In-Track process (In-Track 방식 PRT 차량의 분산식 경로 제어 방법)

  • Jang, Young-Hwan;Kim, Mal-Soo;Ryou, Myung-Seon;Kim, Jae-Sik;Choi, Seung-Gab
    • Proceedings of the KSR Conference
    • /
    • 2009.05a
    • /
    • pp.2023-2029
    • /
    • 2009
  • The PRT can be divided into In-Track and On-Board according to propulsion method. In process of In-Track, vehicles driven by LIMs(Linear Induction Motor) which are installed in Guideway. Central Controller, which control whole machine, must control speed and direction of all vehicles. In this case, as vehicle increases, Central Controller will overload. If Central Controller fails, all vehicle stops. To avoid this problem, processing of Central Controller must be distributed. This paper introduces method of Distributed Routing. Method of Distributed Routing will provide safety and efficiency for PRT System.

  • PDF

Improved AODV Routing Protocol Considering the Link Quality of Wireless Transmission Environments (무선 전송환경의 링크품질을 고려한 개선된 AODV 라우팅프로토콜)

  • Lee, Tae-Hoon;Jeun, Sung-Woo;Kim, Young-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.10
    • /
    • pp.1903-1911
    • /
    • 2016
  • As interest in MANET is increasing nowadays, research upon an efficient MANET routing protocol is actively under way. A LQA(Link Qualty Aware)-AODV routing protocol to deal with frequent changes of topology and wireless link variations under tactical operating conditions is proposed in this paper. The suggested LQA-AODV takes into account the channel capacity of each hop during the route request process of the traditional AODV protocol. In detail, LQA-AODV adds a channel capacity cost value to the RREQ message format that occurs during the routing process of the existing AODV Routing Protocol causing the accumulated channel capacity cost values of each sections to be compared before establishing a route. To verify the performance of LQA-AODV, NS2.35 was utilized and the Link-Quality Model was applied in order to reflect the tactical wireless environment. The simulation compares and analyzes LQA-AODV and the existing AODV, showing a large improvement over the traditional AODV in regards to the Packet Delivery Ratio, and End-to-End Delay.

Protocol Design for Wavelength Routing in Optical Ring Access Networks (광링액세스네트워크에서의 파장 라우팅을 위한 프로토콜 설계)

  • Lee, Sang-Wha
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.4
    • /
    • pp.2382-2392
    • /
    • 2014
  • In this paper, a new data frame structure for wavelength routing in optical ring access network(ORAN) is designed and the functions of each field in the frame are defined. In addition, the IP packet transmission to the network layer corresponding to the newly proposed structure of the protocol stack is newly presented. Tha data transmission protocol design techniques of ORAN was proposed. IP packet and broadcasting packet transmission within the sub-network, and the IP packet transmission to other sub-network was shown through the process illustration. In the process, the encapsulation and framing process of the wavelength information to routing has been described in detail. And each step takes place in a packet transfer process is demonstrated. A ring type optical access network protocol is not yet research field. ORAN data transfer protocol to send/receive module structure of a subscriber node and a control node of the two rings which analyzed the results are shown. The high-speed Internet solution is proposed that by using wavelength routing the packet transport protocol for ORAN is designed.

Efficient Flooding Methods for Link-state Routing Protocols (Link-state 라우팅 프로토콜을 위한 효율적인 플러딩 방법)

  • Kim, Jeong-Ho;Lee, Seung-Hwan;Rhee, Seung-Hyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.760-766
    • /
    • 2012
  • In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.