Second-order hubbing-and-grooming constrained by demand categories

摘要

An end-to-end demand between a pair of nodes of a telecommunication network is determined is categorized into a category based on hub assignments for the nodes. A route for the end-to-end demand in the telecommunication network is determined using a hubbing-and-grooming algorithm. The hubbing-and-grooming algorithm constrains which one or more links are eligible to be considered in determining the route based on the category of the end-to-end demand.