Prioritizing data packets in a network

    公开(公告)号:US09800514B1

    公开(公告)日:2017-10-24

    申请号:US15379738

    申请日:2016-12-15

    Applicant: Red Hat, Inc.

    CPC classification number: H04L47/6275 H04L47/24 H04L47/34 H04L69/22

    Abstract: Data packets being communicated through a communications network can be prioritized. For example, a processor can receive a data packet via the communications network. The data packet can be formed according to a communications protocol and have a header field with an initial value. The processor can determine an updated value for the header field of the data packet based on the initial value from the header field and a user account associated with the data packet. The processor can update the header field to have the updated value. The processor can then prioritize the data packet with respect to at least one other data packet based on the updated value of the header field.

    Reducing overlay network overhead across container hosts

    公开(公告)号:US11775354B2

    公开(公告)日:2023-10-03

    申请号:US17581342

    申请日:2022-01-21

    Applicant: Red Hat, Inc.

    CPC classification number: G06F9/5083

    Abstract: A system for reducing overlay network overhead includes a memory, a processor in communication with the memory, a first container and a second container running on a first host, and a container scheduler executing on the processor. Each of the first container and second container expose a network service port(s). The container scheduler executes on the processor to assign a network complexity weight to the first host. The network complexity weight is based on a quantity of network service ports that the first container and the second container expose. The container scheduler also filters hosts based on resource availability corresponding to each host and ranks the hosts based on a respective network complexity weight corresponding to each host. Additionally, the container scheduler dispatches a third container to a second host based on the resource availability and network complexity weight corresponding to the second host.

    Cascading job scheduling in guests
    95.
    发明授权

    公开(公告)号:US11526382B2

    公开(公告)日:2022-12-13

    申请号:US16826810

    申请日:2020-03-23

    Applicant: Red Hat, Inc.

    Abstract: Cascading job scheduling in guests is disclosed. For example, first, second, third, and fourth nodes, each execute respective first, second, third, and fourth pluralities of guests each of which executes respective first, second, third, and fourth pluralities of jobs. A scheduler executes on a processor to receive a current capacity update of the first node. A respective quantity of jobs executing on each of the first, second, third, and fourth nodes is tracked. A first, second, third, and fourth estimated capacity of the respective first, second, third, and fourth nodes is calculated. The first, second, third, and fourth nodes are ranked in a list based on the respective estimated capacities. A request to execute a job is received. The first, second, and third nodes are selected as a schedulable set based on the list. A schedulable set notice and the job are sent to the first node to be executed.

    Categorizing computing process output data streams for flash storage devices

    公开(公告)号:US10963163B2

    公开(公告)日:2021-03-30

    申请号:US16597297

    申请日:2019-10-09

    Applicant: Red Hat, Inc.

    Abstract: Categorizing computing process output data streams for flash storage devices is disclosed. A first computing process characteristic of a first computing process that generates a first output data stream is determined. A structure that correlates the first computing process characteristic to a first stream identifier is accessed. A first filter driver is associated with the first computing process to configure the first filter driver to receive the first output data stream. The first filter driver is associated with a flash storage device. The first stream identifier is sent to the first filter driver.

    Container intrusion detection and prevention system

    公开(公告)号:US10862904B2

    公开(公告)日:2020-12-08

    申请号:US15656712

    申请日:2017-07-21

    Applicant: Red Hat, Inc.

    Abstract: A container intrusion detection and prevention system includes a memory, a physical processor in communication with the memory, and an image scanner executing on the physical processor. The image scanner scans an image of a container in a container image registry. The container includes an application. The image scanner creates an image tag of the container and a set of generic rules for the container. The image scanner packages the image tag of the container with the set of generic rules to form a tuple and stores the tuple in an application rule registry.

    REDUCING OVERLAY NETWORK OVERHEAD ACROSS CONTAINER HOSTS

    公开(公告)号:US20200326993A1

    公开(公告)日:2020-10-15

    申请号:US16912182

    申请日:2020-06-25

    Applicant: Red Hat, Inc.

    Abstract: A system for reducing overlay network overhead includes a memory, a processor in communication with the memory, a first container and a second container running on a first host, and a container scheduler executing on the processor. Each of the first container and second container expose a network service port(s). The container scheduler executes on the processor to assign a network complexity weight to the first host. The network complexity weight is based on a quantity of network service ports that the first container and the second container expose. The container scheduler also filters hosts based on resource availability corresponding to each host and ranks the hosts based on a respective network complexity weight corresponding to each host. Additionally, the container scheduler dispatches a third container to a second host based on the resource availability and network complexity weight corresponding to the second host.

    Distributing requests for data among servers based on indicators of intent to access the data

    公开(公告)号:US10771601B2

    公开(公告)日:2020-09-08

    申请号:US15595562

    申请日:2017-05-15

    Applicant: Red Hat, Inc.

    Abstract: Requests for data can be distributed among servers based on indicators of intent to access the data. For example, a kernel of a client device can receive a message from a software application. The message can indicate that the software application intends to access data at a future point in time. The kernel can transmit an electronic communication associated with the message to multiple servers. The kernel can receive a response to the electronic communication from a server of the multiple servers. Based on the response and prior to receiving a future request for the data from the software application, the kernel can select the server from among the multiple servers as a destination for the future request for the data.

    Optimizing continuous integration (CI) using code review quality

    公开(公告)号:US10754641B2

    公开(公告)日:2020-08-25

    申请号:US15608585

    申请日:2017-05-30

    Applicant: Red Hat, Inc.

    Abstract: A system and method for optimizing CI using code review quality includes a memory, a processor in communication with the memory, a classifier executing on the processor, a high priority integration queue, and a low priority integration queue. In an example, the classifier may receive pull requests for code changes and determine reliability factors. The classifier may also determine a reliability value of the pull requests based on the reliability factors and classify each of the pull requests into a classification, such as a trusted classification and an untrusted classification. Then, the classifier sends the pull requests in the trusted classification to the high priority integration queue and the pull requests in the untrusted classification to the low priority integration queue.

Patent Agency Ranking