146 results about "Expiration Time" patented technology

The invention discloses a certificate management method and device, computer equipment and a storage medium. The method comprises the following steps: reading certificate information in a system; judging whether the certificate expiration time in the certificate information is smaller than a set threshold value or not; and if the time from the expiration of the certificate in the certificate information is smaller than a set threshold value, alarm information is sent out. By implementing the method, service interruption or data security risks caused by expiration of the certificates can be effectively avoided, continuity and stability of application services are ensured, the workload of operation and maintenance personnel in the aspect of certificate management is reduced, the operation and maintenance personnel do not need to manually check the expiration time of each certificate, and the operation and maintenance efficiency is improved. The automatic management mode not only reduces the operation labor cost, but also improves the operation and maintenance efficiency, and the technical scheme can be applied to the fields of medical treatment and finance.

The invention discloses an authority management method and system for double-token decoupling and dynamic token mapping, and relates to the technical field of information security. According to the method, a user identity is verified in a unified identity management system; receiving the user identity identifier in the target subsystem and generating a local permission token based on the permission model; in the token mapping service, when it is detected that a mapping relation is not established, the user identity identifier, the target subsystem identifier and the time slice identifier are combined according to a preset sequence, a one-time random factor is inserted, and a mapping key is generated through two-time abstract calculation of different secure hash functions and key parameters; determining a unified expiration time based on a smaller value of the validity period of the double tokens, generating a mapping value by using the exclusive key of the target subsystem in an encryption manner, and storing the mapping value, the mapping key and the expiration time in a distributed cache in an association manner; and the validity of the identity token is verified and the corresponding local permission token is obtained during user access, so that cross-system security access is realized, permission data migration is reduced, and compatibility and security are improved.

The invention discloses a token synchronization method and device based on micro-service, equipment and a storage medium, and relates to the technical field of application software development, and the method comprises the steps: analyzing a target request comprising a first token to obtain token expiration time; and if the current time does not exceed the token expiration time, judging whether the remaining effective duration is greater than a target duration threshold, if the remaining effective duration is not greater than the target duration threshold and a token refreshing mark does not exist, setting the token refreshing mark in the preset cache database, refreshing the token, and issuing an obtained second token to the front-end micro-service, the front-end micro-service accesses the back-end micro-service based on the second token; and calling the independent micro-service to analyze a first token issued by the front-end micro-service to obtain the user identifier, so that the independent micro-service accesses a preset cache database by using a key generated based on the user identifier to obtain a second token, and accesses the rear-end micro-service based on the second token, and enabling the back-end micro-service to transmit the access response information to the independent micro-service for processing. Therefore, the token synchronization efficiency can be improved.

The invention discloses a software trial time setting method and system based on a dual verification mechanism, which effectively increases a tamper-proof function of software trial time control, and comprises the following steps: step S1, a client collects equipment hardware feature information, generates hardware fingerprints, and sends the hardware fingerprints to a server; packaging the hardware fingerprint, the software version number and the application timestamp into an authorization request and sending the authorization request to a license server; s2, the server generates a dynamic encryption key according to a software version matching trial period; s3, the server encrypts the hardware fingerprint, the trial deadline and the function permission list by using the dynamic key, generates a license file after adding a digital signature, and issues the license file to the client; the method is novel in structure, ingenious in conception and easy and convenient to operate, the unique binding function of the license and the hardware equipment is effectively enhanced, the cracking resistance of the encryption key is improved, the real-time tamper-proof verification function is added, and the response efficiency of an exception handling mechanism is optimized.

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.

Methods, systems, and devices for wireless communications are described. An application server (AS) may generate one or more packet data unit (PDU) sets of a first periodic burst transmission. The first periodic burst transmission may correspond to a first delivery deadline at a user equipment (UE) during a jitter window. The jitter window may span a time period prior to and after a first arrival time associated with the one or more PDU sets. The AS may buffer at least a portion of the one or more PDU sets for a first duration of the jitter window. The first duration may correspond to a threshold percentage of the jitter window. The AS may output the one or more PDU sets based on expiration of the first duration and prior to the first delivery deadline.

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.

In one aspect, a device for wireless communication is disclosed. The device includes at least one processor and a memory coupled to the at least one processor. The at least one processor is configured to cause the device to: receive reassembly timer configuration information. The at least one processor is also configured to receive one or more radio link control (RLC) segments, each RLC segment associated with a sequence number (SN), wherein the one or more RLC segments are associated with a reassembly timer expiration time based on the reassembly timer configuration information. The at least one processor is further configured to: release, prior to the reassembly timer expiration time, the one or more RLC segments based on an adjusted reassembly timer expiration time. The adjusted reassembly timer expiration time is determined based on an output from a learning model of the device. Other aspects are described and claimed.

Methods, systems, and devices for wireless communications are described. An application server (AS) may generate one or more packet data unit (PDU) sets of a first periodic burst transmission. The first periodic burst transmission may correspond to a first delivery deadline at a user equipment (UE) during a jitter window. The jitter window may span a time period prior to and after a first arrival time associated with the one or more PDU sets. The AS may buffer at least a portion of the one or more PDU sets for a first duration of the jitter window. The first duration may correspond to a threshold percentage of the jitter window. The AS may output the one or more PDU sets based on expiration of the first duration and prior to the first delivery deadline.

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.

The invention relates to a Redis-based asynchronous task security scheduling method and system, and the method comprises the steps: creating an asynchronous task, and storing the asynchronous task to a task queue for scheduling; scheduling the asynchronous tasks through atomic operation executed by the script, preferentially acquiring the overtime asynchronous tasks from the task execution set, or popping up the asynchronous tasks to be executed from the task queue, and recording the acquired asynchronous tasks to the task execution set to track a scheduling state; prolonging the maximum execution time of the asynchronous task by updating the expiration time of the asynchronous task in the task execution set; and after the asynchronous task is completed or failed, deleting the asynchronous task from the task execution set. Compared with the prior art, the scheme has the advantages that the task scheduling stability in a high-concurrency scene is remarkably improved, the task loss risk is reduced, non-blocking access and dynamic scheduling are supported, the scheme is suitable for high-reliability systems such as financial systems and industrial control systems, the system performance is optimized, and the implementation complexity is simplified.

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.

The invention discloses a token life cycle collaborative management and session synchronization control method and system, and relates to the technical field of session token management. According to the method, an encryption mapping data structure is established in a main control module, the corresponding relation between a user identity token and two or more subsystem local authority tokens is recorded, and index retrieval based on user identification is supported. The main control module cooperatively completes synchronous updating of the identity token and the local token based on parameters such as token expiration time, network delay, processing delay and operation state; and when a global logout request is received, controlling the plurality of subsystems to complete local token logout and delete the mapping information according to the dynamically calculated batch number and priority sequence. All updating and logout operations are completed through a unified communication interface with identity authentication, security verification and exception retry mechanisms, an original authority control mechanism of the subsystem does not need to be modified, and the security, consistency and expansibility of cross-system session management are improved.

A storage space management method and electronic device relate to the field of computer technology. The electronic device determines a predicted life index of a data block based on the life cycle index of the file to which the data block belongs in the file system. Thereafter, the electronic device manages the storage space of the file system based on the predicted life index of the data block. The predicted life index is used to indicate the expected number of data blocks allocated by the file system from the time the data block is written to the time it expires. The life cycle index of a file is used to indicate the expected number of data blocks allocated by the file system from the time the file is created to the time it is deleted. By predicting the life of a data block and knowing the expected expiration time of the data block in advance, the electronic device can manage the storage space more efficiently, thereby reducing the management load of the storage space.

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.

The invention discloses a DNS cache updating method and device based on pushing, the method is applied to a recursive server, the recursive server is used for periodically initiating an updating DNS query request to an updating database and deleting a local cache according to a domain name list in an updating DNS response, and the method comprises the following steps: receiving a DNS query request sent by a client, checking whether an effective record exists in the local cache or not, and if yes, returning the effective record to the client; if not, triggering a cache miss event, and obtaining a latest analysis result from the authoritative server; the authoritative server pushes an event to the update database after the DNS record is changed; inserting the latest analysis result into a local cache, and setting cache expiration time according to a TTL value returned by the authoritative server; and returning the latest analysis result to the client, and managing the actual validity period of the local cache record. According to the invention, the updating time efficiency and the TTL are decoupled, and real-time updating is realized.

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 present invention discloses a method and system for implementing a distributed lock based on Redis, belonging to the technical field of Java under the microservice architecture. The technical problem to be solved by the present invention is how to handle the concurrent access of data with Redis distributed locks and ensure the ultimate consistency of data. The technical solution is as follows: The method is specifically as follows: Obtain the current time in milliseconds; Request to acquire a lock from the Redis master node in sequence; The client sets the network connection and response timeout, and the response timeout is less than the expiration time of the lock; If the response timeout expires, skip this Redis master node and try the next Redis master node; The client uses the current time minus the time when the lock acquisition started to obtain the time used for lock acquisition: Only when more than half of the Redis master nodes have acquired the lock and the time used for lock acquisition is less than the lock expiration time, the lock acquisition is successful, and the true effective time of the acquired lock needs to subtract the time used for lock acquisition; When the lock acquisition fails, the client unlocks on all Redis master nodes.

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 invention provides a data timeout management method, apparatus, electronic device, and readable storage medium, relating to the field of computer technology. The method includes: acquiring timeout setting information from a Redis database, the timeout setting information including a key and an expiration time corresponding to a hash type, wherein the hash type is a triple of key, field, and value; determining the timeout setting type of the hash type based on the current key, the timeout setting type including a first type and a second type; if the timeout setting type is the first type, creating a first string based on the current key, wherein the value of the first string corresponds to the expiration time; and setting a timeout for the field in the hash type based on the first string. This invention improves the effectiveness of hash type timeout management by setting timeouts for the fields in the hash type.

A base station or user equipment comprising apparatus with: means for processing transmission of a plurality of data units in accord with a packet data convergence protocol, PDCP; means for creating a report for at least one of the plurality of data units, said report providing a sequence number of the at least one data unit, and an expiry time for the at least one data unit; and means for sending the report to a receiver to which the data units are processed to be sent. The apparatus may comprise: means for determining the data unit of a set associated with the shortest expiry time, wherein the means for creating the report provides the sequence number of that data unit and the expiry time for that data unit; or, comprise means for determining the shortest expiry time for a data unit in a set, wherein the means for creating the report provides the sequence number of all data units in that set and the shortest expiry time within the set. The expiry time is a time-to-live value equal to: a remaining time before a discard timer expires; or, a remaining time before a discard timer for relatively low-importance data expires. The report is sent for the set responsive to one data unit of the set being submitted to a lower layer for transmission, wherein the data unit is submitted to an RLC layer and the data unit is a protocol data unit, PDU.

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.