• Title/Summary/Keyword: Data Queuing Algorithm

Search Result 19, Processing Time 0.028 seconds

Algorithm of GTS Time Slots Allocation Based on Weighted Fair Queuing in Environments of WBAN (WBAN 환경에서 Weighted Fair Queuing 기반의 GTS 타임 슬롯 할당 알고리즘)

  • Kim, Kyoung-Mok;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.45-56
    • /
    • 2011
  • WBAN is short range wireless communication technology which is consists of several small devices close to, attached to or implanted into the human body. WBAN is classified into between medical and non-medical by applications based on technology and medical data with periodic characteristics is used the GTS method for transmitting data to guarantee the QoS. In this paper we proposed algorithm that resolve lack of GTSs while data transmit GTS method in superframe structure of WBAN. Coordinator dynamically allocates GTSs according to the data rate of devices and make devices share GTSs when lack of GTSs. We compared delay bounds, throughput for performance evaluation of the proposed algorithm. In other words, we proposed algorithm adaptive WFQ scheduling that GTS allocation support differential data rate in environments of WBAN. The experiment results show the throughput increased and the maximum delay decreased compared with Round Robin scheduling.

Discrete-Time Queuing Analysis of Dual-Plane ATM Switch with Synchronous Connection Control

  • Choi, Jun-Kyun
    • ETRI Journal
    • /
    • v.19 no.4
    • /
    • pp.326-343
    • /
    • 1997
  • In this paper, we propose an ATM switch with the rate more than gigabits per second to cope with future broadband service environments. The basic idea is to separate the connection control flow from the data information flow inside the switch. The proposed switch has a dual-plane switch matrix with the synchronous control algorithm. The queuing behaviors of the proposed switch are shown by the discrete-time queuing analysis. Numerical analyses are taken both in the non-blocking crossbar switch and the banyan switch with internal blocking. Results show that a proposed dual-plane $16{\times}16$ switch would have the acceptable performance with maximum throughput of about 95 percent.

  • PDF

Design and Implementation of the Prevention System for Side Effects of Polypharmacy Components Utilizing Data Queuing Algorithm

  • Choi, Jiwon;Kim, Chanjoo;Ko, Yunhee;Im, Hyeji;Moon, Yoo-Jin;McLain, Reid
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.11
    • /
    • pp.217-225
    • /
    • 2021
  • In this paper, we designed and implemented the integrated system to prevent adverse drug reactions of polypharmacy components in medicine by supporting component-component information and disease-component information, through data queuing algorithm and vast amounts of pharmaceutical big data. In addition, by providing information for drugs, drug components, prohibited drugs, as well as suppliers and distributors, it could help ease anxiety about taking drugs not only for health-care professionals but also for general users. The representative information provided were side effects between two drugs, main components and effectiveness of particular drugs, drugs manufactured by the same pharmaceutical company, and drug component information for patients with chronic diseases. The future work is to update the database by collecting information on rare & new diseases and new drugs.

An Approximate algorithm for the analysis of the n heterogeneous IBP/D/l queuing model (다수의 이질적 IBP/D/1큐잉 모형의 분석을 위한 근사 알고리즘)

  • 홍석원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.3
    • /
    • pp.549-555
    • /
    • 2000
  • We propose an approximate algorithm to analyze the queuing system with n bursty and heterogeneous arrival processes. Each input process is modeled by Interrupted Bernoulli Process(IBP). We approximate N arrival processes by a single state variable and subsequently simplify the transition probability matrix of the Markov chain associated with these N arrival processes. Using this single state variable of arrival processes, we describe the state of the queuing system and analyze the system numerically with the reduced transition probability matrix. We compute the queue length distribution, the delay distribution, and the loss probability. Comparisons with simulation data show that the approximation algorithm has a good accuracy.

  • PDF

Queuing Time Computation Algorithm for Sensor Data Processing in Real-time Ubiquitous Environment (실시간 유비쿼터스 환경에서 센서 데이터 처리를 위한 대기시간 산출 알고리즘)

  • Kang, Kyung-Woo;Kwon, Oh-Byung
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.1
    • /
    • pp.1-16
    • /
    • 2011
  • The real-time ubiquitous environment is required to be able to process a series of sensor data within limited time. The whole sensor data processing consists of several phases : getting data out of sensor, acquiring context and responding to users. The ubiquitous computing middleware is aware of the context using the input sensor data and a series of data from database or knowledge-base, makes a decision suitable for the context and shows a response according to the decision. When the real-time ubiquitous environment gets a set of sensor data as its input, it needs to be able to estimate the delay-time of the sensor data considering the available resource and the priority of it for scheduling a series of sensor data. Also the sensor data of higher priority can stop the processing of proceeding sensor data. The research field for such a decision making is not yet vibrant. In this paper, we propose a queuing time computation algorithm for sensor data processing in real-time ubiquitous environment.

An Adaptive Proportional Integral Active Queue Management Algorithm based on Self-Similar Traffic Rate Estimation in WSN

  • Liu, Heng;Wang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1946-1958
    • /
    • 2011
  • Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. Traffic flow in WSN appears self-similar due to its data delivery process, and this impacts queue length greatly and makes queuing delay worse. Active queue management can be designed to improve QoS performance for WSN. In this paper, we propose self-similar traffic rate estimating algorithm named Power-Law Moving Averaging (PLMA) to regulate packet marking probability. This algorithm improves the availability of the rate estimation algorithm under the self-similar traffic condition. Then, we propose an adaptive Proportional Integral algorithm (SSPI) based on the estimation of the Self-Similar traffic rate by PLMA. Simulation results show that SSPI can achieve lower queue length jitter and smaller setting time than PI.

An Abnormal Worker Movement Detection System Based on Data Stream Processing and Hierarchical Clustering

  • Duong, Dat Van Anh;Lan, Doi Thi;Yoon, Seokhoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.88-95
    • /
    • 2022
  • Detecting anomalies in human movement is an important task in industrial applications, such as monitoring industrial disasters or accidents and recognizing unauthorized factory intruders. In this paper, we propose an abnormal worker movement detection system based on data stream processing and hierarchical clustering. In the proposed system, Apache Spark is used for streaming the location data of people. A hierarchical clustering-based anomalous trajectory detection algorithm is designed for detecting anomalies in human movement. The algorithm is integrated into Apache Spark for detecting anomalies from location data. Specifically, the location information is streamed to Apache Spark using the message queuing telemetry transport protocol. Then, Apache Spark processes and stores location data in a data frame. When there is a request from a client, the processed data in the data frame is taken and put into the proposed algorithm for detecting anomalies. A real mobility trace of people is used to evaluate the proposed system. The obtained results show that the system has high performance and can be used for a wide range of industrial applications.

A Proposal for Improving Techniques of GTS Utilization Based on WBAN (WBAN 기반의 GTS 채널 이용률 향상기법 제안)

  • Park, Joo-Hee;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.73-81
    • /
    • 2011
  • The WBAN(Wireless Body Area Network) technology is a short distance wireless network which provides each device's interactive communication by connecting devices inside and outside of body located within 3 meters. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. The The WBAN servides consists of both medical and non-medical applications. The medical application service uses the sensor that transfer the periodic traffic and have different data rates. It uses GTS method to guarantee QoS. In this paper, a new method is proposed, which are suitable design for MAC Protocol. Firstly, MAC frame structure and a primitive based on the WBAN are proposed. Secondly, we proposed the GTS algorithm improved the channel utilization based on the WFQ(Weighted Fair Queuing). The proposed scheduling method is improved channel utilization compared with i-Game(Round Robin scheduling method).

Study on Wireless Body Area Network System Design Based on Transmission Rate (전송률을 고려한 WBAN 시스템 설계에 관한 연구)

  • Park, Joo-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.12
    • /
    • pp.121-129
    • /
    • 2012
  • In this paper, we proposed WBAN system model to management an application that requires low rate data transfer in IEEE 802.15.4. We have to use different wireless sensor network technology to transfer different date rate and emergency message in medical application service. A suitable system model for WBAN and a WBAN MAC protocol in order to solve these existing system problems are proposed. Firstly, the priority queuing was applied to contention access period, and the system model which could guarantee transmission of a MAC command frame was proposed. Secondly, the MAC frame was newly defined to use the system model which was proposed above. Thirdly, WBAN CSMA/CA back-off algorithm based on data transmission rate was proposed to enhance data throughput and transmission probability of the data frame which does not have priority in the proposed WBAN system. The proposed algorithm is designed to be variable CSMA/CA algorithm parameter, depending on data rate. For the evaluation of WBAN CSMA/CA algorithm, we used Castalia. As a result of the simulation, it is found that the proposed system model can not only relieve loads of data processing, but also probability of collision was decreased.

A DQN-based Two-Stage Scheduling Method for Real-Time Large-Scale EVs Charging Service

  • Tianyang Li;Yingnan Han;Xiaolong Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.3
    • /
    • pp.551-569
    • /
    • 2024
  • With the rapid development of electric vehicles (EVs) industry, EV charging service becomes more and more important. Especially, in the case of suddenly drop of air temperature or open holidays that large-scale EVs seeking for charging devices (CDs) in a short time. In such scenario, inefficient EV charging scheduling algorithm might lead to a bad service quality, for example, long queueing times for EVs and unreasonable idling time for charging devices. To deal with this issue, this paper propose a Deep-Q-Network (DQN) based two-stage scheduling method for the large-scale EVs charging service. Fine-grained states with two delicate neural networks are proposed to optimize the sequencing of EVs and charging station (CS) arrangement. Two efficient algorithms are presented to obtain the optimal EVs charging scheduling scheme for large-scale EVs charging demand. Three case studies show the superiority of our proposal, in terms of a high service quality (minimized average queuing time of EVs and maximized charging performance at both EV and CS sides) and achieve greater scheduling efficiency. The code and data are available at THE CODE AND DATA.