IP Library Granted Patent US 8,775,352
Granted Patent B2
US 8,775,352 · App. 12/715,189 · Granted Jul 8, 2014

Methods and apparatus to model end-to-end class of service policies in networks

Inventors: Subhabrata Sen (New Providence, NJ); Carsten Lund (Berkeley Hts., NJ); Sanjay Gopinatha Rao (West Lafayette, IN); Yu-Wei Sung (West Lafayette, IN)
Assignees: AT&T Intellectual Property I, L.P.; Purdue Research Foundation
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,775,352
App. No.
12/715,189
Granted
Jul 8, 2014
Kind
B2
Abstract

Methods and apparatus to model end-to-end class of service policies in operational networks are disclosed. An example method to generate a class of service model is described, including electronically generating a ruleset based on the class of service configuration associated with a router, electronically generating a flat representation of the ruleset, electronically generating a class of service model by composing the flat representation into a composed ruleset, and storing the class of service model in a computer-readable memory.

Claims (28)

1. A method to generate a class of service model, comprising:

electronically generating a ruleset based on a class of service configuration associated with a router;

electronically generating a flat representation of the ruleset, wherein generating the flat representation comprises generating a binary decision diagram representative of the ruleset;

electronically generating a class of service model by composing the flat representation into a composed ruleset, wherein composing the flat representation comprises transforming the binary decision diagram, wherein the binary decision diagram is a first binary decision diagram and transforming the first binary decision diagram comprises using existential quantification to remove a binary decision diagram variable from the binary decision diagram, generating a second binary decision diagram using the removed binary decision diagram variable, and performing a set-union on the first and second binary decision diagrams to generated a transformed binary decision diagram; and

storing the class of service model in a computer-readable memory.

2. A method as defined in claim 1 , further comprising generating a recursive representation of the ruleset.

3. A method as defined in claim 1 , wherein the class of service configuration comprises a configuration file, the router providing a plurality of classes of service based on the configuration file.

4. A method as defined in claim 1 , further comprising using the stored class of service model to do at least one of: output a flow treatment, identify a shadowed policy in the class of service model, identify a departure from a class of service configuration pattern, and electronically generate a class of service map of a virtual private network.

5. A method as defined in claim 1 , wherein generating the flat representation further comprises set-intersecting a first binary decision diagram representative of a flowset with a second binary decision diagram representative of a router policy of the router.

6. A computer readable storage disk comprising machine readable instructions which, when executed, cause a machine to at least:

generate a ruleset based on a class of service configuration associated with a router;

generate a flat representation of the ruleset, wherein generating the flat representation comprises generating a binary decision diagram representative of the ruleset;

generate a class of service model by composing the flat representation into a composed ruleset, wherein composing the flat representation comprises transforming the binary decision diagram, wherein the binary decision diagram is a first binary decision diagram, and transforming the first binary decision diagram comprises using existential quantification to remove a binary decision diagram variable from binary decision diagram, generating a second binary decision diagram using the removed binary decision diagram variable, and performing a set-union on the first and second binary decision diagrams to generated a transformed binary decision diagram; and

store the class of service model in a computer-readable memory.

7. A computer readable storage disk as defined in claim 6 , wherein the class of service configuration comprises a configuration file, the router providing a plurality of classes of service based on the configuration file.

8. A computer readable storage disk as defined in claim 7 , wherein the instructions further cause the machine to use the stored class of service model to do at least one of: output a flow treatment, identify a shadowed policy in the class of service model, identify a departure from a class of service configuration pattern, and electronically generate a class of service map of a virtual private network.

9. A computer readable storage disk as defined in claim 6 , wherein generating the flat representation further comprises set-intersecting a first binary decision diagram representative of a flowset with a second binary decision diagram representative of a router policy.

10. An apparatus, comprising:

a processor; and

a memory having computer readable instructions stored thereon which, when executed, cause the processor to perform operations comprising:

generating a ruleset based on a class of service configuration associated with a router;

generating a flat representation of the ruleset;

generating a class of service model by composing the flat representation into a composed ruleset, wherein composing the flat representation comprises transforming the binary decision diagram, wherein the binary decision diagram is a first binary decision diagram, and transforming the first binary decision diagram comprises using existential quantification to remove a binary decision diagram variable from binary decision diagram, generating a second binary decision diagram using the removed binary decision diagram variable, and performing a set-union on the first and second binary decision diagrams to generated a transformed binary decision diagram; and

storing the class of service model in the memory.

11. An apparatus as defined in claim 10 , wherein generating the flat representation further comprises set-intersecting a first binary decision diagram representative of a flowset with a second binary decision diagram representative of a router policy.

12. An apparatus as defined in claim 10 , wherein the instructions further cause the processor to generate a recursive representation of the ruleset.

13. An apparatus as defined in claim 10 , wherein the class of service configuration comprises a configuration file, the router providing a plurality of classes of service based on the configuration file.

14. An apparatus as defined in claim 10 , wherein the instructions further cause the processor to use the stored class of service model to do at least one of: output a flow treatment, identify a shadowed policy in the class of service model, identify a departure from a class of service configuration pattern, and electronically generate a class of service map of a virtual private network.

Assignments (3)
CONFIRMATORY LICENSE Recorded Dec 29, 2011
From: PURDUE UNIVERSITY
To: NATIONAL SCIENCE FOUNDATION
Reel/Frame 027464/0128 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 24, 2010
From: RAO, SANJAY G.; SUNG, YU-WEI
To: PURDUE RESEARCH FOUNDATION
Reel/Frame 024876/0478 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 16, 2010
From: SEN, SUBHABRATA; LUND, CARSTEN
To: AT&T INTELLECTUAL PROPERTY I, L.P.
Reel/Frame 024699/0309 →
Continuity (1)
Related Publication 20110213738A1 · Sep 1, 2011