In this paper, we derive the closed-form delay distributions of slotted ALOHA and nonpersistent carrier sense multiple access (CSMA) protocols under steady state. Three retransmission policies are analyzed. We find that under a binary exponential backoff retransmission policy, finite average delay and finite delay variance can be guaranteed for 2 and 4 3, respectively, where is the channel traf...

A novel dynamic programming formulation is proposed for computing optimal power control, source coding, and channel coding policies when the source traffic has tight delay constraints. Our solution minimizes power consumption subject to constraints on delay for all channel gains. This provides a much tighter delay bound than an average delay constraint, averaged over time varying channel gains....

BACKGROUND Delayed diagnosis of pulmonary embolism (PE) is common because symptoms can be non-specific. The few studies that have investigated diagnostic delay have not taken into account the role of primary care physicians in the diagnostic process. AIM To document and quantify the stages of diagnostic delay of PE and to identify clinical factors associated with this delay. DESIGN AND SETT...

We consider the fundamental delay bounds for scheduling packets in an N × N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the be...

The MetaRing is a Medium Access Control (MAC) protocol for Gigabit LANs and MANs with cells removed by the destination stations (slot reuse). Slot reuse increases the aggregate throughput beyond the capacity of single links but can cause starvation. In order to prevent this the MetaRing MAC protocol includes a fairness algorithm. Two types of fairness algorithms have been proposed: "global" and...

The extended GME (group mutual exclusion) problem is a natural extension of the GME problem. In extended GME problem, processes are allowed to request more than one resource at a time, in order that the processes that can proceed by having access to any one of the requested resource can be allowed to do so. Manabe-Park suggested a quorum based solution for the extended GME problem. However, the...

We report the detection of a massive high-redshift cluster of galaxies near the quadruple quasar RX J0911+05, using the LRIS instrument on the Keck-II telescope. The cluster is found to have a mean redshift of z̄ = 0.7689± 0.002 and a velocity dispersion of σ = 836 −200 km s , based on redshift measurements for 24 member galaxies. This massive high-redshift cluster is the origin of the unusually...

Proof: In this protocol X becomes a multi-access variable. If the sequentiality of X could be maintained we would get the same utilization bound as derived earlier. Note, that since there are only M slots, X may be simultaneously accessed by at most M stations. In the worst case when the value of X is 1 and M stations pick one slack slot each, they in the process deprive (M ? 1) stations down s...

In order to exploit the nonlinear time-varying property of network traffic, the traffic flow from controlled sources is described by a fuzzy autoregressive moving-average model with auxiliary input (fuzzy ARMAX process), with the traffic flow from uncontrolled sources (i.e., cross traffic) being described as external disturbances. In order to overcome the difficulty of the transmission delay in...

In this research report, we examine the effects of small-world network organization on spike synchronization dynamics in networks of Izhikevich spiking units. We interpolate network organizations from regular ring lattices, through the small-world region, to random networks, and measure global spike synchronization dynamics. We examine how average path length and clustering effect the dynamics ...