• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.1
• /
• pp.33-41
• /
• 2011

This paper considers a topological optimization of a network design with mean packet delay and node connectivity constraints. The objective is to find the topological layout of links, at minimal cost. This Problem is known to be NP-hard. To efficiently solve the problem, a scatter search algorithm is proposed. An illustrative example is used to explain and test the proposal approach. Experimental results show evidence that the proposal approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic approach.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.1
• /
• pp.101-107
• /
• 2008

This paper considers a topological optimization of a computer network design with a reliability constraint. The objective is to find the topological layout of links, at minimal cost, under the constraint that the network reliability is more than a given reliability. To efficiently solve the problem, a scatter search approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic algorithm approach.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1227-1237
• /
• 2008

In this paper, we analyze topological properties and embedding of Folded Hyper-Star network to further improve the network cost of Hypercube, a major interconnection network. Folded Hyper-Star network has a recursive expansion and maximal fault tolerance. The result of embedding is that Folded Hypercube $FQ_n$ and $n{\times}n$ Torus can be embedded into Folded Hyper-Star FHS(2n,n) with dilation 2. Also, we show Folded Hyper-Star FHS(2n,n) can be embedded into Folded Hypercube $FQ_{2n-1}$ with dilation 1.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• pp.243-243
• /
• 1997

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.926-937
• /
• 1996

A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2004.11a
• /
• pp.37-41
• /
• 2004

The existing network can be expanded with addition of new nodes and multiple choices of link type for each nossible link. In this paper, the design problem of network expansion is defined as finding the network topology minimizing cost subject to reliability constraint. To efficiently solve the problem, an genetic algorithm approach is suggested.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.1-7
• /
• 2010

In this paper, a high-performance fault-tolerant switching network using a deflection self-routing was proposed. From an abstract algebraic analysis of the topological properties of the Delta network, which is a baseline switching network, we derive the Multidimensional Ring-Delta network: a multipath switching network using a deflection self-routing algorithm. All of the links including already existing links of the Delta network are used to provide the alternate paths detouring faulty/congested links. We ran a simulation analysis under the traffic loads having the non-uniform address distributions that are usual in Internet. The throughput of $1024\;{\times}\;1024$ switching network proposed is better than that of the 2D ring-Banyan network by 13.3 %, when the input traffic load is 1.0 and the hot ratio is 0.9. The reliability of $64\;{\times}\;64$ switching network proposed is better than that of the 2D ring-Banyan network by 46.6%.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.959-977
• /
• 2022

The topological indices are numerical parameters which determined the biological, physical and chemical properties based on the structure of the chemical compounds. One of the recently topological indices is the uphill Zagreb indices. In this paper, the formulae of some uphill Zagreb indices for a few graph operations of some graphs have been derived. Furthermore, the precise formulae of those indices for the honeycomb network have been found along with their graphical profiles.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.3
• /
• pp.205-225
• /
• 2022

In this paper, we derive analytical closed results for the first (a, b)-KA index, the Sombor index, the modified Sombor index, the first reduced (a, b)-KA index, the reduced Sombor index, the reduced modified Sombor index, the second reduced (a, b)-KA index and the mean Sombor index mSO_α for the OTIS biswapped networks by considering basis graphs as path, wheel graph, complete bipartite graph and r-regular graphs. Network theory plays a significant role in electronic and electrical engineering, such as signal processing, networking, communication theory, and so on. A topological index (TI) is a real number associated with graph networks that correlates chemical networks with a variety of physical and chemical properties as well as chemical reactivity. The Optical Transpose Interconnection System (OTIS) network has recently received increased interest due to its potential uses in parallel and distributed systems.

• Journal of the Economic Geographical Society of Korea
• /
• v.10 no.4
• /
• pp.427-443
• /
• 2007

The purpose of this study is to investigate spacio-temporal structures of traffic flows on the subway network in the Metropolitan Seoul, and the relationships between topological structures of traffic flows and land use patterns. In particular we analyze in the topological structures of traffic flows on the subway network in time dimension as well as in spatial dimension. For the purpose, this study utilizes data mining techniques to the one day T-card transaction data of the last four years, which has developed for exploring the characteristics of traffic flows from large scale trip-transaction databases. The topological structures of traffic flows on the subway network has changed considerably during the last four years. The volumes of traffic flows, the travel time and stops per trip have increased until 2006 and decreased again in 2007. The results are visualized by utilizing GIS and analyzed, and thus the spatial patterns of traffic flows are analyzed. The spatial distribution patterns of trip origins and destinations show substantial differences among time zones during a day. We analyze the relationships between traffic flows at subway stops and the geographical variables reflecting land use around them. We obtain 6 log-linear functions from stepwise multiple regression analysis. We test multicollinearity among the variables and autocollelation for the residuals.