• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.255-263
• /
• 2000

A multistage interconnection network is a suitable class of interconnection architecture for constructing large-scale multicomputers. Broadcast and multicast communication are fundamental in supporting collective communication operations such as reduction and barrier synchronization. In this paper, we propose a new multicast technique in wormhole-switched bidirectional multistage banyan networks for constructing large-scale multicomputers. To efficiently support broadcast and multicast with simple additional hardware without deadlock, we propose a two-phase multicast algorithm which takes only two transmissions to perform a broadcast and a multicast to an arbitrary number of desired destinations. We encode a header as a cube and adopt the most upper input link first scheme with periodic priority rotation as arbitration mechanism on contented output links. We coalesce the desired destination addresses into multiple number of cubes. And then, we evaluate the performance of the proposed algorithm by simulation. The proposed two-phase multicast algorithm makes a significant improvement in terms of latency. It is noticeable that the two-phase algorithm keeps broadcast latency as efficient as the multicast latency of fanout 2^m where m is the minimum integer satisfying $2^m{\geq} {\sqrt{N}}$ ( N is a network size).

• Journal of the Society of Naval Architects of Korea
• /
• v.53 no.3
• /
• pp.237-248
• /
• 2016

As OPB and IPB moment-induced fatigue damage on mooring chain links were reported for a offloading buoy, verification of OPB and IPB fatigue has been a key engineering item in offshore structure mooring design. Mathematical and physical features of the conventional approach which was mainly explained in BV guideline are reviewed and disadvantages of the conventional approach are addressed in terms of stress proportionality and nonlinearity of OPB and IPB moments. In order to eradicate these disadvantages, a novel approach is newly proposed which is able to dispel apprehension on stress proportionality and is not dependent of nonlinearities of OPB and IPB moments. Significant differences between two approaches are suggested by comparing relations of OPB moment versus OPB interlink angle and IPB moment versus IPB interlink angle. For periodic OPB tension angle processes having three different OPB angle ranges with a simple irregular tension process, fatigue damage calculation reveals that OPB moment-induced fatigue damage has dominant portion to total fatigue damage. Comparative studies between two approaches also show that the conventional approach based on BV guideline predicts fatigue damage far conservatively since it assume unrealistic high stress concentration factor for tension load. Meanwhile IPB moment-induced fatigue damage is negligible compared to tension-induced fatigue damage.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.1
• /
• pp.91-103
• /
• 2006

Given a bill of materials (BOM) tree T labeled by the breadth first search (BFS) order from node 0 to node n and a general network ${\Im}=(V,A)$, where V={1,2,...,m} is the set of production facilities and A is the set of arcs representing transportation links between any of two facilities, we assume that each node of T stands for not only a component. but also a production stage which is a possible stocking point and operates under a periodic review base-stock policy, We also assume that the random demand which can be achieved by a suitable service level only occurs at the root node 0 of T and has a normal distribution $N({\mu},{\sigma}^2)$. Then our integrated model of facility location problems and safety stock optimization problem (FLP&SSOP) is to identify both the facility locations at which partitioned subtrees of T are produced and the optimal assignment of safety stocks so that the sum of production cost, inventory holding cost, and transportation cost is minimized while meeting the pre-specified service level for the final product. In this paper, we first formulate (FLP&SSOP) as a nonlinear integer programming model and show that it can be reformulated as a 0-1 linear integer programming model with an exponential number of decision variables. We then show that the linear programming relaxation of the reformulated model has an integrality property which guarantees that it can be optimally solved by a column generation method.

• Journal of Digital Contents Society
• /
• v.15 no.1
• /
• pp.1-9
• /
• 2014

Delay-Tolerant Network (DTN) is an asynchronous networking technology that has been deployed for the networking environment in which steady communication paths are not available, and therefore it stores receiving data in a data storage and forward them only when the communication links are established. DTN can be applied to sensor networks and mobile ad-hoc network (MANET) as well as space communication that supports data transmissions among satellites. In DTN networking environments, it is very important to secure a scheme that has relatively low routing overhead and high reliability, so that it can enhance the overall routing speed and performance. In order for achieving efficient data transmissions among the nodes that have comparatively periodic moving patterns, this paper proposes a time information based DTN routing scheme which is able to predict routing paths. From the simulation results using Omnet++ simulation tools, it has been verified that the proposed time information based DTN routing algorithm shows satisfied levels of routing speed and routing reliability even with lower routing overheads.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.556-560
• /
• 2010

In the wireless sensor networks using a multi-hop, quality variation of links occurs irregularly due to the hardware restriction and environmental factor. If an appropriate route, which is affected by the quality variation, is not selected. Traditionally, a beacon is periodically broadcasted and the link quality is estimated. However, the periodically beacon based scheme cannot efficiently estimate the quality of the link changing irregularly. In this paper, a scheme to estimate the link quality adaptively according to network state is proposed. When the link quality changes, the scheme adapts to a change agilely and packet losses are reduced. When there is no change of the link quality, the link quality is estimated in the long period and the energy consumption is reduced. Through performance evaluations, we prove that our adaptive link estimation scheme improves the energy efficiency and packet reception ratio than the periodic estimation scheme.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.4
• /
• pp.86-98
• /
• 2018

Since 2015, the Korea Expressway Corporation has provided predicted travel time information, which is reproduced from DSRC systems over the extended expressway network in Korea. When it is open for public information, it helps travelers decide optimal routes while minimizing traffic congestions and travel cost. Although, sutiable evaluations to investigate the reliability of travel time forecast information have not been conducted so far. First of all, this study seeks to find out a measure of effectiveness to evaluate the reliability of travel time forecast via various literatures. Secondly, using the performance measurement, this study evaluates concurrent travel time forecast information in highway quantitatively and examines the forecast error by exploratory data analysis. It appears that most of highway lines provided reliable forecast information. However, we found significant over/under-forecast on a few links within several long lines and it turns out that such minor errors reduce overall reliability in travel time forecast of the corresponding highway lines. This study would help to build a priority for quality control of the travel time forecast information system, and highlight the importance of performing periodic and sustainable management for travel time forecast information.