• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.1-12
• /
• 2009

A routing policy based on BGP community routing permits to select a specific route for particular network by making use of user-defined routing policies. Especially, community based routing policy is recently getting a great concern to enhance overall performance in the global research networks which are generally inter-connected large number of different characterized networks. In this paper, we analyze the community routing which has been applied in existing global research networks in the network performance point of view, and catch hold of problems caused by the routing performance in a new global research network. Then, we suggest an effective community routing policy model along with an interconnection architecture of research networks, in order to make correct some wrong routings and resolve an asymmetric routing problem, for a new global research network. Our work is expected to be utilized as an enabling base technology to improve the network performance of future global research networks as well as commercial networks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.176-186
• /
• 2007

An interconnection network can be represented as a graph where a vertex corresponds to a node and an edge corresponds to a link. The diameter of an interconnection network is the maximum length of the shortest paths between all pairs of vertices. The fault diameter of an interconnection network G is the maximum length of the shortest paths between all two fault-free vertices when there are $_k(G)-1$ or less faulty vertices, where $_k(G)$ is the connectivity of G. The fault diameter of an R-regular graph G with diameter of 3 or more and connectivity ${\tau}$ is at least diam(G)+1 where diam(G) is the diameter of G. We show that the fault diameter of a 2-dimensional $m{\times}n$ torus with $m,n{\geq}3$ is max(m,n) if m=3 or n=3; otherwise, the fault diameter is equal to its diameter plus 1. We also show that in $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ torus with each $k_i{\geq}3$, there are 2d mutually disjoint paths joining any two vertices such that the lengths of all these paths are at most diameter+1. The paths joining two vertices u and v are called to be mutually disjoint if the common vertices on these paths are u and v. Using these mutually disjoint paths, we show that the fault diameter of $d({\geq}3)$-dimensional $k_1{\times}k_2{\times}{\cdots}{\times}k_d$ totus with each $k_i{\geq}3$ is equal to its diameter plus 1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.946-955
• /
• 2004

It is shown that the do Bruijn graph (dBG) can be used as an architecture for interconnection network and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into fault free shortest path (FFSP) on dBG has been non-existent. In addition, as the size of the network increase, more faults are to be expected and therefore shortest path dBG algorithms in fault free mode may not be suitable routing algorithms for real interconnection networks, which contain several failures. Furthermore, long fault free path may lead to high traffic, high delay time and low throughput. In this paper we investigate routing algorithms in the condition of existing failure, based on the Bidirectional do Bruijn graph (BdBG). Two FFSP routing algorithms are proposed. Then, the performances of the two algorithms are analyzed in terms of mean path lengths and discrete set mean sizes. Our study shows that the proposed algorithms can be one of the candidates for routing in real interconnection networks based on dBG.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.65-74
• /
• 2002

Recently star networks are considered as attractive alternatives to the widely used hypercube for interconnection networks in parallel processing systems by many researchers. One of the fundamental communication problems on star graph networks is broadcasing In this paper we consider the broadcasting problems in star graph networks using wormhole routing. In wormhole routed system minimizing link contention is more critical for the system performance than the distance between two communicating nodes. We use Hamiltonian paths in star graph to set up link-disjoint communication paths We present a broadcast algorithm in n-dimensional star graph of N(=n!) nodes such that the total completion time is no larger than $([long_n n!]+1)$ steps where $([long_n n!]+1)$ is the lower bound This result is significant improvement over the previous n-1 step broadcasting algorithm.

• Journal of the Korea Convergence Society
• /
• v.8 no.8
• /
• pp.9-15
• /
• 2017

With the development of semiconductor integration technology, central processing units and storage devices have been miniaturized and performance has been rapidly developed, interconnection network technology is becoming a more important factor in terms of the performance of high performance computing system. In this paper, we analyze the trend of interconnection network technology used in high performance computing. Interconnect technology, which is the most widely used in the Supercomputer Top 500(2017. 06.), is an Infiniband. Recently, Ethernet is the second highest share after InfiniBand due to the emergence of 40/100Gbps Gigabit Ethernet technology. Gigabit Ethernet, where latency performance is lower than InfiniBand, is preferred in cost-effective medium-sized data centers. In addition, top-end HPC systems that demand high performance are devoting themselves from Ethernet and InfiniBand technologies and are attempting to maximize system performance by introducing their own interconnect networks. In the future, high-performance interconnects are expected to utilize silicon-based optical communication technology to exchange data with light.

• Journal of Advanced Navigation Technology
• /
• v.15 no.1
• /
• pp.54-60
• /
• 2011

The development of wireless sensor networks (WSN) can be motivated by several types of applications. However, these applications demand an energy-efficient WSN that can prolong the network lifetime and can provide high throughput, low latency and delay. Designing wireless sensor networks with the capability of prolonging network lifetime catch the attention of many researchers in wireless system and network field. Contrasts with Mobile Ad Hoc Network system, Wireless Sensor Networks designs focused more on survivability of each node in the network instead of maximizing data throughput or minimizing end-to-end delay. In this paper, we will study part of data link layer in Open Systems Interconnection (OSI) model, called medium access control (MAC) layer. Since the MAC development of energy aware MAC Protocol for wireless sensor layer controls the physical radio part, it has a large impact on the overall energy consumption and the lifetime of a node. This paper proposes a analytical approach that tries to reduce idle energy consumption, and shows the increasement of network end-to-end arrival rate due to efficiency in energy consumption from time slot management.

• Journal of Advanced Navigation Technology
• /
• v.21 no.4
• /
• pp.402-412
• /
• 2017

The convergence of broadcasting and telecommunication technologies is a key issue of the ubiquitous networks. So this paper offers the convergence of integrated telecommunication networks and broadcasting system, Advanced Terrestrial Digital Multimedia Broadcasting (AT-DMB), and the interconnection of them via the Media Independent Information Server/Service (MIIS). Then, this paper proposes the fast wakeup and connection mechanism with concepts for improving QoS and energy efficiency simultaneously. In the proposed convergence network, our mechanism places the key on the minimization of both the incoming service delay destined to a turned-off interface by using the broadcasting network and the additional energy consumption. This paper further evaluates the performance of proposed mechanism through the numerical and experimental analysis and has confirmed the decrease of both service delay and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1201-1209
• /
• 1991

Generally, the conventional tracking algorithms are very limited in the practical applications because of its exponential increase in the required computation time for the number of targets being tracked. Therefore, in this paper, a new real-time moving target tracking system is proposed, which is based on the neural networks with massive parallel processing capabilities. Through the theoretical and experimental results, the target tracking system based on neural network algorithm is analyzed to be computationally independent of the number of objects being tracked and performs the optimized tracking through its massive parallel computation and learning capabilities. And this system also has massive matched filtering effects because the moving target data can be compactly stored in the interconnection weights by learning. Accordingly, a possibility of the proposed neural network target tracking system can be suggested to the fields of real-time application.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.9 no.1
• /
• pp.17-24
• /
• 1972

A method utilizing vector representation is investigated for determining a faulty elenlent in passive and active networks by simple external measurements. A large system may be considered as an interconnection of a number of subnetlvorks. By utilizing the relationships between the magintudes of a transfer function at various frequencies and the deviations of a circuit element, the fault simulation curves can be drawn. The fault identification regions are defined from the fault simulation curves. A fault identlfication matrix is constructed corresponding the defined fault identification regions. The fault identification matrix, when premultiplied by a vector whose components are measured from a network, yieldg another vector whose components identify a network element which is faulty. A test procedure for the fault identification method is presented and verified by experiments.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.153-160
• /
• 1996

In this paper, we propose an efficient digital architecture for the discrete-time cellular neural networks (DTCNN's). DTCNN's have the locality and the translation invariance in the templates which determine the patterns of the connection between the cells. Using distributed arithmetic (DA) and the characteristics of DTCNN, we propose a simple implementation of DTCNN. The bus width in the cell-to-cell interconnection is reduced to one bit because of DA's bitwise operation. We implemented the reconfigurable architecture of DTCNN using programmable FPGA.