Scalability of fork/join queueing networks with blocking

Authors:
Cathy H. Xia;Zhen Liu;Don Towsley;Marc Lelarge
Affiliations:
IBM T.J. Watson Research Center;IBM T.J. Watson Research Center;University of Massachusetts;INRIA & Ecole Normale Superieure
Venue:
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2007

Citing 14
Cited 3

Data flow computing

Data flow computing
On the execution of parallel programs on multiprocessor systems—a queuing theory approach

Journal of the ACM (JACM)
Equivalence, reversibility, symmetry and concavity properties in fork-join queuing networks with blocking

Journal of the ACM (JACM)
TCP is max-plus linear and what it tells us on its throughput

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Large Tandem Queueing Networks with Blocking

Queueing Systems: Theory and Applications
How Bad TCP Can Perform In Mobile Ad Hoc Networks

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Approximate join processing over data streams

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Multimedia streaming via TCP: an analytic performance study

Proceedings of the 12th annual ACM international conference on Multimedia
GATES: A Grid-Based Middleware for Processing Distributed Data Streams

HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Designing And Managing The Supply Chain

Designing And Managing The Supply Chain
Design, implementation, and evaluation of the linear road bnchmark on the stream processing core

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Overcast: reliable multicasting with on overlay network

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
IrisNet: An Architecture for a Worldwide Sensor Web

IEEE Pervasive Computing
A transport protocol for supporting multimedia streaming in mobile ad hoc networks

IEEE Journal on Selected Areas in Communications

Sharpness, a tight condition for throughput scalability

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Sharpness: A Tight Condition for Scalability

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Per-flow optimal service selection for Web services based processes

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates how the through put of a general fork-join queueing network with blocking behaves as the number of nodes increases to infinity while the processing speed and buffer space of each node stay unchanged. The problem is motivated by applications arising from distributed systems and computer networks. One example is large-scale distributed stream processing systems where TCP is used as the transport protocol for data transfer in between processing components. Other examples include reliable multicast in overlay networks, and reliable data transfer in ad hoc networks. Using an analytical approach, the paper establishes bounds on the asymptotic throughput of such a network. For a subclass of networks which are balanced, we obtain sufficient conditions under which the network stays scalable in the sense that the throughput is lower bounded by a positive constant as the network size increases. Necessary conditions of throughput scalability are derived for general networks. The special class of series-parallel networks is then studied in greater detail, where the asymptotic behavior of the throughput is characterized.