Analysis of the Total Delay of IEEE 802.11e EDCA and 802.11 DCF

Engelstad, Paal E.; Østerbø, Olav N.

doi:10.1109/icc.2006.254853

Cited by 64 publications

(43 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This kind of service is inherently subject to high variability, as the actual delay depends on the position which a newly activated flow gets in the round robin list. With BFQ, applications are served on the basis of the timestamps they get, so the effect is similar to a 15 Available for download at git://git.kernel.dk/fio.git round robin only among the latency-sensitive streamers (they all have the same timing constraints), and, as we can see from the results, only the number of streamers affects the perceived latency.…”

Section: Bfq Experimentsmentioning

confidence: 49%

“…FWP resource manager should provide schedulability analysis, however, since EDCA technique is not deterministic, the FWP resource manager cannot calculate an exact schedulability analysis. There exist probabilistic EDCA models such as [15], which could be used, but FWP uses a simpler approach which works reasonably well [50]. In short, FWP resource manager is responsible for two things:…”

Section: Wireless Bandwidth Managementmentioning

confidence: 99%

“…The admission control algorithm is recommended but not specified in [25] in order to limit the network load. Inan et al [27] considered the problem of multimedia capacity estimation and admission control for the EDCA function and Engelstad and Østerbø proposed [15] a probabilistic model used for delay estimation. Several authors (see [10,54,19]) studied how the QoS parameters of EDCA will affect the performance and proposed how to control these parameters.…”

Section: Real-time Network Schedulingmentioning

confidence: 99%

See 2 more Smart Citations

Modular software architecture for flexible reservation mechanisms on heterogeneous resources

Sójka

Píša

Faggioli

et al. 2011

Journal of Systems Architecture

View full text Add to dashboard Cite

Management, allocation and scheduling of heterogeneous resources for complex distributed real-time applications is a challenging problem. Timing constraints of applications may be fulfilled by a proper use of real-time scheduling policies, admission control and enforcement of timing constraints. However, it is not easy to design basic infrastructure services that allow for an easy access to the allocation of multiple heterogeneous resources in a distributed environment.In this paper, we present a middleware for providing distributed soft real-time applications with a uniform API for reserving heterogeneous resources with real-time scheduling capabilities in a distributed environment. The architecture relies on standard POSIX OS facilities, such as time management and standard TCP/IP networking services, and it is designed around CORBA, in order to facilitate modularity, flexibility and portability of the applications using it. However, real-time scheduling is supported by proper extensions at the kernel-level, plugged within the framework by means of dedicated resource managers. Our current implementation on Linux supports reservation of CPU, disk and network bandwidth. However, additional resource managers supporting alternative real-time schedulers for these resources, as well as additional types of resources, may be easily added.We present experimental results gathered on both synthetic applications and a real multimedia video streaming case study, showing advantages deriving from the use of the proposed middleware. Finally, overhead figures are reported, showing sustainability of the approach for a wide class of complex, distributed, soft real-time applications.

show abstract

Section: Bfq Experimentsmentioning

confidence: 49%

Section: Wireless Bandwidth Managementmentioning

confidence: 99%

Section: Real-time Network Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Modular software architecture for flexible reservation mechanisms on heterogeneous resources

Sójka

Píša

Faggioli

et al. 2011

Journal of Systems Architecture

View full text Add to dashboard Cite

show abstract

“…The Markov analysis of [6] is also modified by several researchers to include the capacity analysis of the DCF or EDCA function in nonsaturation [20]- [23]. A number of queueing models have also been proposed to analyze delay performance of a station or an AC under the assumption that the traffic is uniformly distributed [4], [5], [24], [25].…”

Section: B Capacity Analysis and Admission Control In Edcamentioning

confidence: 99%

Multimedia Capacity Analysis of the IEEE 802.11e Contention-Based Infrastructure Basic Service Set

Inan

Keceli

Ayanoğlu

2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

We first propose a simple mathematical analysis framework for the Enhanced Distributed Channel Access (EDCA) function of the recently ratified IEEE 802.11e standard. Our analysis considers the fact that the distributed random access systems exhibit cyclic behavior. The proposed model is valid for arbitrary assignments of AC-specific Arbitration Interframe Space (AIFS) values and Contention Window (CW) sizes and is the first that considers an arbitrary distribution of active Access Categories (ACs) at the stations. Validating the theoretical results via extensive simulations, we show that the proposed analysis accurately captures the EDCA saturation performance. Next, we propose a framework for multimedia capacity analysis of the EDCA function. We calculate an accurate stationand AC-specific queue utilization ratio by appropriately weighing the service time predictions of the cycle time model for different number of active stations. Based on the calculated queue utilization ratio, we design a simple model-based admission control scheme. We show that the proposed call admission control algorithm maintains satisfactory user-perceived quality for coexisting voice and video connections in an infrastructure BSS and does not present over-or under-admission problems of previously proposed models in the literature.

show abstract

“…It is not difficult to extend our analysis for the case when multiple nodes contend for the same medium. In [11], for example, Engelstad and Østerbø calculated the queueing delay by applying a Bianchi model that is extended to non-saturation conditions. Thus, extending our analysis is not hard to do, but draws attention away from the main objective of this paper.…”

Section: A Model For the Rerouting Timementioning

confidence: 99%

Rerouting Time and Queueing in Proactive Ad Hoc Networks

Pham¹,

Larsen²,

Øvsthus³

et al. 2007

2007 IEEE International Performance, Computing, and Communications Conference

Self Cite

View full text Add to dashboard Cite

In a MANET network where nodes move frequently, the probability of connectivity loss between nodes might be high, and communication sessions may easily loose connectivity during transmission. The routing protocol is designed to find alternative paths in these situations. This rerouting takes time, and the latency is referred to as the rerouting time. This paper investigates the rerouting time of proactive routing protocols and shows that the rerouting time is considerably affected by queueing. Simulations and analysis are conducted to explore the problem. Finally, we propose a MAC-layer solution that reduces the rerouting time problems due to queueing. Simulations and analysis show that the solution is so effective that it eliminates the entire problem in many situations.

show abstract

Analysis of the Total Delay of IEEE 802.11e EDCA and 802.11 DCF

Cited by 64 publications

References 3 publications

Modular software architecture for flexible reservation mechanisms on heterogeneous resources

Modular software architecture for flexible reservation mechanisms on heterogeneous resources

Multimedia Capacity Analysis of the IEEE 802.11e Contention-Based Infrastructure Basic Service Set

Rerouting Time and Queueing in Proactive Ad Hoc Networks

Contact Info

Product

Resources

About