Class-based per-flow queuing across multiple hierarchical link-sharing structures

Abstract

A method for class-based per-flow queuing for use with multiple link-sharing hierarchies, where each one of multiple link-sharing hierarchies imposes a different resource allocation program at one or more levels of differentiation, extending from the link root node to each individual data flow. A new queuing decision layer is introduced that considers all hierarchies simultaneously and arrives at a single queuing solution.

1 . A method for class-based per-flow queuing across multiple hierarchical link-sharing structures in a communications network, the method comprising: 
 a) providing a leaf selection mechanism operative to enforce a plurality of rules adapted for a plurality of hierarchical link-sharing structures, wherein each of said structures shares a single link, wherein each of said structures comprises a plurality of leaves, wherein each of said leaves represents a single flow, and wherein each of said leaves is common to each of said structures; and    b) selecting, in response to applying said leaf selection mechanism, one of said leaves for servicing during a communications network transmission opportunity.    
   
   
       2 . A method according to  claim 1  and further comprising updating operating parameters of said multiple hierarchical link-sharing structures to reflect resource usage by said leaf serviced during said communications network transmission opportunity.