• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.06a
• /
• pp.306-307
• /
• 2022

Recently, in the process of developing, verifying, and upgrading the e-Navigation service and autonomous navigation system, there is an increasing demand for inter-working with a ship-handling simulator that can simulate actual maritime traffic conditions. In this paper, to develop a ship-handling simulation system based on actual maritime traffic conditions, a simulation server was built, received information on the actual maritime traffic conditions from the e-Navigation linkage system, and changed to information for operating the ship-handling simulator. In order to provide simulation images to users, 3D shape modeling for trade ports, coastal ports in Korea and major type of ship were performed. The developed system will be used for the advancement of e-Navigation service, development and verification of autonomous navigation systems, by enabling simultaneous processing of more than 10,000 ships and allowing users to simulate actual maritime traffic conditions in the desired area.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.199-208
• /
• 2002

The downlink rate scheduling problem is considered for CDMA networks with multiple users carrying packets of heterogeneous traffic (voice/audio only, bursty data only or mixed traffic), with each type having its own distinct quality of service requirements. Several rate scheduling algorithms are developed, the common factor of which is that part of the decision on which users to serve is based on a function of the deadline of their head-ofline packets. An approach of Andrews et al., in which the basic Earliest-Deadline-First algorithm is studied for similar systems, is extended to result in better performance by considering a more efficient power usage and by allowing service of more than one user per timeslot if the power resources permit it. Finally, the performance of the proposed schemes is compared through simulations.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.06a
• /
• pp.24-25
• /
• 2022

Based on the case of Busan Port November anchorage, which is a group anchorage, related regulations to promote group anchorage safety management, the turning radius of anchored ship, and more accurate weather information collection and safety through improvement of the supporting system for VTS operations to apply the anchorage location in accordance with reality that it is a suggestion for management improvement methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.308-315
• /
• 2002

Guaranteed frame rate (GFR) service has been defied to provide minimum cell rate (MCR) guarantees for virtual connections (VCs) carrying Internet traffic in ATM networks and allow them to fairly share residual bandwidth. The simplest switch implementation mechanism to support the GFR service in ATM networks consists of the frame-based generic cell rate algorithm (F-GCRA) frame classifier and the early packet discard (EPD)-like buffer acceptance algorithm in a single FIFO buffer. This mechanism is simple, but has foiled to guarantee the same bandwidth as an MCR to a VC that has reserved a relatively large MCR. This paper applies the packet spacing scheme to TCP traffic to alleviate its burstness, so as to guarantee a larger MCR to a VC. In addition, the random early detection (RED) scheme is added to the buffer acceptance algorithm in order to improve fairness in use of residual bandwidth. Simulation results show that the applied two schemes improve a quality of service (QoS) in the GFR service for the TCP traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1755-1764
• /
• 1997

In this paper, we proposed the mechanism for the buffer allocation and a cell scheduling method with logical separation a single buffer in the ATm switch, and analyzed the cell loss probability and the delay of each trafic (CBR/VBR/ABR) based on the weighted value and the dynamic cell service scheduling algorithm. The proposed switch buffering system classifies composite trafics incoming to the switch, according to the characteristic of traffic, then stores them in the logically separated buffers, and adopts the round-robin service with weighted value in order to transmit cells in buffers though one output port. We analyzed 4 cell service scheduling algorithms with dynamic round-robinfor each logically separated service line of a single buffer, in which buffers have the respective weighted values and 3 classes on mixed traffic which characteristized by traffic descriptor. In simulation, using SIMCRIPT II.5., we model the VBR and the ABR traffics as ON/OFF processes, and the CBR traffic as a Poisson processes. As the results of analysis according to the proposed buffer management mechanism and cell service algorithm, we have found that the required QoS of each VC can be quaranteed depends on a scale of weighted values allocated to buffers that changed the weighted values, and cell scheduling algorithm.

• Journal of Information Technology Services
• /
• v.11 no.2
• /
• pp.339-353
• /
• 2012

Mobile communication technology is advancing forward to deliver more connected devices and richer content and applications. The number of subscriptions continues to grow along with an explosive increase in the mobile data traffic demand. Thereby, it creates a significant network capacity shortage concerns for mobile network operators. In order to address this problem, it is essential to increase the network capacity at a low additional cost. The device-to-device (D2D) communication based proximity service is believed to have a promising future mobile communication technology that is capable to create new mobile service opportunities and offload traffic to the eNB. In addition, it is also required to develop new mobile communication services and its business models not only to accommodate the increasing mobile traffic demand but also to foster profitability of mobile business service providers such as the network providers, contents providers and platform providers. In this article, we first analyze current mobile business eco-system in the context of CPNT based value chain. Then, propose service development framework and business model creation methodologies for the device-to-device communication based services in the beyond LTE/LTE-Advanced systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2651-2673
• /
• 2019

In order to detect Denial of Service (DoS) attacks, victim-side detection methods are used popularly such as static threshold-based method and machine learning-based method. However, as DoS attacking methods become more sophisticated, these methods reveal some natural disadvantages such as the late detection and the difficulty of tracing back attackers. Recently, in order to mitigate these drawbacks, source-side DoS detection methods have been researched. But, the source-side DoS detection methods have limitations if the volume of attack traffic is relatively very small and it is blended into legitimate traffic. Especially, with the subtle attack traffic, DoS detection methods may suffer from high false positive, considering legitimate traffic as attack traffic. In this paper, we propose an effective source-side DoS detection method with traffic seasonality aware adaptive threshold. The threshold of detecting DoS attack is adjusted adaptively to the fluctuated legitimate traffic in order to detect subtle attack traffic. Moreover, by understanding the seasonality of legitimate traffic, the threshold can be updated more carefully even though subtle attack happens and it helps to achieve low false positive. The extensive evaluation with the real traffic logs presents that the proposed method achieves very high detection rate over 90% with low false positive rate down to 5%.

• Journal of Information Processing Systems
• /
• v.4 no.2
• /
• pp.41-52
• /
• 2008

In this paper, we discuss a novel reservation-based, asynchronous MAC protocol called 'Multi-rate Multi-hop MAC Protocol' (MMMP) for multi-hop ad hoc networks that provides QoS guarantees for multimedia traffic. MMMP achieves this by providing service differentiation for multirate real-time traffic (both constant and variable bit rate traffic) and guaranteeing a bounded end-to-end delay for the same while still catering to the throughput requirements of non real time traffic. In addition, it administers bandwidth preservation via a feature called 'Smart Drop' and implements efficient bandwidth usage through a mechanism called 'Release Bandwidth'. Simulation results on the QualNet simulator indicate that MMMP outperforms IEEE 802.11 on all performance metrics and can efficiently handle a large range of traffic intensity. It also outperforms other similar state-of-the-art MAC protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1246-1252
• /
• 2006

In this paper, a collision probability, processing time and traffic capacity analysis algorithm for RFID system using random FHSS and synchronous FHSS is proposed. Service time, duty cycle, traffic intensity and additional delay time required for re-transmission due to collision are considered and the processing delay and frequency channel capacity are analyzed for the steady state operation of the system. The simulation results which show maximum capacity of the system and explain the accuracy of the algorithm are provided.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.2
• /
• pp.134-146
• /
• 2009

Traffic classification seeks to assign packet flows to an appropriate quality of service(QoS) class based on flow statistics without the need to examine packet payloads. Classification proceeds in two steps. Classification rules are first built by analyzing traffic traces, and then the classification rules are evaluated using test data. In this paper, we use self-organizing map and K-means clustering as unsupervised machine learning methods to identify the inherent classes in traffic traces. Three clusters were discovered, corresponding to transactional, bulk data transfer, and interactive applications. The K-nearest neighbor classifier was found to be highly accurate for the traffic data and significantly better compared to a minimum mean distance classifier.