• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.297-300
• /
• 1998

A honeycomb network is considered as a multiprocessor interconnection network. The network cost defined as the product of degree and diameter is better for honeycomb networks than for other types of meshes. Parallel paths offer us bypasses when the networks have faulty nodes or edges. In this paper, we present a method to construct a parallel path in honeycomb network, and show that the fault diameter for the honeycomb network is d+8, where d is diameter of the honeycomb network.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.205-214
• /
• 2011

We propose a new interconnection network, called Twisted cube torus(TT) network based on well-known 3-dimensional twisted cube. Twisted cube torus network has smaller diameter and improved network cost than honeycomb torus with the same number of nodes. In this paper, we propose routing algorithm of Twisted cube torus network and analyze its diameter, network cost, bisection width and hamiltonian cycle.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.499-506
• /
• 2005

Recently, Hyper-Star network HS(m,k) which improves the network cost of hypercube has been proposed. In this paper, we show that the bisection width of regular Hyper-Star network HS(2n,n) is maximum (2n-2,n-1). Using the concept of container, we also show that k-wide diameter of HS(2n,n) is less than dist(u,v)+4, and the fault diameter is less than D(HS(2n,n))+2, where dist(u,v) is the shortest path length between any two nodes u and v in HS(2n,n), and D(HS(2n,n)) is its diameter.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.12
• /
• pp.143-152
• /
• 1997

The deflection of an end mill is very important in machining process and cutting simulation because it affects directly workpiece accuracy, cutting force, and chattering. In this study, the deflection of the end mill was studied both experimentally and by using finite element analysis. And the moment of inertia of cross sections of the helical end mill is calculated for the determination of the relation between geometry of radial cross section and rigidity of the tools. Using the Bernoulli-Euler beam theory and the concept of equivalent diameter, a deflection model is established, which includes most influences from tool geomety parameters. It was found that helix angle attenuates the rigidity of the end mill by the finite element analysis. As a result, the equivalent diameter is determined by tooth number, inscribed diameter ratio, cross sectional geometry and helix angle. Because the relation betweem equivalent diameter and each factor is nonlinear, neural network is used to decide the equivalent diameter. Input patterns and desired outputs for the neural network are obtained by FEM analysis in several case of end milling operations.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.745-747
• /
• 1999

인터넷이 급성장함에 따라 사용자의 더 나은 서비스에 대한 요구 역시 급증하였다. 네트웍 연구가들은 제한된 네트웍 자원 하에서 오류제어, 흐름 제어, 그리고 폭주 제어를 적절히 수행함으로써 전송 품질을 향상시키는 방법들에 대해 연구해 오고 있다. 그러나 인터넷 연구의 가장 큰 난점 중 하나가 인터넷에는 네트웍의 상태를 모니터링할 수 있는 근간이 되는 방법이 기본적으로 지원되고 있지 않다는 점이고 따라서 네트웍의 구조와 상태, 플로우의 흐름 및 통계 등에 대한 기본 자료가 부족한 실정이다. 오류 제어나 흐름 제어, 그리고 폭주제어 기술을 연구할 때 가장 필요한 자료중의 하나가 네트웍 토폴로지이다. 그 중에서도 송신자와 수신자 사이의 거리 정보인 Network Diameter가 있다. 기존 연구에서는 연구자 임의로 이 값을 할당하거나 혹은 특정 실험실에서만 유효한 Network Diameter가 있다. 기존 연구에서는 연구자 임의로 이 값을 할당하거나 혹은 특정 실험에서만 유효한 Network Diameter 값을 제시해오고 있었다. 이 논문에서는 이처럼 비객관적이거나 특수값으로만 사용되어 오던 Internet Diameter를 실효 접속에 근거하여 측정하는 알고리즘을 제안하고, KAIST에서 전세계로 나가는 실측 접속 자료로부터 접속 Hop Count의 분포를 측정하며 이를 통해 타 인터넷 연구에 적절한 자료를 제시한다.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.63-66
• /
• 2001

In this paper, We propose the new interconnection network which is designed to edge numbering labeling using postorder traversal which can reduce diameter when it has same node number with Hypercube, which can reduce total node numbers considering node degree and diameter on Fibonacci trees and its jump sequence of circulant is Fibonacci numbers. It has a simple (shortest oath)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded to Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.95-100
• /
• 2008

In this paper, we propose a new interconnection network topology, hierarchical folded hyper-star network HFH($C_n,\;C_n$), which is based on folded hyper-star network. Our results show that the proposed hierarchical folded hyper-star network performs very competitively in comparison to folded hyper-star network and hierarchical network HCN(m,m), HFN(m,m) have been previously proposed, when diameter ${\times}$ degree is used as a network cost measure. We also investigate various topological properties of HFH($C_n,\;C_n$) including connectivity, routing algorithm, diameter, broadcasting.

• Journal of IKEEE
• /
• v.19 no.2
• /
• pp.133-141
• /
• 2015

The IMS is an architectural control framework for delivering IP multimedia services such as voice, video, audio and data, the IMS supports not only the mobile communication system but also the existing wired and wireless network based on IP. The network that is integrated by the IMS needs policy-based network management protocol for managing the limited network resources to provide efficient multimedia service. The IMS use additional device called PDF for efficient resource management, but the PDF only uses diameter which is one of the network management protocol such as SNMP and COPS. Many devices use various protocol to manage the limited network resources. There is an algorithm using a variety of protocols such as Diameter, COPS and SNMP to handle the resources management efficiently. We also analyze the performance using the proposed algorithm in the implemented IMS environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.344-350
• /
• 2009

In this paper, we propose a new interconnection network, hierarchical odd network HON($C_d,C_d$), which used the odd network as basic modules. We investigate various topological properties of HON($C_d,C_d$), including connectivity, routing algorithm, diameter and broadcasting. We show that HON($C_d,C_d$) outperforms the three networks, i.e. the odd network, HCN(m,m), and HFN(m,m).

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.293-296
• /
• 1998

In this paper, we propose a matrix hypercube graph as a new topology for parallel computer and analyze its characteristics of the network parameters, such as degree, routing and diameter. N-dimensional matrix hypercube graph MH(2,n) contains 22n vertices and has relatively lower degree and smaller diameter than well-known hypercube graph. The matrix hypercube graph MH(2,n) and the hypercube graph Q2n have the same number of vertices. In terms of the network cost, defined as the product of the degree and diameter, the former has n2 while the latter has 4n2. In other words, it means that matrix hypercube graph MH(2,n) is better than hypercube graph Q2n with respect to the network cost.