205 results about "Rate limiting" patented technology

The invention provides a cache information processing method and device of a port platform and a medium, and belongs to the technical field of port distributed information processing. An update request is received, and authentication and flow limiting processing are performed on the request; obtaining a cache key prefix and a data structure type, routing a cache key to a fragment node based on a consumption write-back event, executing a write-in operation in a distributed cache service, and setting survival time and multi-copy synchronization; delivering the message body to the message middleware and obtaining delivery confirmation; the messages are pulled from the queue according to the configured concurrency, deduplication verification is carried out on idempotent identifiers of the messages, and data persistence operation is executed after the verification message version is higher than the current version of the database; index collection points are implanted into all modules of the whole link, and the request delay, the cache hit rate and the message accumulation depth index are visually displayed. The reasonable distribution and optimization of system resources are realized; the consistency and integrity of the data are guaranteed, and the reliability of message transmission is improved at the same time.

The disclosure provides a method for configuring rate limiting policies for microservices in a request execution chain of a distributed system. The method generally includes receiving global rate limit(s), where each global rate limit is associated with a tag and a microservice of a plurality of microservices, and each global rate limit indicates a rate of requests tagged with the tag associated with the global rate limit allowed to be processed by the microservice associated with the global rate limit; and configuring, for each global rate limit: each of the local rate limiter(s) associated with microservice instance(s) associated with the global rate limit with a local rate limit indicating a rate of requests tagged with the tag associated with the global rate limit allowed to be processed by the microservice instance, wherein the local rate limit of each of the local rate limiter(s) is based on the global rate limit.

The invention provides a distributed system flow intelligent grading scheduling method and system based on reinforcement learning, and relates to the technical field of flow grading, and the method comprises the steps: constructing a double-layer neural network to extract flow features, and inputting the flow features into a reinforcement learning model employing a double Q network structure, and outputting an intelligent hierarchical scheduling strategy including the interface priority, the processing queue configuration and the resource allocation proportion. Based on the strategy, a distributed token bucket algorithm is utilized to carry out rate limitation, queue allocation and resource regulation and control on interface requests with different priorities. When the system performance fluctuates, real-time monitoring data is fed back to the reinforcement learning model for online learning, a scheduling strategy is continuously optimized, self-adaptive hierarchical scheduling of distributed system traffic is realized, the utilization rate and stability of system resources are improved, and the request response time is shortened.

The invention discloses a dynamic concurrency control and resource optimization method of a smart phone outbound system. According to the method, the calling resources are dynamically allocated through the multi-dimensional weight model, and line loads and risk management and control are effectively balanced on the premise of ensuring compliance requirements of operators. Real-time state monitoring of the calling number is combined with an intelligent cooling strategy, so that a risk control mechanism is prevented from being triggered by overuse of a single line, and high-efficiency access of high-value customers is ensured through priority scheduling. The concurrency scale and the calling rhythm are accurately controlled through double constraints of the double-token mechanism, the instant flow is prevented from impacting the bearing limit of the system, it is ensured that the outbound call rate is always within the safety threshold value of an operator, and therefore the call failure rate and resource waste are greatly reduced. A parameter optimization mechanism based on dynamic feedback can automatically adjust a resource allocation strategy according to historical data and operation environment changes, for example, rate limitation is temporarily relaxed and remainder smooth scheduling is started in a burst traffic scene, so that smooth transition of a service peak value is realized.

Techniques for performing distributed rate limiting in networks in a cloud environment are described for determining an amount of network bandwidth available to be processed by flow control nodes within a cloud network for a first time period, determining a bandwidth allocation for traffic classes for the first time period, determining, a portion of the bandwidth allocation for the flow control nodes, providing, data to the flow control nodes, where the data indicates the portion of the bandwidth allocation for the traffic classes, and receiving, second data that indicates an amount of network traffic routed during the first time period by individual ones of the flow control nodes.

The invention relates to the technical field of cloud computing networks, and provides a traffic speed limiting system, a traffic speed limiting method and a traffic speed limiting device. The system comprises a network element agent unit, a monitoring unit, a speed limiting configuration unit, a program loading unit, a speed limiting execution tool and a filter agent unit. When the monitoring unit monitors that the life cycle or the bandwidth configuration strategy of the network element agent unit is changed, the speed-limiting configuration unit is triggered to obtain a bandwidth speed-limiting execution mode and a bandwidth information configuration file according to the bandwidth configuration strategy; the program loading unit updates ip address bandwidth mapping data in the filter speed limiting program file through the speed limiting execution tool and the bandwidth information configuration file; and the program loading unit also acquires and loads a filter speed limiting program file to an operating system kernel, so that a speed limiting execution tool realizes flow speed limiting according to ip mapping data and bandwidth mapping data in the file and a bandwidth speed limiting execution mode. By adopting the system, the expandability can be improved.

Techniques are disclosed relating to selective rate limiting and reducing clock frequency of fabric circuitry in response to certain power management events. Disclosed techniques may advantageously allow power management circuitry to reduce or avoid negative impacts of power events by reducing the clock frequency of a communication fabric while using rate limiting of relatively lower-priority traffic to reduce impacts of the frequency reduction on high-priority traffic. For example, rate limiting of lower-quality-of-service virtual channels may continue after recovery of the clock frequency until higher-quality-of-service virtual channels have recovered from the frequency reduction.

The invention relates to the field of data processing, in particular to a distributed flow limiting method and device, equipment and a medium, which are used for realizing distributed flow limiting control on a service request. The method comprises the following steps: receiving business requests of business servers connected with a cache server, and clustering the business requests based on multi-dimensional object information of the business requests to obtain request clusters; aiming at each request cluster, respectively executing the following steps: sorting the service requests in the request cluster to obtain a request sequence; aiming at each service request in the request sequence, sequentially executing the following steps: acquiring the count of a counter corresponding to the multi-dimensional object information of the service request, comparing the count with a first quantity threshold value, and judging whether the count is updated or not based on a first comparison result; and sending the first comparison result to a service server corresponding to the service request to enable the service server to analyze the first comparison result, and if a return value in an analysis result is a first set value, performing flow limiting processing on the service request.

A method of ingress message rate limiting across a distributed producer network function (NF) application using an optimized token bucket algorithm includes implementing a producer NF instance as a distributed producer NF application and implementing a distributed ingress gateway (IGW) for performing ingress message rate limiting on the distributed producer NF application. The method further includes maintaining, for each distributed IGW, a local token bucket for rate restrictions of ingress service-based interface (SBI) request messages received by each distributed IGW; and maintaining a distributed token bucket for refilling the local token bucket. The method further includes receiving an ingress SBI request message at the distributed IGW and consuming, by the distributed IGW, the token from the local token bucket to allow processing of the ingress SBI request message by the distributed producer NF application; and refilling the local token bucket with tokens from the distributed token bucket when the number of tokens in the local token bucket falls below a threshold level.

The invention discloses an LLM-DoS attack protection method based on a multi-level defense strategy and a related device, and belongs to the field of artificial intelligence security. According to the method, denial of service attacks aiming at a large language model are effectively prevented through a three-layer defense strategy: firstly, dynamic frequency control is carried out on an API request, a three-stage rate limiting system is established, a load-aware dynamic adjustment algorithm is introduced, and when the system load is too high, the quota is automatically adjusted; secondly, constructing an input perception classifier by adopting a lightweight Transform model, breaking through context limitation in combination with a random fragment compression and length penalty strategy, and realizing hierarchical interception of attack requests through a harmfulness scoring function; and finally, a request hash mapping and streaming response multiplexing technology is implemented at a server side, and real-time detection and response multiplexing are performed on repeated high-concurrency attack requests, so that consumption of computing resources is reduced. According to the method, the security and availability of the large language model service can be effectively improved, and the influence of DoS attacks on the system is reduced.

The present disclosure provides techniques for context-sensitive token-bucket rate limiting. A processing device obtains, in a kernel space of an operating system (OS), a message comprising a unique process identifier (UPID) and a message type. The processing device determines whether to send the message from the kernel space to a user space of the OS based on at least one of: the UPID, the message type, or a token count and a discrete time unit in an entry in a data structure in the kernel space. The processing device processes the message based on the determination of whether to send the message from the kernel space to the user space.

This invention provides a controller rate limiting method, apparatus, device, and product, comprising: acquiring the key value and return signature of a resource to be re-enqueued; wherein the return signature is sent by the tuning process based on the return point of the resource to be re-enqueued in the tuning process, and each return point in the tuning process corresponds to a return signature; determining the re-enqueuing time of the resource to be re-enqueued based on the key value and return signature; and performing a delayed enqueuing operation for the resource to be re-enqueued based on the re-enqueuing time. By acquiring the return point of the resource in the tuning process based on the key value and return signature, determining the re-enqueuing time, and performing a delayed enqueuing operation at the re-enqueuing time, rate limiting is performed when the external preconditions required for updating the state cannot be met during the tuning process, thus avoiding deadlock and solving the problem of idle consumption of computing and network resources in the controller and cluster.

A method for configurable caching, deduplication, and rate limit handling of user interface data requests according to an embodiment includes receiving a data request initiated by a user interface element of a user interface, determining whether a deduplication cache includes a deduplication entry associated with the data request, determining whether a main cache includes a cache entry associated with the data request in response to determining that the deduplication cache does not include the deduplication entry, determining whether the data request is associated with a rate-limited group of application programming interface endpoints in response to determining that the main cache does not include the cache entry or determining that the cache entry has expired, and making the data request to a backend system after a predefined server retry period associated with the rate-limited group has elapsed in response to determining that the data request is associated with the rate-limited group.

Methods and apparatuses for automatic ingestion of data using a rate-limited application programming interface (API) include a computing device that creates structured query objects, each comprising instructions for retrieving data from a repository using the rate-limited API. The computing device requests data from the repository via the rate-limited API using the structured query objects and a plurality of API access tokens, including a) generating data requests, each comprising a structured query object; b) determining a transmission delay for each API access token based upon a current rate limit imposed by the rate-limited API; c) transmitting each data request to the repository via the rate-limited API using an API access token that has a transmission delay below a threshold value; and d) processing data received from the repository in response to each data request. The computing device repeats steps b) through d) until data responsive to each data request is received.

A first ratio of a sending rate limit to a full line rate for a link in the computing network is accessed. A second ratio of a sending window size to W_max for the link is accessed. W_max is the maximum allowed window size or the window size that utilizes an end-to-end path for the link. One or more of the first or second ratio is used to determine an amount to reduce the sending rate or window for the link in response to an indication of network congestion in the link.

The invention relates to the technical field of computers, and discloses a process scheduling method based on a tenant isolation strategy, and the method comprises the steps: receiving a process scheduling request of a tenant, and carrying out the standardization processing and legality verification; querying a predefined tenant mapping table, and determining an internal unified tenant identifier corresponding to the flow scheduling request and associated single-tenant concurrent quota, tenant resource weight, isolation level and strategy rule; obtaining a single-tenant concurrent quota and a tenant resource weight, generating a tenant isolation strategy in combination with the calculated rate limiting parameter and the tenant correction priority, and performing admission judgment; and based on the judgment result, distributing the flow scheduling request to the corresponding tenant scheduling unit according to the local priority, selecting a target tenant scheduling unit according to the scheduling qualification value and the global scheduling priority, generating an execution instance and triggering the execution instance. Through differentiated services, resource monopoly is prevented, task hunger is eliminated, system overload is avoided, multi-dimensional mutual restriction is carried out, and isolation between tenants is achieved.

Systems, methods, and apparatus related to server access. In one approach, a computing device accesses one or more external servers through a gateway. A rate at which the computing device accesses the servers is controlled based on monitoring the context of a computing environment. Examples of the context include available spare processing bandwidth and / or processing rates for a given user or tenant. The rate is regulated by a dynamic rate limiter and is updated in real-time to reflect any changes to the monitored context.

Some service providers (e.g., Microsoft's Office 365 services) throttle application or service requests an organization, a user, or device can request from a specific application or a suite of applications / services. This throttling can significantly impact performance for, not only the requesting user / device, but also for other tenants associated with that organization. To limit this imposed external throttling, an intelligent internal adaptive throttling or rate limiting may be implemented. In an embodiment, the system monitors throttling imposed by the service provider. Using this information, the system determines an optimal rate of calls that can made for that service to maximize throughput and performance. The system continuously monitors the throttling and in response dynamically modifies the internal target rate.

A method for in-band telemetry rate limiting is disclosed. An apparatus and computer program product also perform the functions of the method. Embodiments of the method include receiving a telemetry packet at an egress node of a data pathway in a data network. The data pathway includes an ingress node, transit nodes and the egress node and the telemetry packet includes a telemetry parameter where the telemetry parameter is for a node in the data pathway. The method includes comparing the telemetry parameter with a previous telemetry parameter from a previous telemetry packet received at the egress node prior to receiving the telemetry packet, and transmitting telemetry data from the telemetry packet to a network controller in response to a telemetry difference exceeding a telemetry parameter threshold. The telemetry difference includes a difference between the telemetry parameter and the previous telemetry parameter.

Techniques are disclosed that relate to rate limiting network traffic at a content distribution network based on decisions provided by a rate limiter located on an on-premise network. A computer system may receive, at the CDN, network traffic requesting access to a service associated with an on-premise network. The computer system sends, to a second computing system deployed in the on-premise network, a request to decide whether to rate constrain the network traffic. The second computing system is configured to perform an analysis on the network traffic. In response to the request, the computer system receives a decision from the second computing system. The computer system implements the decision for the network traffic at the CDN.

The invention relates to the technical field of cloud computing and network communication, and discloses a cloud network data flow speed limiting method and device, and the method comprises the steps: configuring a random discarding starting threshold parameter and a priority discarding threshold parameter; the random discarding starting threshold parameter is greater than the priority discarding threshold parameter; and acquiring the number of tokens in the single-bucket single-rate CAR token bucket, when the cloud network data flow reaches the single-bucket single-rate CAR token bucket, comparing the number of tokens with a random discarding start threshold parameter and a priority discarding threshold parameter, and limiting the speed of the cloud network data flow based on a comparison result. According to the invention, the user Qos service quality can be effectively improved under the scene that the user traffic exceeds the bandwidth, and the efficiency and stability of data transmission are improved.

The present application relates to a cluster shared traffic threshold-based rate limiting method and apparatus, which are used for achieving effective bandwidth management and allocation among a plurality of nodes in a cluster and among a plurality of network card queues in the nodes. The method comprises: S1, a cluster manager issuing a cluster rate limiting threshold of a specified data stream to each node in a network cluster, and adding the forwarding process of each node into a multicast to share traffic information between the nodes, the cluster rate limiting threshold being acquired in the forwarding process of the node; S2, a node controller collecting statistics about the traffic of the specified data stream flowing into a network card per second, performing marking, sending out, by means of multicasting, a unique identifier of the node and network card traffic received per second to be shared to other nodes in the cluster, and on the basis of a multicast packet received from the cluster, calculating a node rate limiting quota threshold of the present node; S3, on the basis of each service core for processing traffic of queues in the forwarding process of the node and the bandwidth proportion of the total traffic of the nodes, a bandwidth allocation scheduler allocating a core rate limiting quota threshold of each node; and S4, on the basis of real-time data of the processed traffic of each queue in the nodes and the proportion of the total bandwidth of the nodes, a token bucket manager performing periodical and dynamical adjustment by means of a token bucket algorithm to obtain the proportion of each queue in a cluster rate limiting bandwidth, so as to limit the rate of the traffic passing through the queue.

A content distribution and optimization system that receives a plurality of event traffic bursts, generated by a first client computing device, in a first pod from a partition of a messaging bus. Messaging bus is partitioned based on a device identifier (ID) of the first client computing device and comprises a plurality of application launch timestamps. A filtering rule is configured for the device ID of the first client computing device for checking a rate limit of each event traffic burst. First set of event traffic bursts is blocked based on number of events exceeding a threshold value of rate limit of an event traffic burst generated by the first client computing device until a new fixed window is assigned. Event traffic communicated to a metrics aggregation controller is limited to pre-defined rate for the first client computing device. Enrichment of remaining second set of event traffic bursts is performed.

An application programming interface (API) proxy intercepts API calls and responses for an application under test in a development environment, simulating (e.g., mocking) rate limiting and throttling behavior, which is otherwise challenging to test. The API proxy receives a API call and, based on a resource limiting parameter (e.g., rate-limiting or otherwise throttling), determines that the API call should be forwarded to the API endpoint. When the API proxy receives another API call from the application, destined for the same API endpoint, the API proxy determines to not forward the second API call, based on the resource limiting parameter (e.g., too soon after the first API call, or requests too much of a computational burden, such as exceeding a resource quota). The API proxy instead returns a throttling response, as would be expected from the API endpoint. The API proxy provides guidance messages for both outgoing calls and incoming responses.

A method for configurable caching, deduplication, and rate limit handling of user interface data requests according to an embodiment includes receiving a data request initiated by a user interface element of a user interface, determining whether a deduplication cache includes a deduplication entry associated with the data request, determining whether a main cache includes a cache entry associated with the data request in response to determining that the deduplication cache does not include the deduplication entry, determining whether the data request is associated with a rate-limited group of application programming interface endpoints in response to determining that the main cache does not include the cache entry or determining that the cache entry has expired, and making the data request to a backend system after a predefined server retry period associated with the rate-limited group has elapsed in response to determining that the data request is associated with the rate-limited group.

The invention provides a distributed current limiting control method and a related device, and relates to the field of current limiting. After the user request is received, if it is judged that the user request needs to be subjected to the flow limiting operation, the flow limiting operation is executed on the user request based on the flow limiting strategy, the problem that the bandwidth of an enterprise core application is occupied due to concurrent resource competition caused by the fact that a CDN cache cluster responds to too high concurrent access flow is avoided, and the CDN service quality is improved. Besides, in the invention, during the current-limiting configuration, the current-limiting strategies of different target cache clusters are the same or different, and the current-limiting strategies of different applications configured in the target cache clusters are the same or different, so that the current-limiting requirements of different clusters or applications can be adapted, and the application range of the distributed current-limiting control method is improved. The method also supports the limitation of the request rate, the limitation of the concurrent connection number and the limitation of the time window request number, and can meet different current limiting demand scenes.

This specification provides a rate limiting method, apparatus, electronic device, and medium for a distributed cluster. The method includes: if at least one token in the token set is greater than 0, calculating a token deviation value; if the token deviation value is less than a first threshold and the condition that all tokens in the token set are greater than or equal to 0 is not met, reducing the token generation rate corresponding to the token bucket rate limiter with tokens greater than the token number threshold, and increasing the token generation rate corresponding to the token bucket rate limiter with tokens less than the token number threshold; if every token in the token set is less than or equal to 0, calculating a rate deviation value based on the generation rate set; if the rate deviation value is greater than or equal to a second threshold, reducing the token generation rate corresponding to the token bucket rate limiter with a token generation rate greater than the token generation rate threshold, and increasing the token generation rate corresponding to the token bucket rate limiter with a token generation rate less than the token generation rate threshold.

The invention relates to the technical field of computers, and provides a short message sending control method, a short message sending control device, a computer readable storage medium and electronic equipment.The short message sending control method comprises the steps that a preset short message sending rate limiting strategy is acquired, the short message sending rate limiting strategy is used for defining the maximum number M of short messages allowed to be sent in a preset time window; initializing an annular storage area based on the maximum short message number M, wherein the annular storage area is composed of M memory blocks; when a short message sending request is received, obtaining a time difference between the current timestamp and the earliest timestamp recorded in the annular storage area; if the time difference is larger than or equal to the preset time window, the current short message is allowed to be sent, and the current timestamp is written into the target memory block occupied by the earliest timestamp. According to the method, the memory overhead and the processing delay can be remarkably reduced while the condition that the sending amount in any continuous time window does not exceed M strictly can be ensured.

The invention discloses a financial lease internet open platform and a use method. The open platform comprises an interface information module, a protocol information module, a service registration module, an unpacking and packing module, a desensitization restoration module, a configuration management module and the like. Secure data transmission between the open platform and the partner is ensured; the method comprises the following steps: registering information of a partner by using an open platform, associating API interface information with back-end protocol information, matching the API interface information, executing the back-end protocol information, and performing data security transmission between the partner and the open platform. According to the open platform disclosed by the invention, by formulating a secure transmission scheme and comprehensively considering multiple aspects such as identity verification, signature protection and rate limitation, the API interface is effectively prevented from being hostile attacks and unauthorized access, and the operation stability of the open platform is improved.

The invention discloses a gas turbine parallel steam side high-pressure bypass pressure control system and method. The system comprises a non-module, a first switching module, an AND module, a second switching module, a multiplication module, a large selection module, a rate limiting module and a small selection module. The method comprises the steps that when a second parallel steam electric valve is fully opened to be '1' and a first parallel steam electric valve is fully opened to be '1', the output of a first switching module is 0.5, multiplication calculation is conducted on the output value of the front pressure of a second high-pressure parallel steam valve, and after numerical optimization of a large selection module, a rate limiting module and a small selection module is conducted, a bypass pressure set value is obtained. The problems that the effect of the steam merging process at the initial stage of unit starting is poor, and control over all parameters is unstable are solved, pressure and temperature are kept stable in the unit starting operation process, and safe and efficient operation of the unit is ensured.