A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Achieving Bounded Matching Delay and Maximized Throughput in Information Dissemination Management
2011
IEEE Transactions on Network and Service 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
doi:10.1109/tnsm.2011.012111.00004
fatcat:l6bjwze4ljhgll33jmbtuglufe