• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.498-508
• /
• 2009

In wireless mobile environments, large bandwidth and high QoS (Quality of Service) are recently required to support the increased demands for multimedia services. LTE (Long Term Evolution) is one of the promising solutions for the next generation broadband wireless access systems. To efficiently use downlink resource and effectively support QoS, packet scheduling algorithm is one of the important features in LTE system. In this paper, we proposed DAPS (Delay-Aware Packet Scheduling) algorithm to consider QoS requirements of delays for various traffic classes as well as channel condition and fairness. To reflect delay experiences at scheduling instance, DAPS observes how queue waiting time of packet is closed to maximum allowable delay. The simulation results show that the DAPS algorithm yields better performance for delay experience by increasing the number of transmitted packets with satisfying the required delay time compared with existing scheduling algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.533-535
• /
• 2017

MQTT provides three QoS levels on top of the TCP/IP layer to ensure message delivery reliability. However, in an environment where messages are concurrently transmitted and received in a node, messages are lost due to the delivery method for QoS level. In this paper, it construct an experimental environment in which MQTT generates concurrently messages, and confirm the message reliability according to QoS level. Therefore, we analyze the message reception ratio on the subscriber side by changing number of publisher and transmission cycle of message. Experimental results show that the message reception ratio of 1 and 2 except QoS level 0 decreases as the number of publisher increases or the message transmission cycle increases.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3684-3693
• /
• 2000

In this paper, performance of a nonblocking high speed packet switch with switching capacity m which adopts a dynamic priority control function (DPCF) of a threshold- based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBP] scheme, a head packet of the delay-sensitive traffic buffer goes into the loss -sensitive traffic buffer with Hernoulli probability p according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBP] scheme shows better performance than that of HOL scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.80-91
• /
• 2002

A general goal of the AT%(Asynchronous Transfer Mode) network is to support connect across various network. On ATM networks, ABR services are provided using the remained ban after allocation CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR ado VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. In this paper a simulation has been performed to compare and evaluate the performance between the ERICA(Explicit Rate Indicate Avoidance) and EPRCA(Enhanced Proportional Rate Control Algorithm) switches which use Explicit Rate switch algorithm for ABR switch. The variation of the ACR at the source end system, the queue length, the utilization rate of the link bandwidth and the share fairness at the transient and steady states are used as the evaluation criteria for the simulation. As a result of simulation, ERICA algorithm switch was ten times long compared to ERPCA switch to achieve assigned fair share. so EPRCA switch is superior to ERICA about load response. For Fair share and stability, ERICA switch is excellent to EPRCA switch.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.111-120
• /
• 2018

This study focuses on utilizing drones for performance evaluation of ITS detectors and analyzing economic feasibility when performance evaluation is conducted by the traffic management center's own personnel using drones. The study sites were selected from DSRC, video detector, and radar detector locations and drone filming was conducted to obtain travel speed, queue length, and delay time and compare with the detector data. It was shown that drones can be very effectively used to evaluate performance of major ITS detectors such as DSRC and video detectors. In addition, it was analyzed that a drone operated by the traffic management center's own personnel provides very economic solution for ITS detector performance evaluation when compared to consignment by external agencies.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.5D
• /
• pp.579-585
• /
• 2009

In spite of the proven effectiveness of ramp metering system, it has not been successfully implemented in Korean setting. The purpose of this paper is to select target locations to introduce ramp metering into the Korean expressway system. For this, domestic standards to introduce ramp metering have been presented after reviewing those of the US. The major criteria are level of service (LOS), the existence of detour route, space for queue build-up and opened ramp. 15 different locations were selected and AHP has been used to make priority among them. Intuitively, the result of priority was in accordance with the congestion and traffic volume. The core results identified in this paper is expected to be used in different cities and expressway networks elsewhere.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.585-587
• /
• 2022

The visual motivation between AP devices is NTP-based visual motivation through the access of the Internet through the internal wired LAN, but this has several seconds of visual difference in hundreds of milliseconds (msec) depending on the network. The frame for the output of the video will vary depending on the application, but usually 24 (image) frames are output to the screen in one second. Therefore, the visual synchronization between peripheral devices can be performed through the adjacent moving camera device, not the wired method. The programming method of generating API for synchronization command when creating an application for visual synchronization and delivering it to AP through MAC may differ from the time in synchronization command according to the environment of the operating system at the transmission side and the situation of the buffer queue of the MAC. Therefore, as a method to solve this problem, the renewal of visual information in the device driver terminal controlling MAC can be much more effective.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.421-429
• /
• 2000

In present, ATM integrated switching system has been developed to a mixed modules that complexed switching system including maintenance, operation based on B-ISDN/LAN service and plug-in module, , which runs on workstation computer system. Meanwhile, workstation has HMI operation system feature including file system management, time management, graphic processing, TMN agent function. The workstation has communicated with between ATM switching module and clients. This computer system architecture has much burden messages communication among processes or processor. These messages communication consume system resources which are socket, message queue, IO device files, regular files, and so on. Therefore, in this paper we proposed new performance modeling with this system architecture. We will analyze the system bottleneck and improve system performance. In addition, in the future, the system has many additional features should be migrated to workstation system, we need previously to evaluate system bottleneck and redesign it. In performance model, we use queueing network model and the simulation package is used PDQ and C-program.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.249-264
• /
• 2007

As the need for telematics contents services due to the frequent traveling of people is increasing, it is necessary to provide various telematics contents by connecting and integrating current telematics contents which are collected and provided by each individual data provider. However, it is difficult to integrate or exchange the current telematics contents, because the data providers use different telematics contents models. Therefore, we propose a 'telematics contents gateway(TCG); system, which enables to integrate different telematics contents, so that the contents can be interoperable. The TCG can be a solution for several problems in the current telematics contents providing system. First of all, it has been impossible to search the contents without any information about data providers, because of the absence of metadata in the current systems. For this problem, TCG supports a search function based on a web-service technology. Second, TCG provides a common road network model for interoperability, and the model can be a solution to integrate different road network models into the common model. Moreover, integration algorithm for enhancing the correctness of integration will be proposed. In addition, it is designed by multi threads and multi queue structure. The TCG developed with C# on a windows system has been running and we verified that there was no information loss in the integration process. In addition, the speed of content integration and transfer satisfied the requirement of telematics services providers.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.793-805
• /
• 2001

In the recent priority system, high-priority packet will be served first and low-priority packet will be served when there isn\`t any high-priority packet in the system. By the way, even high-priority packet can be blocked by HOL (Head of Line) contention in the input queueing System. Therefore, the whole switching performance can be improved by serving low-priority packet even though high-priority packet is blocked. In this paper, we study the performance of preemptive priority in an input queueing switch for high speed switch system. The analysis of this switching system is taken into account of the influence of priority scheduling and the window scheme for head-of-line contention. We derive queue length distribution, delay and maximum throughput for the switching system based on these control schemes. Because of the service dependencies between inputs, an exact analysis of this switching system is intractable. Consequently, we provide an approximate analysis based on some independence assumption and the flow conservation rule. We use an equivalent queueing system to estimate the service capability seen by each input. In case of the preemptive priority policy without considering a window scheme, we extend the approximation technique used by Chen and Guerin [1] to obtain more accurate results. Moreover, we also propose newly a window scheme that is appropriate for the preemptive priority switching system in view of implementation and operation. It can improve the total system throughput and delay performance of low priority packets. We also analyze this window scheme using an equivalent queueing system and compare the performance results with that without the window scheme. Numerical results are compared with simulations.