• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.10
• /
• pp.421-426
• /
• 2013

As a greater amount of traffic have been generated on the Internet, it becomes more important to know the size of each flow. Many research studies have been conducted on the traffic measurement, and mostly they have focused on how to increase the measurement accuracy with a limited amount of memory. In this paper, we propose an explicit flow labeling technique that can be used to find out the names of the top flows and to increase the counting upper bound of the existing scheme. The labeling technique is applied to CSM (Counter Sharing Method), the most recent traffic measurement algorithm, and the performance is evaluated using the CAIDA dataset.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.5
• /
• pp.67-72
• /
• 2019

The self-driving cars identify appropriate navigation paths and obstacles to arrive at their destinations without human control. The autonomous cars are capable of sensing driving environments to improve driver and pedestrian safety by sharing with neighbor traffic infrastructure. In this paper, we have focused on pedestrian protection and have designed an improved localization algorithm to track mobile users on roads by interacting with smart traffic lights in vehicle environments. We developed smart traffic lights with the RSSI sensor and built the proposed method by improving the Kalman filter algorithm to localize mobile users accurately. We successfully evaluated the proposed algorithm to improve the mobile user localization with deployed five smart traffic lights.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2328-2339
• /
• 1994

The PBS(Partial Buffer Sharing) space priority mechanism is one of priority control methods which may improve the performance of a single server queueing system when mixed traffic with different performance requirements is applied to the system. This paper analyzes the cell loss behavior of PBS assuming loss sensitive traffic and delay sensitive traffic are applied to the system. To derive the successive cell loss probabilities. which are an important performance measure of realtime traffic, we develop a recursive algorithm. Performance results show the successive cell loss probabilities obtained by our method are lager than the probabilities derived from an independent cell loss assumption. These results may indicate the limitation of PBS for realtime traffic and the increase of the admissible load with the criterion of quality of service.

• Transportation Technology and Policy
• /
• v.7 no.1
• /
• pp.63-68
• /
• 2010

• Journal of KIISE:Information Networking
• /
• v.37 no.6
• /
• pp.477-482
• /
• 2010

Recently, advanced Internet applications such as Internet telephone, multimedia streaming, and file sharing have appeared. Especially, P2P or web-based file sharing applications have been notorious for their illegal usage of contents and massive traffic consumption by a few users. This paper presents a novel method to identify the P2P or web-based file names with traffic monitoring. For this purpose, we have utilized the Korean decoding method on the IP packet payload. From experiments, we have shown that the file names requested by BitTorrent, Clubbox, and Tple applications could be correctly identified.

• Journal of Advanced Navigation Technology
• /
• v.28 no.4
• /
• pp.436-441
• /
• 2024

Urban air mobility (UAM) is an innovative air traffic management system that utilizes electric vertical take off and landing aircraft(eVTOL) to transport passengers and cargo in urban areas. The corridor can be defined as the airspace that the vehicle operates in and must be collaboratively managed. For the stable operation of UAM, it is essential to have strategic separation and a collaborative decision-making(CDM) system for cooperation and coordination among stakeholders. This study examines the application of time-based milestones from traditional air traffic flow management to the UAM system to ensure safe traffic volume and optimize air traffic flow. For traffic flow management, the milestone time information is categorized into a total of 13 key milestone time indicators based on the UAM movement status, and the sharing entities providing each time indicator and the flow of milestones are defined. Emphasizing the need for a CDM to balance UAM traffic and capacity, sharing and managing milestone information among stakeholders is expected to improve UAM aircraft departure flow and enhance operational efficiency.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.235-237
• /
• 2003

멀티미디어 데이터 전송이 가능한 초고속 통신망의 발달로 음성을 위주로 서비스하던 과거와는 다른 self-similar 특성을 갖는 데이터 트래픽이 발생된다는 것이 알려지고 있다. 이러한 트래픽은 전통적인 네트워크 해석 방법인 포와송 트래픽 모델과는 상당히 차이가 난다는 것이 여러 트래픽의 측정 결과 나타나고 있다. 본 논문에서는 공유 메모리를 갖는 CS(Complete Sharing), DT(Dynamic Threshold), PO(Push-Out) 그리고, SMXQ(Sharing with Maximum Queue)와 같은 다양한 ATM(Asynchronous Transfer Mode) 스위치의 버퍼 관리 기법을 이용하여 입력포트에 self-similar 성질을 갖는 트래픽이 들어올 때 출력포트에서의 self-similarity와 셀 손실률 그리고, 이용률 등을 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.136-151
• /
• 2016

Flexible large-scale WLANs are now widely deployed in crowded and highly mobile places such as campus, airport, shopping mall and company etc. But network management is hard for large-scale WLANs due to highly uneven interference and throughput among links. So the traffic is difficult to predict accurately. In the paper, through analysis of traffic in two real large-scale WLANs, Granger Causality is found in both scenarios. In combination with information entropy, it shows that the traffic prediction of target AP considering Granger Causality can be more predictable than that utilizing target AP alone, or that of considering irrelevant APs. So We develops new method -Granger Causality and Vector Auto-Regression (GCVAR), which takes APs series sharing Granger Causality based on Vector Auto-regression (VAR) into account, to predict the traffic flow in two real scenarios, thus redundant and noise introduced by multivariate time series could be removed. Experiments show that GCVAR is much more effective compared to that of traditional univariate time series (e.g. ARIMA, WARIMA). In particular, GCVAR consumes two orders of magnitude less than that caused by ARIMA/WARIMA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1134-1143
• /
• 2000

We propose a scheduling algorithm, Bandwidth Allocation Scheme (BAS), that guarantees bounded delay in a switching node. It is based on the notion of the GPS (Generalized Processor Sharing) mechanism, which has clarified the concept of fair queueing with a fluid-flow hypothesis of traffic modeling. The main objective of this paper is to determine the session-level weights that define the GPS sewer. The way of introducing and derivation of the so-called system equation' implies the approach we take. With multiple classes of traffic, we define a set of service curves:one for each class. Constrained to the required profiles of individual service curves for delay satisfaction, the sets of weights are determined as a function of both the delay requirements and the traffic parameters. The schedulability test conditions, which are necessary to implement the call admission control, are also derived to ensure the proposed bandwidth allocation scheme' be able to support delay guarantees for all accepted classes of traffic. It is noticeable that the values of weights are tunable rather than fixed in accordance with the varying system status. This feature of adaptability is beneficial towards the enhanced efficiency of bandwidth sharing.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.101-107
• /
• 2009

In existing wireless ad-hoc networks, how to distribute network resources fairly between many users to optimize data transmission is an important research subject. However, in wireless mesh networks (WMNs), it is one of the research areas to avoid gateway bottleneck more than the fair network resource sharing. It is because WMN traffic are concentrated on the gateway connected to backhaul. To solve this problem, the paper proposes Weighted Fairness Time-sharing Access (WFTA). The proposed WFTA is a priority time scheduling scheme based on Weighted Fair Queuing (WFQ).