A recent study of non-extensive phase transitions in nuclei and nuclear clusters needs a probability model compatible with the appropriate Hamiltonian. For magnetic molecules a representation of the evolution by a Markov process achieves the required probability model that is used to study the probability density function (PDF) of the order parameter, i.e., the magnetization. The existence of o...

The coexistence of different cellular networks in the same area necessitates joint radio resource management for enhanced QoS provisioning and efficient radio resource utilization. We propose adaptive bandwidth management and joint call admission control (JCAC) scheme for heterogeneous cellular networks. The objectives of the proposed adaptive JCAC scheme are to enhance average system utilizati...

The major objectives of mobile multimedia networks are better bandwidth utilization, mobility, support for real time and non real time content transfer etc., But it has its own limitations with respect to number of calls admitting into the cell structure and allocation of bandwidth without much degradation of QoS. The QoS parameters are Call Dropping Probability (CDP) and Call Blocking Probabil...

We discuss dynamic system performance evaluation in the river port utilizing queuing models with batch arrivals. The general models of the system are developed. This system is modelled by M/M/n/m queue with finite waiting areas and identical and independent cargo-handling capacities. The models are considered with whole and part batch acceptance or whole and part batch rejections and the intera...

In this paper, we consider an optimization problem in networks with storage servers for providing multimedia service. The design involves assigning communication link capacity, sizing the multimedia servers and distributing di erent types of content at each server, while guaranteeing an upper limit on the individual end-to-end blocking probability. We consider alternate methods for obtaining th...

We consider passive all-optical networks using wavelength division multiplexing and wavelength routing, i.e. the path of a signal is determined by the wavelength of the signal and the signal origin. We present upper and lower bounds on the required number of wavelengths to achieve a given blocking probability. Speciically we show that between ?p M (1?P b) and O ?p M wavelengths are required to ...

We introduce a tra c model for circuit switched alloptical networks (AONs) which we then use to calculate the blocking probability along a path for networks with and without wavelength changers. We investigate the e ects of path length, switch size, and interference length (the expected number of hops shared by two sessions which share at least one hop) on blocking probability and the ability o...

We investigate the performance improvements imparted by some wavelength assignment algorithms to optical path WDM rings. A computationally inexpensive algorithm is presented that minimizes: a) the blocking probability immediately after each assignment; and b) the increment of the channel blocking probability at the assigned wavelength. Simple metrics are proposed for the choice of the best wave...

For the next generation optical internet to meet the growing traffic needs WDM technology is the key issue to realize high capacity networking infrastructure. In this paper an efficient algorithm is implemented for circuit switching in wide area networks. This algorithm known as semelightpath algorithm has been applied to ARPANET and NSFNET to estimate the blocking probability of a call via ful...