Application-level network queueing

• US 20170187640A1
• Filed: 12/26/2015
• Published: 06/29/2017
• Est. Priority Date: 12/26/2015
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Vasudevan, Anil, Patil, Kiran A., Ilango, Arun Chekhov
• Granted Patent: US 10,547,559 B2
• Time in Patent Office: Days
• CPC Class Codes: H04L 43/10 Active monitoring, e.g. heartbeat, ping or trace-route
• CPC Class Codes: H04L 47/24 Traffic characterised by specific attributes, e.g. priority or QoS
• CPC Class Codes: H04L 47/2475 for supporting traffic characterised by the type of applications
• CPC Class Codes: H04L 47/50 Queue scheduling
• CPC Class Codes: H04L 49/90 Buffering arrangements
• CPC Class Codes: H04L 49/9068 in the network interface card

Abstract

In an example, there is disclosed a computing apparatus, having: a network interface configured to provide a plurality of queues; an application; and one or more logic elements comprising a queuing engine to: inspect an incoming packet; and assign the incoming packet to a dedicated queue for the application based on a classifier. There is also disclosed a method of providing a queuing engine, and one or more tangible, non-transitory computer-readable storage mediums having stored thereon executable instructions for providing a queuing engine.

Claims

1. An apparatus, comprising:

a network interface configured to provide a plurality of queues;

one or more logic elements for providing an application; and

one or more logic elements for providing a queuing engine to;

inspect an incoming packet; and

assign the incoming packet to a dedicated queue for the application based on a classifier.

2. The apparatus of claim 1, wherein the classifier comprises an application identifier.

3. The apparatus of claim 1, wherein the classifier comprises a port number.

4. The apparatus of claim 1, further comprising means for notifying the application of the assigning.

5. The apparatus of claim 1, comprising means to enable the application to bypass an interrupt mechanism and to perform per-thread, non-interfering busy polling.

6. The apparatus of claim 1, wherein the queuing engine is further to receive a queue mapping for a socket via an extended socket option.

7. The apparatus of claim 1, wherein the application is to:

receive a queue assignment notification from the network interface, comprising a queue assignment for a socket; and

assign the socket to a thread associated with the queue assignment.

8. The apparatus of claim 7, wherein the thread is uniquely associated with the queue assignment in a one-to-one arrangement.

9. The apparatus of claim 7, wherein a plurality of queue assignments are associated with the thread in an n-to-1 arrangement.

10. The apparatus of claim 7, wherein the application is to bypass an interrupt mechanism and to perform per-thread, non-interfering busy polling.

11. The apparatus of claim 7, wherein the application is to set queue mapping for the socket via an extended socket option.

12. One or more tangible, non-transitory computer-readable mediums having stored thereon instructions to providing a queuing engine to:

inspect an incoming packet on a network interface; and

assign the incoming packet to a dedicated queue for an application based on a classifier.

13. The one or more tangible, non-transitory computer-readable storage mediums of claim 12, wherein the classifier comprises an application identifier.

14. The one or more tangible, non-transitory computer-readable storage mediums of claim 12, wherein the classifier comprises a port number.

15. The one or more tangible, non-transitory computer-readable storage mediums of claim 12, further comprising instructions to notify the application of the assigning.

16. The one or more tangible, non-transitory computer-readable storage mediums of claim 12, further comprising instructions to enable the application to bypass an interrupt mechanism and to perform per-thread, non-interfering busy polling.

17. The one or more tangible, non-transitory computer-readable storage mediums of claim 12, wherein the queuing engine is further to receive a queue mapping for a socket via an extended socket option.

18. One or more tangible, non-transitory computer-readable mediums having stored thereon instructions to providing an application to:

receive a queue assignment notification from a network interface, comprising a queue assignment for a socket, wherein the queue assignment is unique to the application; and

assign the socket to a thread associated with the queue assignment.

19. The one or more tangible, non-transitory computer-readable storage mediums of claim 18, wherein the thread is uniquely associated with the queue assignment in a one-to-one arrangement.

20. The one or more tangible, non-transitory computer-readable storage mediums of claim 18, wherein a plurality of queue assignments are associated with the thread in an n-to-1 arrangement.

21. The one or more tangible, non-transitory computer-readable storage mediums of claim 18, wherein the application is to bypass an interrupt mechanism and to perform per-thread, non-interfering busy polling.

22. The one or more tangible, non-transitory computer-readable storage mediums of claim 18, wherein the application is to set queue mapping for the socket via an extended socket option.

23. A method of providing application-level network queuing, comprising:

providing a plurality of queues on a network interface;

providing a network-capable application;

one or more logic elements comprising a queuing engine to;

inspecting an incoming packet; and

assigning the incoming packet to a dedicated queue for the application based on a classifier.

24. The method of claim 23, wherein the classifier comprises an application identifier.

25. The method of claim 23, wherein the classifier comprises a port number.