• 조명전기설비학회논문지
• /
• 제29권12호
• /
• pp.88-96
• /
• 2015

This paper describes a new method for enhancing the accuracy of network analysis applications in energy management systems. Topology processing, state estimation, power flow analysis, and contingency analysis play a key factor in the stable and reliable operation of power systems. In this respect, the aim of topology processing is to provide the electrical buses and the electrical islands with the actual state of the power system as input data. The results of topology processing is used to input of other applications. New method, which includes the topology error analysis based on inconsistency check, coherency check, bus mismatch check, and outaged device check is proposed to enhance the accuracy of network analysis. The proposed methodology is conducted by energy management systems and the Korean power systems have been utilized for the test systems.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 추계종합학술대회
• /
• pp.123-126
• /
• 2005

STP는 토폴로지 구성방법에 따라 네트워크의 성능이 달라진다. 따라서 효율적인 네트워크 환경을 위하여 최적의 토폴로지를 구성할 필요가 있다. 본 논문은 이더넷에서 스위치들 사이의 효율적인 네트워크 구축을 위한 최적의 토폴로지 구성방법을 제안하였다 루트스위치에서 송신한 프레임을 같은 도메인 안에 있는 스위치들이 프레임을 수신하는 시간을 수학적 모델로 계산하여 최적의 토폴로지 구성 방법을 도출하였다. 그리고 최적의 토폴로지에서의 루트 스위치의 위치에 따른 성능을 분석하였다. 성능 분석 결과 정방형으로 설계된 망에서 루트스위치가 중앙에 위치하게 설계하는 것이 효과적이라는 결론을 얻을 수 있었다.

• 대한전자공학회논문지TC
• /
• 제39권6호
• /
• pp.1-1
• /
• 2002

본 논문은 기존의 Topology Aggregation 알고리즘에 따른 성능을 비교 평가하는데 초점을 두었다. 이를 위해 PNNI 라우팅 시뮬레이터를 설계 및 구현하여 TA알고리즘의 성능을 비교 분석하였다. ATM Forum에서는 계층으로 구성된 네트워크에서 계층적 라우팅 프로토콜과 토폴로지 정보를 요약하기 위한 PNNI 1.0 규격을 권고하였다. 토폴로지 정보를 요약하는 일련의 과정을 Topology Aggregation 이라 하며, 라우팅과 네트워크의 확장성 및 보안에 중요한 역할을 하게 된다. 따라서 라우팅 알고리즘과 Topology Aggregation 알고리즘이 PNNI 네트워크의 성능에 중요한 변수가 된다. 이를 비교·분석하기 위해 구현된 PNNI 라우팅 시뮬레이터는 라우팅 알고리듬 및 Topology Aggregation 알고리듬 개발에 적용되어 빠른 기간 내에 보다 개선된 알고리듬 개발에 사용될 수 있다.

• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.319-335
• /
• 2012

In this study, we design an applicable model enabling internet protocol television (IPTV) service providers to use a virtual network (VN) for IPTV service delivery. The model addresses the guaranteed service delivery, cost effectiveness, flexible control, and scalable network infrastructure limitations of backbone or IP overlay-based content networks. There are two major challenges involved in this research: i) The design of an efficient, cost effective, and reliable virtual network topology (VNT) for IPTV service delivery and the handling of a VN allocation failure by infrastructure providers (InPs) and ii) the proper approach to reduce the cost of VNT recontruction and reallocation caused by VNT allocation failure. Therefore, in this study, we design a more reliable virtual network topology for solving a single virtual node, virtual link, or video server failure. We develop a novel optimization objective and an efficient VN construction algorithm for building the proposed topology. In addition, we address the VN allocation failure problem by proposing VNT decomposition and reconstruction algorithms. Various simulations are conducted to verify the effectiveness of the proposed VNT, as well as that of the associated construction, decomposition, and reconstruction algorithms in terms of reliability and efficiency. The simulation results are compared with the findings of existing works, and an improvement in performance is observed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3572-3593
• /
• 2015

This article investigates the topology control problem in the space information network (SIN) using a hierarchical autonomous system (AS) approach. We propose an AS network topology control (AS-TC) algorithm to minimize the time delay in the SIN. Compared with most existing approaches for SIN where either the purely centralized or the purely distributed control method is adopted, the proposed algorithm is a hybrid control method. In order to reduce the cost of control, the control message exchange is constrained among neighboring sub-AS networks. We prove that the proposed algorithm achieve logical k-connectivity on the condition that the original physical topology is k-connectivity. Simulation results validate the theoretic analysis and effectiveness of the AS-TC algorithm.

• 한국군사과학기술학회지
• /
• 제25권1호
• /
• pp.65-71
• /
• 2022

In this paper, we propose an opportunistic data relay scheme in narrowband multihop combat radio networks. Narrowband networks have physical restrictions on high-speed transmission. Furthermore, the topology changes dynamically due to the jamming of the enemy, signal interference between friendly forces, and movement of network entities. Therefore, the traditional relay scheme that collects topology information and calculates a relay path before transmission is unsuitable for such networks. Our proposed scheme does not collect topology information and transmits data opportunistically. The scheme can cause unnecessary data relaying that is not related to data delivery to the destination node. However, for small networks, the effect of increasing network throughput by not gathering topology information is much greater than the effect of reducing throughput by unnecessary data relays. We demonstrate the performance superiority of the proposed scheme through simulation in the worst case of network topology.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.431-443
• /
• 2016

Secure multi-party computation (MPC) has been a research focus of cryptography in resent studies. However, hiding the topology of the network in secure computation is a rather novel goal. Inspired by a seminal paper [1], we proposed a topology-hiding broadcast protocol based on NTRUEncrypt and secret sharing. The topology is concealed as long as any part of the network is corrupted. And we also illustrated the merits of our protocol by performance and security analysis.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.371-377
• /
• 2014

Localized topology control is attractive for obtaining reduced network graphs with desirable features such as sparser connectivity and reduced transmit powers. In this paper, we focus on studying how to prolong network lifetime in the context of localized topology control for wireless multi-hop networks. For this purpose, we propose an energy efficient localized topology control algorithm. In our algorithm, each node is required to maintain its one-hop neighborhood topology. In order to achieve long network lifetime, we introduce a new metric for characterizing the energy criticality status of each link in the network. Each node independently builds a local energy-efficient spanning tree for finding a reduced neighbor set while maximally avoiding using energy-critical links in its neighborhood for the local spanning tree construction. We present the detailed design description of our algorithm. The computational complexity of the proposed algorithm is deduced to be O(mlog n), where m and n represent the number of links and nodes in a node's one-hop neighborhood, respectively. Simulation results show that our algorithm significantly outperforms existing work in terms of network lifetime.

• 한국산학기술학회논문지
• /
• 제10권6호
• /
• pp.1207-1213
• /
• 2009

본 논문에서는 다양한 네트워크의 통합관리를 위한 네트워크토폴로지를 설계하는 방법을 제안한다. 이를 위해 TMN-DCN 디바이스를 정의하고 이를 주요요소로 이용하기로 한다. 이 때 관리정보량이 주요변수가 된다. 또한 네트워크 관리특성의 주요요소로 떠오르는 네트워크 서바이벌특성이 포함되는 네트워크 토폴로지의 간단한 설계방법을 제안한다. 이들 방법은 링크비용을 최소로 하면서 전체 트래픽 량을 지원할 수 있다. 실제 설계 예를 통하여 그 결과를 확인한다. 설계방법이 간단하게 제안 되었지만 서바이벌 특성구현과 관리 네트워크설계에 관한 보편적으로 적용할 수 있는 최적의 설계알고리듬이 존재하지 않기에 본 논문에서 제안된 설계방법이 실제 관리망의 구축 시 활용될 수 있다.

• Journal of information and communication convergence engineering
• /
• 제19권4호
• /
• pp.205-213
• /
• 2021

The properties of a scale-free network are little known; its node degree following a power-law distribution is among its few known properties. By selecting real-field scale-free networks from a network dataset and comparing them to other networks, such as random and non-scale-free networks, the topology characteristics of scale-free networks are identified. The assortative coefficient is identified as a key metric of a scale-free network. It is also identified that most scale-free networks have negative assortative coefficients. Traditional generation models of scale-free networks are evaluated based on the identified topology characteristics. Most representative models, such as BA and Holme&Kim, are not effective in generating real-field scale-free networks. A link-rewiring method is suggested that can control the assortative coefficient while preserving the node degree sequence. Our analysis reveals that it is possible to effectively reproduce the assortative coefficients of real-field scale-free networks through link-rewiring.