Apparatus and method for virtual switching

• US 10,348,651 B2
• Filed: 10/20/2016
• Issued: 07/09/2019
• Est. Priority Date: 12/30/2015
• Status: Active Grant

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Choi, Kang-Il, Lee, Bhum-Cheol, Lee, Jung-Hee, Lee, Hyun-Yong
• Primary Examiner(s): Vu, Hoang-Chuong Q
• Application Number:
  US15/298,592
• Publication Number:
  US 20170195261A1
• Time in Patent Office: 992 Days
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 45/54 Organization of routing tables
• CPC Class Codes: H04L 45/586 of virtual routers
• CPC Class Codes: H04L 45/7453 using hashing
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/50 Queue scheduling
• CPC Class Codes: H04L 49/70 Virtual switches
• CPC Class Codes: H04L 49/901 using storage descriptor, e.g. read or write pointers

Abstract

An apparatus for virtual switching includes a queue memory configured to store at least one queue; a data memory configured to store data; a mapper configured to classify the data into flows and store a point of the data in a queue mapped with the flows; a plurality of virtual machines configured to perform a process based on the data; and a virtual switch configured to extract the data from the data memory by referring to the point stored in the queue and transfer the data to the virtual machine, wherein the virtual switch transfers the data corresponding to a single queue to a single virtual machine.

Claims

1. An apparatus for virtual switching, comprising:

a queue memory configured to store queues;

a data memory configured to store data;

a mapper configured to classify the data into flows and store pointers of the data in the queues mapped onto the flows;

a plurality of virtual machines configured to perform processes based on the data;

a virtual switch configured to extract the data from the data memory by referring to the pointers stored in the queues and to transfer the data to the virtual machines; and

a table provider configured to store a flow table comprising flow information for identifying the flows and queue information for identifying the queues,

wherein the mapper determines the queues mapped onto the flows by referring to the flow table,

wherein the mapper maps the flows onto new queues or existing activated queues when the flows are not mapped onto the existing activated queues in the flow table,

wherein the mapper maps the flows onto the new queues when a number of pointers stored in each of the existing activated queues is greater than a predetermined threshold, and

wherein the mapper maps the flows onto the existing activated queues when the number of pointers stored in any of the existing activated queues is not greater than the predetermined threshold.

2. The apparatus for virtual switching of claim 1, further comprising a virtual switch manager configured to assign virtual switches for the new queues when the mapper maps the flows onto the new queues.

3. The apparatus for virtual switching of claim 2, wherein when data capacity transferred through the assigned virtual switches is equal to or greater than a predetermined threshold, the virtual switch manager generates new virtual switches and assigns the new queues to the new virtual switches.

4. The apparatus for virtual switching of claim 1, wherein when the number of pointers stored in any of the existing activated queues is not greater than the predetermined threshold and a mapping mode is a power saving mode, the mapper maps the flows onto one of the existing activated queues, which stores a least number of pointers therein.

5. The apparatus for virtual switching of claim 1, wherein when the number of pointers stored in any of the existing activated queues is not greater than the predetermined threshold and a mapping mode is an even distribution mode, the mapper maps the flows onto one of the existing activated queues, which stores a most number of pointers therein.

6. The apparatus for virtual switching of claim 1, wherein the mapper classifies the data in accordance with flow information which is a value bit-masked or a value applied with a hash function for an identification reference value of the data.

7. The apparatus for virtual switching of claim 1, wherein the mapper classifies the data in accordance with flow information which is a combination of a value bit-masked or a value applied with a hash function for an identification reference value of the data and tenant information of the virtual machines.

8. A method for virtual switching in a method for performing parallel processing by an apparatus for virtual switching, the method comprising:

receiving data and storing the data in a data memory;

classifying the data into flows;

storing pointers of the data in queues mapped onto the flows;

extracting the data from the data memory by referring to the pointers stored in the queues and transferring the data to virtual machines assigned to the queues;

performing processes corresponding to the data through the virtual machines assigned to the queues;

identifying the queues mapped onto the flows by referring to a flow table comprising flow information for identifying the flows and queue information for identifying the queues; and

mapping the flows onto new queues or existing activated queues when the flows are not mapped onto the existing activated queues in the flow table,

wherein the mapping the flows onto the new queues or the existing activated queues when the flows are not mapped onto the existing activated queues in the flow table comprises;

mapping the flows onto the new queues when flow information corresponding to the flows is not stored in the flow table and a number of pointers stored in each of the existing activated queues is greater than a predetermined threshold; and

mapping the flows onto the existing activated queues when flow information corresponding to the flows is not stored in the flow table and the number of pointers stored in any of the existing activated queues is not greater than the predetermined threshold.

9. The method for virtual switching of claim 8, further comprising:

assigning virtual switches for the new queues when the flows are mapped onto the new queues; and

assigning a single processor for the new queues.

10. The method for virtual switching of claim 9, wherein the assigning virtual switches for the new queues when the flows are mapped onto the new queues comprises:

when data capacity transferred through the assigned virtual switches is equal to or greater than a predetermined threshold, generating new virtual switches and assigning the new queues to the new virtual switches.

11. The method for virtual switching of claim 8, wherein the mapping the flows onto the existing activated queues when flow information corresponding to the flows is not stored in the flow table and the number of pointers stored in any of the existing activated queues is not greater than the predetermined threshold, comprises:

mapping the flows onto one of the existing activated queues, which stores a least number of pointers therein, when a mapping mode is a power saving mode.

12. The method for virtual switching of claim 8, wherein the mapping the flows onto the existing activated queues when flow information corresponding to the flows is not stored in the flow table and the number of pointers stored in any of the existing activated queues is not greater than the predetermined threshold, comprises:

mapping the flows onto one of the existing activated queues, which stores a most number of pointers therein, when a mapping mode is an even distribution mode.

13. The method for virtual switching of claim 8, wherein the classifying the data into flows comprises classifying the data into flows in accordance with flow information which is a value bit-masked or a value applied with the hash function for an identification reference value of the data.

14. The method for virtual switching of claim 8, wherein the classifying the data into flows comprises classifying the data into flows in accordance with flow information which is a combination of a value bit-masked or a value applied with the hash function for an identification reference value of the data and tenant information of the virtual machines.