System and method for adaptive query plan selection in distributed relational database management system based on software-defined network

• US 20150154258A1
• Filed: 11/26/2014
• Published: 06/04/2015
• Est. Priority Date: 12/04/2013
• Status: Abandoned Application

• Current Assignee: NEC Laboratories America Inc (NEC Corporation)
• Original Assignee: NEC Laboratories America Inc (NEC Corporation)
• Inventors: Hacigumus, Vahit Hakan, Xiong, Pengcheng
• Application Number:
  US14/554,751
• Publication Number:
  US 20150154258A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24542 Plan optimisation
• CPC Class Codes: H04L 43/0876 Network utilisation, e.g. volume of load or congestion level
• CPC Class Codes: H04L 43/20 the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV

Abstract

Systems and methods are disclosed for operating a software-defined network (SDN) by slicing the SDN into differentiated queues according to different priorities to prioritizes the queries based on the user'"'"'s request; reserving necessary bandwidth for specific queries to ensure specific performance levels based on the user'"'"'s request; providing information to a query plan executor; and managing performance of analytical queries in distributed relational databases.

Claims

1. A software-defined network (SDN) based method, the method comprising:

slicing the SDN into differentiated queues according to different priorities;

providing information to a query plan executor; and

managing performance of analytical queries in distributed relational databases.

2. The method of claim 1, wherein the network slicing comprises:

setting an OpenFlow switch in priority queue (PQ) mode; and

configuring different priorities for different queues.

3. The method of claim 1, wherein the network slicing comprises

setting the OpenFlow switches in weighted fare queue mode;

and

configuring different network bandwidth reservation or minimum rate for different queues.

4. The method of claim 1, further comprising:

obtaining each query'"'"'s priority position.

5. The method of claim 1, further comprising:

mapping different query'"'"'s network traffic to different network slice according to the query'"'"'s priority.

6. The method of claim 1, further comprising:

applying an OpenFlow protocol to enqueue a specific flow to a specific network slice.

7. The method of claim 1, further comprising:

monitoring network state information and flow information; and

selecting an adaptive plan for execution with a query manager that receives the network state information and flow information, including;

receiving a query, parsing the query, generating and optimizing a global query plan;

dividing the global query plan into local plans;

sending the local plans to corresponding data store sites for execution with separate threads; and

orchestrating data flows among the data store sites and forwarding a final result to a user.

8. The method of claim 7, wherein the network monitoring comprises:

using the OpenFlow protocol to monitor network status.

9. The method of claim 7, wherein the network monitoring comprises:

updating global flow information.

10. The method of claim 7, wherein the selecting of the adaptive plan comprises:

using a plan generator to generate candidate plans.

11. The method of claim 7, wherein the selecting of the adaptive plan comprises:

estimating a cost of each candidate plan using global flow information based on a cost model.

12. The method of claim 5, further comprising:

estimating a cost for a candidate plan using global flow information and a cost model.

13. The method of claim 7, wherein the selecting of the adaptive plan comprises:

selecting the best plan with the lowest cost, comprising executing the selected plan.

14. The method of claim 1, further comprising:

generating a dynamic communication cost model.

15. The method of claim 14, further comprising:

integrating the dynamic communication costs with a computational cost model.

16. The method of claim 1, further comprising:

setting queues within a switch as priority queues (PQ), wherein if more than one queue has queued frames, the PQ sends frames in order of queue priority and during the transmission; and

providing higher-priority queues with absolute preferential treatment over lower-priority queues.

17. The method of claim 1, wherein a network information manager (NIM) updates and inquires information about a current network state by communicating with a flow controller, comprising storing flow as a four tuple including ingress and egress ports of a switch for the flow, an egress queue of the flow, and a traffic rate.

18. The method of claim 17, further comprising:

sending an inquiry to the NIM to inquire A(U)_ON (available bandwidth for network operator O_N for user U) determined as

19. The method of claim 1, further comprising:

reserving a guaranteed bandwidth for a predetermined query and using guaranteed bandwidth during query optimization.

20. A database system used in a software-defined network (SDN), the system comprising:

a flow controller;

a plurality of data stores coupled to the flow controller; and

a distributed query processor with code to;

slicing the SDN into differentiated queues according to different priorities;

providing information to a query plan executor; and

managing performance of analytical queries in distributed relational databases.