in this paper, a new enhanced version of the particle swarm optimization (pso) is presented. an important modification is made by adding probabilistic functions into pso, and it is named probabilistic particle swarm optimization (ppso). since the variation of the velocity of particles in pso constitutes its search engine, it should provide two phases of optimization process which are: explorati...

Satellites in Satellite IP network (SIPN) run along its orbit and have fixed periods. It is possible to estimate the encounter time between two satellites using their history encountering information. We introduce a method to estimate the time. Based on the encounter time information estimated, a new routing method, named Encounter Time Estimating Routing (ETER), is presented in the paper. ETER...

A BF-BASEDANALYTICALMODEL : DETAILS At its core, the analytical model of BF-based forwarding calculates the probability of forwarding decisions within a router, assuming Longest Prefix Matching (LPM) semantics. E.g. say a router has 3 interfaces 0, 1 and 2 each associated forwarding entries with sizes 1 or 2. Themodel calculates the probability of events such as ‘having a packet forwarded over ...

OBJECTIVE Studying geometric dynamics for annual cases of dengue recorded in Colombia from 19902006 by making an analogy with a probabilistic random walk. METHODS The geometric dynamics for the number of annual cases of dengue registered in Colombia for 1990-2006 was mathematically analyzed as a probabilistic random walk, building the total probability space for the dynamics in order to analy...

To evaluate existing and alternative proposals for emergency response to a deliberate smallpox attack, we embed the key operational features of such interventions into a smallpox disease transmission model. We use probabilistic reasoning within an otherwise deterministic epidemic framework to model the 'race to trace', i.e., attempting to trace (via the infector) and vaccinate an infected perso...

Gossip-based communication and epidemic-style routing algorithms have been proposed to achieve scalability in distributed systems and to support probabilistic communication when the application of the classic deterministic algorithms and protocols is impossible or unsuitable. In this paper, we present a middleware for probabilistic communication that relies on optimised epidemic-style informati...

When viruses spread, outbreaks can be spawned in previously unaffected regions. Depending on the time and mode of introduction, each regional outbreak can have its own epidemic dynamics. The migration and phylodynamic processes are often intertwined and need to be taken into account when analyzing temporally and spatially structured virus data. In this article, we present a fully probabilistic ...

Since roughly a decade ago, network science has focused among others on the problem of how the spreading of diseases depends on structural patterns. Here, we contribute to further advance our understanding of epidemic spreading processes by proposing a nonperturbative formulation of the heterogeneous mean-field approach that has been commonly used in the physics literature to deal with this kin...

Mobile opportunistic networks (MONs) are deliberated as important aspect to proliferate the wireless communications. These pose several challenges such network lifetime, storage capacity, and forwarding capacity. End-to-End routing schemes considered promising technique solution deal with these issues. In this domain, has gained huge attention because it follows broadcasting nature of communica...