The maximum concurrent flow problem
Journal of the ACM (JACM)
Introduction to algorithms
Approximation algorithms for multicommodity flow and shop scheduling problems
Approximation algorithms for multicommodity flow and shop scheduling problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
Chain: operator scheduling for memory minimization in data stream systems
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Gigascope: a stream database for network applications
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal on Very Large Data Bases
Operator placement for in-network stream query processing
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distributed operation in the Borealis stream processing engine
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A multicommodity flow model for distributed stream processing
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Load shedding in a data stream manager
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Operator scheduling in a data stream manager
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Remembrance of streams past: overload-sensitive management of archived streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A simple local-control approximation algorithm for multicommodity flow
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A multi-commodity flow approach to maximising utility in linked market-based grids
Proceedings of the 5th international workshop on Middleware for grid computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference
| Hi-index | 0.00 |
Distributed stream processing architecture has emerged as appealing solution to coping with the analysis of large amount of data from dispersed sources. A fundamental problem in such stream processing systems is how to best utilize the available resources so that the overall system performance is optimized. We consider a distributed stream processing system that consists of a network of cooperating servers, collectively providing processing services for multiple data streams. Each stream is required to complete a series of operations on various servers. We assume all servers have finite computing resources and all communication links have finite available bandwidth. The problem is to find distributed schemes to allocate the limited computing resources as well as the communication bandwidth in the system so as to achieve a maximum concurrent throughput for all output streams. We present a generalized multicommodity flow model for the above problem. We develop a distributed resource allocation algorithm that guarantees the optimality. We also provide detailed analysis on the complexity of the algorithm and demonstrate the performance using numerical experiments.