Computer networks stability independence of the queuing delays

Abstract

Communication in intelligent computer networks is an indispensible attribute of the dataflow quality in Web traffic. We propose a model that investigates intelligent computer networks stability while specifying its limits. Packet queuing delay affects the performance of the network, and especially its stability. If the network is presented as a dynamic system in block diagram form, we compute a transfer function and determine the quasi-polynomial system. The characteristic polynomial distribution of zeros of complex variable quasi-plane determines the boundaries of the network stability. The approach relies on estimation of the network system's transfer functions and its quasi-polynomial. Computer network stability is specified by the distribution of zeros of our quasi-polynomial that is the system's trajectory for arbitrary initial conditions which approach zero as soon as the packets in a router start queuing. Since the quasipolynomials consist of an infinite number of zeros a typical analytical methods cannot be applied here. So, we use graphical methods. Our model indicates that the queuing delays usually occurring in the network performance, do not affect the Web traffic and consequently the network stability on the whole.

Network Delay-Weighted Least Squares Localization Algorithm with Taylor Expansion based on Acoustic Emission

“…Paper [30] develops a continuous time Markov model to evaluate the packet sojourn time and design an expectation-maximization (EM) algorithm to calibrate the transition rate in the model. Paper [31] proposes a Channelbased Sampling rate and Queuing state Control (CSQC) scheme to minimize the packet transmission delay in industrial wireless sensor networks, and this scheme has low delay compared with the delay of IEEE 802.15.4 standard under varying interference effects. The state of the art and development directions of the queuing algorithm of WNCs are presented in paper [32].…”