93 results about "Expiration Time" patented technology

A wireless communication apparatus, method or protocol for wireless STAs using CSMA / CA on a wireless local area network (WLAN). A receiver STA receives MSDUs or A-MSDUs which include an expiration time, from a transmitter STA. The receiver STA stores the MSDUs or A-MSDUs with expiration time in its receive reordering buffer of the corresponding high-throughput (HT)-immediate block acknowledgement (Ack) agreement. The receiver STA passes the MSDU or A-MSDU to a next MAC process before an expiration time of the MSDU or A-MSDU. Thus, the percentage of latency sensitive traffic packets being communicated prior to expiration is increased.

A computing device having a host system coupled to a memory sub-system, the host system having at least one processing device configured to run a garbage collection manager and a plurality of storage space tenants. The garbage collection manager can: track a history of data storage instances of data being written, according to a protocol of flexible direct placement (FDP), to reclaim units in the memory sub-system by the plurality of storage space tenants; identify, based at least in part on the history, a reclaim unit as a candidate for accelerated invalidation of valid data remaining in the reclaim unit; determine, based at least in part on the history, estimates of expiration time of the valid data; and determine, based on the estimates, whether to perform operations to accelerate invalidation of the valid data remaining in the reclaim unit.

A computing device having a host system coupled to a memory sub-system. The host system runs a garbage collection manager and a plurality of storage space tenants. The garbage collection manager can: write, to the memory sub-system according to a protocol of flexible direct placement (FDP), data of the plurality of storage space tenants to a reclaim unit in the memory sub-system; identify, after a first portion of the data stored in the reclaim unit is invalidated, first storage space tenants having a second portion of the data remaining valid in the reclaim unit; communicate with the first storage space tenants to identify estimates of expiration time of the second portion; and select, based on the estimates, the reclaim unit for acceleration of invalidation of the second portion of the data.

A computer-implemented method, system and computer program product for handling eviction of subprocess pods of a node. An indication to evict pods of a node in a container environment is received. Upon receiving such an indication, process information pertaining to the evicted pods is retrieved. In scenarios in which some of the evicted pods include subprocess pods, based on such processing information, those subprocess pods with a timeout that is less than a threshold value may be tagged for timeout handling. Such timeout handling involves selecting a number of subprocess pods to ensure that their parent process will successfully complete its assigned job. A schedule plan may then be generated for such selected subprocess pods, where the schedule plan updates the timeout for such subprocess pods to enable them to complete execution of their assigned tasks prior to their expiration time (timeout) even though they were evicted.

The invention provides a high-concurrency and high-throughput message consumption deduplication method and device for a distributed message queue, and the method comprises the steps: obtaining a to-be-deduplicated message Key and a service type parameter, processing the synchronous or asynchronous call of a single or batch message, and generating message Key group data containing original grouping information; routing to corresponding memory queues for temporary storage according to service types to form a classification queue structure; the thread pool consumption queue is used for generating batch message Key and service type information through time-limited and batch two-dimensional batch gathering; executing batch duplicate removal in Redis through a Lua script, judging duplicate by using an incr command, and setting expiration time to obtain a processing result; and restoring the result according to the original message group and notifying the thread, and returning the Boolean value or array to the service party. According to the invention, a high-concurrency and high-throughput message deduplication function is realized.

This invention discloses a data processing method, apparatus, electronic device, and storage medium, relating to the field of computer technology. One specific embodiment of the method includes: receiving a data processing instruction; obtaining the corresponding sliding window for each stored data; calculating the access parameters for each stored data; responding to a reporting instruction for the access parameters; obtaining the corresponding data identifier; obtaining the remaining expiration time of the data identifier to determine the current remaining time of the data identifier; and updating the local window lock of the data identifier based on the current remaining time; responding to a successful update of the local window lock; reporting the access parameters associated with the data identifier to a caching system; and responding to a triggering of a popularity acquisition task; obtaining the access popularity of each stored data from a preset caching system. This embodiment can solve the problem that analyzing client access data through a server requires establishing an independent server, resulting in high operational complexity and resource consumption.

A processing client may receive a dataset replacement indication that indicates an upcoming synchronized data replacement in which processing clients are to synchronously replace a first synchronized dataset with a second synchronized dataset as well as a request period during which the processing clients are to request, at randomized times, the second synchronized dataset. The processing client may transmit a query requesting the second synchronized dataset. The processing client may receive a response including the second synchronized dataset and an indication of an expiration time for the first synchronized dataset that indicates when the processing clients are to replace the first synchronized dataset. The processing client may store, at the processing client prior to the expiration time, the second synchronized dataset and the indication of the expiration time. The processing client may replace, in response to the expiration time occurring, the first synchronized dataset with the second synchronized dataset.

The invention discloses a terminal certificate state abnormity monitoring method and device based on flow analysis, electronic equipment and a storage medium, and belongs to the field of network security monitoring, and the method comprises the steps: obtaining a certificate load message and current system time sent by a network access terminal in a key exchange process; analyzing the message to obtain a certificate public key, certificate deadline and a device unique identifier, and calling a historical fingerprint sequence from a local database according to the device unique identifier; performing hash processing on the certificate public key to generate a current public key fingerprint, comparing the current public key fingerprint with a historical fingerprint sequence, and calculating a difference value between certificate deadline and current system time to complete timeliness verification; and integrating the certificate state verification result and the certificate timeliness verification result, determining the current security state of the network access terminal, and generating a state monitoring report. According to the invention, the problem that the terminal certificate historical consistency abnormity cannot be identified in the prior art can be solved.

The invention discloses a cache data optimization method and device based on service information, equipment and a storage medium, relates to the technical field of data caching, and discloses a cache data optimization method based on service information, comprising: acquiring service information and initial cache data; determining expiration time of the initial cache data according to the service information; selecting to-be-detected cache data according to the initial cache data, and performing effective judgment on the to-be-detected cache data according to the expiration time to obtain a judgment result; and deleting expired data in the to-be-detected cache data and updating the expired time according to the judgment result to complete cache data optimization. According to the method, the cache expiration strategy is dynamically adjusted, the cache utilization rate is improved, and the system performance overhead is reduced.

The invention discloses a distributed delay task processing method and device, and the method comprises the steps: obtaining a task, distributing the task to a corresponding task bucket, and distributing the task to the corresponding task bucket based on a delay expiration timestamp associated with the task; polling a task bucket set which is not executed in real time to scan to obtain a current expired target task bucket, and taking out a bucket name of the target task bucket and putting the bucket name into an expired task bucket queue; consuming the expired task bucket queue to take out the target task corresponding to the bucket according to the bucket name, and adding the target task into the expired task queue; the expired task queue is consumed. By newly adding the time sequence barrel dimension, each time sequence corresponds to one independent storage set, and the data storage capacity is greatly increased. The corresponding delay task is processed by scanning whether the time sequence bucket expires or not instead of scanning an independent delay task, so that the performance is greatly improved. Therefore, the defects existing in related technologies are overcome.

This application provides a data processing method, electronic device, medium, and product; wherein, the method includes: obtaining a time parameter when target data enters the cache and the lifespan of the target data; the time parameter includes a count value of a global counter; inserting the target data into a classification list based on the lifespan and the count value; the classification list is used to aggregate data with the same expiration time and expiration cycle; cleaning the target data based on the classification list, which can aggregate data with the same expiration time and expiration cycle together, and realize efficient querying and cleaning of expired data.

A delay message processing method based on a message queue, a medium, a device and a product relate to the technical field of computers, receive a delay message in a delay message queue in a message queue engine, read the delay message from the delay message queue through a delay message engine, and store the delay message in a storage system. And reading the expired delay message from the storage system based on the expiration timestamp of the delay message, and sending the expired delay message to the corresponding target message queue based on the target message queue identifier carried by the expired delay message, so that a message consumer consumes the expired delay message from the target message queue. According to the message queue engine, the delay message and other types of messages can be stored and used in an isolated manner through different message engines, so that the situation that the delay message and other types of messages in the message queue engine influence each other is avoided, the performance of the message queue is greatly ensured, and independent capacity expansion can be performed on the delay message.

The invention discloses a Dores data efficient batch writing method and system, and the method comprises the following steps: S1, receiving data to be written into a Dores cluster, storing the data into a cache, and marking the timestamp of the data entering the cache; s2, monitoring the cached data volume and the data retention duration in real time, and when the cached data volume reaches a dynamically configured batch size threshold value or the data retention duration reaches a configurable expiration time threshold value, triggering a batch writing process; s3, extracting to-be-written data in the cache, and after the to-be-written data is adapted to a Dores table structure, executing data writing through a batch writing interface; and S4, according to a Dores cluster pressure index which comprises a CPU utilization rate and a parallel transaction number, dynamically adjusting a batch size threshold value, adapting to cluster load change, and ensuring stable operation of the cluster. The method is combined with expiration time, prevents data from being accumulated and cached for a long time, and balances the system load.

This application provides a dual-resource-pool hierarchical resource scheduling method, apparatus, device, and medium. The method includes: for each GPU basic unit of each node, if the resource pool type of the GPU basic unit is a monthly resource pool, then the GPU basic unit is reclaimed based on idle time and expiration time; if the resource pool type is a packaged resource pool, then the GPU basic unit is reclaimed based on idle time. Based on the number of GPUs, the real-time acquired number of available GPUs of each node, the GPU occupancy type, and node scheduling constraints, a set of selectable nodes is selected from each node. Based on the scheduling priority ranking strategy determined by the number of GPUs and the node GPU utilization, the nodes are sorted for scheduling priority, and the target GPU of the target node is determined. Based on the GPU occupancy type, the resource scheduling method of the target GPU is determined, and the target GPU is scheduled to the container resource request using the resource scheduling method. This achieves differentiated management of GPU resources and improves GPU resource utilization.

The application provides a method, device and equipment for implementing a distributed delay task, the method comprising: obtaining a task to be processed, submitting the task to a database Redis after obtaining a distributed lock with a task ID as a Key; periodically traversing a task executor queue, each time the current task executor is traversed, accessing the database Redis with a task type corresponding to the current task executor as a Key, querying a target task in the queue with the most advanced expiration time of the task to be processed of the corresponding task type, confirming whether the target task is expired, otherwise traversing the next current task executor, if the target task is expired, obtaining a distributed lock with an ID of the target task, executing the target task through a working thread of the current task executor, and traversing the next current task executor, if the distributed lock is not obtained, traversing the next current task executor. The application solves the consistency problem and the idempotency problem with lower complexity, and effectively manages different types of tasks.

A method comprising: obtaining a content item to be published on a webpage, wherein the content item comprises content to be displayed to a user; calculating an expiration time for the content item based on the content; and upon reaching the expiration time, unpublishing the content item. The calculating may comprise performing freshness prediction using a machine learning tool trained with historic content items and labeled expiration times. The calculating may comprise performing freshness prediction based on time-related keywords in content item titles. The calculating may comprise obtaining a new content item published after the original publication time and determining the new content item renders the original content item expired through content analysis.

The invention provides a game flow limiting method, device and system and computer equipment, and relates to the technical field of computers. The game traffic limiting method comprises the steps that a login request from a client side is received, and whether login is allowed or not is determined according to the number of online people; if login is allowed, an authentication token containing expiration time is sent to the client; receiving a service request containing the authentication token from a client, and updating the authentication token based on expiration time in the authentication token; and updating the number of online people based on the number of unexpired authentication tokens.

The invention discloses a multi-platform live stream intelligent distribution method and device, and is applied to the technical field of data processing. Cloud service equipment receives platform configuration information and a unique SN code of edge equipment, the configuration is stored in a cloud MySQL database, and the platform type is identified according to a push stream address to complete filing classification; and receiving a plug flow request containing the SN code, the key and the expiration time, allowing plug flow after verification is passed, and otherwise, rejecting the plug flow. And after the verification is passed, receiving the video stream and segmenting the video stream into TS slices, generating M3U8 index storage, and only retaining the TS slices in the latest 3 seconds to prevent the hard disk from being overloaded. And after the plug flow notice is received, cloud distribution configuration is checked according to an SN code, the domestic platform directly reads local flow plug flow, and the foreign platform sends an HTTP POST request containing parameters such as a pull flow address and the like to trigger an overseas server to pull flow. And receiving a flow pulling success notification, monitoring domestic and overseas flow pushing states, recording flow pushing key data in real time, locally backing up, and synchronously configuring and logging to a cloud database.

The invention relates to the technical field of computer data processing, and discloses a cache-based data query analysis result optimization method and system, and the method comprises the steps: receiving a client data query request, and extracting an original parameter set; the parameters are subjected to effective cleaning and ASCII code ascending order arrangement, and a unique cache key is generated through normalized splicing and Hash operation; retrieving a cache database according to the result, and returning an analysis result if the result is hit; if the target data is not hit, returning to the source to query the underlying database, and writing the obtained target data into the cache based on an adaptive compression strategy and random expiration time, and in addition, the system establishes a mapping index of a data table and a cache key and monitors a data change event in a binary log of the database, so that active and accurate clearing of the cache is realized. According to the method, the influence of the sequence difference of the request parameters on the cache hit is eliminated through parameter standardization processing, the cache reuse rate is improved by combining adaptive storage and an active failure mechanism, the memory occupation is reduced, and the high real-time performance of data is guaranteed.

A system includes a memory configured to store a post quantum cryptography (PQC) key and sensitive data to be transmitted to a computing device over a communication channel and a processor operably coupled to the memory and configured to access the PQC key and the sensitive data. The processor is further configured to determine, based at least in part on the sensitive data, an expiration time beyond which the sensitive data is rendered unreadable. The expiration time is identified based on an estimated future time at which a quantum computing based decryption process can be utilized to read the sensitive data. The processor is further configured to encode the sensitive data based on the PQC key. The PQC key is associated with the expiration time. The processor is further configured to transmit, over the communication channel, the encoded sensitive data to the computing device.

The application discloses a data processing method and device, electronic equipment and storage medium, and relates to the technical field of computers. A specific implementation manner of the method comprises the following steps: receiving a data request, obtaining a data identifier in the data request, querying corresponding target data from a cache, returning the target data, and triggering an update operation of the target data; in response to the update operation, obtaining an expiration timestamp of the target data and an update threshold, wherein the update threshold is determined from an update time interval corresponding to the expiration timestamp based on an attribute parameter of the target data; calculating a time length between the expiration timestamp and a current time, determining that the time length is less than the update threshold, and calling a preset data update thread to update the target data in the cache. The implementation manner can solve the problem that, in a high-concurrency scenario, data in the cache reaches an expiration time and then data is updated, which reduces the efficiency of data request and response and causes the performance of a business system to decrease.

A method and related system for providing contextual data using ephemeral records includes operations to detect a request for communication from a first device associated with a first identifier to a second device associated with a second identifier and retrieve a profile from a database based on the first identifier in response to detecting the request. The method also includes retrieving an ephemeral record of the profile based on the second identifier, where the ephemeral record is associated with an expiration time and includes a set of context values provided via a first message associated with the second identifier. The method also includes providing a second message including the set of context values to the second device and deleting the ephemeral record at a time exceeding the expiration time where receiving the second message causes a screen of the second device to display the set of context values.

The embodiment of the invention provides an Internet of Things communication method and device, relates to the field of communication, and aims to save the power consumption of Internet of Things equipment, adapt to the requirements of massive Internet of Things systems and guarantee efficient and stable operation of a communication system. The method is applied to the Internet of Things equipment, and comprises the following steps: receiving a synchronization signal; at a first moment, a first timer is started, the duration of the first timer is determined according to the first offset value, and the first moment is equal to or later than the end moment of the synchronization signal; when the first timer is overtime, the beacon signal is detected in a first window, and the starting moment of the first window is the overtime moment of the first timer; receiving a PRDCH in a case where the beacon signal is detected in the first window; and entering a dormant state under the condition that the beacon signal is not detected in the first window.

Systems and methods for device provisioning may include a second device which communicates, to an API of one or more servers, prior to an expiration time corresponding to a first request from a first device, credentials corresponding to a unique identifier included in the first request, and a second request for a signed certificate. The second device may receive, from the one or more servers via the API, a response to the second request including the signed certificate. The second device may establish, using the signed certificate, a virtual tunnel to communicate with a remote resource. The second device may update, using the remote resource, one or more provisioned resources of the second device.

The invention discloses an expiration automatic destruction setting method and program, and solves the problems that files are easy to leak, expiration is difficult to delete and a timing function is easy to fail in the prior art. The method comprises the following steps: setting preset expiration time containing an encryption timestamp; embedding destroying logic (modifying native code binding) containing time detection, permission change, file destroying and program exit modules into the file; and triggering detection when the file is opened, firstly setting the file to be read-only after the time is up, then irreversibly destroying the file, and finally closing the application program. A program can receive parameters, generate adaptive codes and embed the adaptive codes, and batch processing is supported and the adaptive codes are stored in various media. According to the method, logic and files are deeply bound, external interference is prevented, a confidential closed loop is formed, the management efficiency is improved, and data security laws and regulations are adapted.

An apparatus in an illustrative embodiment comprises at least one processing device configured to maintain a cyclic array of storage object queues each associated with one of a set of two or more different time intervals. The at least one processing device is also configured to identify a storage object having an associated expiration time and to select, for the identified storage object, one of the storage object queues in the cyclic array based at least in part on its associated expiration time. The at least one processing device is further configured to insert the identified storage object into the selected storage object queue, and to process, in response to a designated timer trigger event corresponding to expiration of a given one of the time intervals, storage objects in a given one of the storage object queues in the cyclic array associated with the given time interval.

The application discloses a cache method based on node state and content heat, which is applied to NDMANET and comprises the following steps: if there is a PIT table item corresponding to a data packet in an intermediate node, then the cache score S of the intermediate node is calculated based on the connectivity, cache free amount and heat of the node cache and the cache score threshold T score ; S cache is compared with T score ; if S cache is less than T score , the cache process is not executed, and the data packet is directly forwarded; if the cache score S cach is greater than or equal to T score , the content is cached in the CS when the cache capacity is sufficient, and the content is attached with an expiration time; when the cache capacity is insufficient, a cache replacement algorithm is executed first, then the cache free amount is updated, and the data packet is forwarded. The application can cache the content with higher heat to a suitable node, so that the node cache hit rate is improved while reducing the user request time delay.

The application relates to a key information processing method and device, computer equipment, a storage medium and a computer program product. The method comprises the following steps: acquiring key configuration information in a timely manner; the key configuration information comprises an authorization identifier, an expiration extension time and first key information; the first key information comprises a first key expiration time and a first key identifier; for each first key identifier, when the first key expiration time is reached, the authorization identifier is acquired; when the authorization identifier corresponds to automatic authorization, the first key information is updated based on the first key expiration time and the expiration extension time to obtain second key information; and the second key information is stored in the key configuration information as new first key information. The method can dynamically update the key configuration information and improve the security of key data.

Methods, systems, and devices for wireless communications are described. A wireless device may determine a dynamic expiration value for a timer (e.g., a radio link control (RLC) status protocol data unit (PDU) retransmission timer), determine one or more event triggers for retransmitting a status PDU, or both, and may retransmit an RLC status PDU based on the expiration value, the one or more event triggers, or both. The UE may determine the second expiration time, the one or more event triggers, or both, based on one or more RLC or hybrid automatic repeat request (HARQ) parameters, one or more predictions associated with RLC PDUs, or both, where a machine learning (ML) model may generate the one or more predictions. the UE may be configured with one or more parameters and key performance indicators (KPIs) for determining the second expiration value, the one or more event triggers, or both.

The invention discloses a distributed flow limiting method and system based on a pre-calculation token, and particularly relates to the field of distributed system flow control. In a distributed system, a unique Key is distributed to each flow limiting object to serve as a Redis index, and a token generation interval T and Key expiration time E are preset; packaging atomization operation by means of a Lua script, wherein the operation comprises token calculation, timestamp updating and request judgment logic; when the request arrives, Key matching and parameter obtaining are carried out through an API gateway or an interceptor, and a Lua script is called to judge whether release is carried out or not; forwarding service processing if the result is 1, and degrading according to a strategy if the result is 0; the parameters are stored in a Nacos configuration center, and the system is started and loaded to a local cache and Redis; when the parameters are adjusted, the configuration center pushes the parameters to each node in real time, the nodes asynchronously update local and Redis data, smooth transition of new and old parameters is ensured, and dynamic accurate flow limiting is realized.