Abstract
In this paper, we present a new generalized betweenness centrality expression to account for the case where the source and the destination nodes are not uniformly chosen in the process of creating and sending information packets in a complex network. It is also shown that the standard expression for the betweenness centrality fails to predict the critical packet generation rate above which the transition from the free-flow to the congested state occurs while the new generalized quantity predicts it perfectly. This quantity is also used in the context of a new generalized self-avoiding paths routing (g-SAPR) protocol which uses static information that mimics the real traffic load distribution across the network. The simulations show results that confirm calculated quantities and that the g-SAPR algorithm is more adapted than other standard protocols, for the situation of non-uniformly selected source and destination nodes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
