Though there are works that show the asymptotic capacity bounds in a wireless network considering interference constraints from all transmitting nodes, there are no such evaluation of capacity bounds for finite secondary cognitive radio networks where the primaries pose additional constraints. In this paper, we find the bounds for the maximum achievable capacity of a randomly deployed secondary...

In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k—the capacity of the vehicle used for making the deliveries. The goal is to compute a shortest tour for the vehicle in which all objects can be delivered from their sources to their destinations while ensuring that the vehicle carries a...

In this paper we present a technique for deriving approximate measures for finite capacity queuing networks. The fact that buffers have finite capacity makes the analysis of such networks very difficult. Indeed, FC-QNs do not have a product form solution, except for a limited number of special cases. In general exact solution for such models can only be obtained using numerical methods. However...

A great deal of recent research attention has been given to the throughput maximization of interconnection networks. These networks connect computer processing and routing resources via both physical and wireless links, where the resources are reconfigurable in a dynamic fashion. Jobs move through several processing stations and can be buffered between each stage. Most theoretical work assumes ...

We establish the capacity region of the two-user Finite-Field Fading X-Channel with delayed channel state information at the transmitters. We consider the most general case in which each transmitter has a common message for both receivers and a private message for each one of them. We derive a new set of outer-bounds for this problem that rely on an extremal entropy inequality. This inequality ...

Gardner's analysis of the optimal storage capacity of neural networks is extended to study finite-temperature effects. The typical volume of the space of interactions is calculated for strongly-diluted networks as a function of the storage ratio α, temperature T , and the tolerance parameter m, from which the optimal storage capacity α c is obtained as a function of T and m. At zero temperature...

In this paper GI/G/1 queueing systems with buffer overflows are involved. First, we will give asymptotic expressions for the long-run fraction of rejected customers, in case the buffer capacity K grows large. Furthermore, we give a non-trivial upper and lower bound for this fraction for all K larger than some constant. Finally, we treat a method to speed up the simulation of the fraction of rej...

Equilibrium behavior of a store-and-forward network node with finite buffer capacity is studied via a network-of-queues model. The positive acknowledgment protocol is explicitly modeled and consumes part of the buffer pool. The principal results are the buffer overflow probability, the mean delays, and the distribution of queue lengths as functions of the buffer capacity and traffic levels. Int...

In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog colored Gaussian noise channel where the noise has an arbitrary spectral density. We introduce a new approach to the problem where we solve the problem over a finite number of transmissions and then consider the limi...

The present investigation deals with the performance prediction of finite Markovian retrial queues with unreliable server. The arrivals of the customers follow geometric distribution while the service pattern follows exponential distribution. The customers are served in two stages i.e. first essential service (FES) which is compulsory for all the arriving customers and second optional service (...