• Bulletin of the Korean Mathematical Society
• /
• v.47 no.5
• /
• pp.915-932
• /
• 2010

The goal of this paper is to study extension problems of several continuities in computer topology. To be specific, for a set $X\;{\subset}\;Z^n$ take a subspace (X, $T_n^X$) induced from the Khalimsky nD space ($Z^n$, $T^n$). Considering (X, $T_n^X$) with one of the k-adjacency relations of $Z^n$, we call it a computer topological space (or a space if not confused) denoted by $X_{n,k}$. In addition, we introduce several kinds of k-retracts of $X_{n,k}$, investigate their properties related to several continuities and homeomorphisms in computer topology and study extension problems of these continuities in relation with these k-retracts.

• Journal of Communications and Networks
• /
• v.8 no.3
• /
• pp.339-350
• /
• 2006

Several novel concepts and tools have revolutionized our understanding of the Internet topology. Most of the existing efforts attempt to develop accurate analytical models. In this paper, our goal is to develop an effective conceptual model: A model that can be easily drawn by hand, while at the same time, it captures significant macroscopic properties. We build the foundation for our model with two thrusts: a) We identify new topological properties and b) we provide metrics to quantify the topological importance of a node. We propose the jellyfish as a model for the inter-domain Internet topology. We show that our model captures and represents the most significant topological properties. Furthermore, we observe that the jellyfish has lasting value: It describes the topology for more than six years.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.341-360
• /
• 2012

The network topology for a wide area sensor network has to support connectivity and a prolonged lifetime for the many applications used within it. The concepts of structure and group in sociology are similar to the concept of cluster in wireless sensor networks. The clustering method is one of the preferred ways to produce a topology for reduced electrical energy consumption. We herein propose a cluster topology method based on sociological structures and concepts. The proposed sociological clustering topology (SOCT) is a method that forms a network in two phases. The first phase, which from a sociological perspective is similar to forming a state within a nation, involves using nodes with large transmission capacity to set up the global area for the cluster. The second phase, which is similar to forming a city inside the state, involves using nodes with small transmission capacity to create regional clusters inside the global cluster to provide connectivity within the network. The experimental results show that the proposed method outperforms other methods in terms of energy efficiency and network lifetime.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.307-310
• /
• 2011

IPTV의 스트리밍 서비스를 위해 P2P를 이용하는 방법이 활발하게 연구되어지고 있다. 이 논문에서는 topology를 최적화하는 방안으로 P2P에서 각 peer 간에 연결 및 전송 정보를 이용하는 방법을 제안한다. 제안하는 방법은 mesh-network에서 각 peer에 연결된 link의 수를 이용하여 업로드 대역폭을 추정하는 알고리즘을 기반으로 한다. 이 방법은 자원의 관리를 위해 업로드 대역폭을 판단하기 위한 메시지 과부하를 효과적으로 줄여주지만 스트리밍에서 주어진 연산만을 수행할 경우 업로드 대역폭과 무관한 형태로 network topology가 잘못 구성될 가능성을 가지고 있다. 본 논문에서는 기존 연구에서 부족했던 부분들을 정리하고 극복할 수 있는 각각의 알고리즘들과 적용했을 시에 예상되는 결과를 제시한다.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.49-57
• /
• 2012

In P2P streaming management, peer's churning and finding efficient topology architecture optimization algorithm that reduces streaming delay is important. This paper studies a topology optimization algorithm based on the P2P streaming using peer's link information. The proposed algorithm is based on the estimation of peer's upload bandwidth using peer's link information on mesh-network. The existing algorithm that uses the information of connected links is efficient to reduce message overload in the point of resource management. But it has a risk of making unreliable topology not considering upload bandwidth. And when some network error occurs in a server-closer-peer, it may make the topology worse. In this paper we propose an algorithm that makes up for the weak point of the existing algorithm. We compare the existing algorithm with the proposed algorithm using test data and analyze each simulation result.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.1-9
• /
• 2013

Recently many researches have focused on indoor navigation system. An optimal indoor navigation method can help people to find a path in large and complex buildings easily. However, some indoor navigation algorithms only calculate approximate routes based on spatial topology analysis, while others only use indoor road networks. However, both of them use only one of the spatial topology or network information. In this paper, we present a navigation method based on topology analysis and room internal networks for indoor navigation path. FT-Indoornavi (Flexible Topology Analysis Indoornavi) calculate internal routes based on spatial topology and internal path networks to support length-dependent and running-time optimal routing, which adapt to complex indoor environment and can achieve a better performance in comparison of Elastic algorithm and iNav.

• Journal of Power Electronics
• /
• v.14 no.6
• /
• pp.1157-1165
• /
• 2014

The T-type topology is a three-level topology that has an advantage in terms of its number of switching device and its efficiency when compared to the neutral-point clamped (NPC)-type topology. With the recent increase in the usage of the T-type topology, the interest in its reliability has also increased. Therefore, a tolerance control for a T-type rectifier is necessary to improve the reliability of applications when an open-switch fault occurs. NPC-type rectifiers cannot eliminate input current distortion completely. However, the T-type rectifier is able to restore distorted current. In this paper, a tolerance control for the $S_{x2}$ and $S_{x3}$ open-switch faults of a T-type rectifier is proposed where it is advantageous in terms of efficiency when compared with other tolerance controls. The performance of the proposed tolerance control is verified through simulation and experimental results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.379-384
• /
• 2006

이 논문에서 제안하는 Gnutella기반의 Balanced tree topology는 Unstructured P2P이므로 탐색 질의가 hash key에 제한되지 않고 동적인 네트워크 환경에도 적합하다. 또한 topology형태가 tree이므로 Gnutella의 큰 문제점인 질의 탐색 시 중복된 패킷을 제거하고, tree형태가 balanced tree이므로 일정 홉수 안에 모든 노드를 방문 할 수 있다. Balanced tree topology는 일정 홉 수 안에 모든 노드를 방문하기 때문에 Gnutella기반의 P2P가 가지는 희귀 자료에 대한 검색의 문제점 또한 해결하였다. Gnutella기반의 확장 ping과 확장 local cache를 사용하여 balanced tree topology유지 및 문제 해결에 필요한 추가 비용을 줄였다.

• Journal of Power Electronics
• /
• v.19 no.6
• /
• pp.1449-1457
• /
• 2019

This paper presents two voltage domain stacking topologies for powering integrated digital loads such as multiprocessors or 3D integrated circuits. Pairs of loads and capacitors are connected in series to form a stack of voltage domains. The voltage is balanced by switching the position of the capacitors in one case and the position of the loads in the other case. This method makes the voltage regulation robust to large differential load power consumption. The first configuration can be named the load stacking topology. The second configuration can be named the capacitor stacking topology. This paper aims at proposing and comparing these two topologies. Models of both topologies and a switching scheme are presented. The behavior, control scheme, losses and overall performance are analyzed and compared theoretically in simulation and experiments. Experimental results show that the capacitor stacking topology has better performance with a 30% voltage ripple reduction.

• KNOM Review
• /
• v.23 no.1
• /
• pp.1-9
• /
• 2020

With the rapid development of science and technology in recent years, the network environment are growing, and a huge amount of traffic is generated. In particular, the development of 5G networks and edge computing will accelerate this phenomenon. However, according to these trends, network malicious behaviors and traffic overloads are also frequently occurring. To solve these problems, network administrators need to build a network management system to implement a high-speed network and should know exactly about the connection topology of network devices through the network management system. However, the existing network topology discovery method is inefficient because it is passively managed by an administrator and it is a time consuming task. Therefore, we proposes a method of network topology discovery according to the amount of in and out network traffic. The proposed method is applied to a real network to verify the validity of this paper.