• Journal of Satellite, Information and Communications
• /
• v.11 no.2
• /
• pp.29-35
• /
• 2016

High-availability seamless redundancy (HSR) is a fault-tolerant protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy is forwarded on a separate physical path. HSR is a potential candidate for several fault-tolerant Ethernet applications, including smart-grid communications. However, the major drawback of the HSR protocol is that it generates and circulates unnecessary frames within connected rings regardless of the presence of a destination node in the ring. This downside degrades network performance and can deplete network resources. Two simple but efficient approaches have previously been proposed to solve the above problem: quick removing (QR) and port locking (PL). In this paper, we will present a hybrid approach, QRPL, by combining QR with PL, resulting in further traffic reductions. Our analysis showed that network traffic is significantly reduced for a large-sized HSR connected ring network compared to the standard HSR protocol, QR, and PL.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.3
• /
• pp.19-25
• /
• 2002

Bluetooth, in radio network environment, is a small local radio communication that is available with low expense and little power use. It is specified for the wireless connect in a small area between Network Excess Point, portable devices such as mobile phones. PDAs and portable PCs, and other per peripheral equipment. Bluetooth is consisted of a master and a piconet having seven slaves in a maximum and finally has a scatternet gathering lot of piconet. The thesis tries to design the most effective structure of a scatternet by the number of nodes and the type of scatternet such as linear and ring for its mechanism. then the performance evaluation is realized through the Bluehoc simulator based on the NS. Finally the most appropriate radio network environment is made by the comparison and analysis of the characteristics of liner and ring scatternets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.2
• /
• pp.160-170
• /
• 1988

This paper describes the outboard NIU(Network Interface Unit) using microprocessor and the hardware and software of concentrator for constructing star typed LAN(Local Area Network) based on token ring method. The NIU adapter can adapter up to four parallel and serial typed terminals. Because it has PAD function on input output data, any type of terminals can be adapted. Since the concentrator has logical switching circuit which enables data to bypass the faulted NIU adapter, this network prevents communication break. When user transmits and receives data, the concentrator constructs star typed LAN which connct both transmitting and receiving sides. A s result, this network eliminated ring latency time in other NIU exculding transmitting and receiving NIU. So the throughput of this LAN is increased. Because this LAN system consists of several modultes according to it's function, the expansion of function or the modification of method is easy.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.200-207
• /
• 2009

In this paper, novel traffic gromming algorithms are proposed with a primary goal of maximize the throughput in WDM(Wavelength Division Multiplexing) ring networks. To achieve this goal, we analyze two network designs that are Lightpath Designs and Virtual Topology Designs and simulate the throughput in various traffic environments. From this methods, we propose novel traffic gromming algorithms to maximize the throughput.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11B
• /
• pp.663-672
• /
• 2007

This paper proposes an algorithm for design of a multiple ring network that can be applied to an arbitrary topology in the WDM optical transport networks. Especially, we suggest an integer linear program(ILP) formulation with the objective of minimizing the total cost of nodes based on the reconfigurable OADM(ROADM) architecture and propose a heuristic algorithm to reduce computational complexity of the exact problem formulation. To evaluate the performance and validity of this scheme, we applied it to an NSFnet topology assuming the dynamic or static traffic condition and compared it with a mesh methodology about capacity of connection requests and the total cost of the nodes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.177-187
• /
• 2000

In the past several years, many systems which adopted ring topology with high-speed unidirectional point-to-point links have emerged to overcome the limit of bus for interconnection network of clustered multiprocessor system. However, rapid increase of processor speed and performance improvement of local bus and memory system limit scalability of system with point-to-point link of standard bandwidth. Therefore, necessity to extend bandwidth is emphasized. In this paper, we adopt PANDA system as base model, which is clustering-based multiprocessor system. By simulating a model adopting commercial processor and local bus specification, we show that point-to-point link is bottleneck of system performance, and bandwidth expansion by more than 200% is needed. To expand bandwidth of interconnection network, it needs excessive design cost and time to develop new point-to-point link with doubled bandwidth. As an alternative to double bandwidth, we propose several ways to implement dual ring -simple dual ring, transaction-separated dual ring, direction-separated dual ring- by using off-the-shelf point-to-point links with IEEE standard bandwidth. We analyze pros. and cons. of each model compared with doubled-bandwidth single ring by simulation.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2292-2294
• /
• 2002

This paper presents the network of Distributed Control System(DCS) considering specification of nuclear power plant. The network is composed of field network, control network and information network. The protocol of control network is ring type and it is compared to ethernet type. This paper proposes the structure of DCS, the protocol of each network and analyzes the network traffic along data capacity of field network, control network, information network and the network performance. Network II.5 is used as traffic simulation tool.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.02a
• /
• pp.307-308
• /
• 2009

To reduce delay for high priority packets in the ring-based EPON, the EPON packet classifier groups services as their priorities and frames for services are dynamically framed as their priorities. Since dynamic framing for a packet priority dynamically changes assignment spaces in the maximum framing packet size as network traffics, it makes services with high priority to improve quality of services with relative low threshold time for transmitting.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.490-493
• /
• 2006

본 논문은 Linux Cluster의 MPICH에서 MPI_Allgather Algorithm의 성능을 개선하고 실험을 통해 최대 30%의 성능향상을 증명하였다. MPICH의 기존 버전이 메시지의 크기와 실행 프로세스 수에 따라 Recursive Doubling, Bruck Algorithm, Ring Algorithm을 차등 적용했던 것을, 앞의 Algorithm을 개선하여 Double Bruck Algorithm, Double Ring Algorithm을 제안, 구현하였다.