Routing for networks with content filtering
First Claim
Patent Images
1. A method of generating routing for one or more connections in a network of nodes interconnected by links, the method comprising the steps of (a) providing a list of nodes having content filtering for the network;
- (b) formulating a routing-with-content-filtering problem (RCFP) for a relatively maximized network capacity subject to a set of constraints such that flow of each connection passes through at least one of the list of nodes having content filtering; and
(c) solving the RCFP to generate a routing solution that specifies routing for the one or more connections through the network.
3 Assignments
0 Petitions
Accused Products
Abstract
A network of nodes interconnected by links has content filtering specified at certain nodes, and routing of packet connections through the network is generated based on the specified content-filtering nodes. The network is specified via a content-filtering node placement method and a network-capacity maximization method so as to apply content filtering to packets for substantially all traffic (packet streams) carried by the network.
-
Citations
21 Claims
-
1. A method of generating routing for one or more connections in a network of nodes interconnected by links, the method comprising the steps of
(a) providing a list of nodes having content filtering for the network; -
(b) formulating a routing-with-content-filtering problem (RCFP) for a relatively maximized network capacity subject to a set of constraints such that flow of each connection passes through at least one of the list of nodes having content filtering; and
(c) solving the RCFP to generate a routing solution that specifies routing for the one or more connections through the network. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A method of generating a routing solution for a network of nodes interconnected by links and having at least one connection routed through the network, wherein 1) one or more of the nodes is included in a set of content filtering nodes, each content filtering node adapted to apply content filtering to a connection passing through the node, and 2) each connection passes through at least one content filtering node, the method comprising the steps of:
-
(a) initializing each weight and each flow associated with each link of the network;
(b) routing a demand for each connection by the steps of;
(b(i)) generating a shortest path for the demand through at least one node of the set of content filtering nodes, (b(ii)) determining an incremental amount of flow of the demand, (b(iii)) routing the incremental amount of flow along the shortest path, (b(iv)) updating the flow and the weight of each link based on the incremental amount of flow, and (b(v)) repeating steps (b(i)) through (b(v)) until the demand is routed; and
(c) repeating steps (b1), (b2), and (b3) until the dual constraints are met. - View Dependent Claims (15, 16, 17, 18)
-
-
19. A network comprising:
-
a plurality of nodes interconnected by links and having at least one connection routed through the network, wherein;
1) the network comprises a set of content-filtering nodes of the plurality of nodes, each content filtering node adapted to apply content filtering to a connection passing through the content filtering node;
2) each connection is routed through the network in accordance with a routing solution such that each connection passes through at least one of the set of content-filtering nodes; and
3) the routing solution is generated by;
(a) providing a list of nodes having content filtering for the network, wherein each connection may reach at least one of the list of nodes having content filtering;
(b) formulating a routing-with-content-filtering problem (RCFP) for a relatively maximized network capacity subject to a set of constraints such that each connection passes through at least one of the list of nodes having content filtering; and
(c) solving the RCFP to generate a routing solution, the routing solution specifying routing for the one or more connections through the network so as to apply content filtering to each connection.
-
-
20. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to implement a method for generating routing for one or more connections in a network of nodes interconnected by links, the method comprising the steps of:
-
(a) providing a list of nodes having content filtering for the network;
(b) formulating a routing-with-content-filtering problem (RCFP) for a relatively maximized network capacity subject to a set of constraints such that flow of each connection passes through at least one of the list of nodes having content filtering; and
(c) solving the RCFP to generate a routing solution that specifies routing for the one or more connections through the network.
-
-
21. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to implement a method for generating a routing solution for a network of nodes interconnected by links and having at least one connection routed through the network, wherein 1) one or more of the nodes is included in a set of content filtering nodes, each content filtering node adapted to apply content filtering to a connection passing through the node, and 2) each connection passes through at least one content filtering node, the method comprising the steps of:
-
(a) initializing each weight and each flow associated with each link of the network;
(b) routing a demand for each connection by the steps of;
(b(i)) generating a shortest path for the demand through at least one node of the set of content filtering nodes, (b(ii)) determining an incremental amount of flow of the demand, (b(iii)) routing the incremental amount of flow along the shortest path, (b(iv)) updating the flow and the weight of each link based on the incremental amount of flow, and (b(v)) repeating steps (b(i)) through (b(v)) until the demand is routed; and
(c) repeating steps (b1), (b2), and (b3) until the dual constraints are met.
-
Specification