• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.540-542
• /
• 1999

We develop jumping ring system with sensor and control system using dynamic neural networks. Jumping ring, sensor and control system are controlled by 586 PC using Turbo C program. Sensor system is composed of 20 optical sensors and encoder. The control circuits are consisted of thyristor, FET and phase controller. A/D converter and optical sensor acquire real time motion data of the jumping ring system. The information of acquired jumping ring Position is estimated by using dynamic neural networks. Estimated control signals are sent to control circuits and D/A converter to track desired position of the jumping ring system. Experiment results are given to verify that proposed dynamic controller is useful in real jumping ring system.

• Journal of Sensor Science and Technology
• /
• v.28 no.2
• /
• pp.121-126
• /
• 2019

The voltage-controlled oscillator is one of the fundamental building blocks that determine the signal quality and power consumption in RF transceivers for wireless sensor networks. Ring oscillators are attractive owing to their small form factor and multi-phase capability despite the relatively poor phase noise performance in comparison with LC oscillators. The phase noise of a ring oscillator can be improved by using a coupled structure that works at a lower frequency. This paper introduces a 2.4 GHz low-noise ring oscillator that consists of two 3-stage coupled ring oscillators. Each sub-oscillator operates at 800 MHz, and the multi-phase signals are combined to generate a 2.4 GHz quadrature output. The voltage-controlled ring oscillator designed in a 65-nm standard CMOS technology has a tuning range of 800 MHz and exhibits the phase noise of -104 dBc/Hz at 1 MHz offset. The power consumption is 13.3 mW from a 1.2 V supply voltage.

• Journal of IKEEE
• /
• v.15 no.2
• /
• pp.157-163
• /
• 2011

In this paper, novel traffic groomming algorithms are proposed with a primary goal for maximizing throughput in WDM Multi-ring networks. To achieve this goal, we design four network topologys that are ITG, STG, MTG, PMTG and simulate the throughput in uniform traffic environments. From this methods, we proposed novel traffic groomming algorithms to maximize throughput in WDM Multi-ring networks.

• ETRI Journal
• /
• v.29 no.1
• /
• pp.116-119
• /
• 2007

In this letter, we design a collision resolution protocol for optical burst switching ring networks to avoid burst collision. We define the offset time condition for no burst transmission collision and manage the free time list of nodes for no burst reception collision. In order to improve the throughput, we use a fiber delay line, void-filling, and void-compression. This protocol does not require any additional procedures for bandwidth reservation such as centralized assignment of bandwidth, lightpath setup of WDM ring networks, or token capturing for the burst transmission. The simulation results show that the proposed protocol can achieve high throughput while saving 70% of wavelengths when compared to round robin with random selection, round robin with persistent, and round robin with non-persistent with only destination delay.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.51-60
• /
• 2007

In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1606-1623
• /
• 2015

Optical switching will be applied in datacenter networks because electronic switching is costly and power-consuming. In this paper, considering the ring-based interconnection using optical switching in the core of a datacenter, we study the home circuit (HC) construction for the labeled optical burst switching with home circuit (LOBS-HC), a new paradigm trying to share wavelengths among the HCs from the same source. In particular, aiming to construct HCs dynamically and properly, a scheme named optimal path matching and symmetric HC matching (OPM-SHM) is proposed. The main idea of OPM-SHM is to dynamically construct HCs by sharing wavelength(s) not only among the same-source HCs but also with symmetric HCs which have different sources other than the original LOBS-HC features. The simulation results demonstrate that OPM-SHM achieves better performance than some other methods in terms of burst loss rate and wavelength utilization of physical links. More specially, it maintains good load balancing for the datacenter network using an LOBS-HC ring. In addition, due to the symmetric feature of SHM, the proposed scheme can decrease the upper bound of the average hop count of the routing paths to half of the ring size.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.135-138
• /
• 2004

This paper considers a ring loading problem on RPR(Resilient Packet Ring), where RPR is recommended by IEEE802.17 Resilient Packet Ring working group for data optimized networks without the requirements of provisioning circuits. RPR is well suitable for metropolitan area network with two counter-rotating rings that multiple stations share the bandwidth, where the data and its corresponding control traffic is transmitted to the two opposite directional ring, respectively. One of the major concerns on RPR is to provide fairness among traffic requirements. The paper discusses several fairness measures and analysis ring loading problems for the fairness.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.2
• /
• pp.255-263
• /
• 1996

Optical fiber systems play an essential role In today's telecommunications networks. The recently standardized SONET technology has made a ring structure the preferred architecture for inter-city communication networks. In designing a SONET with ring structure, we consider inserting optional cites, which are not necessary in constructing the SONET, but cost-effective in connecting essential nodes in the ring. This problem is modeled as Steiner ring problem. Efficient heuristic procedures are developed based on the procedures for the traveling salesman problem. Computational results show that the proposed algorithm is excellent compared to the optimal solution. The error bound by the proposed method is 2 - 6% in experimented problems.

• International Journal of Contents
• /
• v.5 no.4
• /
• pp.88-93
• /
• 2009

It is important for communication networks to possess the capability to overcome failures and provide survivable services. We address modeling and analysis of performability affected by both performance and availability of system components for a token ring network under failure and repair conditions. Stochastic reward nets (SRN) is an extension of stochastic Petri nets and provides compact modeling facilities for system analysis. In this paper, hierarchical SRN modeling techniques are used to overcome state largeness problem. The upper level model is used to compute availability and the lower level model captures the performance. And Normalized Throughput Loss (NTL) is obtained for the composite ring network for each node failures occurrence as a performability measure. One of the key contributions of this paper constitutes the Petri nets modeling techniques instead of complicate numerical analysis of Markov chains and easy way of performability analysis for a token ring network under SRN reward concepts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.15-30
• /
• 2000

The important considerations in the design of fiber-optic networks are reliability and survivability preparing against a failure. The SDH(Synchronous Digital Hierarchy), the international standard of optical transmission, offers several network reconfiguration methods that enable network to be automatically restored from failure. One of the methods is the SHR(Self Healing Ring), which is a ring topology system. Most network providers have constructed their backbone networks with SHR architecture since it can provide survivability economically. The network architecture has eventually evolved into a multi-ring network comprised of interconnected rings. This paper addresses multi-ring network design problems is to minimize ring-construction cost. This problem can be formulated with MIP(mixed integer programming) model. However, it is difficult to solve the model within reasonable computing time on a large scale network because the model is NP-complete. Furthermore, in practice we should consider the problem of routing demands on rings to minimize total cost. This routing problem involves multiplex bundling at the intermediate nodes. A family of heuristic algorithms is presented for this problem. These algorithms include gateway selection and routing of inter-ring demands as well as load balancing on single rings. The developed heuristic algorithms are applied to some network provider's regional and long-distance transmission networks. We show an example of ring design and compare it with another ring topology design. Finally, we analysis the effect bundling.