Consider a wireless ad hoc network with random access channel. We present a model that takes into account topology, routing, random access in MAC layer and forwarding probability. We propose a new approach (based on cycle of transmissions) to derive throughput of multi-hop routes and stability of forwarding queues. With this cycle approach, we correct the analytical expressions derived in [2] a...

We develop a simple theory of flows to study the flow of data in real-time computing networks. Flow Theory is based on discrete and nondeterministic mathematics, rather than the customary continuous or probabilistic mathematics. The theory features two types of flows: smooth and uniform, and eight types of flow operators. We prove that, if the input flow to any of these operators is smooth or u...

We consider the problem of scheduling a group of heterogeneous, distributed processes, with different relative priorities and service preferences, to a group of heterogeneous virtual machines. Assuming linearly elastic IT resource needs, we extend prior results on proportional fair and max-min fair scheduling to a constrained multiresource case for a fam- ily of fairness criteria (including our...

With Weighted Fair Queuing, the link’s bandwidth is distributed among competing flows proportionally to their weights. In this paper we propose an extension of the DCF function of IEEE 802.11 to provide weighted fair queuing in Wireless LAN. Simulation results show that the proposed scheme is able to provide the desired bandwidth distribution independent of the flows aggressiveness and their wi...

We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...

The transport of real-time data flows over wireless channels can be optimized by cross-layer schedulers which serve the different users dependent on their traffic load and channel state. This paper investigates the delay performance of a two-stage cross-layer scheduler which has been designed to meet the above requirements. The well-known Weighted Fair Queuing Scheduler can tramsmit packets wit...

In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block over long time spans such as seconds. In order to optimize the power settings, one needs to employ models which predict the rate of terminals over the next coordination period under the usage of a give...

This paper reports results of the first experiment DESPEC Phase-0 campaign at GSI, which focused on study neutron-deficient nuclei approaching 100Sn. These data provide extended commissioning for collaboration within NuSTAR. We present electromagnetic transition rates associated with decays from excited states populated following formation Iπ = 8+ proton ‘seniority-isomer’ in N 50 isotones 94Ru...

In this paper, we propose a design and implementation method for priority queuing mechanisms on FPGAs. First, we describe behavior of WFQ (weighted fair queuing) with several parameters in a model called concurrent periodic EFSMs. Then, we derive a parameter condition for the concurrent EFSMs to execute their transitions without deadlocks in the specified time period repeatedly under the specif...

In this paper, we suggested an algorithm to guarantee QoS (Quality of Service) and provide priority for users in 1xEV-DO systems. On forward link, a selected user is served in a TDM fashion with full base station power. The transmission rate depends on the forward link channel quality of each access terminal, which is reported by DRC channel. 1xEV-DO systems adopted an efficient scheduling algo...