• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2018.05a
• /
• pp.259-261
• /
• 2018

VTS 관제에서 시스템적 환경은 선박의 트래픽 이동 및 주변 상황 표현이 정확해야 하며, 이를 위하여 항상 최신의 전자해도를 유지하여야 한다. 따라서 VTS 환경에서 운용 시스템을 포함한 여러 시스템에서 전자해도를 이용하고 있으며, 일부 오래된 전자해도를 그대로 사용하는 문제가 있어 왔으며, 업데이트 자체가 보안적 문제와 운용성을 고려하여 진행되어야 하므로 번거로운 문제이기도 하다. 즉, VTS 시스템에서는 선박을 표출하는 화면에서 모든 선박위치, 지형지물 등 기본적인 전자해도의 역할이 매우 중요하고 데이터를 상호 교환하고 관제하는 과정에서도 섹터별 운용, 선박과 관제 센터간 상호 동기화, 최신화가 요구되어 왔다. 따라서, 본 논문에서는 VTS 국산화연구에 따른 상용화를 위하여, 관제환경의 편의성을 개선하기 위한 전자해도 업데이트 프로토콜을 설계하고, 다중의 운용시스템 환경과 사용자의 관제 환경의 업데이트를 통한 동기화를 검토하였으며, 향후 e-Navigation으로 진화시에 16개 MSP중 하나인 소형선박 등 다중 단말환경에서 전자해도 보안 업데이트 프로토콜로 확장하는 방안으로 진행될 수 있다.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.1077-1078
• /
• 2012

시계열 데이터는 기상데이터, 주식데이터, 센서 데이터, 네트워크 트래픽 데이터, 의료 데이터 등 다양한 분야에서 사용되고 있다. 그 중에서 서브시권스 매칭 방법은 시계열 데이터베이스 어플리케이션에서 많은 주목을 받고 있다. 기존의 서브시권스 매칭 방법은 단일 윈도우만을 비교하여 서브시권스 매칭을 수행하였으나, 착오해답을 줄이는 데에는 한계가 있었다. 따라서 다중 윈도우를 비교하여 착오해답을 줄이고 성능을 높일 수 있는 다중 윈도우를 이용한 서브시퀀스 매칭 방법을 구현하였다. 그 결과 단일 윈도우를 사용했을 때보다 약 4.8배까지 후보집합의 수가 줄어드는 것을 볼 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.604-612
• /
• 2000

In order to satisfy the desired QoS level associated with each existing connection, ATM networks require traffic policing during a connection. Users who respect the contract should receive the function of transparent traffic policing without any interruption. However, contract violations should be detected and mediated immediately. So we propose a CAM type policing controller to allow user cell streams to minimize additional delay. The proposed policing scheme controls policing actions including traffic shaping by suitably spacing cells on each virtual circuit. This policing action is based on parallel processing of multiple cell stream which arrive in ATM multiplexed virtual circuits. We have developed an analytical model of the proposed policing scheme to examine the amount of cell loss and delay, which depends on traffic load, the size of policing buffers and minimum spacing cell time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.956-965
• /
• 2000

In this paper, we propose an efficient traffic grooming algorithm to minimize to number of SONET ADMs which is the dominant cost of system in high speed optical ring networks. It is an optimal traffic grooming algorithm to be applied to both unidirectional ring and bi-directional ring under both uniform traffic and nonuniform traffic. The proposed traffic grooming algorithm consists of two subalgorithms : one is the algorithm to construct full connection-rings as many as possible to minimize gaps by cutting the connections and using redirection method, and the other is the algorithm to groom connection-rings into a wavelength to maximize the number of shared nodes. The simulation results show that the proposed algorithm is superior to conventional algorithm under various network conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1852-1861
• /
• 1999

In this paper, CDMA Reservation ALOHA scheme which can reduce multiple access interference and packet collision is proposed to support multi-traffic such as voice and random data with and without priority. In this scheme, the time slot is divided into two stage, access and transmission stage. Only packets with spreading codes assigned from base station in access stage can transmit their packets in transmission stage, so MAI can be reduced. To reduce packer collision in access stage, the code reservation and access permission probability are used. Code reservation is allowed for voice traffic and continuous traffic with priority using piggyback and access permission probability based on the estimation of the number of contending users in the steady-state is adaptively applied to each traffic terminal. Also, we analyzed and simulated the numerical performances required for each traffic using Markov chain modeling in a single cell environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.71-79
• /
• 2003

As the traffic grows rapidly in the Internet, the QoS guarantee of the flows and the traffic engineering problems have become very important issues. MPLS has more advantages to solve the problems than existing IP routing because of its use of multiple paths between the source and destination pairs Particularly, the availability of Constraint-based Shortest Path First(CSPF) algorithm and explicit route in MPLS made the problem referred above to be solved efficiently. However, the CSPF algorithm has the characteristic of selecting the shortest path of all paths which meet the traffics' QoS constraints Therefore, even though there are alternative paths to route traffic, alternate QoS paths may not be found and best-effort traffic will be dropped during congestion period In this paper, we present the network resource optimization method related to the traffic engineering by using load balancing through routing in MPLS network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1083-1096
• /
• 2008

This paper proposes an energy-aware path management scheme, so-called the TBP(Threshold based Back-Pressure) algorithm, which is designed for lifetime extension of the energy-constrained wireless sensor networks. With the goal of fair energy consumptions, we extensively utilize the available paths between the source and the sink nodes. The traffic distribution feature of the TBP algorithm operates in two scales; the local and the whole routing area. The threshold and the back-pressure signal are introduced for implementing those operations. It is noticeable that the TBP algorithm maintains the scalability by defining both the threshold and the back-pressure signal to have their meanings locally confined to one hop only. Throughout several experiments, we observe that the TBP algorithm enhances the network-wide energy distribution. which implies the extension of the network lifetime. Additionally, both the delay and the throughput outcomes show remarkable improvements. This shows that the energy-aware path control scheme holds the effects of the congestion control.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.12-22
• /
• 2000

This paper presents the window-based permit distribution scheme for efficient medium access control to support multiclass traffic in APON(ATM over passive optical network). The proposed MAC protocol considers the characteristics of QoS(Quality of Service) for various traffic classes. A periodic RAU(request access unit) in upstream direction, includes dedicative request fields for each traffic category within the request slot. The transmission of upstream cell is permitted by the proposed window-based spacing scheme which distributes the requested traffic into several segments in the unit of one spacing window. The delay sensitive traffic source such as CBR or VBR with the stringent requirements on CDV and delay, is allocated prior to any other class. In order to reduce the CDV, so that the permit arrival rate close to the cell arrival rate, Running-Window algorithm is applied to permit distribution processing for these classes. The ABR traffic, which has not-strict CDV or delay criteria, is allocated flexibly to the residual bandwidth in FIFO manner. UBR traffic is allocated with the lowest priority for the remaining capacity. The performance of proposed protocol is evaluated in terms of transfer delay and 1-point CDV according to various offered load. The simulation results show that our protocol has the prominent improvement on CDV and delay performance with compared to the previous protocol.

• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.44-52
• /
• 2010

The most popular world wide web traffic in the Internet uses TCP as the transport layer protocol. Since TCP utilizes the single path, it can not communicate with the correspondent host during the link-down. On the other hand, SCTP can still communicate with the other SCTP entity by using alternate path even while the primary path is down. Most of previous studies have conducted the performance comparison research between TCP and SCTP by using typical file transfer. Since web traffic with self-similarity is characterized by the packet inter-arrival times and shape parameter affecting the size of web file in the Pareto distribution, it is necessary to perform the experiments considering these parameters. This paper aims to compare the throughput between TCP and SCTP while varying parameters reflecting the web traffic characteristics in link-down environment. Experimental results for web traffic using NS-2 simulator show that the throughput of SCTP using multi-homing is better than that of TCP. Simulation also shows that TCP is more affected than SCTP by mean inter-arrival and shape parameters with regard to the web traffic. These results can be applied to estimate the performance variation of web traffic due to the duration of link-down.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1145-1151
• /
• 2014

In this paper, we propose MPLO(Multi-Path routing with Local Optimization) for load balancing in the tactical backbone network. The MPLO manages global metric and local metric separately. The global metric is propagated to other routers via a routing protocol and is used for configuring loop-free multi-path. The local metric reflecting link utilization is used to find an alternate path when congestion occurs. We verified MPLO could effectively distribute user traffic among available routers by simulation.