اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPeer-to-Peer and Mass Communication Effect on Revolution Dynamics
427
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Revolution dynamics is studied through a minimal Ising model with three main influences (fields): personal conservatism (power-law distributed), inter-personal and group pressure, and a global field incorporating peer-to-peer and mass communications, which is generated bottom-up from the revolutionary faction. A rich phase diagram appears separating possible terminal stages of the revolution, characterizing failure phases by the features of the individuals who had joined the revolution. An exhaustive solution of the model is produced, allowing predictions to be made on the revolutions outcome.
قيم البحث
اقرأ أيضاً
A multiagent based model for a system of cooperative agents aiming at growth is proposed. This is based on a set of generalized Verhulst-Lotka-Volterra differential equations. In this study, strong cooperation is allowed among agents having similar s
izes, and weak cooperation if agent have markedly different sizes, thus establishing a peer-to-peer modulated interaction scheme. A rigorous analysis of the stable configurations is presented first examining the fixed points of the system, next determining their stability as a function of the model parameters. It is found that the agents are self-organizing into clusters. Furthermore, it is demonstrated that, depending on parameter values, multiple stable configurations can coexist. It occurs that only one of them always emerges with probability close to one, because its associated attractor dominates over the rest. This is shown through numerical integrations and simulations,after analytic developments. In contrast to the competitive case, agents are able to increase their capacity beyond the no-interaction case limit. In other words, when some collaborative partnership among a relatively small number of partners takes place, all agents act in good faith prioritizing the common good, whence receiving a mutual benefit allowing them to surpass their capacity.
This paper focuses on the stationary portion of file download in an unstructured peer-to-peer network, which typically follows for many hours after a flash crowd initiation. The model includes the case that peers can have some pieces at the time of a
rrival. The contribution of the paper is to identify how much help is needed from the seeds, either fixed seeds or peer seeds (which are peers remaining in the system after obtaining a complete collection) to stabilize the system. The dominant cause for instability is the missing piece syndrome, whereby one piece becomes very rare in the network. It is shown that stability can be achieved with only a small amount of help from peer seeds--even with very little help from a fixed seed, peers need dwell as peer seeds on average only long enough to upload one additional piece. The region of stability is insensitive to the piece selection policy. Network coding can substantially increase the region of stability in case a portion of the new peers arrive with randomly coded pieces.
Typical protocols for peer-to-peer file sharing over the Internet divide files to be shared into pieces. New peers strive to obtain a complete collection of pieces from other peers and from a seed. In this paper we investigate a problem that can occu
r if the seeding rate is not large enough. The problem is that, even if the statistics of the system are symmetric in the pieces, there can be symmetry breaking, with one piece becoming very rare. If peers depart after obtaining a complete collection, they can tend to leave before helping other peers receive the rare piece. Assuming that peers arrive with no pieces, there is a single seed, random peer contacts are made, random useful pieces are downloaded, and peers depart upon receiving the complete file, the system is stable if the seeding rate (in pieces per time unit) is greater than the arrival rate, and is unstable if the seeding rate is less than the arrival rate. The result persists for any piece selection policy that selects from among useful pieces, such as rarest first, and it persists with the use of network coding.
Growth models have been proposed for constructing the scale-free overlay topology to improve the performance of unstructured peer-to-peer (P2P) networks. However, previous growth models are able to maintain the limited scale-free topology when nodes
only join but do not leave the network; the case of nodes leaving the network while preserving a precise scaling parameter is not included in the solution. Thus, the full dynamic of node participation, inherent in P2P networks, is not considered in these models. In order to handle both nodes joining and leaving the network, we propose a robust growth model E-SRA, which is capable of producing the perfect limited scale-free overlay topology with user-defined scaling parameter and hard cut-offs. Scalability of our approach is ensured since no global information is required to add or remove a node. E-SRA is also tolerant to individual node failure caused by errors or attacks. Simulations have shown that E-SRA outperforms other growth models by producing topologies with high adherence to the desired scale-free property. Search algorithms, including flooding and normalized flooding, achieve higher efficiency over the topologies produced by E-SRA.
The dynamic behavior of a multiagent system in which the agent size $s_{i}$ is variable it is studied along a Lotka-Volterra approach. The agent size has hereby for meaning the fraction of a given market that an agent is able to capture (market share
). A Lotka-Volterra system of equations for prey-predator problems is considered, the competition factor being related to the difference in size between the agents in a one-on-one competition. This mechanism introduces a natural self-organized dynamic competition among agents. In the competition factor, a parameter $sigma$ is introduced for scaling the intensity of agent size similarity, which varies in each iteration cycle. The fixed points of this system are analytically found and their stability analyzed for small systems (with $n=5$ agents). We have found that different scenarios are possible, from chaotic to non-chaotic motion with cluster formation as function of the $sigma$ parameter and depending on the initial conditions imposed to the system. The present contribution aim is to show how a realistic though minimalist nonlinear dynamics model can be used to describe market competition (companies, brokers, decision makers) among other opinion maker communities.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
