• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1370-1376
• /
• 2000

Consider the problem to updata breadth-First Spanning Tree in response to topology change of the network. The paper proposes an efficient distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(p√q+q+a+n') respectively, where n' is the number fo processors in the network after the topology change, a is the number of added links, p is the total number of links in the biconnected component (of the network before the topology change) including the detected links or added links, and q is the total number of processors in the biconnected component (of the network before the topology change) including the deleted links or added links, and q is the total number of processors in the biconnected component including the deleted links or added links.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.83-93
• /
• 2014

It is a widespread concern that electrical interconnection based network-on-chip (NoC) will ultimately face the limitation in communication bandwidth, transmission latency and power consumption in the near future. With the development of silicon photonics technology, a hybrid optical network-on-chip (HONoC) which embraces both electrical- and optical interconnect, is emerging as a promising solution to overcome these problems. Today's leading edge systems-on-chips (SoCs) comprise heterogeneous many-cores for higher energy efficiency, therefore, extended study beyond regular topology based NoC is required. This paper proposes an energy and latency optimization topology design technique for HONoC taking into account the traffic characteristics of target applications. The proposed technique is implemented with genetic algorithm and simulation results show the reduction by 13.84% in power loss and 28.14% in average latency, respectively.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.1
• /
• pp.138-152
• /
• 2007

There has been much effort to improve the accuracy of the Internet topology model and include its quantitativeand/or qualitative effects on studies of a variety of network problems. Such improvement is the primarymotivation of this paper in listing and classifying the body of literature addressing the Internet topology. Themetrics, which characterize the fundamental properties of the Internet, are also divided into five categories andtheir importance and applications are discussed. Finally, we suggest several future research topics for theInternet topology models to be more realistic and applicable.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.411-414
• /
• 2006

Topology information can be aggregated in the network constructed hierarchically and aggregating topology information is known as TA(Topology Aggregation) and TA is very important for scalability in networks. It is a very important elements to extend networks and routing in networks. In paticular, routing and TA algorithm are much influence on networks performance in PNNI. Therefore, in this paper, we design and implement routing simulator for TA in PNNI.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.95-102
• /
• 2008

In this paper, we proposed topology aggregation method that efficiently aggregating topology information in simple node topology. And, it improved QoS of networks by improving call success rate and call access time. Proposed method can improving performance of network by decreasing aggregation information and aggregating multi-links information between boundary nodes using the line segment scheme within bandwidth and delay parameter. To evaluate performance of the proposed scheme, we compare/analyze the current method with the proposed scheme in respect to call success rate, access time.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.646-647
• /
• 2007

The topology processor uses the status of circuit breakers as input. It operates on the bus section connectivity data, which is stored in the data base, to determine the bus/branch topology of the network. This output of the topology processor forms part of the input to the state estimation or dispatcher power flow. This paper describes the development of the topology processor using matrix structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1421-1425
• /
• 1999

A restoration scheme is presented when a failure occurs at nodes or links on the ATM network. Each node on the network contains the same topology information for resources on the network by Exchanging NSE(Network State Element) which has the network state information through RCC(Routing Control Channel). We also propose a new establishing algorithm that set up a new alternate path reflecting the state of the network changed dynamically at the source node. In the result of applying our scheme, the rates of restoration can be improved and the number of messages decreased so that fast recovering could be possible by reducing traffics on the network by lowering the rates of the call-setup failure at the stage of CAC(Connection Admission Control).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3163-3181
• /
• 2023

Eavesdropping attacks have seriously threatened network security. Attackers could eavesdrop on target nodes and link to steal confidential data. In the traditional network architecture, the static routing path and the important nodes determined by the nature of network topology provide a great convenience for eavesdropping attacks. To resist monitoring attacks, this paper proposes a random routing mutation defense method based on dynamic path weight (DPW-RRM). It utilizes network centrality indicators to determine important nodes in the network topology and reduces the probability of important nodes in path selection, thereby distributing traffic to multiple communication paths, achieving the purpose of increasing the difficulty and cost of eavesdropping attacks. In addition, it dynamically adjusts the weight of the routing path through network state constraints to avoid link congestion and improve the availability of routing mutation. Experimental data shows that DPW-RRM could not only guarantee the normal algorithmic overhead, communication delay, and CPU load of the network, but also effectively resist eavesdropping attacks.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.9
• /
• pp.38-45
• /
• 2016

For higher efficiency and reliability of railroad trains with many electronic sensors and actuators, a distributed control system with which electronic components communicate with each other in a distributed manner via a data network is considered. This paper considers Ethernet-based Train Communication Network (TCN) for this purpose and proposes a methodology to optimize the topology in terms of transmission latency and reliability, each of which is modeled as the number of traversing backbone nodes and the number of cables between vehicles, respectively. An objective function is derived accordingly and a closed-form optimum is obtained by relaxing the integer constraint of the number of vehicles for a unit network. Then, the final integer optimum is searched around it. Through numerical evaluation, the validity of the proposed methodology and the characteristics of the resulting solutions are shown.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.2
• /
• pp.10-16
• /
• 2016

For higher reliability against a link failure of a control network in railway vehicles, a recovery mechanism is needed. We introduce a problem that, when a link failure occurs in a ring-topology control network, a node may experience a significant increase of transmission delay depending on its relative position within the network. We then propose two mechanisms to solve this problem: (1) differentiating and prioritizing node traffic in forwarding; and (2) switching some nodes to a backup bus-topology network. Our simulation study shows that, while the first mechanism achieves a limited gain by only compensating queuing delay, the second one gets a sufficient gain which is impacted by the number of nodes switched to the bus network.