• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.747-748
• /
• 2013

This paper proposes a new dynamic polling method for XGPON1 (10-Gbps-capable passive optical network stage 1). XGPON1 system supports 2.5 Gbps for upstream and 10 Gbps for downstream. In XGPON1 system, if the polling frequency is high, then the efficiency of dynamic bandwidth allocation increases whereas the upstream bandwidth is wasted. The proposed method decreases the upstream bandwidth wastage owing to polling and efficiently increases the polling frequency.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.2
• /
• pp.63-69
• /
• 2019

Recently, ultra-low latency flash storage devices such as Z-SSD and Optane SSD were introduced with the significant technological improvement in the storage devices which provide much faster response time than today's other NVMe SSDs. With such ultra-low latency, $10{\mu}s$, storage devices the cost of context switch could be an overhead during interrupt-driven I/O completion process. As an interrupt-driven I/O completion process could bring an interrupt handling overhead, polling or hybrid-polling for the I/O completion is known to perform better. In this paper, we analyze tail latency problem in a polling process caused by process scheduling in data center environment where multiple applications run simultaneously under one system and we introduce our adaptive polling selection technique which dynamically selects efficient processing method between two techniques according to the system's conditions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.183-185
• /
• 2000

본 논문에서는 SNMP를 이용한 Nerwork Management System(NMS)이 Network을 사용하는 Application에 영향을 주지 않도록 하는 Polling 전략과 Model을 설계하였다. 제안된 System은 Network의 각 Client 정보를 처리하는 Agent와 Data 수집 및 제어를 담당하는 Server로 구성된다. Agent는 SNMP Agent 부분과 Network 상태를 Monitoring 하는 SubManager로 구성되어, Server는 SNMP Agent와의 Polling 및 Polling 정책을 결정하는 부분으로 구성된다. 제안 Model은 SNMP를 이용한 NMS를 도입할 경우, 기존 Network Service에 영향을 주지 않도록 하는 것이 목적이다. 제안된 System에 대한 성능평가를 위해 실존하는 Network을 대상으로 SNMP의 Polling 및 Service의 부하량을 측정하였다.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.469-481
• /
• 2004

In this paper, we investigate the mean queue length and the mean packet delay of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the interleaved polling system with a gated service discipline. We assume that input packets arrive at an optical network unit(ONU) according to Poisson process. We use a continuous time queueing model in order to find the queue length distribution of the gated interleaved polling system with the first stage input queue and the second stage transmission queue. We give some numerical results to investigate the mean queue lengths and mean packet delays for the symmetric polling system with statistically identical stations.

• Journal of the Korean Statistical Society
• /
• v.26 no.3
• /
• pp.355-363
• /
• 1997

In queueing theory, polling systems have been widely studied as a way of serving several stations in cyclic order. In this paper we consider Markov-modulated Poisson process which is useful for approximating a superposition of heterogeneous arrivals. We derive the mean waiting time of each station in a polling system where the arrival process is modeled by a Markov-modulated Poisson process.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.120-125
• /
• 2000

SNMP(Simple Network Management Protocol) could have the overhead of network, if the number of the agent system which is managed by the management system is increased by the polling for the collection of network management information and the reply traffic for it. In this Paper, the polling method used in SNMP is improved, and Group Polling method is proposed. This can reduce the overhead of network, on case that the agent system is to be increased. The proposed method collects information by grouping agent systems, and have smaller reply latency time and communication overhead than the previous method. So if the number of agent system or the Polling count is numerous, the proposed method is more efficient. As the result of the prototype test, the increasement of agent system can have small variation of traffic and transmission delay time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1393-1405
• /
• 2017

It is well known that duty-cycling control by dynamically adjusting the polling interval according to the traffic loads can effectively achieve power saving in wireless sensor networks. Thus, there has been a significant research effort in developing polling interval adaptation schemes. Especially, Dynamic Low Power Listening (DLPL) scheme is one of the most widely adopted open-looping polling interval adaptation techniques in wireless sensor networks. In DLPL scheme, if consecutive idle (busy) samplings reach a given fixed threshold, the polling interval is increased (decreased). However, due to the trial-and-error based approach, it may significantly deteriorate the system performance depending on given threshold parameters. In this paper, we propose a novel DLPL scheme, called SDL (Sequential hypothesis testing based Dynamic LPL), which employs sequential hypothesis testing to decide whether to change the polling interval conforming to various traffic conditions. Simulation results show that SDL achieves substantial power saving over state-of-the-art DLPL schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.80-89
• /
• 2005

In IEEE 802.11 and 802.11e for ad hoc networks, DCF and EDCA use a contention-based protocol called CSMA/CA, which is simple to implement efficient when the system is light loaded. But the performance of CSMA/CA decreases dramatically when the system load is heavy because of increasing collisions. In PCF and HCF modes, stations are controlled by a base station by polling, no collision ever occurs. However, when the system load is light, the performance is poor because few stations have data to transfer. More important, PCF and HCF can not be used in the ad hoc networks. In this paper, we address a priority-based distributed polling mechanism (PDPM) that implements polling scheme into DCF or EDCA modes for ad hoc networks by adding a polling approach before every contention-based procedure. PDPM takes the advantages of polling mechanism that avoids most of collisions in a high load condition. At the same time, it also keeps the contention-based mechanism for a light loaded condition. PDPM provides quality of service (QoS) with fewer collisions and higher throughput compared with IEEE 802.11e.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.171-177
• /
• 2007

Although the Distributed Coordination Function is the fundamental access protocol of IEEE 802.11, it cannot meet the Quality of Service (QoS) requirements in general. So, the Point Coordinate Function is provided to support QoS related services. However, it has inherent problems. Access point (AP) has no knowledge of the queue status and instantaneous channel condition of stations in the system. In this paper we propose an efficient and versatile polling scheduler that shows excellent throughput and fairness performance. Comparison with well known polling schemes is provided through computer simulation under various channel situations including error prone environments.

• Smart Structures and Systems
• /
• v.21 no.2
• /
• pp.225-234
• /
• 2018

E-Health allows you to supersede the central patient wireless healthcare system. Wireless Body Sensor Network (WBSN) is the first phase of the e-Health system. In this paper, we aim to understand e-Health architecture and configuration, and attempt to minimize energy consumption and latency in transmission routing protocols during restrictive latency in data delivery of WBSN phase. The goal is to concentrate on polling protocol to improve and optimize the routing time interval and schedule communication to reduce energy utilization. In this research, two types of network models routing protocols are proposed - elemental and clustering. The elemental model improves efficiency by using a polling protocol, and the clustering model is the extension of the elemental model that Destruct Supervised Decision Tree (DSDT) algorithm has been proposed to solve the time interval conflict transmission. The simulation study verifies that the proposed models deliver better performance than the existing BSN protocol for WBSN.