Abstract
Modeling networks as different graph types and researching on route finding strategies, to avoid congestion in dense subnetworks via graph-theoretic approaches, contributes to overall blocking probability reduction in networks. Our main focus is to study methods for modeling congested subnetworks and graph density measures, in order to identify routes that avoid dense subgraphs for global congestion avoidance, along with covering related algorithmic issues.
Models citing this paper 0
No model linking this paper
Cite arxiv.org/abs/2103.06367 in a model README.md to link it from this page.
Datasets citing this paper 0
No dataset linking this paper
Cite arxiv.org/abs/2103.06367 in a dataset README.md to link it from this page.
Spaces citing this paper 1
Collections including this paper 0
No Collection including this paper
Add this paper to a collection to link it from this page.