Asynchronous Browser Event Queuing With Priority-Based In-Memory Queues
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing event monitoring systems in web browsers fail to prioritize and manage different types of events effectively, leading to the risk of high-importance events being lost or discarded due to queue overflow, as all events are treated equally and stored in a single queue.
Innovation Solution
Implementing a system that utilizes multiple in-memory queues with differentiated quality of service, where events are categorized based on type and priority, ensuring high-priority events are stored and delivered separately from low-priority events, using secure isolation techniques like sandboxing to protect data integrity and security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single queue is used to store all events, then the system structure is simple, but high-priority events may be lost due to queue overflow
Solution Approach 1:
The patent divides the single event queue into multiple priority-based queues (e.g., high-priority queue, medium-priority queue, low-priority queue). This segmentation allows different types of events to be stored separately, preventing low-priority events from displacing high-priority events during overflow conditions, thereby improving event delivery reliability while maintaining manageable system complexity.
2Ease of manufacture
If all events are treated equally in a single queue, then the implementation is simple, but event priority is not preserved
Solution Approach 1:
The patent applies local quality by treating different events differently based on their priority levels. Each queue is dedicated to specific priority levels, and events are routed to appropriate queues based on their importance. This ensures that event priority information is preserved and high-priority events receive preferential treatment in terms of processing and delivery.
3Reliability
If multiple queues with different priorities are implemented, then event priority is maintained, but system complexity increases
Solution Approach 1:
The patent implements dynamic queue management where the system can adaptively route events to appropriate priority queues based on real-time conditions. The queue management mechanism dynamically adjusts event routing decisions, allowing the system to maintain high-priority event delivery reliability while managing complexity through intelligent, adaptive control rather than rigid fixed-structure approaches.
4Ease of operation
If events are queued for synchronous processing, then processing is straightforward, but queue overflow causes event loss
Solution Approach 1:
The patent applies preliminary action by pre-establishing multiple priority queues with appropriate capacity allocations before event processing begins. This preliminary structure allows the system to handle varying event volumes without overflow, as events are already categorized and placed in queues sized appropriately for their priority levels, preventing event loss while maintaining processing simplicity.
Data Source
AI summary
A system and method are provided for queueing events based on interactions with computer applications for asynchronous consumption. The method includes obtaining events based on interactions with a web browser; and queueing the obtained events for each of the events. The queuing includes, for a given event: identifying, from amongst a plurality of in-memory queues based on the given event, an in-memory queue in which to queue the given event; and queuing the given event in the identified in-memory queue. The events queued in the queues of the plurality of in-memory queues are queued for asynchronous consumption.