36 search results - page 4 / 8 » Closed-form waiting time approximations for polling systems |
ETT
2002
14 years 9 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
RSS
2007
14 years 11 months ago
2007
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
61
Voted
HICSS
2003
IEEE
15 years 2 months ago
2003
IEEE
— The performance of two Bluetooth piconets linked through a bridge device is analyzed using the tools of queueing theory. We analyze both the Master/Slave (MS) and Slave/Slave (...
99
Voted
PDCN
2004
14 years 11 months ago
2004
IEEE 802.11, the standard of wireless local area networks (WLANs), allows the coexistence of asynchronous and time-bounded traffic using the distributed coordination function (DCF)...
59
Voted
QUESTA
2002
14 years 9 months ago
2002
In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first comput...