• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.40-45
• /
• 2002

In this paper, we deals with scheduling problem for data-path synthesis in high-level synthesis. We proposed a new method to optimize interconnection cost for operator allocation. Especially, we focus to optimize for buses to transfer data channel and register to restore operation result. Also we take account ILP formulation in order to get optimal scheduling result. To verify the effectiveness of this study, we select 5th Digital Wave Filter. The experimental result show that purposed method was better then the general methods.

• Journal of information and communication convergence engineering
• /
• v.22 no.3
• /
• pp.215-220
• /
• 2024

This paper presents an efficient method for expanding interconnections in scenarios involving the reconstruction of interconnections across arbitrarily divided planes. Conventionally, such situations necessitate rebuilding interconnections based on all targets, ensuring minimal cost but incurring substantial time expenditure. In this paper, we present a tinkered tree algorithm designed to efficiently expand interconnections within a Euclidean plane divided into m randomly generated regions. The primary objective of this algorithm is to construct an optimal tree by utilizing the minimum spanning tree (MST) of each region, resulting in swift interconnection expansion. Interconnection construction is applied in various design fields. Notably, in the context of ad hoc networks, which lack a fixed-wired infrastructure and communicate solely with mobile hosts, the heuristic proposed in this paper is anticipated to significantly reduce costs while establishing rapid interconnections in scenarios involving expanded connection targets.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.4
• /
• pp.1935-1941
• /
• 2013

We can use NAT(Network Address Translation) technology to solve the lack of IP address. The problem of NAT traversal is happened when the filtering characteristics of NAT remove the packet that has no binding in the address translation table of NAT. There were many kinds of way to solve these problems by using additional device. Lately, network market is changed into integrating wired and wireless network by the IMS(IP Multimedia Subsystem). The IMS integrates to control network of wired and wireless network, has emerged to control convergence network effectively. Lately, the additional devices like IBCF(Interconnection Border Control Function) and IBGF(Interconnection Border Gateway Function) are used to solve the NAT traversal problem in the IMS. In this paper, we propose the solution of NAT traversal using P-CSCF without any additional equipment in the IMS.

• Journal of Internet Computing and Services
• /
• v.21 no.5
• /
• pp.9-20
• /
• 2020

This study redefines the networks' connection behaviors and the terms confusion over the settlement in Netflix-SK Broadband's dispute through domestic and foreign legal references. Conflict parties, academics and the media use the terms "interconnection fee" or "Access fee" without uniformity, and in some cases mixes for strategic purposes. The use of different terms for the same phenomenon (or vice versa) has a high need for research in that it makes it difficult to reach a unified approach to the problem, to discuss it productively and rationally, and, moreover, to resolve disputes. Therefore, this study cross-referenced/analyzed terms related to network utilization and connectivity, namely "Use", "Access", "Interconnection" and thus cost-related terms as a counter-pay. In addition, it suggests that interconnection fees and access fees should be used separately, and allows them to function as a starting point in resolving future ICT sector issues. As a result of this study, the price against the network access/use between Netflix and SK Broadband is access fee or retail price, and proposes to be used uniformly in the term "interconnection fee" only for fees incurred in interconnection between ISPs that possess or operate networks.

• Journal of information and communication convergence engineering
• /
• v.17 no.4
• /
• pp.246-254
• /
• 2019

This paper proposes a solution to the problem of finding a subgraph for a given instance of many terminals on a Euclidean plane. The subgraph is a tree, whose nodes represent the chosen terminals from the problem instance, and whose edges are line segments that connect two corresponding terminals. The tree is required to have the maximum number of nodes while the length is limited and is not sufficient to interconnect all the given terminals. The problem is shown to be NP-hard, and therefore a genetic algorithm is designed as an efficient practical approach. The method is suitable to various probable applications in layout optimization in areas such as communication network construction, industrial construction, and a variety of machine and electronics design problems. The proposed heuristic can be used as a general-purpose practical solver to reduce industrial costs by determining feasible interconnections among many types of components over different types of physical planes.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.123-132
• /
• 2014

Internet is composed of many independent networks referred to as Internet Service Providers (ISPs) and each provider is generally interconnected based on a commercial agreement. Though many countries are engaged in deregulation in internet interconnection, there is still debate whether the large ISPs are unwilling to peer with small providers, have incentives to lower the quality of data transmission of transit operators or set the interconnection charge regarding the actual costs incurred by the interconnection. Korean government introduced regulations in internet interconnection after observing noticeable anti-competitive behaviors from 2005. This paper analyzes whether there is margin squeeze problem/market concentration, and suggests political proposals in Korean regulation status.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.11
• /
• pp.1118-1124
• /
• 2014

This paper proposes a novel controller design scheme for multimachine power systems based on the explorized policy iteration. Power systems have several uncertainties on system dynamics due to the various effects of interconnections between generators. To solve this problem, the proposed method solves the LQR (Linear Quadratic Regulation) problem of isolated subsystems without the knowledge of a system matrix and the interconnection parameters of multimachine power systems. By selecting the proper performance indices, it guarantees the stability and convergence of the LQ optimal control. To implement the proposed scheme, the least squares based online method is also investigated in terms of PE (Persistency of Excitation), interconnection parameters and exploration signals. Finally, the performance and effectiveness of the proposed algorithm are demonstrated by numerical simulations of three-machine power systems with governor controllers.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.5
• /
• pp.439-444
• /
• 2012

In this study, we address the formation control problem of coupled unicycle-type mobile robots, each of which can interact with its neighboring robots by communicating their position outputs. Each communication link between two mobile robots is assumed to be established according to the given time-varying interconnection topology that switches within a finite set of connected fixed undirected networks and has a non-vanishing dwell time. Under this setup, we propose a distributed formation control algorithm by using the dynamics extension and feedback linearization methods, and by employing a consensus algorithm for linear multi-agent systems which provides arbitrary fast convergence rate to the agreement of the multi-agent system. Finally, the proposed result is demonstrated through a computer simulation.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.12
• /
• pp.1376-1381
• /
• 2012

Optical devices are used extensively in the field of information network. Increasing demand for optical device, optical interconnection has been a important issue for commercialization. However many problems exist in the interconnection between optical device and optical fiber, and in the case of the multi-channel, problems of the optical alignment and optical array arise. For solving the alignment and array problem of optical device and the optical fiber, we fabricated fiber alignment and array by using imprint technology. Achieved higher precision of optical fiber alignment and array due to fabricating using imprint technology. The silicon stamp with different depth was fabricated using the conventional photolithography. Using the silicon stamp, a nickel stamp was fabricated by electroforming process. We conducted imprint process using the nickel stamp with different depth. The optical alignment and array by fabricating the patterns of optical device and fiber alignment and array using imprint process, and achieved higher precision of decreasing the dimensional error of the patterns by optimization of process. The fabricated optical interconnection of PLC device was measured 3.9 dB and 4.2 dB, lower than criteria specified by international standard.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1353-1362
• /
• 1999

그래프 드로잉이란 추상적인 그래프를 시각적으로 구성하여 2차원 평면상에 그려주는 작업으로 대칭성은 그래프 드로잉시 고려해야 하는 미적 기준들 중에서 그래프의 구조 및 특성을 표현해주는 가장 중요한 기준이다. 그러나 일반 그래프에서 대칭성을 찾아 그려 주는 문제는 NP-hard로 증명이 되어 있기 때문에 현재까지는 트리, 외부평면 그래프, 직병렬 유향 그래프나 평면 그래프 등으로 대상을 한정시켜 연구가 진행되어 왔다. 본 논문에서는 병렬 컴퓨터나 컴퓨터 네트워크 구조를 가시화 시키기 위하여 많이 사용되는 그래프인 상호연결망(interconnection network)의 대칭성을 분석하고 분석된 대칭성을 최대로 보여주는 대칭 드로잉 알고리즘을 제안하였다. 그리고 이를 기반으로 하여 상호연결망의 기존 드로잉 방법들과 본 논문에서 제안한 대칭 드로잉 등 다양한 드로잉을 지원하는 WWW 기반의 상호연결망 드로잉 시스템을 구현하였다.Abstract Graph drawing is constructing a visually-informative drawing of an abstract graph. Symmetry is one of the most important aesthetic criteria that clearly reveals the structures and the properties of graphs. However, the problem of finding geometric symmetry in general graphs is NP-hard. So the previous work has focused on the subclasses of general graphs such as trees, outerplanar graphs, series-parallel digraphs and planar graphs.In this paper, we analyze the geometric symmetry on the various interconnection networks which have many applications in the design of computer networks, parallel computer architectures and other fields of computer science. Based on these analysis, we develope algorithms for constructing the drawings of interconnection networks which show the maximal symmetries.We also design and implement Interconnection Network Drawing System (INDS) on WWW which supports the various drawings including the conventional drawings and our suggested symmetric drawings.