scholarly journals Modeling and Optimization ofM/G/1-Type Queueing Networks: An Efficient Sensitivity Analysis Approach

2010 ◽  
Vol 2010 ◽  
pp. 1-20 ◽  
Author(s):  
Liang Tang ◽  
Hong-sheng Xi ◽  
Jin Zhu ◽  
Bao-qun Yin

A mathematical model forM/G/1-type queueing networks with multiple user applications and limited resources is established. The goal is to develop a dynamic distributed algorithm for this model, which supports all data traffic as efficiently as possible and makes optimally fair decisions about how to minimize the network performance cost. An online policy gradient optimization algorithm based on a single sample path is provided to avoid suffering from a “curse of dimensionality”. The asymptotic convergence properties of this algorithm are proved. Numerical examples provide valuable insights for bridging mathematical theory with engineering practice.

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Majidah H. Majeed ◽  
Riyadh Khlf Ahmed

AbstractSpectral Amplitude Coding-Optical Codes Division Multiple Access (SAC-OCDMA) is a future multiplexing technique that witnessed a dramatic attraction for eliminating the problems of the internet in optical network field such as multiple-user access and speed’s growth of the files or data traffic. In this research article, the performance of SAC-OCDMA system based on two encoding–decoding multidiagonal (MD) and Walsh Hadamard (WH) codes is enhanced utilizing three different schemes of dispersion compensating fiber (DCF): pre-, post- and symmetrical compensation. The system is simulated using Optisystem version 7.0 and Optigrating version 4.2. The performance of the proposed system is specified in terms of bit error rate (BER), Q-factor and eye diagram. It has been observed that the compensated system based on MD code is performs much better compared to the system based on WH code. On the other hand, the compensated SAC-OCDMA system with symmetrical DCF has the lowest values of BER and largest values of Q-factor, so it is considered the best simulated scheme contrasted with pre- and post-DCF.


2020 ◽  
Vol 167 ◽  
pp. 107329 ◽  
Author(s):  
Shiyang Yan ◽  
Yuan Xie ◽  
Fangyu Wu ◽  
Jeremy S. Smith ◽  
Wenjin Lu ◽  
...  

2019 ◽  
Vol 8 (3) ◽  
pp. 890-897
Author(s):  
Y. J. I. A. Yaqoob ◽  
W. L. Pang ◽  
S. K. Wong ◽  
K. Y. Chan

The continuous growth in mobile data traffic and limited license wireless spectrum have led to dramatically increase the demand of the radio spectrum. It is widespread the concern about the coexistence of long term evolution (LTE) and Wi-Fi in the unlicensed band. There are several techniques have been proposed to enable the coexistence of LTE and Wi-Fi in the unlicensed band, but these works are targeted on the impact of the LTE to the Wi-Fi network performance. An experiment is carried out in this work to evaluate the impact of Wi-Fi signal on the video streaming in the LTE network. The experimental test comprised of the national instrument (NI) universal software radio peripheral (USRP) 2953R that is controlled by the LabVIEW Communication LTE application framework. Extensiveexperiments are carried out under two scenarios, i.e. (1) Coexistence of LTE and Wi-Fi signal, (2) LTE signal only. Performance evaluations are carried out with different Modulation and coding schemes (MCS) values and different mode of operations, i.e. frequency division duplex (FDD) and time division duplex (TDD) mode. The results illustrated that the interference from Wi-Fi signal caused the performance degradation of the LTE network in throughput and the power received by user equipment (UE).


2020 ◽  
Vol 17 (1) ◽  
pp. 51-70
Author(s):  
Jesús Calle-Cancho ◽  
José-Manuel Mendoza-Rubio ◽  
José-Luis González-Sánchez ◽  
David Cortés-Polo ◽  
Javier Carmona-Murillo

The number of mobile subscribers, as well as the data traffic generated by them, is increasing exponentially with the growth of wireless smart devices and the number of network services that they can support. This significant growth is pushing mobile network operators towards new solutions to improve their network performance and efficiency. Thus, the appearance of Software Defined Networking (SDN) can overcome the limitations of current deployments through decoupling the network control plane from the data plane, allowing higher flexibility and programmability to the network. In this context, the process of handling user mobility becomes an essential part of future mobile networks. Taking advantage of the benefits that SDN brings, in this article we present a novel mobility management solution. This proposal avoids the use of IP-IP tunnels and it adds the dynamic flow management capability provided by SDN. In order to analyse performance, an analytical model is developed to compare it with NB-DMM (Network-based DMM), one of the main DMM (Distributed Mobility Management) solutions. Additionally, performance is also evaluated with an experimental testbed. The results allow handover latency in real scenarios and numerical investigations to be measured, and also show that SR-DMM achieves better efficiency in terms of signaling and routing cost than NB-DMM solution.


2016 ◽  
Vol 2016 ◽  
pp. 1-11
Author(s):  
Zhong-Nan Zhao ◽  
Pei-Li Qiao ◽  
Jian Wang

For the high speed sensor networks applications such as Internet of Things, multimedia transmission, the realization of high-rate transmission under limited resources has become a problem to be solved. A high speed transmission and energy optimization model oriented to lifecycle maximization is proposed in this paper. Based on information-directed mechanism, the energy threshold set and the relay node distance selection will be done in the process of target tracing, as a result, retaining a balance between transmission rate and energy consumption. Meanwhile, multiagent coevolution is adopted to achieve the maximum of network lifecycle. Comparing with the relevant methods, indexes for network such as hops, throughput, and number of active nodes, standard deviation of remaining energy, and the network lifecycle are considered, and the simulated experiments show that the proposed method will promote the transmission rate effectively, prolong the network lifecycle, and improve network performance as a whole.


1987 ◽  
Vol 19 (03) ◽  
pp. 708-738 ◽  
Author(s):  
X. R. Cao

Perturbation analysis is a new technique which yields the sensitivities of system performance measures with respect to parameters based on one sample path of a system. This paper provides some theoretical analysis for this method. A new notion, the realization probability of a perturbation in a closed queueing network, is studied. The elasticity of the expected throughput in a closed Jackson network with respect to the mean service times can be expressed in terms of the steady-state probabilities and realization probabilities in a very simple way. The elasticity of the throughput with respect to the mean service times when the service distributions are perturbed to non-exponential distributions can also be obtained using these realization probabilities. It is proved that the sample elasticity of the throughput obtained by perturbation analysis converges to the elasticity of the expected throughput in steady-state both in mean and with probability 1 as the number of customers served goes to This justifies the existing algorithms based on perturbation analysis which efficiently provide the estimates of elasticities in practice.


1989 ◽  
Vol 26 (02) ◽  
pp. 418-422 ◽  
Author(s):  
Francois Baccelli ◽  
William A. Massey

The exact solution for the transient distribution of the queue length and busy period of the M/M/1 queue in terms of modified Bessel functions has been proved in a variety of ways. Methods of the past range from spectral analysis (Lederman and Reuter (1954)), combinatorial arguments (Champernowne (1956)), to generating functions coupled with Laplace transforms (Clarke (1956)). In this paper, we present a novel approach that ties the computation of these transient distributions directly to the random sample path behavior of the M/M/1 queue. The use of Laplace transforms is minimized, and the use of generating functions is eliminated completely. This is a method that could prove to be useful in developing a similar transient analysis for queueing networks.


2016 ◽  
Vol 2016 ◽  
pp. 1-10
Author(s):  
Ruyan Wang ◽  
Yang Tang ◽  
Junjie Yan

Based on the “storing-carrying-forwarding” transmission manner, the packets are forwarded flexibly in Intermittently Connected Wireless Network (ICWN). However, due to its limited resources, ICWN can easily become congested as a large number of packets entering into it. In such situation, the network performance is seriously deteriorated. To solve this problem, we propose a congestion control mechanism that is based on the network state dynamic perception. Specifically, through estimating the congestion risk when a node receives packets, ICWN can reduce the probability of becoming congested. Moreover, due to ICWN’s network dynamics, we determine the congestion risk threshold by jointly taking into account the average packet size, average forwarding risk, and available buffer resources. Further, we also evaluate the service ability of a node in a distributed manner by integrating the recommendation information from other intermediate nodes. Additionally, a node is selected as a relay node according to both the congestion risk and service ability. Simulation results show that the network performance can be greatly optimized by reducing the overhead of packet forwarding.


Sign in / Sign up

Export Citation Format

Share Document