Routing in Generalized Geometric Inhomogeneous Random Graphs
MetadatosMostrar el registro completo del ítem
In this paper we study a new random graph model that we denote (κ,π)-KG and new greedy routing algorithms (of deterministic and probabilistic nature). The (κ,π)-KG graphs have power-law degree distribution and small-world properties. (κ,π)-KG roots on the Geometric Inhomogeneous Random Graph (GIRG) model, and hence they both preserve the properties of the hyperbolic graphs and avoid the problems of using hyperbolic cosines. In order to construct (κ,π)-KG graphs, we introduce two parametersκandπin the process of building a (κ,π)-KG graph. With these parameters we can generate Kleinberg and power-law networks as especial cases of (κ,π)-KG. Also, we propose two new greedy routing algorithms to reduce the fail ratio and maintaining a good routing performance. The first algorithm is deterministic and the second is, in essence, a weighted random walk. We use simulation techniques to test our network model, and evaluate the new routing algorithms on the two graph models (GIRG and (κ,π)-KG). In our simulations, we evaluate the number of hops to reach a destination from a source and the routing fail ratio, and measure the impact of the parameters (κ and π) on the performance of the new routing algorithms. We observe that our graph model (κ,π)-KG is more flexible than GIRG, and the new routing algorithms have better performance than the routing algorithms previously proposed.