Global Hybrid Routing for Scale-Free Networks

Gao, Xiong; Guo, Hongxiang; Chen, Yanhu; Tang, Yinan; Wang, Cen; Xu, Shengyao; Wu, Jian

doi:10.1109/access.2019.2897255

Cited by 15 publications

(9 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The research of traffic capacity allocation strategy on twolayer network is essential, and the ideal allocation strategy can be helpful in optimizing traffic performance of real networks. The shortest path routing (SPR) strategy is a tradi-tional routing, and its the advantage is that packets can reach the destination as quickly as possible, but contestability these packets would quickly become congested on the central node [20], [21]. Kurant et al [14] abstracted the actual physical layer structure and traffic information on the public transmission system into a two-layer network model.…”

Section: Related Workmentioning

confidence: 99%

“…When structural correlation exists between the two layers, the traffic capacity of the whole network system may be enhanced or weaken [32], [33]. According to the degree correlation, the correlation between the layers can be quantified by the spearman rank correlation coefficient as [21], [30], [34], [35]…”

Section: The Model and Definitions A Coupled Network Modelmentioning

confidence: 99%

See 1 more Smart Citation

Traffic Resource Allocation for Multi-Layer Networks

Zhang

2020

IEEE Access

View full text Add to dashboard Cite

Traffic dynamics on multi-layer networks are of great importance to alleviate traffic congestion of real networks. In this work, we focus on information transport in multi-layer networks comprised of two coupled subnetworks. We investigate the relationship between correlated inter-layer couplings and resource allocation strategies on the traffic dynamics of multi-layer networks. Simulation results show that assortative coupling (AC) structure can improve the multi-layer networks traffic capacity more better than disassortative coupling (DC) and random coupling (RC) with degree-based (DE) efficient resources allocation strategy, and DC structure is better in enhancing the traffic capacity with the simplest average resources allocation (SA) strategy. Our work may shed some light on the traffic dynamics on multilayer networks.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: The Model and Definitions A Coupled Network Modelmentioning

confidence: 99%

Traffic Resource Allocation for Multi-Layer Networks

Zhang

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Several routing strategies have already been proposed for communication network models to mitigate the network congestion. Reference [2] used the information on the number of stored packets among the local connections in the networks to determine the transmitting node of packets, and [3] used the information on the number of stored packets in the entire network to dynamically determine the transmitting routes of packets in the communication networks. These strategies require global and real-time information in the networks.…”

Section: Introductionmentioning

confidence: 99%

An effective routing strategy using congestion signaling for various types of communication networks

Hiraki

Adachi

Matsuura

et al. 2023

NOLTA

View full text Add to dashboard Cite

Finding the shortest paths for packets in communication networks is one of the vital engineering challenges. Recently, a routing strategy using gravitational centrality has been proposed to find efficient transmitting routes for packets to their destinations. This routing strategy successfully mitigates the congestion of packets in the networks and effectively transmits many packets to their destinations by using gravitational centrality. However, this routing strategy is difficult to transmit the packets to their destinations if large volumes of packets flow in the communication networks because fixed costs are used to determine the shortest paths for every source-destination pair. To overcome these problems, we have already proposed a routing strategy using congestion signals. This routing strategy further mitigates the congestion of packets compared to conventional routing strategies such as the routing strategy with gravitational centrality. In this study, we comprehensively evaluate the routing strategy with the congestion signals if different types of centralities are incorporated into the costs of links and various topologies are applied to the communication network models. Numerical experiments illustrate that our routing strategy using the congestion signals mitigates the congestion of packets even if other types of centralities are incorporated. In addition, our proposed routing strategy shows effective transmitting performance for the various topologies of networks.

show abstract

“…Gao et al . [ 9 ] employed weights between nodes that dynamically change based on the connectivity of the network and stored information of packets. Echagüe et al .…”

Section: Introductionmentioning

confidence: 99%

A routing method with adaptively adjusting memory information based on local routing history

Kimura

Shimada

2023

PLoS ONE

View full text Add to dashboard Cite

Finding the shortest paths for packets from sources to destinations in packet-switched communication networks is an inevitable problem in building a future high-speed information society. A routing method with memory information has already been proposed to alleviate the congestion of large volumes of packet flow. This routing method shows a high transmission completion rate even for large volumes of packet flows in communication networks with scale-free properties. However, the method exhibits poor performance for networks with local triangular connections and long distances between nodes. To overcome these problems, in this study, we first enhanced the routing performance of the conventional communication network models by using the betweenness centrality of nodes, which is one of the network centralities that measures the number of shortest paths that pass through each node in the networks. Subsequently, we adaptively changed the transmitting paths of packets by using only local information. Numerical simulations indicated that our routing method performs successfully for various topologies of communication networks by avoiding the congested node, and effectively using the memory information.

show abstract

Global Hybrid Routing for Scale-Free Networks

Cited by 15 publications

References 36 publications

Traffic Resource Allocation for Multi-Layer Networks

Traffic Resource Allocation for Multi-Layer Networks

An effective routing strategy using congestion signaling for various types of communication networks

A routing method with adaptively adjusting memory information based on local routing history

Contact Info

Product

Resources

About