公开(公告)号：US20190199646A1

公开(公告)日：2019-06-27

申请号：US16287339

申请日：2019-02-27

Applicant: Intel Corporation

Inventor： Jasvinder SINGH ,  John J. BROWNE ,  Tomasz KANTECKI ,  Chris MACNAMARA

IPC: H04L12/869 ,  H04L12/873 ,  H04L12/863 ,  H04L12/877 ,  H04L12/861 ,  H04L12/927 ,  H04L12/911

CPC classification number: H04L47/58 ,  H04L47/522 ,  H04L47/525 ,  H04L47/60 ,  H04L47/6215 ,  H04L47/74 ,  H04L47/805 ,  H04L47/808 ,  H04L49/9031

Abstract: Packets are differentiated based on their traffic class. A traffic class is allocated bandwidth for transmission. One or more core or thread can be allocated to process packets of a traffic class for transmission based on allocated bandwidth for that traffic class. If multiple traffic classes are allocated bandwidth, and a traffic class underutilizes allocated bandwidth or a traffic class is allocated insufficient bandwidth, then allocated bandwidth can be adjusted for a future transmission time slot. For example, a higher priority traffic class with excess bandwidth can share the excess bandwidth with a next highest priority traffic class for use to allocate packets for transmission for the same time slot. In the same or another example, bandwidth allocated to a traffic class depends on an extent of insufficient allocation or underutilization of allocated bandwidth such that a traffic class with insufficient allocated bandwidth in one or more prior time slot can be provided more bandwidth in a current time slot and a traffic class with underutilization of allocated bandwidth can be provided with less allocated bandwidth for a current time slot.

公开(公告)号：US20190052530A1

公开(公告)日：2019-02-14

申请号：US16160176

申请日：2018-10-15

Applicant: Intel Corporation

Inventor： Mohammad Abdul AWAL ,  Jasvinder SINGH ,  Reshma PATTAN ,  David HUNT ,  Declan DOHERTY ,  Chris MACNAMARA

IPC: H04L12/24 ,  H04L12/26 ,  H04L12/861

Abstract: Examples include techniques for monitoring a data packet transfer rate at an interface queue, and based at least in part on a comparison of the data packet transfer rate to a threshold, assigning the interface queue from a core of a first class to a core of a second class or assigning the interface queue from a core of the second class to a core of the first class.

公开(公告)号：US20190215272A1

公开(公告)日：2019-07-11

申请号：US16353730

申请日：2019-03-14

Applicant: Intel Corporation

Inventor： Jasvinder SINGH ,  John J. BROWNE ,  Shobhi JAIN ,  Sunku RANGANATH ,  John O'LOUGHLIN ,  Emma L. FOLEY

IPC: H04L12/803 ,  H04L12/801 ,  H04L12/851 ,  G06F9/445

CPC classification number: H04L47/122 ,  G06F9/445 ,  H04L47/19 ,  H04L47/2408

Abstract: Examples include a method of determining a first traffic overload protection policy for a first service provided by a first virtual network function in a network of virtual network functions in a computing system and determining a second traffic overload protection policy for a second service provided by a second virtual network function in the network of virtual network functions. The method includes applying the first traffic overload protection policy to the first virtual network function and the second traffic overload protection policy to the second virtual network function, wherein the first traffic overload protection policy and the second traffic overload protection policy are different.

公开(公告)号：US20190280991A1

公开(公告)日：2019-09-12

申请号：US16414502

申请日：2019-05-16

Applicant: Intel Corporation

Inventor： Jasvinder SINGH ,  Pablo DE LARA GUARCH ,  Kevin LAATZ ,  CIARA POWER ,  Greg CURRAN ,  John J. BROWNE

IPC: H04L12/861 ,  H04L12/713 ,  H04L12/851

Abstract: At a network interface, received packets are classified according to priority level or traffic class. Based on an assigned priority level, a received packet can be allocated to use a descriptor queue associated with the assigned priority level. The descriptor queue can have an associated buffer region in which portions of received packets are stored. The length of the descriptor queue can be dependent on the priority level such that a highest priority descriptor queue can be longer than a lowest priority descriptor queue. The size of the buffer can be dependent on the priority level such that a highest priority level can be assigned a separate buffer space of different size than that assigned to a lower priority level. A polling rate for a descriptor queue can be configured based on a priority level such that a highest priority level descriptor queue can be polled more frequently than a polling of a lower priority level descriptor queue.