Algorithms for partitioning of large routing networks

DOI10.1057/JORS.2009.52MaRDI QIDQ3585725zbMATH OpenOpenAlexFDO

Authors

Publication date 2 September 2010

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.2009.52

zbMATH Keywords

distributed computinggraph partitioninglarge networksload balancing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Performance of a centrally directed hierarchical routing strategy with distance based and traffic based partitioning of network
• A hybrid topological-stochastic partitioning method for scaling QoS routing algorithms
• Ein partitionierungsalgorithmus zur distanzberechnung auf Verkehrsnetzen
• Efficient multiple-way network-partitioning algorithm
• A Voronoi heuristic approach to dividing networks into equal-sized sub-networks

Cited in

(2)

• Simultaneous node and link districting in transportation networks: model, algorithms and railway application
• A hybrid topological-stochastic partitioning method for scaling QoS routing algorithms

This page was built for publication: Algorithms for partitioning of large routing networks

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