355 research outputs found
Estimation, Analysis and Smoothing of Self-Similar Network Induced Delays in Feedback Control of Nuclear Reactors
This paper analyzes a nuclear reactor power signal that suffers from network
induced random delays in the shared data network while being fed-back to the
Reactor Regulating System (RRS). A detailed study is carried out to investigate
the self similarity of random delay dynamics due to the network traffic in
shared medium. The fractionality or selfsimilarity in the network induced delay
that corrupts the measured power signal coming from Self Powered Neutron
Detectors (SPND) is estimated and analyzed. As any fractional order randomness
is intrinsically different from conventional Gaussian kind of randomness, these
delay dynamics need to be handled efficiently, before reaching the controller
within the RRS. An attempt has been made to minimize the effect of the
randomness in the reactor power transient data with few classes of smoothing
filters. The performance measure of the smoothers with fractional order noise
consideration is also investigated into.Comment: 6 pages, 6 figure
Performance analysis of MANET routing protocols in the presence of self-similar traffic
A number of measurement studies have convincingly demonstrated that network traffic can exhibit a noticeable self-similar nature, which has a considerable impact on queuing performance. However, many routing protocols developed for MANETs over the past few years have been primarily designed and analyzed under the assumptions of either CBR or Poisson traffic models, which are inherently unable to capture traffic self-similarity. It is crucial to re-examine the performance properties of MANETs in the context of more realistic traffic models before practical implementation show their potential performance limitations. In an effort towards this end, this paper evaluates the performance of three well-known and widely investigated MANET routing protocols, notably DSR, AODV and OLSR, in the presence of the bursty self-similar traffic. Different performance aspects are investigated including, delivery ratio, routing overhead, throughput and end-to-end delay. Our simulation results indicate that DSR routing protocol performs well with bursty traffic models compared to AODV and OLSR in terms of delivery ratio, throughput and end-to-end delay. On the other hand, OLSR performed poorly in the presence of self-similar traffic at high mobility especially in terms of data packet delivery ratio, routing overhead and delay. As for AODV routing protocol, the results show an average performance, yet a remarkably low and stable end-to-end delay
An acceleration simulation method for power law priority traffic
A method for accelerated simulation for simulated self-similar processes is proposed. This technique simplifies
the simulation model and improves the efficiency by using excess packets instead of packet-by-packet source traffic for a FIFO and non-FIFO buffer scheduler. In this research is focusing on developing an equivalent model of the conventional packet buffer that can produce an output analysis (which in this case will be the steady state probability) much faster. This acceleration simulation method is a further development of the Traffic Aggregation technique, which had previously been applied to FIFO buffers only and applies the Generalized Ballot Theorem to calculate the waiting time for the low priority traffic (combined with prior work on traffic aggregation). This hybrid method is shown to provide a significant reduction in the process time, while maintaining queuing behavior in the buffer that is highly accurate when compared to results from a conventional simulatio
Self-generated Self-similar Traffic
Self-similarity in the network traffic has been studied from several aspects:
both at the user side and at the network side there are many sources of the
long range dependence. Recently some dynamical origins are also identified: the
TCP adaptive congestion avoidance algorithm itself can produce chaotic and long
range dependent throughput behavior, if the loss rate is very high. In this
paper we show that there is a close connection between the static and dynamic
origins of self-similarity: parallel TCPs can generate the self-similarity
themselves, they can introduce heavily fluctuations into the background traffic
and produce high effective loss rate causing a long range dependent TCP flow,
however, the dropped packet ratio is low.Comment: 8 pages, 12 Postscript figures, accepted in Nonlinear Phenomena in
Complex System
- …