• 한국통신학회논문지
• /
• 제29권5B호
• /
• pp.508-519
• /
• 2004

이 논문에서는 MPLS를 사용한 인터넷 트래픽 엔지니어링에 사용될 수 있는 다중경로 한계조건 기반 라우팅 알고리즘을 제안한다. 기존에 사용되던 한계조건 기반 최단경로 라우팅 알고리즘은 트래픽 엔지니어링의 중요한 요소 중에 하나인 대역폭 한계조건이 큰 간을 가지는 경우에는 조건을 만족하는 경로를 찾지 못할 확률이 높아진다. 제안된 다중경로 알고리즘은 대역폭 한계조건을 만족하는 하나의 경로를 찾을 수 없는 경우, 대역폭 조건을 여러 개의 작은 값으로 나누어 각각의 작은 대역폭 한계조건에 대해 다중경로를 찾는 알고리즘이다. 시뮬레이션을 통하여 제안한 알고리즘을 사용할 경우 주어진 네트웍 상황과 대역폭 한계 조건에서 더 높은 경로설정 성공확률을 나타내며, 네트웍 자원 이용률도 개선되는 것을 보였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1098-1100
• /
• 2005

The floorplanning problem is an essential design step in VLSI layout design and it is how to place rectangular modules as density as possible. And then, as the DSM advances, the VLSI chip becomes more congested even though more metal layers are used for routing. Usually, a VLSI chip includes several buses. As design increases in complexity, bus routing becomes a heavy task. To ease bus routing and avoid unnecessary iterations in physical design, we need to consider bus planning in early floorplanning stage. In this paper, we propose a floorplanning method for topological constraint consisting of bus constraint and memory constraint. The proposed algorithms based on Genetic Algorithm(GA) is adopted a sequence pair. For selection control, new objective functions are introduced for topological constraint. Studies on floor planning and cell placement have been reported as being applications of GA to the LSI layout problem. However, no studies have ever seen the effect of applying GA in consideration of topological constraint. Experimental results show improvement of bus and memory constraint.

• ETRI Journal
• /
• 제28권6호
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• 대한전자공학회논문지TC
• /
• 제40권12호
• /
• pp.27-37
• /
• 2003

다양한 실시간 멀티미디어 서비스들을 전송하는 DWDM(Dense-Wavelength Division Multiplexing) 기반의 차세대 인터넷에서는 DWDM망의 다양한 QoS(Quality of Service) 파라미터들을 복합적으로 고려하는 QoS RWA(Routing and Wavelength Assignment) 방식으로의 접근이 요구되어진다. 그러나 일반적으로 다중 제약조건을 만족하는 최적의 경로를 찾는 것은 NP-complete한 문제로서, 파장 연속성가지 고려해야 하는 DWDM 망에서는 QoS RWA 분야에 대한 연구가 아직 미비한 실정이다. 따라서 본 논문에서는 QoS RWA 수행하기 위한 방안으로 flooding 기법을 확장하여 경로 설정에 대한 계산과 구현을 간소화시킨 QPR(Qualified Path Routing) 알고리즘을 제안한다. 또한 QPR 알고리즘을 기반으로 광신호 품질, 광자원(파장), 생존성 및 파장 연속성까지 고려하여 차등적인 QoS 지원하는 QoS-based RWA 알고리즘을 제안하며, 블록률, 라우팅 오버헤드 및 생존성 측면의 성능 평가를 통해 제안된 알고리즘들의 효율성을 검증하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권6호
• /
• pp.1357-1378
• /
• 2013

Energy constraint of wireless sensor networks makes energy saving and prolonging the network lifetime become the most important goals of routing protocols. In this paper, we propose an Energy Efficient Chain-based Routing Protocol (EECRP) for wireless sensor networks to minimize energy consumption and transmission delay. EECRP organizes sensor nodes into a set of horizontal chains and a vertical chain. Chain heads are elected based on the residual energy of nodes and distance from the header of upper level. In each horizontal chain, sensor nodes transmit their data to their own chain head based on chain routing mechanism. EECRP also adopts a chain-based data transmission mechanism for sending data packets from the chain heads to the base station. The simulation results show that EECRP outperforms LEACH, PEGASIS and ECCP in terms of network lifetime, energy consumption, number of data messages received at the base station, transmission delay and especially energy${\times}$delay metric.

• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• 대한전자공학회논문지TC
• /
• 제43권8호
• /
• pp.1-14
• /
• 2006

실시간 멀티미디어 서비스들을 전송하는 DWDM(Dense-Wavelength Division Multiplexing) 기반의 차세대 인터넷에서는 DWDM 망의 다양한 QoS(Quality of Service) 파라미터들을 복합적으로 고려하는 QoS RWA(Routing and Wavelength Assignment) 방식으로의 접근이 요구되어진다. 본 논문은 flooding 방법을 기반으로 하고, 다중제약조건을 만족하는 새로운 QoS 라우팅 알고리즘인 Bounded Flooding Routing (BFR)을 제안한다. BFR 알고리즘의 주요 목적은 network overhead, blocking probability 그리고 wavelength utilization의 성능 분석 파라메터의 향상에 있다. 더욱이, 이러한 목적을 달성하기 위해 본 논문에서는 새로운 개념인 ripple count 개념을 제안하여, 링크 상태정보 및 계산량을 줄임으로써 라우팅의 성능을 높인다. 또한, 제안된 알고리즘의 광범위한 분석을 위해서, DWDM을 기반으로 하는 망에서 중요한 요소인 제한된 파장 변환기를 적용한다. 제안된 BFR 알고리즘의 성능분석 결과는 본 논문에서 제시하는 방법이 network overhead, blocking Probability 그리고 wavelength utilization 측면의 성능 평가를 통해 제안된 알고리즘들의 효율성을 검증하였다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.410-417
• /
• 2002

We consider the constraint based explicit routing problem in MPLS based IP Network. In this problem, we are given a set of traffic demands and a network with different link capacities. The problem is to assign the demand commodities to the paths in the network while minimizing the maximum link load ratio. We formulate this problem as an integer programming problem and propose an efficient column generation technique. To strengthen the formulation, we consider some valid inequalities. We also incorporate the column generation technique with variable fixing scheme Computational results show that the algorithm gives high quality solutions in a short execution time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2346-2361
• /
• 2017

A major challenge in cloud infrastructure is the efficient allocation of virtual network elements on top of substrate network elements. Path algebra is a mathematical framework which allows the validation and convergence analysis of the mono-constraint or multi-constraint routing problems independently of the network topology or size. The present study proposes a new heuristic approach based on mathematical framework "paths algebra" to map virtual nodes and links to substrate nodes and paths in cloud. In this approach, we define a measure criterion to rank the substrate nodes, and map the virtual nodes to substrate nodes according to their ranks by using a greedy algorithm. In addition, considering multi-constraint routing in virtual link mapping stage, the used paths algebra framework allows a more flexible and extendable embedding. Obtained results of simulations show appropriate improvement in acceptance ratio of virtual networks and cost incurred by the infrastructure networks.