• ETRI Journal
• /
• v.30 no.6
• /
• pp.874-876
• /
• 2008

Ethernet ring protection is a new technology introduced in ITU-T Recommendation G.8032, which utilizes the generic Ethernet MAC functions. We introduce an alternative enhanced protection switching scheme to suppress penalty in the switching transient, in which the Ethernet MAC filtering database (FDB) is actively and directly modified by information disseminated from the nodes adjacent to failure. The modified FDB at all nodes are guaranteed to be consistent to form a complete new ring network topology immediately. This scheme can reduce the capacity requirement of the G.8032 by several times. This proposed scheme can be also applied in IP protection rings.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.201-207
• /
• 2003

A multi-hop ad-hoc network can be formed out of Bluetooth capable devices through the use of scatternets. Many topologies can be deployed for scatternet; the most commonly proposed topology in the literature are tree structure and ring structure. We analyze the performance between tree formation algorithm and ring formation algorithm. We then present quantative result that compare the expected traffic performance between Blutooth ring scatternet and Bluetooth tree scatternet. The simulation results showes that Ring structure of scatterent have good performance than Tree structure over mobile environments.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.321-328
• /
• 2012

A novel design for a simple rectangular ring with open-ended monopole antenna wireless local area network (WLAN) applications is proposed in this article. The proposed antenna consists of an open-ended rectangular ring, an inverted L-strip, and a rectangular slit in the ground plane, and is fed by a 50 ${\Omega}$ microstrip feed-line. Prototypes of the proposed antenna were designed, fabricated, and tested. Experimental results show that the proposed antenna receives 2.3125-2.775 GHz and 4.8625-6.7125 GHz with a return loss less than -10 dB, covering the required bandwidths of the 2.4/5.2/5.8 GHz WLAN standards. Meanwhile, the 2D radiation patterns and 3D gain performance of the antenna in the operation bands were also observed and discussed.

• 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.

• 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 Satellite, Information and Communications
• /
• v.9 no.1
• /
• pp.51-56
• /
• 2014

High-availability seamless redundancy (HSR) is a protocol for fault-tolerant Ethernet (FTE) networks. It provides two frame copies and each copy is forwarded on a separate physical path, which provides zero fail-over time. Therefore, the HSR is becoming a potential candidate for various real-time FTE applications. However, the generation and circulation of unnecessary frames due to the duplication of every sending frame is inherent drawback of HSR. Such drawback degrades the performance of the network and may deplete its resources. In this paper, we present a new algorithm called port locking (PL) based on the media access control (MAC) address to solve the abovementioned problem in popular connected-rings network. Our approach makes the network gradually learn the locations of the source and the destination nodes without relying on network control frames. It then prunes all the rings that do not contain the destination node by locking corresponding rings' entrance ports. With the PL algorithm, the traffic can be significantly reduced and therefore the network performance will be greatly enhanced specially in a large scale connected-rings network. Analytical results are provided to validate the PL algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1247-1253
• /
• 2000

To fully utilize the capabilities of a SONET/ADM network, traffic grooming is needed to multiplex a number of lower-rate traffic streams into a higher-rate stream, and vice versa. Although the capacity of a SONET ring network can be upgraded by operating it over multiple wavelengths, the corresponding network design may be costly if it employs a large number of ADMs. A cost-effective design attempts to minimize the total number of ADMs used in the network while carrying the offered traffic. We introduce and evaluate the performance characteristics of a new traffic-grooming approach for WDM ring networks, called multihop. The multihop implementation places an ADM at each node based on the requested traffic in the traffic-demand matrix then, it tries to groom the wavelengths which can be groomed. We select one of the nodes to be the "hub" node which has an ADM for each wavelength. The hub node, therefore, can "bridge" traffic between all of the wavelengths. The algorithm is specified and illustrated by a simple example. Our results demonstrate that it is beneficial to use a single-hop approach, but for a large grooming ratio and node number, we advocate the use of the multihop approach.e multihop approach.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1107-1117
• /
• 2006

In this paper, a load balancing method using ring network structure in the Grid database is proposed. In the Grid database, generally, data is replicated for performance and availability. And, user's request is transferred to node and processed in that node which has target data. But, in such environment, a decline of performance can be occurred because unbalanced workload. A traditional research is proposed to solve unbalanced load problem. However, the Grid database has a number of systems and user's request always changes dynamically. Therefore, a traditional research can not be applied. The proposed method connects each node which has a same replicated data through ing network structure. If workload is overflowed in some node, user's request is transferred to a linked node which has a target data. And, this node stops another request processing until workload is decreased. Then, it changes the link structure through sending a message to a previous node, to stop request forwarding from a previous node. This paper shows a proposed method increases performance than existing research through performance evaluation and is more suitable for a complex and dynamic environment.