arXiv subjects

Chuan-Yang Yin

Publications and source records attributed to Chuan-Yang Yin.

4 recordsLinked to original sources

arXiv2008

An effective local routing strategy on the BA network

In this paper, We propose a effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential delivering exponent alpha. we assume that the handling capacity of one vertex is proportional to its degree when the degree is smaller than a cut-off value $K$, and is infinite otherwise. It is found that by tuning the parameter alpha, the scale-free network capacity measured by the order parameter is considerably enhanced compared to the normal nearest-neighbor strategy. Traffic dynamics both near and far away from the critical generating rate R_c are discussed. We also investigate R_c as functions of m (connectivity density), K (cutoff value). Due to the low cost of acquiring nearest-neighbor information and the strongly improved network capacity, our strategy may be useful and reasonable for the protocol designing of modern communication networks.

physics.data-an↗

arXiv2006

Integrating static and dynamic information for routing traffic

The efficiency of traffic routing on complex networks can be reflected by two key measurements i.e. the system capacity and the average data packets travel time. In this paper, we propose a mixing routing strategy by integrating local static and dynamic information for enhancing the efficiency of traffic on scale-free networks. The strategy is governed by a single parameter. Simulation results show that there exists a optimal parameter value by considering both maximizing the network capacity and reducing the packet travel time. Comparing with the strategy by adopting exclusive local static information, the new strategy shows its advantages in improving the efficiency of the system. The detailed analysis of the mixing strategy is provided. This work suggests that how to effectively utilize the larger degree nodes plays the key role in the scale-free traffic systems.

physics.soc-ph↗

arXiv2005

Efficient routing on scale-free networks based on local information

In this letter, we propose a new routing strategy with a single free parameter $α$ only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of $α$ is sought out. By investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal $α$. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which do not depend on $α$. This phenomenon suggests that the capacity of the network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion.

physics.soc-ph↗

arXiv2005

Analytical Studies on a Modified Nagel-Schreckenberg Model with the Fukui-Ishibashi Acceleration Rule

We propose and study a one-dimensional traffic flow cellular automaton model of high-speed vehicles with the Fukui-Ishibashi-type (FI) acceleration rule for all cars, and the Nagel-Schreckenberg-type (NS) stochastic delay mechanism. By using the car-oriented mean field theory, we obtain analytically the fundamental diagrams of the average speed and vehicle flux depending on the vehicle density and stochastic delay probability. Our theoretical results, which may contribute to the exact analytical theory of the NS model, are in excellent agreement with numerical simulations.

cond-mat.stat-mech↗