Network monitoring and measurement are crucial in network management to facilitate quality of service routing and performance evaluation. Software Defined Networking (SDN) makes network management easier by separating the control plane and data plane. Network monitoring in SDN is relatively light-weight since operators only need to install a monitoring module into the controller. Active monitor...

This paper presents a new polling scheme, that can be used at the Access Point of an IEEE802.11 wireless network as part of the Point Coordination Function, in order to provide guaranteed QoS support of voice traffic. The so called Cyclic Shift polling scheme along with the use of silence detection at the mobile terminals increases the supported number of calls, as a function of the overall rat...

We present a novel scheme for uplink scheduling in WiMax networks that attempts to balance worst-case fairness in bandwidth allocation with the delay requirements of traffic, while taking the varying nature of the wireless channel into account. We assume a polling-based mode of operation at the base station ( ), and provide a method of obtaining an optimal polling interval at which the should p...

PVM (the current version 3.4) as well as many current MPI implementations force application programmers to use active polling (also known as busy waiting) in larger parallel programs. This serious problem is related to thread-unsafety of these communication libraries. While the MPI specification is very careful in this respect, the implementations are not. We present a new mechanism of interrup...

Polling systems have been extensively studied, and have found many applications. They have often been used for studying wired local area networks such as token passing rings and wireless local area networks such as bluetooth. In this contribution we relax one of the main restrictions on the statistical assumptions under which polling systems have been analyzed. Namely, we allow correlation betw...

We consider a polling system consisting of N queues and a single server where polling is performed according to an Elevator (scan) scheme. The server rst serves queues in the `up' direction, i.e. in the order 1,2,...,N-1,N, and then serves these queues in the opposite (`down') direction, i.e. visiting them in the order N,N-1,...,2,1. The server then changes direction again, and so on. A globall...

We consider a polling system with Exhaustive service policy subject to job failures or to station failures. Each of the N stations (nodes) comprising the system is, in isolation, an M/G/1type queue. Failures at each node follow a Poisson process. A job failure causes the job to be rejected from the system, while a station failure (breakdown) causes the server to switch over to the next node. Th...

SUMMARY This paper proposes a new polling-based dynamic slot assignment (DSA) scheme. With the rapid progress of wireless access systems, wireless data communication will become more and more attractive. In wireless data communication, an efficient DSA scheme is required to enhance system throughput, since the capacity of radio links is often smaller than that of wired links. A polling-based DS...

We consider an asymmetric cyclic polling system with general service-time and switchover time distributions with so-called two-stage gated service at each queue, an interleaving scheme that aims to enforce fairness among the different customer classes. For this model, we (1) obtain a pseudo-conservation law, (2) describe how the mean delay at each of the queues can be obtained recursively via t...

In this paper we focus on a class of polling systems encountered while modeling the ferry based wireless local area network (FWLAN). A moving ferry, while walking in a predetermined cyclic path, communicates with the static nodes (or users) of the network via a wireless link. The ferry is assumed to stop and communicate with a node that has a packet to send or to receive, when it is closest to ...