Network having multiple QoS levels
AssigneeAT&T Intellectual Property II, L.P.
InventorRobert Cahn
Life of this patent
Estimating the term…
Abstract
In a multi-QoS network, a scheduling mechanism, such as Weighted Fair Queueing, is configured to meet the multiple QoS guarantees. For each link with n classes and n fixed weights, the traffic is assigned to the various classes to meet end-to-end delay constraints.
Claims13
A method of assigning traffic in a multiple QoS network having traffic paths over a plurality of links and having a plurality of scheduling mechanism classes corresponding to respective priority for classes of traffic over the links, comprising:
- assigning network traffic to a lowest class of the plurality of scheduling mechanism classes;
- determining if there are one or more network paths that do not meet an associated Service Level Agreement (SLA);
- determining a first one of the network paths that most exceeds its associated SLA;
- examining a first link in the first one of the networks paths;
- computing a result of moving the traffic associated with the first link to a higher scheduling mechanism class;
- determining whether the traffic re-assignment causes any other traffic to no longer meet its SLA;
- and
- examining a next link in the first one of the network paths if the traffic re-assignment causes any other traffic to no longer meet its SLA.
A method of assigning traffic in a multiple QoS network having traffic paths over a plurality of links and having a plurality of scheduling mechanism classes corresponding to respective priority for classes of traffic over the links, comprising:
- assigning network traffic to a lowest class of the plurality of scheduling mechanism classes;
- determining if there are one or more network paths that do not meet an associated Service Level Agreement (SLA);
- determining a first one of the network paths that exceeds its associated SLA;
- examining a first link in the first one of the networks paths;
- computing a result of moving the traffic associated with the first link to a higher scheduling mechanism class;
- determining whether the traffic re-assignment causes any other traffic to no longer meet its SLA;
- examining a next link in the first one of the network paths;
- computing a result of moving the traffic associated with the next link to a higher scheduling mechanism class;
- determining if the traffic re-assignments cause any other traffic to fail to meet their SLA;
- if the traffic re-assignments cause other traffic requirements to fail to meet their SLA, identifying the link that is traversed by the most requirements that fail to meet their SLA;
- and
- determining an increased bandwidth for the identified link that would meet an associated SLA.
Dependencies are inferred from the claim text.