Local routing algorithm optimization and design of scale-free networks

MaRDI QIDQ5257702zbMATH OpenFDO

Authors Hong Wen, Xiaoping Fan, Huifu Zhang, Anhua Chen

Publication date 29 June 2015

zbMATH Keywords

algorithm designlocal routing algorithmnetwork performanceoptimal parameterscale-free networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms (68W40)

Recommendations

• Dynamic routing algorithm based on local information in a free-scale network
• A LOCAL INFORMATION-BASED ROUTING STRATEGY ON THE SCALE-FREE NETWORK
• A global routing method for weighted scale-free networks
• Efficient routing on scale-free networks based on local information
• EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS

Cited in

(10)

• On local routing of two-terminal nets
• Self avoiding paths routing algorithm in scale-free networks
• A global routing method for weighted scale-free networks
• Communication network designing: transmission capacity, cost and scalability
• A LOCAL INFORMATION-BASED ROUTING STRATEGY ON THE SCALE-FREE NETWORK
• Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
• Dynamic routing schemes for graphs with low local density
• Dynamic routing algorithm based on local information in a free-scale network
• EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS
• scientific article; zbMATH DE number 7774260 (Why is no real title available?)

This page was built for publication: Local routing algorithm optimization and design of scale-free networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5257702)