Browse Prior Art Database

Method to Reduce CPU Load for Large Number of Health Checks by Interval Spacing using a Least Common Multiple (LCM) Algorithm

IP.com Disclosure Number: IPCOM000240502D
Publication Date: 2015-Feb-04
Document File: 2 page(s) / 41K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a method to provide an optimal algorithm or scheme that arranges the health check packets in diverse spacing in time to avoid link congestion and optimize Central Processing Unit (CPU) utilization for sending the health check packets.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 51% of the total text.

Page 01 of 2

Method to Reduce CPU Load for Large Number of Health Checks by Interval Spacing using a Least Common Multiple (LCM) Algorithm

In a distributed network environment, multiple network entities are connected to each other. Examples of network entities are routers, switches, network appliances such as firewalls, application delivery controllers (ADCs), Software Defined Network (SDN) controllers, Intrusion Prevention Systems (IPS), etc. These entities may be run on dedicated hardware or as a virtual machine on a hypervisor. A network entity has routes to different destinations over several links. Network entities usually need to know the status of other network entities for proper operation. The status of other network entities is ascertained by using periodic health checks confirming the operational state.

In a large network, a network entity needs to perform a large number of health checks. This process of performing health checks consumes a large number of Central Processing Unit (CPU) cycles, and at times can compromise performance. Beyond a certain number of health checks at once, the device may not be able to efficiently perform health checks, which

could lead to health check failure due to inefficient arrangement of health check time spacing. As the number of health

checks increases in a particular link, the health check packets begin to congest the link to such a point that a burst of a health check can cause loss of end-to-end traffic.

The novel solution is a method to provide an optimal algorithm or scheme that ar...