In large and complex communication networks, architectural decisions regarding functionality allocation are often more important than the details of the resultant resource allocation algorithms themselves. Optimization theory is a powerful tool for designing architectures and providing the structures algorithmic structures for communication networks. Starting with fair resource allocation as th...

this paper deals with the design and evaluation of a robust controller for static var compensator (svc) in remote industrial power systems to enhance the voltage profile for three-phase single cage induction motor (scim) loads. the controller design is based on h∞ theory to deal with uncertainties arising in industrial network modelling. the performance of the h∞ controller has been evaluated e...

Living cells deploy many resources to sense their environments, including receptors, downstream signaling molecules, time, and fuel. However, it is not known which resources fundamentally limit the precision of sensing, like weak links in a chain, and which can compensate each other, leading to trade-offs between them. We present a theory for the optimal design of the large class of sensing sys...

In this research, both resource allocation and reactive resource allocation problems in multi-server dynamic PERT networks are analytically modeled, where new projects are expected to arrive according to a Poisson process, and activity durations are also known as independent random variables with exponential distributions. Such system is represented as a queuing network, where multi servers at ...

A set of simple queuing theory models which can model the average response of a network of computers to a given traffic load has been implemented. The impact of variations in traffic patterns and intensities, channel capacities, and message protocols can be assessed using them because of the lack of fine detail in the network traffic rates, traffic patterns, and the hardware used to implement t...

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

Within the competition in today’s business environment, the design of supply chains becomes more complex than before. This paper deals with the retailer’s location problem when customers choose their vendors, and inventory costs have been considered for retailers. In a competitive location problem, price and location of facilities affect demands of customers; consequently, simultaneous optimiza...

To perform a queuing analysis or design in a communications context, we need to estimate the values of the input parameters, specifically the mean of the arrival rate and service time. In this paper, we propose an approach for estimating the arrival rate of Poisson processes and the average service time for servers under the assumption that the service time is exponential. In particular, we der...

in this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. since cell formation problem is np-hard, two algorithms based on genetic and modified particle swarm optimization (mpso) algorithms are developed to solve the problem. for generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...