Achieving Bounded Matching Delay and Maximized Throughput in Information Dissemination Management
The demand for high performance information dissemination is increasing in many applications, such as ecommerce and security alerting systems. These applications usually require that the desired information be matched between numerous sources and sinks based on established subscriptions in a timely manner while a maximized system throughput be achieved to find more matched results. Existing work primarily focuses on only one of the two requirements, either timeliness or throughput. This can lead to an unnecessarily underutilized system or poor guarantees on matching delays.