• Title/Summary/Keyword: Optimum routing

Search Result 67, Processing Time 0.023 seconds

A Detailed Routing Algorithm for Switch Boxes

  • Hongbing Fan;Jiping Liu;Dinah de Porto;Wu, Yu-Liang
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1732-1735
    • /
    • 2002
  • A $\kappa$-side switch box with W terminals on each side is said to be hyper universal, denoted by ($\kappa$, W)-HUSB, if it is routable for any global .outing with density at most W. In [5], we have proposed a switch box design strategy and designed a near optimum (4, W)-HUSB F(W) with 6.W switches. In this paper, we design, analyze and implement an efficient detailed routing algorithm for the S-box F(W). This router. can accommodate all routing requirement topologies.

  • 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

Performance Evaluation of Routing Algorithms based on Optimum Transmission Range in Tactical MANETs (전술 MANET의 최적통달거리 기반 라우팅 알고리즘 성능 연구)

  • Choi, Hyungseok;Lee, JaeYong;Kim, ByungChul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.10-17
    • /
    • 2014
  • This paper presents an analytical method for finding the optimum transmission range in mobile ad hoc networks(MANETs). The results are particularly useful for the operation of military networks, as the transmission range affects the traffic throughput of user & routing traffic, delay, and frequency interference. When the conditions of tactical environment are applied in our simulations and the above-mentioned performances are analyzed, we find the OLSR protocol is more excellent. Plus, we compare the results of MANETs performance when applying optimum transmission range and the default transmission range(10km), and analyze the reasonability of the calculation of optimum transmission range proposed by this paper.

An Efficient Routing Path Search Technique in Power Line Communication (효율적인 전력선통신 라우팅 경로 탐색 기법)

  • Seo, Chung-Ki;Kim, Jun-Ha;Jung, Joonhong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.9
    • /
    • pp.1216-1223
    • /
    • 2018
  • As field of application of AMI, AMR uses the power line as the primary means of communication. PLC has a big merit without installation of the new network for communication in a field using the power line which is the existing equipment. However, there is a serious obstacle in commercialization for the instability by noise and communication environment. Therefore, the technical method for maintaining the communication state which overcome such demerit and was stabilized is required essentially. PLC routing technology is applied with the alternative plan now. The routing technology currently managed by field includes many problems by applying the algorithm of an elementary level. PLC routing path search problem can be modeled with the problem of searching for optimal solution as similar to such as optimal routing problem and TSP(Travelling salesman problem). In this paper, in order to search for a PLC routing path efficiently and to choose the optimal path, GA(Genetic Algorithm) was applied. Although PLC was similar in optimal solution search as compared with typical GA, it also has a difference point by the characteristic of communication, and presented the new methodology over this. Moreover, the validity of application technology was verified by showing the experimental result to which GA is applied and analyzing as compared with the existing algorithm.

A Study on Optimum of IPTV Video Quality by Routing Protocols in Next Generation IP Network (차세대 IP Network에서 Routing protocol에 따른 IPTV영상 최적화에 대한 연구)

  • Kim, Kwang-Hyun;Park, Seung-Seob
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1408-1414
    • /
    • 2008
  • Development of internet and IP network technology creates various fusion services such as IPTV, VoIP and so on. Next generation IPv6 which will solve lack of IP is very important on IPTV which needs best quality of service about security, QoS and bandwidth. In this paper, we suggest a routing protocol standard in which we can service best quality of image using PSNR which is most commonly used as a measure of quality of reconstruction in image on IPv6 network.

CACHE:Context-aware Clustering Hierarchy and Energy efficient for MANET (CACHE:상황인식 기반의 계층적 클러스터링 알고리즘에 관한 연구)

  • Mun, Chang-min;Lee, Kang-Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.571-573
    • /
    • 2009
  • Mobile Ad-hoc Network(MANET) needs efficient node management because the wireless network has energy constraints. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. Previously proposed a hybrid routing CACH prolong the network lifetime and decrease latency. However the algorithm has a problem when node density is increase. In this paper, we propose a new method that the CACHE(Context-aware Clustering Hierarchy and Energy efficient) algorithm. The proposed analysis could not only help in defining the optimum depth of hierarchy architecture CACH utilize, but also improve the problem about node density.

  • PDF

Application of Ant System Algorithm on Parcels Delivery Service in Korea (국내택배시스템에 개미시스템 알고리즘의 적용가능성 검토)

  • Jo, Wan-Kyung;Rhee, Jong-Ho
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.4 s.82
    • /
    • pp.81-91
    • /
    • 2005
  • The Traveling Salesman Problem(TSP) is one of the NP-complete (None-deterministic Polynomial time complete) route optimization problems. Its calculation time increases very rapidly as the number of nodes does. Therefore, the near optimum solution has been searched by heuristic algorithms rather than the real optimum has. This paper reviews the Ant System Algorithm(ANS), an heuristic algorithm of TSP and its applicability in the parcel delivery service in Korea. ASA, which is an heuristic algorithm of NP-complete has been studied by M. Dorigo in the early 1990. ASA finds the optimum route by the probabilistic method based on the cumulated pheromone on the links by ants. ASA has been known as one of the efficient heuristic algorithms in terms of its calculation time and result. Its applications have been expanded to vehicle routing problems, network management and highway alignment planning. The precise criteria for vehicle routing has not been set up in the parcel delivery service of Korea. Vehicle routing has been determined by the vehicle deriver himself or herself. In this paper the applicability of ASA to the parcel delivery service has been reviewed. When the driver s vehicle routing is assumed to follow the Nearest Neighbor Algorithm (NNA) with 20 nodes (pick-up and drop-off places) in $10Km{\times}10Km$ service area, his or her decision was compared with ASA's one. Also, ASA showed better results than NNA as the number of nodes increases from 10 to 200. If ASA is applied, the transport cost savings could be expected in the parcel delivery service in Korea.

Forecasting Air Freight Demand in Air forces by Time Series Analysis and Optimizing Air Routing Problem with One Depot (군 항공화물수요 시계열 추정과 수송기 최적화 노선배정)

  • Jung, Byung-Ho;Kim, Ik-Ki
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.89-97
    • /
    • 2004
  • The Korea Air Force(KAF) has operated freight flights based on the prefixed time and route schedule, which is adjusted once in a month. The major purpose of the operation of freight flights in the KAF is to distribute necessary supplies from the home air base to other air bases. The secondary purpose is to train the young pilots to get more experiences in navigation. Each freight flight starts from and returned to the home air base everyday except holidays, while it visits several other air bases to accomplish its missions. The study aims to forecast freight demand at each base by using time series analysis, and then it tried to optimize the cost of operating flights by solving vehicle routing problem. For more specifically, first, several constraints in operating cargos were defined by reviewing the Korea Air Force manuals and regulation. With such constraints, an integer programming problem was formulated for this specific routing problem allowing several visits in a tour with limitation of maximum number of visits. Then, an algorithm to solve the routing problem was developed. Second, the time series analysis method was applied to find out the freight demand at each air base from the mother air base in the next month. With the forecasted demands and the developed solution algorithm, the oprimum routes are calculated for each flight. Finally, the study compared the solved routing system by the developed algorithm with the existing routing system of the Korea Air Force. Through this comparison, the study proved that the proposed method can provide more (economically) efficient routing system than the existing system in terms of computing and monetary cost. In summary, the study suggested objective criteria for air routing plan in the KAF. It also developed the methods which could forecast properly the freight demands at each bases by using time series analysis and which could find the optimum routing which minimizes number of cargo needed. Finally, the study showed the economical savings with the optimized routing system by using real case example.

PS-NC Genetic Algorithm Based Multi Objective Process Routing

  • Lee, Sung-Youl
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.4
    • /
    • pp.1-7
    • /
    • 2009
  • This paper presents a process routing (PR) algorithm with multiple objectives. PR determines the optimum sequence of operations for transforming a raw material into a completed part within the available machining resources. In any computer aided process planning (CAPP) system, selection of the machining operation sequence is one of the most critical activities for manufacturing a part and for the technical specification in the part drawing. Here, the goal could be to generate the sequence that optimizes production time, production cost, machine utilization or with multiple these criteria. The Pareto Stratum Niche Cubicle (PS NC) GA has been adopted to find the optimum sequence of operations that optimize two conflicting criteria; production cost and production quality. The numerical analysis shows that the proposed PS NC GA is both effective and efficient to the PR problem.

DEVELOPMENT OF A REAL-TIME FLOOD FORECASTING SYSTEM BY HYDRAULIC FLOOD ROUTING

  • Lee, Joo-Heon;Lee, Do-Hun;Jeong, Sang-Man;Lee, Eun-Tae
    • Water Engineering Research
    • /
    • v.2 no.2
    • /
    • pp.113-121
    • /
    • 2001
  • The objective of this study is to develop a prediction mode for a flood forecasting system in the downstream of the Nakdong river basin. Ranging from the gauging station at Jindong to the Nakdong estuary barrage, the hydraulic flood routing model(DWOPER) based on the Saint Venant equation was calibrated by comparing the calculated river stage with the observed river stages using four different flood events recorded. The upstream boundary condition was specified by the measured river stage data at Jindong station and the downstream boundary condition was given according to the tide level data observed at he Nakdong estuary barrage. The lateral inflow from tributaries were estimated by the rainfall-runoff model. In the calibration process, the optimum roughness coefficients for proper functions of channel reach and discharge were determined by minimizing the sum of the differences between the observed and the computed stage. In addition, the forecasting lead time on the basis of each gauging station was determined by a numerical simulation technique. Also, we suggested a model structure for a real-time flood forecasting system and tested it on the basis of past flood events. The testing results of the developed system showed close agreement between the forecasted and observed stages. Therefore, it is expected that the flood forecasting system we developed can improve the accuracy of flood forecasting on the Nakdong river.

  • PDF