• Title/Summary/Keyword: Polling algorithm

Search Result 52, Processing Time 0.027 seconds

Improved ErtPS Scheduling Algorithm for AMR Speech Codec with CNG Mode in IEEE 802.16e Systems (IEEE 802.16e 시스템에서의 CNG 모드 AMR 음성 코덱을 위한 개선된 ErtPS 스케줄링 알고리즘)

  • Woo, Hyun-Je;Kim, Joo-Young;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.661-668
    • /
    • 2009
  • The Extended real-time Polling Service (ErtPS) is proposed tosupport QoS of VoIP service with silence suppression which generates variable size data packets in IEEE 802.16e systems. If the silence is suppressed, VoIP should support Comfort Noise Generation (CNG) which generates comfort noise for receiver's auditory sense to notify the status of connection to the user. CNG mode in silent-period generates a data with lower bit rate at long packet transmission intervals in comparison with talk-spurt. Therefore, if the ErtPS, which is designed to support service flows that generate data packets on a periodic basis, is applied to silent-period, resources of the uplink are used inefficiently. In this paper, we proposed the Improved ErtPS algorithm for efficient resource utilization of the silent-period in VoIP traffic supporting CNG. In the proposed algorithm, the base station allocates bandwidth depending on the status of voice at the appropriate interval by havingthe user inform the changes of voice status. The Improved ErtPS utilizes the Cannel Quality Information Channel (CQICH) which is an uplink subchannel for delivering quality information of channel to the base station on a periodic basis in 802.16e systems. We evaluated the performance of proposed algorithm using OPNET simulator. We validated that proposed algorithm improves the bandwidth utilization of the uplink and packet transmission latency

Development of Efficient Dynamic Bandwidth Allocation Algorithm for XGPON

  • Han, Man Soo;Yoo, Hark;Lee, Dong Soo
    • ETRI Journal
    • /
    • v.35 no.1
    • /
    • pp.18-26
    • /
    • 2013
  • This paper proposes an efficient bandwidth utilization (EBU) algorithm that utilizes the unused bandwidth in dynamic bandwidth allocation (DBA) of a 10-gigabit-capable passive optical network (XGPON). In EBU, an available byte counter of a queue can be negative and the unused remainder of an available byte counter can be utilized by the other queues. In addition, EBU uses a novel polling scheme to collect the requests of queues as soon as possible. We show through analysis and simulations that EBU improves performance compared to that achieved with existing methods. In addition, we describe the hardware implementation of EBU. Finally we show the test results of the hardware implementation of EBU.

A Scheduling Scheme using Partial Channel Information for Ad-hoc Networks (Ad-hoc 망에서 채널의 부분정보를 이용한 스케줄링 기법)

  • 신수영;장영민
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11B
    • /
    • pp.1031-1037
    • /
    • 2003
  • A new scheduling scheme, which uses channel quality information of each flow in Bluetooth system of ad-hoc network for effective bandwidth assignment, has been proposed in this paper. By an effective bandwidth assignment, QoS (Quality of Service) could have been ensured in case of asymmetric data traffic, mixed data transmission, and congested data transmission in a specific channel. The scheduling algorithm determines channel weights using partial channel information of flows. Case studies conducted by NS-2 (Network Simulator 2) and Bluehoc simulator has been presented to show the effectiveness of the proposed scheduling scheme.

A Load Routing Problem in a Tandem AGVS using Genetic Algorithm (유전 알고리듬을 이용한 Tandem AGVS 에서의 운반물 경로 설정 문제)

  • Kim, Jong-Hwa;Park, Je-Seung
    • IE interfaces
    • /
    • v.14 no.2
    • /
    • pp.111-119
    • /
    • 2001
  • A tandem AGV system is based on partitioning all the stations into non-overlapping single vehicle closed loops with additional stations provided as an interface between adjacent loops. For an efficient use of this configuration, it is required to solve the load routing problem(LRP), which is primarily based on the fact that a load may be handled by several vehicles and moved through several loops before it reaches its destination. In this paper, a heuristic based on genetic algorithm(GA) is first developed to solve LRP. The first model obtains the optimal route of each job and the optimal direction of each loop when the vehicle in each loop travels unidirectionally. The second GA model obtaines the optimal polling sequence of the empty vehicle in each loop, when the vehicle can move bidirectionally.

  • PDF

A Medium Access Control Protocol for rt- VBR Traffic in Wireless ATM Networks

  • Lim, In-Taek
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.29-34
    • /
    • 2007
  • This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

Network Method for Automation Factory Processor (자동화 공정을 위한 네트웍 구현)

  • Kim, Jee-Hong;Hwang, Byung-Hun
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2483-2485
    • /
    • 2003
  • As design a network system that should command and response to do tasks by PLC, to make factory automation for being distributed facilities which are not guaranteed procedure, through polling method, commands are send orderly by PLC and responses are answered by each sub-unit. It make a guarantee of sequence and drive a master-slave operation in network. This method help to distribute procedure systems and make possible dividing tasks to each unit. To make this method, network protocol's format have Master or Slave ID and tasking data and Master's command or Slave unit's report. In network interpret algorithm, skip algorithm are included and it make guarantee of protecting data though network are in noise. Data that are made by this method are send to PC to transmit long-distance user by internet.

  • PDF

A Searching Technique of the Weak Connectivity Boundary using Small Unmanned Aerial Vehicle in Wireless Tactical Data Networks (무선 전술 데이터 네트워크에서 소형 무안항공기를 이용한 연결성 약화 지역 탐색 기법)

  • Li, Jin;Song, Ju-Bin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1C
    • /
    • pp.89-96
    • /
    • 2012
  • Since tactical robots are going to be grown and tactical data communications will be more network-centric, the reliability of wireless tactical data networks is going to be very important in the future. However, the connectivity of such wireless tactical data networks can be extremely uncertain in practical circumstances. In this paper, we propose a searching technique to find out the weak boundary area of the network connectivity using a small UAV(unmanned aerial vehicle) which has a simple polling access function to wireless nodes on the ground in wireless tactical data networks. The UA V calculates the network topology of the wireless tactical data networks and coverts it to the Lapalcian matrix. In the proposed algorithm, we iteratively search the eigenvalues and find a minimum cut in the network resulting in finding the weak boundary of the connectivity for the wireless tactical data networks. If a UAV works as a relay nodes for the weak area, we evaluate that the throughput performance of the proposed algorithm outperforms star connection method and MST(minimum Spanning Tree) connection method. The proposed algorithm can be applied for recovering the connectivity of wireless tactical data networks.

Efficient MIB Data Gathering Algorithm for SNMP based NMS (SNMP 기반 NMS를 위한 효율적인 MIB 정보 수집 알고리즘)

  • Choi, Kyung-Joon;Park, Jun-Sang;Kim, Myung-Sup
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.950-953
    • /
    • 2008
  • 네트워크 망 관리를 위해 사용되는 SNMP(Simple Network Management Protocol)는 다양한 네트워크장비에 대해 표준화된 정보를 제공한다. 네트워크의 고속화, 대형화로 인해 관리를 위한 정보 수집 트래픽이 증가하고 정보 수집 시간 지연 문제가 발생한다. 본 논문에서는 기존의 SNMP를 이용한 정보수집 방법의 문제점을 파악하여 네트워크 관리를 위한 트래픽량을 줄이고, Polling 소비 시간을 최소화하는 알고리즘을 제안한다. 제안한 알고리즘은 관리 대상 시스템의 각 링크의 트래픽 변화 유무를 예측하여 불필요한 수집을 줄이는 방법이다. 관리 대상 시스템이 많고, 주기적으로 관리 정보를 수집하는 경우 제안한 알고리즘이 효율적으로 사용될 것으로 기대된다. Enterprise 네트워크 형태의 학교 Campus NMS에 적용하여 알고리즘의 타당성을 증명하였다.

Scheduling of Real-time and Nonreal-time Traffics in IEEE 802.11 Wireless LAN (무선랜에서의 실시간 및 비실시간 트래픽 스케줄링)

  • Lee, Ju-Hee;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.75-89
    • /
    • 2003
  • Media Access Control (MAC) Protocol in IEEE 802.11 Wireless LAN standard supports two types of services, synchronous and asynchronous. Synchronous real-time traffic is served by Point Coordination Function (PCF) that implements polling access method. Asynchronous nonreal-time traffic is provided by Distributed Coordination Function (DCF) based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Since real-time traffic is sensitive to delay, and nonreal-time traffic to error and throughput, proper traffic scheduling algorithm needs to be designed. But it is known that the standard IEEE 802.11 scheme is insufficient to serve real-time traffic. In this paper, real-time traffic scheduling and admission control algorithm is proposed. To satisfy the deadline violation probability of the real time traffic the downlink traffic is scheduled before the uplink by Earliest Due Date (EDD) rule. Admission of real-time connection is controlled to satisfy the minimum throughput of nonreal-time traffic which is estimated by exponential smoothing. Simulation is performed to have proper system capacity that satisfies the Quality of Service (QoS) requirement. Tradeoff between real-time and nonreal-time stations is demonstrated. The admission control and the EDD with downlink-first scheduling are illustrated to be effective for the real-time traffic in the wireless LAN.

Enhancement of BIM Modeling Automation Algorithm for Linear-Based Tunnel Infrastructure and Development of BIM Modeling Automation System (선형기반 터널 인프라 구조물의 BIM 모델링 자동화 알고리즘 개선 및 BIM 모델링 자동화 시스템 개발)

  • Kim, Yun-Ok;Kim, Ji-Young; Kim, Tae-Min;Moon, So-Yeong
    • Journal of KIBIM
    • /
    • v.13 no.3
    • /
    • pp.1-11
    • /
    • 2023
  • In order to use BIM as a tool for improving the productivity and quality of products in the construction industry, a BIM model must be created from the design stage first. Infrastructure structures such as bridges and tunnels are mainly created based on three-dimensional alignment in the generation of BIM models. Especially, generation of BIM models based on three-dimensional linearity has high task difficulty and algorithms for automating BIM modeling for railway infra structures have been suggested in previous studies. This study improved the BIM modeling automation algorithm of railway infrastructures and developed a system based on the algorithm so that it can be easily used by ordinary users. The system was built as an add-in system of Autodesk's Revit. As an improvement first, it is possible to arrange different libraries for each pattern, enabling various uses. In addition, it can be created models of several members with a single process and the system can automatically places structures that are added periodically, such as Rock Bolt and Fore Polling. Finally, 3D length information and volume for each pattern are automatically calculated for more accurate 3D-based volume calculation. This study contributes to increasing user accessibility by building a BIM modeling automation algorithm into a system. The system is expected to improve the efficiency of BIM modeling creation of linear-based infra structures, including railway infrastructure.