Yu-jian Li

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we propose an effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential cutoff exponent K. We assume that the handling capacity of one vertex is proportional to its degree when the degree is smaller than K, and is a constantC 0 otherwise. It is found that by tuning the parameter α,(More)
  • 1