• Title/Summary/Keyword: Steiner Tree Problem

Search Result 40, Processing Time 0.027 seconds

Efficient Construction of Large Scale Grade of Services Steiner Tree Using Space Locality and Polynomial-Time Approximation Scheme (공간 지역성과 PTAS를 활용한 대형 GOSST의 효과적 구성)

  • Kim, In-Bum
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.153-161
    • /
    • 2011
  • As the problem of GOSST building belongs to NP compete domain, heuristics for the problem ask for immense amount execution time and computations in large scale inputs. In this paper, we propose an efficient mechanism for GOSST construction using space locality PTAS. For 40,000 input nodes with maximum weight 100, the proposed space locality PTAS GOSST with 16 unit areas can reduce about 4.00% of connection cost and 89.26% of execution time less than weighted minimum spanning tree method. Though the proposed method increases 0.03% of connection cost more, but cuts down 96.39% of execution time less than approximate GOSST method (SGOSST) without PTAS. Therefore the proposed space locality PTAS GOSST mechanism can work moderately well to many useful applications where a greate number of weighted inputs should be connected in short time with approximate minimum connection cost.

On Minimum Cost Multicast Routing Based on Cost Prediction

  • Kim, Moon-Seong;Mutka, Matt W.;Hwang, Dae-Jun;Choo, Hyun-Seung
    • Journal of Communications and Networks
    • /
    • v.11 no.5
    • /
    • pp.500-508
    • /
    • 2009
  • We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O($kn^2$) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%~4.23% for each best case.

A GOSST Heuristic Mechanism for the Design of a Physical Multiple Security Grade Network (물리적 다중 보안 등급 네트워크 설계를 위한 GOSST 휴리스틱 메커니즘)

  • Kim, In-Bum;Kim, Chae-Kak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12B
    • /
    • pp.728-734
    • /
    • 2007
  • In this paper, we propose a GOSST(Grade Of Services Steiner minimum Tree) heuristic mechanism for the design of a physical multiple security grade network with minimum construction cost. On the network, each node can communicate with other nodes by its desiring security grade. Added to the existing network security methods, the preventing method from illegal physical access is necessary for more safe communication. To construct such network with minimum cost, the GOSST problem is applied. As the GOSST problem is a NP-Hard problem, a heuristic with reasonable complexity is necessary for a practical solution. In this research, to design the physical multiple security grade network with the minimum construction cost, the reformed our previous Distance Direct GOSST heuristic mechanism is proposed. The mechanism brings average 29.5% reduction in network construction cost in comparison with the experimental control G-MST.

A Survey on Design Modelling of Networks with Three Configuration (트리(Tree) 구조를 갖는 망설계 문제의 정식화에 관한 조사연구)

  • Tcha, D.W.;Yoon, M.G.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.15 no.1
    • /
    • pp.1-22
    • /
    • 1990
  • This susrvey is on modelling of various network design problems with tree configuration, which have a wide variety of practical applications, particularly in communication, which have a wide a variety of practical applications, particularly in communication and transportation network planning. Models which can be classified as either minimum spanning tree of Steiner tree, are investigated. Various important variants of each basic model are then classified according to model structurs. In addition to the calssification, the typical solution method for each problem is briefly sketched, along with some remarks on further research issues.

  • PDF

A Layered Network Flow Algorithm for the Tunnel Design Problem in Virtual Private Networks with QoS Guarantee

  • Song, Sang-Hwa;Sung, Chang-Sup
    • Management Science and Financial Engineering
    • /
    • v.12 no.2
    • /
    • pp.37-62
    • /
    • 2006
  • This paper considers the problem of designing logical tunnels in virtual private networks considering QoS guarantee which restricts the number of tunnel hops for each traffic routing. The previous researches focused on the design of logical tunnel itself and Steiner-tree based solution algorithms were proposed. However, we show that for some objective settings it is not sufficient and is necessary to consider both physical and logical connectivity at the same time. Thereupon, the concept of the layered network is applied to the logical tunnel design problem in virtual private networks. The layered network approach considers the design of logical tunnel as well as its physical routing and we propose a modified branch-and-price algorithm which is known to solve layered network design problems effectively. To show the performance of the proposed algorithm, computational experiments have been done and the results show that the proposed algorithm solves the given problem efficiently and effectively.

A Study on Discrete Mathematics Subjects Focused on the Network Problem for the Mathematically Gifted Students in the Elementary School (초등 영재교육에 적용 가능한 이산수학 주제의 내용 구성에 관한 소고 -네트워크 문제를 중심으로-)

  • Choi, Keun-Bae
    • School Mathematics
    • /
    • v.7 no.4
    • /
    • pp.353-373
    • /
    • 2005
  • The purpose of this paper is to analysis the basic network problem which can be applied to the mathematically gifted students in elementary school. Mainly, we discuss didactic transpositions of the double counting principle, the game of sprouts, Eulerian graph problem, and the minimum connector problem. Here the double counting principle is related to the handshaking lemma; in any graph, the sum of all the vertex-degree is equal to the number of edges. The selection of these subjects are based on the viewpoint; to familiar to graph theory, to raise algorithmic thinking, to apply to the real-world problem. The theoretical background of didactic transpositions of these subjects are based on the Polya's mathematical heuristics and Lakatos's philosophy of mathematics; quasi-empirical, proofs and refutations as a logic of mathematical discovery.

  • PDF

Compact elitist Ant Optimization (콤팩트 엘리트 개미 최적화)

  • Cho, Jin-Sun;Chang, Hyeong-Soo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06c
    • /
    • pp.365-370
    • /
    • 2008
  • 본 논문에서는 개미 집단 최적화(Ant Colony Optimization, ACO)의 시간적 공간적 효율성을 향상시키기 위해 ACO에 엘리트 콤팩트 유전 알고리즘(Elitist compact Genetic Algorithms, elitist cGAs)의 아이디어를 적용한 콤팩트 개미 최적화(Compact elitist Ant Optimization, CAO)를 제안한다. CAO는 elitist cGAs에서 각 세대마다 염색체의 수를 둘로 고정하고 우월한 염색체를 유지하여 최적의 해를 찾는 방식을 적용하여 개미의 수를 하나로 고정하고 전이 확률식과 페로몬 갱신 규칙을 변형하고 특정 문제에 적용할 수 있는 타부 규칙을 추가한 알고리즘이다. 이 알고리즘의 공간 효율성이 ACO보다 좋다는 것을 증명하고 스테이너 트리 문제(Steiner Tree Problem)에 적용하여 제안된 알고리즘의 시간 효율성이 ACO보다 좋다는 것을 보인다.

  • PDF

Interconnection Problem among the Dense Areas of Nodes in Sensor Networks (센서네트워크 상의 노드 밀집지역 간 상호연결을 위한 문제)

  • Kim, Joon-Mo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.6-13
    • /
    • 2011
  • This paper deals with the interconnection problem in ad-hoc networks or sensor networks, where relay nodes are deployed additionally to form connections between given nodes. This problem can be reduced to a NP-hard problem. The nodes of the networks, by applications or geographic factors, can be deployed densely in some areas while sparsely in others. For such a case one can make an approximation scheme, which gives shorter execution time, for the additional node deployments by ignoring the interconnections inside the dense area of nodes. However, the case is still a NP-hard, so it is proper to establish a polynomial time approximation scheme (PTAS) by implementing a dynamic programming. The analysis can be made possible by an elaboration on making the definition of the objective function. The objective function should be defined to be able to deal with the requirement incurred by the substitution of the dense area with its abstraction.

A Study of Ant Colony System Design for Multicast Routing (멀티캐스트 라우팅을 위한 Ant Colony System 설계에 대한 연구)

  • Lee, Sung-Geun;Han, Chi-Geun
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.369-374
    • /
    • 2003
  • Ant Algorithm is used to find the solution of Combinatorial Optimization Problems. Real ants are capable of finding the shortest path from a food source to their nest without using visual informations. This behavior of real ants has inspired ant algorithm. There are various versions of Ant Algorithm. Ant Colony System (ACS) is introduced lately. ACS is applied to the Traveling Salesman Problem (TSP) for verifying the availability of ACS and evaluating the performance of ACS. ACS find a good solution for TSP When ACS is applied to different Combinatorial Optimization Problems, ACS uses the same parameters and strategies that were used for TSP. In this paper, ACS is applied to the Multicast Routing Problem. This Problem is to find the paths from a source to all destination nodes. This definition differs from that of TSP and differs from finding paths which are the shortest paths from source node to each destination nodes. We introduce parameters and strategies of ACS for Multicasting Routing Problem.

Maximum Terminal Interconnection by a Given Length using Rectilinear Edge

  • Kim, Minkwon;Kim, Yeonsoo;Kim, Hanna;Hwang, Byungyeon
    • Journal of information and communication convergence engineering
    • /
    • v.19 no.2
    • /
    • pp.114-119
    • /
    • 2021
  • This paper proposes a method to find an optimal T' with the most terminal of the subset of T' trees that can be connected by a given length by improving a memetic genetic algorithm within several constraints, when the set of terminal T is given to the Euclidean plane R2. Constraint (1) is that a given length cannot connect all terminals of T, and (2) considers only the rectilinear layout of the edge connecting each terminal. The construction of interconnections has been used in various design-related areas, from network to architecture. Among these areas, there are cases where only the rectilinear layout is considered, such as wiring paths in the computer network and VLSI design, network design, and circuit connection length estimation in standard cell deployment. Therefore, the heuristics proposed in this paper are expected to provide various cost savings in the rectilinear layout.