51 results about "Distributed queuing" patented technology

An apparatus for and method of enforcing precedence of committed traffic over excess traffic that overcomes the difficulty in supporting committed over excess traffic and has particular application to distributed queuing systems. Queue control messages are generated and transmitted to other line cards to guarantee that committed traffic is not dropped when sent from multiple sources such as line interface cards to a single destination. When the level of a queue exceeds a threshold and flow control is received for the corresponding destination, the queue starts dropping excess traffic and messages indicating the queue status are sent to all other lines cards. When a line card receives a queue control message that another line card started dropping excess traffic to a specific destination, it also starts dropping excess traffic to that destination as well.

The present invention relates to a network security monitoring and management system based on the Angou vulnerability scanning cloud platform, including an API interface, an integrated queue manager, a network vulnerability knowledge base and a network vulnerability scanning cloud platform. The API interface provides a system entrance for a third-party system or user, The integrated queue manager schedules tasks through the distributed queue scanner integration method, and the network vulnerability knowledge base is used to translate raw scan reports into readable scan reports. The network vulnerability scanning cloud platform monitors, manages and maintains the API interface, integrated queue manager and network vulnerability knowledge base through the user management module, scanner management module, vulnerability library management module and report management module. interactive platform. Its advantages are as follows: generating accurate vulnerability reports and conducting vulnerability trend analysis, helping enterprises to intuitively understand their own security situation, improving corporate network security awareness, and reducing corporate information security risks.

The invention discloses a system for processing nonsynchronous message and a method for the system to send message and monitor processing task. The system comprises a plurality of trunked ends and a queue server end, wherein each trunked end comprises an application server and a plurality of client sides, each client side selects a queue server according to default rules, when information is sent, each trunked end serves as a sending end to select the corresponding queue server to transmit the information in a nonsynchronous way by adopting a distributed queue way; when tasks need to be processed, each trunked end serves as a monitoring end to establish a monitoring thread, setting a monitoring queue and monitor the queue server so as to process the tasks in a nonsynchronous way; the queue server end comprises a plurality of queue servers, which are used for receiving nonsynchronous information sent by each trunked end and storing tasks to be processed. According to the system and the method, the efficient and reliable transmission of the nonsynchronous information can be realized, and the system has the characteristics of strong expansibility, complete fault tolerance, convenience in use, low maintenance cost, convenient monitoring management and the like.

High availability event forwarding can be obtained utilizing distributed queues in a server cluster. Each server can receive an event from a data system, such as a database or SAP™ system. Event queues exist on servers in the cluster can store an event until, for example, the event is delivered to a user or retrieved for processing. An event processor examines the load of each event queue and selects the event queue with the lightest load. The event processor generates an alias for the selected queue, such that a user, integration system, or client application does not need to know the identity of the physical queue storing the event, but only needs to refer to the ‘distributed queue’ or alias. After a physical queue is selected and an alias assigned, the event is forwarded to the selected queue.This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.

Distributed queue-aware power and subband allocation for delay-optimal OFDMA uplink systems with one base station, K users, and NF independent subbands are described. For instance, the disclosed subject matter describes distributed delay-optimal power and subband allocation designs and control actions that are a function of instantaneous Channel State Information and joint Queue State Information. The disclosed details enable various refinements and modifications according to system design and tradeoff considerations.

The invention discloses a distributed type task scheduling system. A task middle layer module is used for receiving input task configuration information through an interface and configuring the task configuration information into a dispatching server, and meanwhile stores and provides tasks with task serial numbers for at least two task work nodes. The dispatching server is used for selecting one of the task work nodes according to a stored execution time table for task configuration when the configuration time in the execution time table is due, builds a distributive queue task and sends the task serial number to the selected task work node; the task work node is used for receiving the task serial number sent by the dispatching server, then searching for the stored task number the same as the task serial number sent by the dispatching sever from the task middle layer module, and searching for and executing the corresponding task for execution from the task middle layer module according to the task serial number. The distributed type task scheduling system realizes management on the scheduled tasks in the server, can monitor the execution state of the scheduled tasks in real time and can reasonably handle the corresponding scheduled tasks when the task fails.

The invention relates to the technical field of computers, in particular to a distributed type queue scheduling method and device based on a Redis. The method comprises the steps that the names of task data queues, to be processed, in the Redis at the current moment are acquired; the information of asynchronous task processing programs connected with the Redis is acquired; according to the names of the task data queues and the information of the asynchronous task processing programs, the asynchronous task processing programs are distributed for the task data queues. According to the method, the situation that asynchronous task processing programs fight for data, and deadlock is caused is avoided.

An apparatus for and method of enforcing precedence of committed traffic over excess traffic that overcomes the difficulty in supporting committed over excess traffic and has particular application to distributed queuing systems. Queue control messages are generated and transmitted to other line cards to guarantee that committed traffic is not dropped when sent from multiple sources such as line interface cards to a single destination. When the level of a queue exceeds a threshold and flow control is received for the corresponding destination, the queue starts dropping excess traffic and messages indicating the queue status are sent to all other lines cards. When a line card receives a queue control message that another line card started dropping excess traffic to a specific destination, it also starts dropping excess traffic to that destination as well.

Method and apparatus for sending and receiving data in a wireless machine to machine communication network comprising at least a gateway (2) and a plurality of nodes (4), implementing an hybrid Medium Access Control protocol to access the shared medium. In order to prevent collisions when sending data transmissions (26), nodes (4) request access to the medium with access request packets (25), and are informed by the gateway (2) if said access request packets (25) are received correctly or if a collision occurred. According to the feedback information (24) provided by the gateway (2), nodes (4) are organized in a distributed queuing system with separate queues collision resolutions and data transmissions (26). Time slots (19) with fixed length are used, divided into three separate subperiods for feedback information (24), access request packets (25) and data transmissions (26). The method and apparatus further implements channel hopping to reduce interferences from adjacent networks.

Proposed are a multi-access method and apparatus for a LoRa tag using backscatter communication. The multi-access apparatus for a LoRa tag using backscatter communication may include a contention slot unit configured to receive a signal for a contention participation request from a base station and participate in a contention according to a distributed queuing (DQ) protocol using a backscatter signal if data to be transmitted is present, an FBP unit configured to receive a result of the contention from the base station and check whether the result of the contention is a success, and a data slot unit configured to transmit sensed data to the base station using the backscatter signal if the result of the contention is a success.

The invention discloses a method and a device for carrying out a crawling task. The method comprises the following steps: sending a received crawling request to a cloud distributed queue of a cloud server by a first terminal; reading the crawling request from the cloud distributed queue by a second terminal, wherein the second terminal is a cloud terminal; crawling a network resource according to the crawling request by the second terminal and storing crawling result data to a database; and reading the crawling result data from the database by the first terminal. Due to the adoption of the method and the device, the problems in the prior art that the efficiency of carrying out the crawling task by using a one machine is low and an IP address is easily shielded are solved, and the effect of improving the efficiency of carrying out the crawling task under the condition that the IP address is not shielded by a server is achieved.

The invention is a queuing message data processing method based on wireless network, comprising the following steps of: an operating hall host computer establishes relation database of logon handheld terminal numbers, reducing codes and queuing numbers; inputting operating hall number and transacted service classified data into handheld terminals; transmitting them through wireless network to the operating hall host computer to log on; the host computer distributes queuing numbers and reducing codes to handheld terminals in sequence and adding them to the database; the computer transmits updated service number, waiting number, time change and other data to each handheld terminal; inputting reducing codes into the host computer, and the computer prints queuing number bill as the basis for service transaction. A transactor can log on the host computer by handheld terminal so as to start queuing and exchanges data with the terminal through the host computer to completely learn dynamic changing queuing conditions of the operating hall.

In one embodiment, a device in a shared-media communication network determines a priority of a packet to be queued at the device, and based on the priority determines a length of time the packet is allowed to be queued before being successfully transmitted. After attempting to successfully transmit the queued packet within the shared-media communication network, in response to reaching a threshold amount of the length of time without having successfully transmitted the queued packet, the device may transmit a “shaping” request to one or more reachable neighbors in the shared-media communication network. Specifically, the shaping request is for a temporary reduction in bandwidth utilization by the reachable neighbors for traffic having a comparatively lesser priority than the priority of the packet.

The invention provides a method for providing a service, and the method for providing the service is applied to a server. The method for providing the service includes the following steps: receiving a service request message of a terminal; distributing queuing information to the terminal when the service request message does not carry the queuing information, recording a corresponding relationship between the queuing information and a message source address, and sending the queuing information to the terminal; verifying the corresponding relationship between the queuing information and the message source address if the service request message carries the queuing information; and determining a service priority of the terminal according to the queuing information if the terminal passes verification. According to the technical scheme of the invention, the load of the server can be reduced, and the processing speed of the server can be improved.

A method, an apparatus and an article of manufacture for providing queuing semantics in a distributed queuing service while maintaining service scalability. The method includes supporting at least one of an en-queue and a de-queue operation of one or more queued messages in a non-guaranteed order, maintaining the ordering of the one or more queued messages, and routing an en-queue operation to a persistent queue server and a de-queue operation to a cache manager in the maintained ordering of the one or more queued messages to provide queuing semantics in a distributed queuing service while maintaining service scalability.

The invention provides a queuing method and system applied to a business handling window. The method comprises the following steps: receiving business handling requests of users and distributing queuing numbers of handling the business to the users; obtaining cell phone numbers of the users; and according to a preset policy, sending a queuing notice to the cell phone number corresponding to each queuing number. By virtue of the queuing method and system provided by the invention, the users are prevented from missing the numbers, and a phenomenon that the users wait for queuing at the business handling window for a long time is avoided, so that great convenience is provided for the users.

A system for operating a robust mesh printer network with distributed queue management, comprising a print queue server that receives printer tasks via a network and maintains a print queue based on received tasks, transmits tasks via a network, and updates the print queue based on received changes and transmitted tasks, and a method for operating a robust mesh printer network with distributed queue management using a print queue server.

The invention provides a quasi-real-time asynchronous batch processing system, and the system comprises an asynchronous scheduling module which is used for carrying out reservation scheduling processing on application data through an asynchronous scheduling interface; The distributed queue module is used for performing distributed message queue processing on the application data; And the asynchronous execution module is used for triggering and executing the distributed message queue. According to the method, the existing framework is transformed by using technologies such as sub-library and sub-table, distributed cache, distributed queue and streaming processing technologies, so that the problems of low efficiency and poor expandability in current scheduling processing are solved.

The invention discloses a method for allocating a distributed queue and a distributed system, wherein the method for allocating the distributed queue is applied to the distributed system and comprises the following steps of: receiving an online message of a forwarding unit; and then selecting a queue template corresponding to the type of the forwarding unit from a plurality of queue templates according to the type of the forwarding unit; and allocating the queue by utilizing the selected queue template. Through the method for allocating the distributed queue, the effects of reasonably allocating and utilizing the queue through different types of forwarding units are realized in the distributed system.

The invention discloses a queuing and payment system comprising a terminal scanning module, a binding module, and a certificate module and the like. After registration at a system, a user logs in the system and applies to the system for a queuing order number for system services; the system distributes queuing information and encodes user information and queuing information to a bar code that is then pushed to the user; the user shows the bar code on the scene, and the system carries out scanning for user identification, provides the service for the user according to the user order, and then generates payment data; the user obtains a payment content list and payment amount data; after confirmation, the user carries out on-line payment; the system generates a bar code containing the user identification information and the payment result again and pushes the bar code to the user terminal; and the user can carry out scanning at the system with the bar code and the system identifies the user and verifies the payment information so as to deliver a corresponding object. According to the invention, queuing application for the system service and payment can be carried out by using the terminal, thereby providing the service experience of convenient mobile phone-based queuing and payment for the user.

The present invention extends to methods, systems, and computer program products for using distributed queues in an overlay network. Embodiments of the invention can be used to replicate queue state (e.g., inserted and / or deleted messages) within an overlay network and can be used to continue a process at a different node within the overlay network based on replicated queue state. Accordingly, embodiments of the invention can be used to increase the availability of queue state, compensate for node failures within an overlay network, and promote replication of consistent queue state between nodes within an overlay network.

An egress traffic management system for a data communication system is disclosed. The egress traffic management system makes use of a hierarchical queue ID header paradigm that enables data packets to be directed for egress traffic management to either one of a plurality of assignable queues in a main egress queue module or to one of a plurality of distributed queue modules via a common queue of the main egress queue module. This behavior enables egress traffic management functionality and scale to be varied independently and in a cost-effective manner to meet evolving requirements of a data communications system.

The invention discloses a distributed queue processing method and system. The method comprises reading data from a queue server; processing the data; if the data processing failed, storing the data into a reprocessing data storage device for reprocessing. The failed data is stored through the system for subsequent reprocessing. Therefore, when data processing failure occurs, a sender does not need to push data to a queue again, and safety and reliability of the system can be further ensured, and interaction between the sender and the system can be saved.

The invention discloses a distributed queuing and calling management system of a telecom business office. The distributed queuing and calling system comprises a queuing and calling management center subsystem and a business office queuing and calling subsystem, wherein the queuing and calling management center subsystem comprises a center persistent storage module used for the storage of various configuration information, business data and monitoring data of a business office network, a first queuing and calling management module used for the centralized management of queuing machine configuration and analysis and monitoring of queuing business data, and a center command processing module used for receiving and sending of processed data; the business office queuing and calling subsystem comprises a client-side command message processing module used for reporting of data and receiving of commands, a second queuing and calling management module used for the receiving of the commands to update local configuration, and a local persistent storage module used for the storage of local configuration data and intermediate data. The distributed queuing and calling management system has the stability of a stand-alone system and further has the convenience and effectiveness of a center system through the design of a loosely-coupled architecture.

By utilizing IMPS technology and transient objects or object identifiers, a method and system can notify registered participants of changes in the status of those transient objects. One use of such technology is in the area of on-line auctions, but other uses include the general area of distributed queuing for an item of interest (or a subject of interest) and dispatching to similarly interested users, through transitive presence, information concerning corresponding transactions or actions.

The invention discloses a method and a system for performing distributed queue control on speech right in a push-to-talk over cellular (PoC) session. The system comprises a plurality of PoC user terminals participating in the PoC session and PoC servers that the PoC user terminals belong to. The method comprises the following steps that: when PoC users participating in the session belong to a plurality of PoC servers respectively, a speech request of each PoC user is saved in a local waiting queue of the PoC server that the PoC user belongs to, and the PoC servers are used to maintain respective local waiting queues respectively, and sequentially grant the speech right to the PoC users corresponding to the speech requests in the local waiting queue according to the global position identification of the speech request at the same time. The method and the system belong to the technical field of mobile communication, not only can meet the requirement of the PoC system on the waiting of the speech request, but also can overcome the disadvantages of speech right centralized control technology.

A method for automatically setting DQS (Distributed Queuing System) and DQ (Data Queuing) receiver reference voltages, the method including: using a delay string to measure a number of delay elements that match a DQS high time and a number of delay elements that match a DQS low time; wherein when the number of delay elements for the DQS low time is larger than the number of delay elements for the DQS high time, the reference voltage is decremented until the number of delay elements are equal; and wherein when the number of delay elements for the DQS low time is smaller than the number of delay elements for the DQS high time, the reference voltage is incremented until the number of delay elements are equal.

The embodiment of the invention provides a data acquisition method and device, an electronic device and a storage medium. The method comprises the following steps of: each processing module in the cluster can obtain the crawling request from the distributed queue; after crawling the data according to the obtained crawling request, the processing module can continue to package the link into a new crawling request if the link is still included in the data, and the new crawling request is delivered to the distributed queue, so that each processing module can crawl the data in parallel, and the crawling efficiency is improved.

High availability event forwarding can be obtained utilizing distributed queues in a server cluster. Each server can receive an event from a data system, such as a database or SAP™ system. Event queues exist on servers in the cluster can store an event until, for example, the event is delivered to a user or retrieved for processing. An event processor examines the load of each event queue and selects the event queue with the lightest load. The event processor generates an alias for the selected queue, such that a user, integration system, or client application does not need to know the identity of the physical queue storing the event, but only needs to refer to the ‘distributed queue’ or alias. After a physical queue is selected and an alias assigned, the event is forwarded to the selected queue.