Automated policy generation for mobile communication networks
First Claim
1. A method comprising:
- building a simulation of a mobile ad hoc network comprising;
a plurality of nodes having packet interface queues, at least one node of the plurality of nodes utilizing a priority queue as its packet interface queue and having a policer; and
the policer using a token bucket configured to drop any incoming packets that would cause the token bucket to overflow; and
maximizing, using a computing device, a utility function of the simulation of the mobile ad hoc network configured to generate an optimal bucket size for the token bucket and using as input;
an alive flow ratio in an observation period, a ratio of satisfied flows over alive flows, and a stringency constant.
4 Assignments
0 Petitions
Accused Products
Abstract
A solution to the problem of automated policy generation for mobile ad hoc networks includes an optimization-based, utility-driven approach aimed at generating optimal policies with respect to the given network objectives. The combination of optimization heuristics and network simulation is used to solve the problem. Specifically, the problem of automated generation of network management policies based on available network plans and related information is solved by converting the policy generation into the following optimization problem: given network information and objectives as input, generate optimal policies as output. The optimization process is guided by a utility function based on performance evaluation criteria reflecting the network objectives.
28 Citations
42 Claims
-
1. A method comprising:
-
building a simulation of a mobile ad hoc network comprising; a plurality of nodes having packet interface queues, at least one node of the plurality of nodes utilizing a priority queue as its packet interface queue and having a policer; and the policer using a token bucket configured to drop any incoming packets that would cause the token bucket to overflow; and maximizing, using a computing device, a utility function of the simulation of the mobile ad hoc network configured to generate an optimal bucket size for the token bucket and using as input;
an alive flow ratio in an observation period, a ratio of satisfied flows over alive flows, and a stringency constant. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A non-transitory computer readable medium having instructions stored thereon, the instructions configured to cause a computing device to perform operations comprising:
-
building a simulation of a mobile ad hoc network comprising; a plurality of nodes having packet interface queues, at least one node of the plurality of nodes utilizing a priority queue as its packet interface queue and having a policer; and the policer using a token bucket configured to drop any incoming packets that would cause the token bucket to overflow; and maximizing a utility function of the simulation of the mobile ad hoc network configured to generate an optimal bucket size for the token bucket and using as input;
an alive flow ratio in an observation period, a ratio of satisfied flows over alive flows, and a stringency constant. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A simulation generator apparatus for mobile ad hoc networks, the simulation generator apparatus comprising:
-
a computing device configured to access a simulation of a mobile ad hoc network comprising; a plurality of nodes having packet interface queues, at least one node of the plurality of nodes utilizing a priority queue as its packet interface queue and having a policer; and the policer using a token bucket configured to drop any incoming packets that would cause the token bucket to overflow; and an optimization engine in communication with the computing device, the optimization engine configured to maximize a utility function of the simulation of the mobile ad hoc network configured to generate an optimal bucket size for the token bucket and using as input;
an alive flow ratio in an observation period, a ratio of satisfied flows over alive flows, and a stringency constant. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
-
25. A method comprising:
-
obtaining routing topology and channel capacity for a given time instant for a communication network; determining, using a computing device, an optimal utility value for the communication network with a mathematical utility function using information from the routing topology and the channel capacity as input to partition the channel capacity among a set of priority classes to route a maximum utility subset of point-to-point demand matrices for each priority class; and determining, using a computing device, one or more quality of service parameters for the communication network corresponding to the optimal utility value. - View Dependent Claims (26, 27, 28, 29, 30)
-
-
31. A non-transitory computer readable medium having instructions stored thereon, the instructions configured to cause a computing device to perform operations comprising:
-
obtaining routing topology and channel capacity for a given time instant for a communication network; determining an optimal utility value for the communication network with a mathematical utility function using the routing topology and the channel capacity as input to partition the channel capacity among a set of priority classes to route a maximum utility subset of point-to-point demand matrices for each priority class; and determining one or more quality of service parameters for the communication network corresponding to the optimal utility value. - View Dependent Claims (32, 33, 34, 35, 36)
-
-
37. A network configuration generator apparatus for networks;
- the network configuration generator apparatus comprising;
a computing device configured to access routing topology and channel capacity for a given time instant for a communication network; a network optimization engine in communication with the computing device and configured to; determine an optimal utility value for the communication network with a mathematical utility function using the routing topology and the channel capacity as input to partition the channel capacity among a set of priority classes to route a maximum utility subset of point-to-point demand matrices for each priority class; and determine one or more quality of service parameters for the communication network corresponding to the optimal utility value. - View Dependent Claims (38, 39, 40, 41, 42)
- the network configuration generator apparatus comprising;
Specification