  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.
