• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.541-543
• /
• 2001

비대칭 링크 상에서 TCP 전송율 향상을 위한 새로운 기법을 제시하였다. 기존 TCP는 비대칭 링크에서 수신단의 전송버퍼의 오버프로우에 인하여 패킷의 재전송, 타임아웃 등으로 인하여 전송율이 상당히 낮아지는 문제점을 가진다. 본 논문에서는 이러한 단점을 극복하기 위해 수신단의 전송 버퍼가 가득 찰 경우. 이를 송신 단에게 통보하여 송신단은 전송을 중단하고, 혼잡 윈도우를 유지함으로써. 전송 버퍼의 여유가 생겨서 수신단이 송신단에 이를 통보하여 다시 전송이 가능해졌을 경우 송신단이 즉시 전송을 재개할 수 있도록 하였다 제안된 기법의 성능 향상을 시뮬레이션을 통해 확인하였다 .

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1046-1054
• /
• 2002

In this paper, we propose a subnetwork-based segment restoration scheme to reduce the restoration time and restoration resources. And we compare and analyze the restoration performance according to the size of divided subnetworks. Segment restoration is based on network partitioning where a large network is divided into several small subnetworks and the end-to-end data path is divided into multiple segments according to the subnetworks. In segment restoration, the link/node failure is restored by segment instead of end-to-end path. Because most faults are restored within the subnetwork, the restoration performance can be improved. From the simulation analysis, we verified that the proposed segment restoration has advantage of restoration time and backup resource utilization.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.2
• /
• pp.74-84
• /
• 2022

Vehicle average speed information which measured at a point or a short section has a problem in that it cannot accurately provide the speed changes on an actual highway. In this study, segment separation method based on vehicle big data for accurate micro-speed estimation is proposed. In this study, to find the point where the speed deviation occurs using location-based individual vehicle big data, time and space mean speed functions were used. Next, points being changed micro-scale speed are classified through gradual segment separation based on geohash. By the comparative evaluation for the results, this study presents that the link-based speed is could not represent accurate speed for micro-scale segments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.49-58
• /
• 2010

In this paper, we present a methodology for fast segment restoration under multiple simultaneous link failures in mesh-type MPLS networks. The salient feature of the methodology is that both resilience and QoS constraint conditions have been taken into account for fast segment restoration. For fast restoration, a sufficient condition for testing the existence of backup segments with guaranteed-resilience has been derived for a mesh-type MPLS network. The algorithms for constructing backup segments which can meet both resilience and QoS constraint conditions are then presented with illustrating examples. Finally, simulation has been done to show the efficiency of the proposed segment restoration algorithms.

• Journal of Korean Society of Forest Science
• /
• v.82 no.1
• /
• pp.34-43
• /
• 1993

In this paper, the characteristics of cable logging operations are discussed from a standpoint of mechanics. An example of standing skyline operations is used to illustrate the mechanical principles. Using force and moment boundary conditions, the maximum allowable payload was formulated as a function of slope profile, system geometry and operation options. This formulation includes fundamental equations for log drag and single segment mechanics. The catenary link model is the basic assumption in simulating cable segment stretches. In order to demonstrate the solution procedures of the formulation, a computer model was developed. The model uses Secant algorithm to determine the solution of the complex nonlinear equation set. Finally, the computer model was demonstrated using a hypothetical data set.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.43-54
• /
• 1996

This paper presents new heuristic search algorithms for searching rectilinear r(L1), link metric, and combined shortest paths in the presence of orthogonal obstacles. The GMD(GuidedMinimum Detour) algorithm combines the best features of maze-running algorithms and line-search algorithms. The SGMD(Line-by-Line GuidedMinimum Detour)algorithm is a modiffication of the GMD algorithm that improves efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A search method without constructing a connection graph that contains a shortest path. The GMD and the LGMD algorithms can be implemented in O(m＋eloge＋NlogN) and O(eloge＋NlogN) time, respectively, and O(e＋N) space, where m is the total number of searched nodes, is the number of boundary sides of obstacles, and N is the total number of searched line segment. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and Link Metric shortest path in terms of the length and the number of bands.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.11
• /
• pp.1711-1718
• /
• 2004

When the tracked vehicle is running on various types of terrain, the physical properties of the interacting ground can be different. In this paper, the interactions between track link and soft soil ground are investigated using static sinkage theory of soil ground. Grouser surfaces of a track link and triangular patches of ground are implemented for contact detection algorithm. Contact force at each segment area of a track link is computed respectively by using virtual work concept. Bekker's static soil sinkage model is applied for pressure-sinkage relationship and shear stress-shear displacement relationship proposed by Janosi and Hanamoto is used for tangential shear forces. The repetitive normal loads of a terrain are considered because a terrain element is subject to the repetitive loading of the roadwheels of a tracked vehicle. The methods how to apply Bekker's soil theory for multibody track system are proposed in this investigation and demonstrated numerically by high mobility tracked vehicle.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• Journal of Information Technology Services
• /
• v.7 no.2
• /
• pp.181-195
• /
• 2008

The rapid growth of mobile communication technology has provided the expansion of mobile internet services, particularly mobile realtime transaction takes much weight among mobile fields. There is an increasing demand for various mobile applications to process transactions in a mobile computing fields. Thus, During transmission in wireless networks a base station failure inevitably causes data loss of the base station buffer. It is required to compensate the loss for communication. The existing methods for a base station failure are not adequate because they all suffer from too much overhead and resolve only the link failure. In this paper, we study an efficient recovry systems for a mobile DBMS. We propose SLL (Segment Log List) that enables the mobile host to compensate data loss efficiently in the case of base station failure. In SLL, a base station deliveries an output information of data cells to a mobile host. when a base station fails, the mobile host can retransmit just next data cells. We also prove the efficiency of new method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.3
• /
• pp.13-20
• /
• 1983

A method for the detecting defined vertices is described in this paper. An alogrithm detecting vertex position by means of calculating an error and distinguishing the defined inner and outer corners by the chain code of line segments is described. To calculate the error, virtual links are detected by means of a jointing relations of line segments for a contour. And so an error is calculated by measuring a minimum distance from a jointing point between the line segments to virtual link. As a result, this method is more flexible and effective than conventional Freeman's method.