In the paper we study the performance of a two-hop star network which uses a single channel for bidirectional communications between stations and the central repeater. Two t~ansmission strategies, the station priority and the repeater priority scheme, which are based on S-ALOHA multiple access are presented and analyzed. The maximum network throughput and the delay-throughput tradeoffs for the ...

We investigate the minimum-energy packet scheduling problem for the multiaccess channel with K transmitters and a single receiver, assuming that packets arrive at each transmitter’s buffer at arbitrary times and must be transmitted within a finite time window. The offline scheduling problem is formulated and found to be a convex optimization problem with linear constraints. An efficient algorit...

In this paper, we establish that maintaining a balanced workload on each machine over time stochastically minimizes the work-in-process inventory in certain types of flexible manufacturing systems (FM%) with finite or infinite common input buffer storage and an ample buffer et each machine. The results obtained here complement those obtained by Stecke and Morin (1985), in which it is establishe...

The paper examines self-similar properties of real telecommunications network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. The algorithms for modeling fixed-length sequence generators that are used to simulate self-similar behavior of wireless IP ...

The paper examines self-similar properties of real telecommunications network traffic data over a wide range of time scales. These self-similar properties are very different from the properties of traditional models based on Poisson and Markov-modulated Poisson processes. Simulation with stochastic and long range dependent traffic source models is performed, and the algorithms for buffer overfl...

A GI/M/1-type queueing system with finite buffer capacity and AQM-type packet dropping is investigated. Even when the buffer is not saturated an incoming packet can be dropped (lost) with probability dependent on the instanteneous queue size. The system of integral equations for time-dependent queue-size distribution conditioned by the number of packets present in the system initially is built ...

State explosion is well-known to be the principle limitation in protocol verification. In this paper, we propose a verification technique called leaping reachability analysis (LRA) to tackle state explosion. We advocate LRA as a uniform and property-driven relief strategy for verifying general progress properties of protocols modeled as networks of communicating finite state machines (CFSMs). U...

In this work, we consider the use of buffer-aided relays, linear precoding techniques and multiple antennas for physical-layer security in wireless networks. We develop relay selection algorithms to improve the secrecy-rate performance of cooperative multi-user multiple-antenna wireless networks. In particular, we propose a novel finite buffer-aided relay selection algorithm that employs the ma...

In this paper a study on the buffer overflow period in a finite-buffer queue is presented. A special attention is paid to the autocorrelation and batch arrivals, which are supposed to mimic the properties of real arrival processes. Using the batch Markovian arrival process, formulas for the duration of the first, subsequent and stationary overflow periods, as well as formulas for the distributi...

We study the epidemic routing scheme with an immunity mechanism. The immunity mechanism enables more efficient utilization of limited buffer space at the nodes, by allowing nodes to remove outstanding copies of messages that have already been delivered. We develop a new analytical model for estimating the message delivery ratio (MDR) and the average delivery delay (ADD) under a variant of epide...