• 제목/요약/키워드: routing integrated

검색결과 137건 처리시간 0.027초

Adaptive Differentiated Integrated Routing Scheme for GMPLS-based Optical Internet

  • Wei, Wei;Zeng, Qingji;Ye, Tong;Lomone, David
    • Journal of Communications and Networks
    • /
    • 제6권3호
    • /
    • pp.269-279
    • /
    • 2004
  • A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

TICN 전술백본망을 위한 라우팅 프로토콜 분석 (Analysis of Routing Protocol for Tactical Backbone of TICN)

  • 장동기;권태욱
    • 한국군사과학기술학회지
    • /
    • 제13권4호
    • /
    • pp.650-658
    • /
    • 2010
  • Recently Korea Army developed the TICN which is the next army tactical communication system. The TICN will support ability from under environment, strategy maneuver communication system of integrated army dimension overcome and NCW. If the IER(Information Exchange Requirement) phases 3 of the future application system, the analysis that a transmission ability of the TICN is the uncapable is govern. The TICN tactical backbone's ability is very important. Therefore, network efficiency index in application and analysis of the standard protocol for the data transmission guarantee are obliged. For the TICN tactical backbone, this paper analyzes of routing protocol efficiency index and compares to superiority of the OSPF(v2) and integrated IS-IS protocols in the tactical environment. Conclusively we proposed that integrated IS-IS protocol is more suitable for TICN backbone routing protocol.

A Fuzzy Vehicle Scheduling Problem

  • Han, Sang-Su;Lee, Kyo-Won;Hiroaki Ishii
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
    • /
    • pp.666-668
    • /
    • 1998
  • In this paper, we consider a bi-objective vehicle routing problem to minimize total distance traveled and maximize minimum integrated satisfaction level of selecting desirable routes in an fuzzy graph. The fuzzy graph reflects a real delivery situation in which there are a depot, some demand points, paths linking them, and distance and integrated satisfaction level are associated with each route. For solving the vi-objective problem we introduce a concept of routing vector and define non-dominated solution for comparing vectors. An efficient algorithm involving a selection method of non-dominated solutions based on DEA is proposed for the vehicle routing problem with rigid distance and integrated satisfaction level.

  • PDF

유전자알고리즘 및 발견적 방법을 이용한 차량운송경로계획 모델 (Integrated Vehicle Routing Model for Multi-Supply Centers Based on Genetic Algorithm)

  • 황흥석
    • 한국시뮬레이션학회논문지
    • /
    • 제9권3호
    • /
    • pp.91-102
    • /
    • 2000
  • The distribution routing problem is one of the important problems in distribution and supply center management. This research is concerned with an integrated distribution routing problem for multi-supply centers based on improved genetic algorithm and GUI-type programming. In this research, we used a three-step approach; in step 1 a sector clustering model is developed to transfer the multi-supply center problem to single supply center problems which are more easy to be solved, in step 2 we developed a vehicle routing model with time and vehicle capacity constraints and in step 3, we developed a GA-TSP model which can improve the vehicle routing schedules by simulation. For the computational purpose, we developed a GUI-type computer program according to the proposed methods and the sample outputs show that the proposed method is very effective on a set of standard test problems, and it could be potentially useful in solving the distribution routing problems in multi-supply center problem.

  • PDF

전술 네트워크 환경의 트래픽 특성을 고려한 통합 매트릭 기반 애드혹 라우팅 기법 (An Efficient Ad Hoc Routing Method for Tactical Networks using Integrated Metrics and Traffic Characteristics)

  • 노봉수;허미정;황기민;박귀순
    • 한국통신학회논문지
    • /
    • 제35권11B호
    • /
    • pp.1676-1684
    • /
    • 2010
  • 전술 네트워크 환경은 분산된 구조 하에 노드의 이동성이 보장되는 망 구조를 지향하며, 상용 통신망에 비해 상대적으로 열악한 무선 채널 환경의 특성이 고려되어야 한다. 이러한 환경에서 신뢰성 있는 데이터 전송을 위해서는 경로 결정 시 다양한 무선 채널 환경 요소 및 기동 노드의 상태를 자체적으로 인지하여, 전송 트래픽의 QoS(Quality of Service) 요구조건에 적합한 최적 경로 선정이 이루어져야 한다. 본 논문에서는 전술 네트워크 환경의 서비스 요구 조건 및 트래픽 특성을 정의하고, 이를 기반으로 라우팅 메트릭(Routing Metric)의 선별적인 선을 통해 최적경로를 산출함으로써 효율적 데이터 전송이 가능한 AODV-IMTC(Integrated Metrics and Traffic Characteristics)를 제안한다.

Combining Vehicle Routing with Forwarding : Extension of the Vehicle Routing Problem by Different Types of Sub-contraction

  • Kopfer, Herbert;Wang, Xin
    • 대한산업공학회지
    • /
    • 제35권1호
    • /
    • pp.1-14
    • /
    • 2009
  • The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the integrated operational planning and report on experiments for extending the plain Vehicle Routing Problem to a corresponding problem combining vehicle routing and request forwarding by means of different sub-contraction types. The extended problem is formalized as a mixed integer linear programming model and solved by a commercial mathematical programming solver. The computational results show tremendous costs savings even for small problem instances by allowing subcontracting. Additionally, the performed experiments for the operational transportation planning are used for an analysis of the decision on the optimal fleet size for own vehicles and regularly hired vehicles.

유무선 통합 환경에서 효과적인 멀티캐스트를 위한 라우팅 알고리즘 (Efficient Multicast Routing Algorithm in the Wire/wireless Integrated Environment)

  • 이재영;권영애;지홍일;최승권;조용환
    • 한국통신학회논문지
    • /
    • 제29권8A호
    • /
    • pp.937-941
    • /
    • 2004
  • 본 논문은 유무선 통합 환경에서 효과적인 멀티캐스트를 위한 라우팅 알고리즘을 제안한다. 새로운 알고리즘은 Agent내에 내장된 두 가지 버퍼(Storage_Buffer 및 Provisional_Buffer)를 이용하여 모바일 노드가 이동할 때 패킷의 손실을 방지할 수 있으며, JoinRequest메시지와 JoinAccept메시지를 이용하여 동적으로 멀티캐스트 트리 구조를 조절할 수 있다. 시뮬레이션 결과 새로운 알고리즘은 가장 절약된 대역폭으로 지연이 비교적 작은 멀티캐스트 트리를 구성할 수 있음을 증명하였다.

이동 애드 혹 네트워크의 Mobile IP 지원을 위한 네트워크 구조 및 라우팅 프로토콜 (Network Architecture and Routing Protocol for Supporting Mobile IP in Mobile Ad Hoc Networks)

  • 오훈;판안탄
    • 한국통신학회논문지
    • /
    • 제33권1A호
    • /
    • pp.24-35
    • /
    • 2008
  • 이동 애드혹 네트워크에 Mobile IP를 효율적으로 지원하기 위하여 인프라구조 네트워크와 이동 애드혹 네트워크의 트리 기반 통합 네트워크 구조를 제안하고, 통합 네트워크의 형성 및 관리를 위한 네트워크 구조 관리 프로토콜 및 통합 네트워크에 특화된 트리 기반 라우팅 프로토콜을 제안한다. 통합 네트워크는 두 이기종 네트워크를 연결하는 고정 인터넷 게이트웨이(IG)를 가지고 있으며, 이동 노드들은 IG와 직접 통신 거리에 있는 이동 노드들을 중심으로 작은 트리들을 형성한다. 새로운 노드는 먼저 임의의 트리에 가입하고 트리를 따라 자신의 흠 에이젼트(HA) 및 외부 에이젼트(FA)에 등록한다. 또한, 제안하는 라우팅 프로토콜은 트리 정보를 이용하여 효율적으로 경로를 설정한다. 주요 네트워크 전개 시나리오에 대한 시뮬레이션을 통해서 트리 기반 통합 네트워크의 효율성을 분석하였으며, 제안하는 라우팅 프로토콜을 기존의 Mobile IP 지원 AODV 프로토콜과 성능을 비교 분석하였다.

선박용 배관의 Auto-Routing을 위한 설계 전문가 시스템 (Pipe Atuo-Routing with Design Knowledge-base)

  • 강상섭;명세현;한순흥
    • 한국CDE학회논문집
    • /
    • 제2권1호
    • /
    • pp.1-10
    • /
    • 1997
  • Finding the optimum route of ship's pipes is complicated and time-consuming process. Experience of designers is the main tool in this process. To reduce design man-hours and human errors a design expert system shell and a geometric modeler is used to automate the design process. In this paper, a framework of the intelligent CAD system for pipe auto-routing is suggested, which consists of general-purpose expert system shell and a geometric modeler. The design expert system and the geometric modeling kernel have been integrated. The CADDS5 of Computervision is used as the overall CAD environment. The Nexpert Object of Neuron Data is used as the expert system shell. The CADDS5 ISSM is used as the interface that creates and modifies geometric models of pipes. Existing algorithms for the routing problem have been analyzed. Most of them are to solve the 2-D circuit routing problems. Ship piping system, specially within the engine room, is a complicated, large scale 3-D routing problem. Methods of expert system have been used to find the route of ship pipes on the main deck.

  • PDF

다수 물류기지 재고 및 경로 문제의 유전알고리즘에 의한 해법 (An Effective Genetic Algorithm for Solving the Joint Inventory and Routing Problem with Multi-warehouses)

  • 정재헌
    • 경영과학
    • /
    • 제29권3호
    • /
    • pp.107-120
    • /
    • 2012
  • In this paper we propose an effective genetic algorithm for solving the integrated inventory and routing problem of supply chain composed of multi-warehouses and multi-retailers. Unlike extant studies dealing with integrated inventory and routing problem of supply chain, our model incorporates more realistic aspect such as positive inventory at the multi-warehouses under the assumption of inventory policy of power of two-replenishment-cycle. The objective is to determine replenishment intervals for the retailers and warehouses as well as the vehicles routes so that the total cost of delivery and inventory cost is minimized. A notable feature of our algorithm is that the procedure for evaluating the fitness of objective function has the computational complexity closing to linear function. Computational results show effectiveness of our algorithm.