Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Optimal transport on complex networks.

Bogdan Danila1, Yong Yu, John A Marsh

  • 1Department of Physics, The University of Houston, Houston, Texas 77004, USA. dbogdan@mail.uh.edu

Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics
|December 13, 2006
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Complexity and dynamics of partially symmetric random neural networks.

ArXiv·2026
Same author

From Chaos to Coherence: Effects of High-Order Synaptic Correlations on Neural Dynamics.

ArXiv·2025
Same author

Extreme Value Statistics of Community Detection in Complex Networks with Reduced Network Extremal Ensemble Learning (RenEEL).

Entropy (Basel, Switzerland)·2025
Same author

Hierarchical Modular Structure of the <i>Drosophila</i> Connectome.

The Journal of neuroscience : the official journal of the Society for Neuroscience·2023
Same author

How High-Risk Comorbidities Co-Occur in Readmitted Patients With Hip Fracture: Big Data Visual Analytical Approach.

JMIR medical informatics·2020
Same author

Reduced network extremal ensemble learning (RenEEL) scheme for community detection in complex networks.

Scientific reports·2019
Same journal

Tension on dsDNA bound to ssDNA-RecA filaments may play an important role in driving efficient and accurate homology recognition and strand exchange.

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Amplitude-phase coupling drives chimera states in globally coupled laser networks [Phys. Rev. E 91, 040901(R) (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Shapes of sedimenting soft elastic capsules in a viscous fluid [Phys. Rev. E 92, 033003 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Erratum: Attenuation of excitation decay rate due to collective effect [Phys. Rev. E 90, 022142 (2014)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Role of connectivity and fluctuations in the nucleation of calcium waves in cardiac cells [Phys. Rev. E 92, 052715 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
Same journal

Publisher's Note: Lattice Boltzmann approach for complex nonequilibrium flows [Phys. Rev. E 92, 043308 (2015)].

Physical review. E, Statistical, nonlinear, and soft matter physics·2016
See all related articles

This study introduces a new heuristic algorithm for optimizing transport on complex networks. The algorithm balances network traffic to prevent node congestion, allowing networks to handle more traffic than shortest path routing.

Area of Science:

  • Network science
  • Computer science
  • Operations research

Background:

  • Existing network transport optimization algorithms focus on reducing link overload.
  • Node congestion can cause network jamming, even when links are not overloaded.

Purpose of the Study:

  • To present a novel heuristic algorithm for optimizing transport on complex networks.
  • To address network jamming caused by node congestion.

Main Methods:

  • Developed a heuristic algorithm to balance traffic by minimizing maximum node betweenness.
  • Incorporated minimal path lengthening into the routing strategy.

Main Results:

  • The proposed algorithm effectively balances traffic across network nodes.

Related Experiment Videos

  • Networks utilizing this routing can sustain significantly higher traffic loads without jamming compared to shortest path routing.

    • Conclusions:

    • The heuristic algorithm provides an effective solution for node congestion in complex networks.
    • This approach enhances network capacity and resilience under high traffic conditions.