Dynamic queue instantiation

A computer program product comprising a non transitory computer useable medium having embodied therein program code comprising:

• logic for entering a PPP Multilink-Extension negotiation with a peer network device;
• logic for comparing a preset number of maximum egress priority queues with a preset number of peer network device egress priority queues;
• logic for negotiating a number of egress priority queues that is less than or equal to the number of peer network device egress priority queues;
• logic for instantiating the number of negotiated egress priority queues, instantiating further including:
• identifying the number of PPP multilink extension classes based on a common number of available egress priority queues;
• setting a matching number of egress priority queues on each peer;
• and
• instantiating the matching number of egress priority queues such that allocation of memory resources supporting the instantiated queues occurs following the negotiation, wherein scheduling resources recognize the instantiated number of egress priority queues rather than a maximum number supportable by either peer;
• logic for establishing a number of PPP Multilink-Extension classes equal to the number of negotiated egress priority queues;
• logic for negotiating a matching number of Multilink-Extension classes with the peer network device;
• and
• mapping DSCP (Differentiated Service Code Point) classes to the established PPP Multilink-Extension classes, the DSCP classes indicative of differentiated service level treatment.

A communication device comprising:

• a memory encoded with logic for performing a method for providing network transport, the memory being a non-transitory computer readable medium;
• logic for entering a PPP Multilink-Extension negotiation with a peer network device;
• logic for comparing a present number of maximum egress priority queues with a preset number of peer network device egress priority queues;
• logic for negotiation a number of egress priority queues that is less than or equal to the number of peer network device egress priority queues;
• logic for instantiating the number of negotiated egress priority queues, instantiating further including:
• identifying the number of PPP multilink extension classes based on a common number of available egress priority queues;
• setting a matching number of egress priority queues on each peer;
• and
• instantiating the matching number of egress priority queues such that allocation of memory resources supporting the instantiated queues occurs following the negotiation, wherein scheduling resources recognize the instantiated number of egress priority queues rather than a maximum number supportable by either peer;
• and
• logic for establishing a number of PPP Multilink-Extension classes equal to the number of negotiated egress priority queues;
• and
• logic for negotiating a matching number of Multilink-Extension classes with the peer network device;
• and
• mapping DSCP (Differentiated Service Code Point) classes to the established PPP Multilink-Extension classes, the DSCP classes indicative of differentiated service level treatment.