ROUTE/SERVICE PROCESSOR SCALABILITY VIA FLOW-BASED DISTRIBUTION OF TRAFFIC
First Claim
1. A scalable routing system for distributing packets in a network, including a plurality of data compilers;
- a plurality of port adapters connected to said data compilers;
a plurality of route processing engines; and
at least one structure connecting said plurality of route processing engines to said data compilers.
1 Assignment
0 Petitions
Accused Products
Abstract
The invention provides a router architecture that is scalable, that is, as more processing power is desired, more individual processors can be added. The data flow from each line can be distributed among all of the processors in the system. As desired services are added, increasing the amount of “touch” or processing performed on the packets in the system, more processors can be added to carry the increased load. The router architecture is also able to distribute the high interface rate of an uplink connection in the same manner. Packets are allocated to processors in a manner that allows the original order of data packets within the same flow to be maintained. The system uses a hash function to distribute the flows, making sure that packets within the same flow are sent to the same processor so that the original packet order in each flow is maintained. Different flows may be sent to different processors.
-
Citations
16 Claims
-
1. A scalable routing system for distributing packets in a network, including
a plurality of data compilers; -
a plurality of port adapters connected to said data compilers;
a plurality of route processing engines; and
at least one structure connecting said plurality of route processing engines to said data compilers. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A scalable routing system for distributing packets in a network, including
a plurality of network interfaces; -
a plurality of route processing engines;
a fabric interconnecting said plurality of network interfaces and said plurality of route processing engines;
wherein each of said plurality of network interfaces uses a hashing function to distribute packet flows among said plurality of route processing engines; and
wherein the processing power of the scalable routing system can be scaled by adding additional route processing engines to said plurality of route processing engines. - View Dependent Claims (12, 13, 14, 15, 16)
-
Specification