• Management Science and Financial Engineering
• /
• v.9 no.1
• /
• pp.11-27
• /
• 2003

In this study, we propose a mathematical model based on the graph theory for the wavelength assignment problem arising in the design of SDH (Synchronous Digital Hierarchy) over WDM (Wavelength Division Multiplexing) ring networks. We propose a branch- and -price algorithm to solve the suggested models effectively within reasonable time in realistic SDH over WDM ring networks. By exploiting the structure of ring networks, we developed a polynomial time algorithm for efficient column generation and a branching rule that conserves the structure of column generation. In a computer simulation study, the suggested approach can find the optimal solutions within reasonable time and show better performance than the existing heuristics.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.196-208
• /
• 2005

In multiprocessor systems, interconnection network design is critical for overall system performance. Popular interconnection networks, which are generally considered, are meshes, rings, and hierarchical rings. In this paper, we propose (')Torus Ring('), which is a modified version of hierarchical ring. Torus Ring has the same complexity as the hierarchical rings, but the only difference is the way it connects the local rings. It has an advantage over the hierarchical rings when the destination of a packet is the neighbor local ring in the reverse direction. Though the average number of hops in Torus Ring is equal to that of the hierarchical rings when assuming the uniform distribution of each transaction, the benefits of the number of hops are expected to be larger because of the spatial locality in the real environment of parallel programming. In the simulation results, latencies in the interconnection network are reduced by up to 19$\%$, and the execution times are reduced by up to 10$\%$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.645-651
• /
• 2002

This thesis describes two wavelength allocation algorithms applied to OMS (Optical Multiplex Section) or OCh (Optical Channel) SPRING (Shared Protection Ring) and compares their characteristics by simulations. Two wavelength allocation algorithms are optimal algorithm and nonblocking algorithm applicable on SPRING WDM networks. In particular, when a node is added in previous ring network, how to work for each algorithm is considered. The optimal algorithm is better than nonblocking for most of comparisons. Nonblocking algorithm has an important advantage, though. Nonblocking algorithm has no wavelength connection or allocation to reconfigure some previous connections.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.10
• /
• pp.55-62
• /
• 2017

In this paper, we proposes a multi-ring based mobile sink location scheme for solar-powered wireless sensor network (WSN). The proposed scheme maintains the multi-rings in which nodes keep the current location of sink node. With the help of nodes in multi-rings, each node can locate the sink node efficiently with low-overhead. Moreover, because our scheme utilizes only surplus energy of a node, it can maintain multiple rings without degrading any performance of each node. Experimental results show that the proposed scheme shows much better latency and scalability with lower energy-consumption than the existing single-ring based scheme.

• Journal of Aerospace System Engineering
• /
• v.16 no.4
• /
• pp.68-76
• /
• 2022

The purpose of this paper was to design the cable networks for mesh reflector antennas, considering the flexibility of structures. An effective form-find methodology is proposed. The whole parts of the cable networks are described by the absolute nodal coordinate formulation. Additionally, nonlinear deformation of the cable can be obtained. The form-finding analysis of the reflector with standard configuration is performed, to validate the proposed methodology. The truss ring structure is numerically modeled using the frame elements. To consider the flexibility of the truss ring as well as the cable net structure, an iteration analysis between the truss ring and the cable net under tensional forces is also performed in the form-finding process. The finial configuration of the reflector with tensioned cable networks is demonstrated.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.93-104
• /
• 2007

Traffic grooming, in which low-rate circuits are multiplexed onto wavelengths, with the goal of minimizing the number of add-drop multiplexers (ADMs) and wavelengths has received much research attention from the optical networking community in recent years. While previous work has considered various traffic models and network architectures, protection requirements of the circuits have not been considered. In this paper, we consider survivable traffic grooming, or grooming traffic which contains a mix of circuits that need protection and that do not need protection. We assume a unidirectional ring network with all-to-all symmetric traffic with $t\geq1$ circuits between each node pair, of which s require protection. As it turns out, survivable traffic grooming presents a significant tradeoff between the number of wavelengths and the number of ADMs, which is almost non-existent in non-survivable traffic grooming for this type of traffic. We explore this tradeoff for some specific cases in this paper. We also present some new results and solution methods for solving certain non-survivable traffic grooming problems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.717-720
• /
• 2010

This paper considers the Quality of Service (QoS) provisioning mechanisms for the WDM burst switched ring networks. The loss-sensitive service and the delay-sensitive service are discussed. Considering their different requirements, different QoS provisioning schemes are proposed to provision them respectively. The proposed schemes are evaluated through simulation results.

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.8-15
• /
• 2007

Grid environments provide the mechanism to share heterogeneous resources among nodes. Because of the similarity between grid environments and P2P networks, the structures of P2P networks can be adapted to enhance scalability and efficiency in deployment and to search for services. In this paper, we present a membership management based on a hierarchical ring which constructs P2P-like Grid environments. The proposed approach uses only a limited number of connections, reducing communication cost. Also, it only keeps local information for membership, which leads to a further reduction in management cost. This paper analyzes the performance of the approach by simulation and compares it with other approaches.

• Journal of Korean Society for Quality Management
• /
• v.28 no.1
• /
• pp.105-118
• /
• 2000

In this paper, we consider an interconnection network, DRDT (Dual Receive Dual Transmit), that is a double-loop ring topology and adopts the concept of multiple packets transmission. For three types of DRDT configurations, we investigate some properties related to path sets and discuss the method for finding minimal path sets. Using the concept of the terminal reliability and the path sets approach, we evaluate the reliability of the DRDT networks and compare them with a single ring network and a unidirectional double-loop ring network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.571-578
• /
• 1998

In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.