Optimization of hierarchical routing protocols

DOI10.1016/S0166-5316(00)00009-2MaRDI QIDQ4779361zbMATH OpenOpenAlexFDO

Authors Jean-Louis Rougier, Daniel Kofman, A. Gravey

Publication date 24 June 2003

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-5316(00)00009-2

zbMATH Keywords

clustering processnetwork performance

Mathematics Subject Classification ID

Network protocols (68M12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Minimizing hierarchical routing error
• Hierarchical clustering with topology databases
• Performance of a centrally directed hierarchical routing strategy with distance based and traffic based partitioning of network
• scientific article; zbMATH DE number 1795201
• The complexity of routing in~hierarchical PNNI networks

Cited in

(12)

• Minimizing hierarchical routing error
• The expected length of a random line segment in a rectangle.
• Performance of a centrally directed hierarchical routing strategy with distance based and traffic based partitioning of network
• Clustering algorithms for the optimization of communication graphs
• Preventing the cluster formation attack against the hierarchical OLSR protocol
• The dynamic wireless sensor network routing protocol based on prime-numbered addresses
• scientific article; zbMATH DE number 4203676 (Why is no real title available?)
• scientific article; zbMATH DE number 5010337 (Why is no real title available?)
• The complexity of routing in~hierarchical PNNI networks
• Hierarchical use of dedicated channels
• Improving Topological Routing in N2R Networks
• Closed-form formulas for cluster sizing for two-level hierarchical networks with source routing

This page was built for publication: Optimization of hierarchical routing protocols

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