نتایج جستجو برای: polling

تعداد نتایج: 2030  

Journal: :JNW 2014
Zheng Guan Hongwei Ding Wenhua Qian

The widespread use of multimedia networking applications has brought more requirements to the network, creating a need for end-to-end Quality of Service (QoS). The contention-free Point Coordination Function (PCF) with Round Robin scheme, where the Access Point controls all transmissions based on a polling mechanism, is defined in IEEE 802.11 standard to provide QoS service. This network suffer...

1998
Robert B. Cooper Mandyam M. Srinivasan

Sarkar and Zangwill (1991) showed by numerical examples that reduction in setup times can, surprisingly, actually increase work in process in some cyclic production systems (that is, reduction in switchover times can increase waiting times in some polling models). We present, for polling models with exhaustive and gated service disciplines, some explicit formulas that provide additional insight...

2002

The standard way to notify the processor of a network event, such as the arrival or transmission of a packet, is through interrupts. Interrupts are more effective than polling, in terms of the per packet send/receive latency. Interrupts, however, incur a high overhead both during and after the interrupt handling, because modern superscalar processors use long pipelines, out-of-order and specula...

Journal: :Probability in the Engineering and Informational Sciences 2011

Journal: :Simulation 2014
Ali Azadeh Mohammad Sheikhalishahi N. Yousefi

This study proposes an efficient computer simulation approach for estimation and optimization of performance measures in a polling system. A single server polling system operating under exhaustive, gated, and mixed service disciplines is developed. In this system, the arrival process is a Poisson process and service and setup times are exponentially distributed. The polling model is solved thro...

2007
Arne A. Nilsson

This paper focuses on the upper bounds for both the mean delay and the loss probability that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). We compute the upper bounds f...

Journal: :IEICE Transactions 2005
Eiji Kawai Youki Kadobayashi Suguru Yamaguchi

Polling I/O mechanisms on the Unix platform such as select() and poll() cause high processing overhead when they are used in a heavily-loaded network server with many concurrent open sockets. Large waste of processing power incurs not only service degradation but also various troubles such as high electronic power consumption and worsened MTBF of server hosts. It is thus a serious issue especia...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید