A technique determines whether configured logical bandwidth allotments for logical channels are supported by maximum available physical bandwidths of physical channels assigned to those logical channels. The technique establishes a bandwidth-constraint directed acyclic graph (DAG) or “BCD” based on novel relationship rules between vertexes of the BCD that represent logical channels or unions of logical channels as well as the underlying physical channels and their maximum available bandwidth constraints. Once the BCD is established, the vertexes of the BCD may be traversed (e.g., from in-neighbor vertexes to out-neighbor vertexes) to determine whether their constraints are met.