ترغب بنشر مسار تعليمي؟ اضغط هنا

Loss Fluctuations and Temporal Correlations in Network Queues

66   0   0.0 ( 0 )
 نشر من قبل Igor V. Lerner
 تاريخ النشر 2008
والبحث باللغة English




اسأل ChatGPT حول البحث

We consider data losses in a single node of a packet-switched Internet-like network. We employ two distinct models, one with discrete and the other with continuous one-dimensional random walks, representing the state of a queue in a router. Both models {have} a built-in critical behavior with {a sharp} transition from exponentially small to finite losses. It turns out that the finite capacity of a buffer and the packet-dropping procedure give rise to specific boundary conditions which lead to strong loss rate fluctuations at the critical point even in the absence of such fluctuations in the data arrival process.

قيم البحث

اقرأ أيضاً

We introduce a continuum model describing data losses in a single node of a packet-switched network (like the Internet) which preserves the discrete nature of the data loss process. {em By construction}, the model has critical behavior with a sharp t ransition from exponentially small to finite losses with increasing data arrival rate. We show that such a model exhibits strong fluctuations in the loss rate at the critical point and non-Markovian power-law correlations in time, in spite of the Markovian character of the data arrival process. The continuum model allows for rather general incoming data packet distributions and can be naturally generalized to consider the buffer server idleness statistics.
Via molecular dynamics simulations of a generic glass former in the supercooled and normal liquid states, it is shown that spatial correlations of strain fluctuations exhibit a crossover from the well-established power-law $sim 1/r^3$-decay at long w avelengths to an exponential behavior, $sim exp(-r/l_{text {c}})$ at intermediate distances. The characteristic length of the exponential decay grows both with temperature and time via, $l_{text {c}}^2 propto D(T), t$, with $D(T)$ being the temperature-dependent diffusion coefficient. This suggests that the crossover between the power-law and exponential decays is governed by a diffusion process.
Most complex networks serve as conduits for various dynamical processes, ranging from mass transfer by chemical reactions in the cell to packet transfer on the Internet. We collected data on the time dependent activity of five natural and technologic al networks, finding that for each the coupling of the flux fluctuations with the total flux on individual nodes obeys a unique scaling law. We show that the observed scaling can explain the competition between the systems internal collective dynamics and changes in the external environment, allowing us to predict the relevant scaling exponents.
We present a new, systematic approach for analyzing network topologies. We first introduce the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Increasing values of d capture progr essively more properties of G at the cost of more complex representation of the probability distribution. Using this series, we can quantitatively measure the distance between two graphs and construct random graphs that accurately reproduce virtually all metrics proposed in the literature. The nature of the dK-series implies that it will also capture any future metrics that may be proposed. Using our approach, we construct graphs for d=0,1,2,3 and demonstrate that these graphs reproduce, with increasing accuracy, important properties of measured and modeled Internet topologies. We find that the d=2 case is sufficient for most practical purposes, while d=3 essentially reconstructs the Internet AS- and router-level topologies exactly. We hope that a systematic method to analyze and synthesize topologies offers a significant improvement to the set of tools available to network topology and protocol researchers.
How does a cell self-organize so that its appendages attain specific lengths that are convenient for their respective functions? What kind of rulers does a cell use to measure the length of these appendages? How does a cell transport structure buildi ng materials between the cell body and distal tips of these appendages so as to regulate their dynamic lengths during various stages of its lifetime? Some of these questions are addressed here in the context of a specific cell appendage called flagellum (also called cilium). A time of flight (ToF) mechanism, adapted from the pioneering idea of Galileo, has been used successfully very recently to explain the length control of flagella by a biflagellate green algae. Using the same ToF mechanism, here we develop a stochastic model for the dynamics of flagella in two different types of monoflagellate unicellular organisms. A unique feature of these monoflagellates is that these become transiently multi-flagellated during a short span of their life time. The mean length of the flagella in our model reproduce the trend of their temporal variation observed in experiments. Moreover, for probing the intracellular molecular communication between the dynamic flagella of a given cell, we have computed the correlation in the fluctuations of their lengths during the multiflagellated stage of the cell cycle by Monte Carlo simulation.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا