• 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.

• Journal of Convergence Society for SMB
• /
• v.5 no.4
• /
• pp.5-10
• /
• 2015

With the advance of ICT, understanding the condition of network and analysing network monitoring have become an important issue. On the TCP/IP network, SNMP is the typical protocol that catches the condition of network by using polling method. If polling method is implemented for a long period, to catch the change of the condition of the network is not easy. On the other hand, in case of short-term polling, even if it could catch the condition of the network in real time, responsive messages to results of the polling cause the increase of traffic and therefore burden the network. There have been studies to control the overhead of responsive messages by controlling the polling period. However, not considering the characteristics of an agent, and running randomly, they cannot decrease the overhead although they would have an instant effect. This paper suggests an efficient polling method that decreases the traffic overhead of polling and catches the condition of the network in real time. Proposed method an polling for a short period and gave weight based on the characteristics of agents to catch the network condition, and a manager decided polling differentially based on the weight so that it decreased the overhead of polling traffic.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.489-496
• /
• 2002

This study proposes a new polling algorithm allowing dynamic change in polling period based on line utilization prediction. Polling is the most important function in network monitoring, but excessive polling data causes rather serious congestion conditions of network when network is In congestion. Therefore, existing multiple polling algorithms decided network congestion or load of agent with previously performed polling Round Trip Time or line utilization, chanced polling period, and controlled polling traffic. But, this algorithm is to change the polling period based on the previous polling and does not reflect network conditions in the current time to be polled. A algorithm proposed in this study is to predict whether polling traffic exceeds threshold of line utilization on polling path based on the past data and to change the polling period with the prediction. In this study, utilization of each line configuring network was predicted with AR model and violation of threshold was presented in probability. In addition, suitability was evaluated by applying the proposed dynamic polling algorithm based on line utilization prediction to the actual network, reasonable level of threshold for line utilization and the violation probability of threshold were decided by experiment. Performance of this algorithm was maximized with these processes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.982-983
• /
• 2013

This paper introduce a dynamic polling method for XG-PON systems and describes the performance evaluation results. We show the mean delay and delay variance of the introduced method and the existing method.

• Journal of Industrial Technology
• /
• v.21 no.B
• /
• pp.257-263
• /
• 2001

Terminal paging is the process of determining the exact location of a particular mobile terminal. The paging cost is related to the number of paging cycles and the number of cells being polled by each cycle. In this paper, we first analyze the performance of various terminal paging strategies in terms of the number of polling cycles and the number of polling signals. Then we present a paging scheme which combines Shortest-Distance-First with movement history list. Simulation results show that the proposed paging scheme reduces the number of polling signals as well as the number of polling cycles.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.140-150
• /
• 2008

Point Coordination Function (PCF) of the IEEE 802.11 protocol providing a centrally-controlled polling-based multiple access to a wireless channel is very efficient in high load conditions. However, its performance degrades with increasing the number of terminals and decreasing the load, because of wastes related to unsuccessful polling attempts. To solve the problem, we propose and study analytically the generic dynamic polling policy using backoff concept. For this aim, we develop Markov models describing the network queues changes, what allows us to estimate such performance measures as the average MAC service time and the average MAC sojourn time, to show the dynamic polling efficiency and to tune optimally the backoff rule.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.1
• /
• pp.6-11
• /
• 2009

This paper presents a new dynamically adaptable polling scheme for efficient support of real-time traffic over an IEEE 802.11 wireless LAN network. The poll scheduling plays an important role in IEEE 802.11 PCF. However, the current version of the polling list management scheme proposed in the IEEE 802.11 standard is inefficient when a variable number of mobile stations have variable packets to transmit. If Point Coordinator has an exact information on the station status, it is possible to efficiently perform polling. In this paper, we suggest an adaptable polling scheme to meet requirements of the stations. In our scheme, each station transmits packets including a piggyback information to inform that it wants to receive a poll in the next polling duration. Simulation results indicate that our scheme may reduces the packet discard ratio and real-time packet transfer delay.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04b
• /
• pp.1627-1630
• /
• 2002

본 논문은 역추적 예견 알고리즘을 사용한 비터비 복호기에서의 TB단의 Polling 구조의 단순화 방법을 제시한다. 비터비 복호기의 3대 Unit중 하나인 Trace Back에서 역추적 예견 알고리즘을 사용할 경우 복호화 시점에서의 최소 State Metric 값을 찾아야 하는 번거로움을 줄일 수 있다. 하지만 복호 신호의 신뢰도 분산에 따라 Polling Unit 이 추가되어야 함에 따라 실제 하드웨어 복잡도에서의 이득은 미미한 것으로 알려져 있다. 제시된 구조에서는 Polling Unit을 단순화 할 수 있는 방법을 적용하였다. 기존 하드웨어와의 비교 평가를 위하여 IEEE802.11a의 표준에 따른 부호화율 1/2, 구속장 7을 갖는 비터비 디코더에 대하여 역추적 예견 알고리즘과 파이프라인 구조만을 갖는 경우와 제안된 단순화한 Polling Unit을 적용한 구조와의 비교에서 Trace Back Unit에서 약 45%의 감소 효과를 보였다.

• Asian Journal for Public Opinion Research
• /
• v.10 no.4
• /
• pp.262-276
• /
• 2022

In this study, we examine how the third- and first-person perceptions of election polling news are linked to voters' political behaviors through anxiety and pride. The results of two web-based surveys conducted before and after the 2022 local elections in South Korea demonstrate that the third-person perception of election polling news is directly and indirectly linked to support for restrictions on media reports of election poll results through anxiety. The first-person perception of polling news is positively associated with reinforcement of support for the preferred candidate. These results suggest that how voters perceive the effects of polling news may have actual impacts on their political behaviors.