The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We model the behavior of a mobile agent as a random walk on a network, and derive the formula of the expected time until two random walkers meet on the basis of the spectral graph theory. The validity of the derived formula is confirmed by the comparison with simulation results. We believe that our work contributes to understanding the property of epidemic information dissemination, and designing...
People interaction on social media has a significant impact on public opinion formation. Disagreement, which is a kind of people interaction, causes dissensus among persons, and makes it difficult to build consensus in the society. Many studies investigated social networks with disagreement relationships. In particular, one study discussed the opinion formulation with a decision-making model where...
Microgrid is well known as key technology to improve renewable energy's ease of use. Some previous works focused on a microgrid that is divided into autonomous electricity subsystems (AESs) for its reliability and scalability. We have proposed the MCMC-based autonomous decentralized mechanism (ADM) to perform energy interchange between AESs so as to be supply energy appropriately for different energy...
The dynamics of network services' growth and decline is similar to infectious disease. So, it is expected that we can explain the growth and decline of a network service by using epidemiological models. The irSIR model is proposed as one of promising model for describing epidemiological transition of network services. To study the validity of applying the irSIR model, this paper focuses on SNSs transition...
In this paper, we analyze end-to-end TCP performance (i.e., Sending rate, packet loss probability, and roundtrip time) of TCP flows on a network with scale-free structure. Using a numerical example of our analysis, we show that the scale-free structure contributes to improve the end-to-end TCP performance, and that such performance improvement is caused by reduction in the average path length and...
It is not easy to provide energy supply based on renewable energy enough to satisfy energy demand anytime and anywhere because renewable energy amounts depends on geographical conditions and the time of day. This paper proposes a novel autonomous decentralized mechanism of energy interchanges between distributed batteries on the basis of the diffusion equation and MCMC (Markov chain Monte Carlo) for...
We have proposed an autonomous decentralized control using a local action rule for indirectly controlling the probability distribution of a system performance variable on the basis of markov chain monte carlo, while not measuring the variable. In this paper, we design an autonomous decentralized adaptive function for retaining the control strength of our control under a changing environment as an...
The TCP global synchronization problem is a phenomenon that congestion window control actions of multiple TCP flows are synchronized and causes inefficient use of network bandwidth. RED is a well known mechanisms to avoid this problem. However, the possible discard of packets based on probabilistic mechanism might not be fair enough. For this problem, we have proposed a transmission rate control base...
In this paper, we propose a novel autonomous decentralized control (ADC) for indirectly controlling a system performance variable, while not measuring the variable. In a large-scale and wide-area network, each node cannot gather information from the whole network, and has to control all over the network by collaborating with other nodes according to information in its local area. Some important problems...
The TCP global synchronization problem is a phenomenon that packet losses or window control actions of different flows are synchronized. It causes degradation of the utilization of network bandwidth. RED is a well known approach to avoid this problem. However, discard of packets occurs in some probability even if they are in low-rate flow, and it might be unfair. In this paper, we propose new transmission...
Conventional flow-level simulators use timescales around the round-trip time when numerically solving fluid-flow models for network simulations. In large-scale and high-speed network simulations, understanding coarser behavior than that achieved with timescales around the round-trip time is sometimes sufficient for performance analysis. In this paper, we propose a novel method for accelerating flow-level...
Hierarchization by clustering is effective for scalable routing control in an ad hoc network. Due to a constraint from structural features of ad hoc networks, clustering in ad hoc networks should be autonomous decentralized algorithm based on local information. Bio-inspired approach gives a solution of such autonomous decentralized clustering mechanism and its well-known mechanism is based on reaction-diffusion...
Since an autonomous decentralized mechanism needs not gather state information for all subsystems, it would have high feasibility for large-scale systems. One of the challenges for leading a property of a large-scale system in desirable direction (i.e., generating global order) by using an autonomous decentralized mechanism is to connect global behavior in a large- scale system and an autonomous action...
In this paper, we derive distributions of throughput, round-trip time, and packet loss probability of TCP flows in a scale-free network. Different from non scale-free networks such as ER (Erdos and Renyi) random graph, the connecting probability between nodes is dependent on their node degrees in scale-free networks. Hence, scale-free networks are generally not easy to analyze. Fekete et al. have...
In this paper, we extensively investigate the effectiveness of an epidemic broadcast with directional antennas on two-dimensional road model. In VANETs, realization of broadcast communication from a vehicle to other vehicles solely using a vehicle-to-vehicle radio communication channel is desired. In our previous work, we have proposed DSCF (Directional Store-Carry-Forward), which is an epidemic broadcast...
An efficient solution for a single-source problem called Thorup's algorithm has been proposed, whose computational complexity, O(N), is smaller than that of Dijkstra's algorithm, O(N log N). In this paper, we compare the performance of Dijkstra's algorithm and Thorup's algorithm for large-scale network simulation. Through extensive experiments, we show that Thorup's algorithm is slightly faster with...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.