اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Dynamics of Internet Traffic: Self-Similarity, Self-Organization, and Complex Phenomena
642
0
0.0
(
0
)
تأليف
Reginald D. Smith
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Internet is the most complex system ever created in human history. Therefore, its dynamics and traffic unsurprisingly take on a rich variety of complex dynamics, self-organization, and other phenomena that have been researched for years. This paper is a review of the complex dynamics of Internet traffic. Departing from normal treatises, we will take a view from both the network engineering and physics perspectives showing the strengths and weaknesses as well as insights of both. In addition, many less covered phenomena such as traffic oscillations, large-scale effects of worm traffic, and comparisons of the Internet and biological models will be covered.
قيم البحث
اقرأ أيضاً
Self-organization can be broadly defined as the ability of a system to display ordered spatio-temporal patterns solely as the result of the interactions among the system components. Processes of this kind characterize both living and artificial syste
ms, making self-organization a concept that is at the basis of several disciplines, from physics to biology and engineering. Placed at the frontiers between disciplines, Artificial Life (ALife) has heavily borrowed concepts and tools from the study of self-organization, providing mechanistic interpretations of life-like phenomena as well as useful constructivist approaches to artificial system design. Despite its broad usage within ALife, the concept of self-organization has been often excessively stretched or misinterpreted, calling for a clarification that could help with tracing the borders between what can and cannot be considered self-organization. In this review, we discuss the fundamental aspects of self-organization and list the main usages within three primary ALife domains, namely soft (mathematical/computational modeling), hard (physical robots), and wet (chemical/biological systems) ALife. We also provide a classification to locate this research. Finally, we discuss the usefulness of self-organization and related concepts within ALife studies, point to perspectives and challenges for future research, and list open questions. We hope that this work will motivate discussions related to self-organization in ALife and related fields.
We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e
., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We prove that a class of hidden variable models with underlying metric spaces are able to accurately reproduce the self-similarity properties that we measured in the real networks. Our findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.
In this chapter we discuss how the results developed within the theory of fractals and Self-Organized Criticality (SOC) can be fruitfully exploited as ingredients of adaptive network models. In order to maintain the presentation self-contained, we fi
rst review the basic ideas behind fractal theory and SOC. We then briefly review some results in the field of complex networks, and some of the models that have been proposed. Finally, we present a self-organized model recently proposed by Garlaschelli et al. [Nat. Phys. 3, 813 (2007)] that couples the fitness network model defined by Caldarelli et al. [Phys. Rev. Lett. 89, 258702 (2002)] with the evolution model proposed by Bak and Sneppen [Phys. Rev. Lett. 71, 4083 (1993)] as a prototype of SOC. Remarkably, we show that the results obtained for the two models separately change dramatically when they are coupled together. This indicates that self-organized networks may represent an entirely novel class of complex systems, whose properties cannot be straightforwardly understood in terms of what we have learnt so far.
For a tuple $A= (A_0, A_1, ldots , A_n)$ of elements in a unital Banach algebra $mathcal{B}$, its textit{projective (joint) spectrum} $p(A)$ is the collection of $zinmathbb{P}^{n}$ such that $A(z)=z_0A_0+z_1 A_1 + ldots z_n A_n$ is not invertible. If
the tuple $A$ is associated with the generators of a finitely generated group, then $p(A)$ is simply called the projective spectrum of the group. This paper investigates a connection between self-similar group representations and an induced polynomial map on the projective space that preserves the projective spectrum of the group. The focus is on two groups: the infinite dihedral group $D_infty$ and the Grigorchuk group ${mathcal G}$ of intermediate growth. The main theorem shows that for $D_infty$ the Julia set of the induced rational map $F$ is equal to the union of the projective spectrum with the extended indeterminacy set. Moreover, the limit function of the iteration sequence ${F^{circ n}}$ on the Fatou set is determined explicitly. The result has an application to the group ${mathcal G}$ and gives rise to a conjecture about its associated Julia set.
In this paper, we begin by reviewing a certain number of mathematical challenges posed by the modelling of collective dynamics and self-organization. Then, we focus on two specific problems, first, the derivation of fluid equations from particle dyna
mics of collective motion and second, the study of phase transitions and the stability of the associated equilibria.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
