Method and apparatus for performing data flow ingress/egress admission control in a provider network
First Claim
1. A control module for a provider edge node of a provider network, comprising:
- a session table storing control information relating to peering sessions between the provider edge node and the provider network;
a circuit table storing, for each data tunnel, data tunnel identification data, encapsulation label data, outgoing data packet interface identification data, CIR data, class data, setup priority data, and holding priority data;
a packet table storing, for each data packet flow, packet data interface identification data, data tunnel identification data, encapsulation label data, CIR data, class data, setup priority data, and holding priority data;
an ingress resource table storing, for each data runnel, data tunnel identification data, physical bandwidth data and available bandwidth for each of a plurality of classes;
an egress resource table storing, for each egress data interface, egress data interface identification data, physical bandwidth data, available total bandwidth data, and available bandwidth for each of a plurality of classes;
admission control logic operatively connected to said session table, said circuit table, said packet table, said ingress resource table, and said egress resource table;
said admission control logic referring to said session table, said circuit table, said packet table, said ingress resource table, and said egress resource table to perform admission control on behalf of a new data flow requesting ingress to and egress from the provider network.
6 Assignments
0 Petitions
Accused Products
Abstract
A method, apparatus and network for transporting layer-2 frames, such as Ethernet MAC, ATM AAL5, and Frame Relay, over MPLS, SONET/SDH, or OTN optical transport networks as well as electrical transport networks is disclosed. The method establishes “pseudo-wires” between, for example, routers, Layer-2 packet switches, or SONET/SDH switches. Inter-related ingress and egress resource tables may be used by provider edge nodes to negotiate consistently managed data tunnels across a provider network on behalf of data flowing from/to a diverse base of customer edge nodes. Detailed network resource information particular to each of the data flows is exchanged between provider edge nodes during the creation of pseudo-wires. Admission control algorithms are applied at the ingress and egress points in order to manage the data flows into a provider network and exiting from a provider network to customer equipment. By applying pseudo-wire shuffling and preemption techniques, the providers can make better use of their network resources by admitting more pseudo-wires.
-
Citations
19 Claims
-
1. A control module for a provider edge node of a provider network, comprising:
-
a session table storing control information relating to peering sessions between the provider edge node and the provider network; a circuit table storing, for each data tunnel, data tunnel identification data, encapsulation label data, outgoing data packet interface identification data, CIR data, class data, setup priority data, and holding priority data; a packet table storing, for each data packet flow, packet data interface identification data, data tunnel identification data, encapsulation label data, CIR data, class data, setup priority data, and holding priority data; an ingress resource table storing, for each data runnel, data tunnel identification data, physical bandwidth data and available bandwidth for each of a plurality of classes; an egress resource table storing, for each egress data interface, egress data interface identification data, physical bandwidth data, available total bandwidth data, and available bandwidth for each of a plurality of classes; admission control logic operatively connected to said session table, said circuit table, said packet table, said ingress resource table, and said egress resource table; said admission control logic referring to said session table, said circuit table, said packet table, said ingress resource table, and said egress resource table to perform admission control on behalf of a new data flow requesting ingress to and egress from the provider network.
-
-
2. A method of establishing pseudo-wires between an initiating provider edge node and a terminating provider edge node of a provider network so as to permit admission control, comprising:
-
initiating a pseudo-wire request from the initiating provider edge node requesting a new data flow having a network resource requirement; searching an ingress resource table for available network resources on one or more data tunnels to determine if there is a sufficient amount of available network resources on one or more data tunnels connecting the initiating and terminating provider edge nodes to satisfy the new data flow; wherein upon the determination that there is a sufficient amount of available network resources to satisfy the new data flow, the method further comprises; updating a packet table associated with the initiating provider edge node with the network resource requirement of the new data flow; updating the ingress resource table with the network resources to be consumed by the new data flow; and creating and sending a control message to the terminating provider edge node requesting a pseudo-wire to be set up between the initiating and terminating provider edge nodes to carry the new data flow; wherein at the terminating provider edge node, the method further comprises; receiving the control message requesting a pseudo-wire to be set up between the initiating and terminating provider edge nodes; and determining if there are enough available network resources on the outgoing data interface to accommodate the new data flow based on the information contained in the control message and an egress resource table. - View Dependent Claims (3, 4, 5)
-
-
6. A method of establishing pseudo-wires between an initiating provider edge node and a terminating provider edge node of a provider network so as to permit admission control, comprising:
-
initiating a pseudo-wire request from the initiating provider edge node requesting a new data flow having network resource requirements; determining if there is a sufficient amount of available network resources on one or more data tunnels connecting the initiating and terminating provider edge nodes to satisfy the new data flow; shuffling at least one existing pseudo-wire to accommodate the network resource requirements the new data flow if said determining step determines that there are insufficient available network resources; and preempting at least one existing pseudo-wire with the new data flow if said shuffling fails to provide enough network resources to accommodate the new data flow. - View Dependent Claims (7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19)
-
Specification