In this paper, we introduce a comprehensive packet delay analysis for wireless networks based on IEEE 802.11 Distributed Coordination Function (DCF). We develop mathematical models that calculate a set of packet delay metrics, namely a) the average packet delay for successfully transmitted packets, b) the average packet delay of successfully transmitted packets experiencing a specific number of...

We present a core-stateless quality of service architecture for achieving delay differentiation between flows. There are two key components in our approach: 1. Per-class per-hop relative average delay: the average queueing delay perceived by the packets in a delay class at a link is inversely proportional to the delay weight of the class. 2. Per-flow end-to-end delay class adaptation: the delay...

background: tuberculosis (tb) is still a major cause of morbidity and mortality in both developed and developing countries. delay in accessing tuberculosis care is associated with the highest densities of mycobacterium tuberculosis (m. tuberculosis) bacilli on sputum smears. objectives: the current study aimed to determine the extent of delay, and the major health system contributing factors to...

We propose a new distributed scheduling scheme for guaranteeing quality of service(QoS) in WSNs. We first introduce the two multi-hop delay factors which can be caused by conventional TDMA scheduling;queueing delay and the delay by random link schedule. Next, this paper drives average end-toend delay of the proposed scheduling scheme that sequentially schedules the slots on the path and the con...

This paper presents a delay measurement techniques using signature analysis, and a scan design for the proposed delay measurement technique to detect small-delay defects. The proposed measurement technique measures the delay of the explicitly sensitized paths with the resolution of the on-chip variable clock generator. The proposed scan design realizes complete on-chip delay measurement in shor...

have also given a linear time algorithm to determine the set of possible root locations for a minimum diameter shortest path tree, and shown that any minimum diameter tree must pass through this region. When compared with the 1-Steiner algorithm, minimum diameter A-trees produced lower maximum and average delays, with slightly higher tree length. Consideration of the feasible center region resu...

We introduce three models of RAN-CN interface in IMT-2000 networks. After modeling each protocol stacks as queueing models, the performance of these models is evaluated in terms of average call setup delay and average transmission delay between RNC and MSC, and average location update delay. The comparison among them gives information about which protocol stack model is more advantageous. The Q...

The support of delay-sensitive applications like VoIP, video conferencing, video streaming, etc. on scheduled mesh networks requires careful configuration of routing and scheduling. We formulate a delay-optimal joint routing and scheduling optimization problem that minimizes the maximum average delay perceived by any flow under the physical interference model. Due to the non-convex nature of th...