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

   
   

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.

 
Web www.patentalert.com

< Method for maintaining consistent dual copies of vital product data in a dual accessor library of portable data storage media

< Methods and apparatus for real-time projection and rendering of geospatially organized data

> Access-method-independent exchange with communication request

> Web-based media submission tool

~ 00196