• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.1-10
• /
• 2008

In this paper, a packet scheduling algorithm, called the modified PLFS, is proposed for real-time traffic in IEEE 802.22 WRAN systems. The modified PLFS(Packet Loss Fair Scheduling) algorithm utilizes not only the delay of the Head of Line(HOL) packets in buffer of each user but also the amount of expected loss packets in the next-next frame when a service will not be given in the next frame. The performances of the modified PLFS are compared with those of PLFS and M-LWDF in terms of the average packet loss rate and throughput. The simulation results show that the proposed scheduling algorithm performs much better than the PLFS and M-LWDF algorithms.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.45-46
• /
• 2018

본 논문에서는 시간에 엄격한(Time critical) 산업용 IoT(Industrial IoT) 환경의 무선 센서 네트워크 시스템 상의 효율적인 패킷 전달과 정확도(Accuracy) 향상을 위해 강화학습과 EDF 알고리즘을 혼합한 스케쥴링 기법을 제안한다. 이 방식은 다중 대기열(Multiple queue) 환경에서 각 대기열의 요구 정확도(Accuracy Requirement)를 기준으로 최대한 패킷 처리를 미룸으로써 효율적인 CPU자원 분배와 패킷 손실율(Packet Loss)을 조절한다. 제안하는 기법은 무선 센서 네트워크 상의 가변적이고 예측 불가능한 환경에 대한 사전지식이 없이도 요구하는 서비스의 질(Quality of service)를 만족할 수 있도록 한다. 또한 정확도를 요구조건으로 제시하여 마감시간이 중요시되는 작업에서도 효율을 최대화한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3523-3543
• /
• 2022

Autonomous vehicles are gradually being regarded as the mainstream trend of future development of the automobile industry. Autonomous driving networks generate many intensive and delay-sensitive computing tasks. The storage space, computing power, and battery capacity of autonomous vehicle terminals cannot meet the resource requirements of the tasks. In this paper, we focus on the task scheduling problem of autonomous driving in software-defined edge networks. By analyzing the intensive and delay-sensitive computing tasks of autonomous vehicles, we propose an emotion model that is related to task urgency and changes with execution time and propose an optimal base station (BS) task scheduling (OBSTS) algorithm. Task sentiment is an important factor that changes with the length of time that computing tasks with different urgency levels remain in the queue. The algorithm uses task sentiment as a performance indicator to measure task scheduling. Experimental results show that the OBSTS algorithm can more effectively meet the intensive and delay-sensitive requirements of vehicle terminals for network resources and improve user service experience.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2018

In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.12
• /
• pp.1604-1610
• /
• 2018

The speech recognition service is used as an ancillary means of communication by converting and visualizing the speaker's voice into text to the hearing impaired persons. However, in open environments such as classrooms and conference rooms it is difficult to provide speech recognition service to many hearing impaired persons. For this, a method is needed to efficiently provide it according to the surrounding environment. In this paper, we propose a system that recognizes the speaker's voice and transmits the converted text to many hearing impaired persons as messages. The proposed system uses the MQTT protocol to deliver messages to many users at the same time. The end-to-end delay was measured to confirm the service delay of the proposed system according to the QoS level setting of the MQTT protocol. As a result of the measurement, the delay between the most reliable Qos level 2 and 0 is 111ms, confirming that it does not have a great influence on conversation recognition.

• Journal of Platform Technology
• /
• v.6 no.1
• /
• pp.17-23
• /
• 2018

Taxi's queue for entering into taxi stand makes traffic jam and congestion around taxi stand. If we make that taxi waits in another place around taxi stand, and can approach to taxi stand when it gets in its turn, these traffic jam and congestion around taxi stand can be reduced. In this paper, we propose entry sequence operating system for taxi stand to reduce traffic jam and congestion around taxi stand. In this system, taxi driver can request his sequence number, and the system issues sequence number to driver. When it is time to approach to taxi stand due to issued sequence number, the proposed system notifies to taxi driver via taxi terminal. Taxi getting the proposed service can wait in another place around taxi stand, and can approach to taxi stand after receiving notify for approaching. Therefore, the proposed system in this paper can reduce traffic jam and congestion around taxi stand because it can reduce or get rid of taxi's queue around taxi stand. We implement the taxi stand approach sequence management system proposed in this paper for taxi stand installed in Chungju-Si, Chungbuk. We use Google Cloud service and Android platform for implementing.

• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.107-113
• /
• 2006

It is essential to guarantee a handoff dropping probability below a predetermined threshold for wireless mobile networks. Previous studies have proposed admission control policies for integrated voice/data traffic in wireless mobile networks. However, since QoS has been considered only in terms of CDP (Call Dropping Probability), the result has been a serious CBP (Call Blocking Probability) unfairness problem between voice and data traffic. In this paper, we suggest a new admission control policy that treats integrated voice and data traffic fairly while maintaining the CDP constraint. For underprivileged data traffic, which requires more bandwidth units than voice traffic, the packet is placed in a queue when there are no available resources in the base station, instead of being immediately rejected. Furthermore, we have adapted the biased coin method concept to adjust unfairness in terms of CBP. We analyzed the system model of a cell using both a two-dimensional continuous-time Markov chain and the Gauss-Seidel method. Numerical results demonstrate that our CAC (Call Admission Control) scheme successfully achieves CBP fairness for voice and data traffic.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.418-425
• /
• 2002

Bluetooth is an emerging technology expected to provide users with short range, low cost, pico-cellular wireless connectivity. The access to the medium for Bluetooth is based on a Master driven Time Division Duplexing (TDD) scheme. A slave transmits packets in the reverse slot only after the master polls the slave (or transmits a packet to the slave) in a forward slot. The master transmits packets to a slave in even slots while the slave transmits packets to the master in an odd slot. The way in which the master schedules packets transmission to slaves or polls them determines system performance. In this paper. we propose a traffic adaptive MAC scheduling scheme for Bluetooth. The proposed scheme adopts the ISAR (Intelligent Segmentation and Reassembly) policy, which adjusts the packet size to the traffic patterns, to adapt the polling frequency to the traffic conditions. Also for achieving fairness among master-slave connections our scheme includes a priority policy assinging prioritised service tlimes to each connection. By considering a scenario where a Bluetooth master is used as wireless access point to the Internet, we show that our scheme improve the system throughput and average queue delay with regard to a naive Round Robin (RR) scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.95-102
• /
• 2005

This paper is purpose for improvement performance wireless lan of IEEE802.11a/b/g. Access point utilized a single server, multi-queuing system, FIFS system model to adapted priority multi-bufferto be alteration packet type. The main purpose of the paper improve the transmission rate and the performance of access point to settle transmission delay for load in MAC, has priority multi-buffer. We use experimentation to obtain our model of the access point and buffer-related parameters. Using our test design, we are able to extract the parameters of an analytic equation giving the average service time of a packet as a function of packer IP payload.

• Journal of Korean Society of Transportation
• /
• v.7 no.2
• /
• pp.89-111
• /
• 1989

This study concentrates on a basic investigation research related to some of parameters to be used for the analysis of capacity and the level of service for signalized intersections. The parameters to be studied are ideal saturation flow rate, large vehicle's passenger car equivalent(PCE) ane the lane utilization factors of through and left turn vehicles. The field data were collected at six intersections in Seoul using video cameras so as to reflect conditions in urban areas. In this study discharge headway based on a rear bumper of each vehicle was used and all the parameters were estimated using a regression technique. The findings of this research are as follows : 1. The saturation headway and saturation flow rate on a single lane with the lane width of 3.1m are 1.652 seconds and 2,180 pcphgpl. It was found that the frist 5 vehicles in the queue experience some start-up lost time. 2. It was confirmed that the new method adopted for the estimate of large vehicle's PCE gives larger PCE values than those derived from the method commonly used. 3. For the estimate of lane utilization factors of through and left turn vehicles, a relationship was established and the corresponding formulas were developed.