Article

Scalability of fork/join queueing networks with blocking

Authors:

Marc LelargeAuthors Info & Claims

SIGMETRICS '07: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Pages 133 - 144

https://doi.org/10.1145/1254882.1254898

Published: 12 June 2007 Publication History

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.

References

[1]

D. J. Abadi et al. The design of the borealis stream processing engine. In Proc. of CIDR, pages 277--289, 2005.

[2]

F. Baccelli, A. Chaintreau, Z. Liu, and A. Riabov. The one-to-many tcp overlay: a scalable and reliable multicast architecture. In Proc. IEEE INFOCOM, 2005.

[3]

F. Baccelli and D. Hong. Tcp is max-plus linear, and what it tells us on its throughput. In Proc. of SIGCOMM, pages 219--230, 2000.

Digital Library

[4]

F. Baccelli and Z. Liu. On the stability condition of a precedence-based queueing discipline. Adv. Appl. Prob., 21:883--887, 1989.

[5]

F. Baccelli and Z. Liu. On the execution of parallel programs on multiprocessor systems-a queuing theory approach. Journal of the ACM, 37(2):373--417, 1990.

Digital Library

[6]

F. Baccelli and Z. Liu. Comparison properties of stochastic decision free petri nets. IEEE Trans. on Automatic Control, 37:1905--1920, 1992.

[7]

D. Bhattacharyya, D. Towsley, and J. Kurose. The loss path multiplicity problem in multicast congestion control. In Proc. of IEEE INFOCOM, 1999.

[8]

A. Chaintreau. Processes of Interaction in Data Networks. PhD thesis, Ecole Normale Suprieure and Universit Paris 6, 2006.

[9]

A. Chaintreau, F. Baccelli, and C. Diot. Impact of network delay variations on multicast sessions with tcp-like congestion control. pages 1133--1142, 2001.

[10]

Y. Chawathe, S. McCanne, and E. Brewer. Rmx: Reliable multicast in heterogeneous networks. In Proc. of IEEE INFOCOM, 2000.

[11]

L. Chen, K. Reddy, and G. Agrawal. Gates: A gridbased middleware for processing distributed data streams. In Proc. of HPDC, 2004.

Digital Library

[12]

M. Cherniack et al. Scalable distributed stream processing. In Proc. of CIDR, 2003.

[13]

Y. Dallery, Z. Liu, and D. Towsley. Equivalence, reversibility, symmetry and concavity properties in fork/join queueing networks with blocking. Journal of the ACM, 41:903--943, 1994.

Digital Library

[14]

Y. Dallery, Z. Liu, and D. Towsley. Properties of fork/join queueing networks with blocking under various operating mechanisms. IEEE Transactions on Robotics and Automation, 13:503--518, 1997.

[15]

A. Das, J. Gehrke, and M. Riedewald. Approximate join processing over data streams. In Proc. ACM SIGMOD, 2003.

Digital Library

[16]

Z. Fu, X. Meng, and S. Lu. How bad tcp can perform in mobile adhoc networks. IEEE Symposium on Computers and Communications, 2002.

Digital Library

[17]

Z. Fu, X. Meng, and S. Lu. A transport protocol for supporting multimedia streaming in mobile ad hoc networks. IEEE journal on selected areas in communicatioins, 21(10):1615--1626, 2004.

Digital Library

[18]

J. Galambos. The Asymptotic Theory of Extreme Order Statistics. Wiley, NY, 1978.

[19]

P. Gibbons, B. Karp, Y. Ke, S. Nath, and S. Seshan. Irisnet: An architecture for a world-wide sensor web. IEEE Pervasive Computing, 2(4), 2003.

Digital Library

[20]

P. Hsiao, H. Kung, and K. Tan. Active delay control for tcp. In IEEE Globecom, 2001.

[21]

Y. Huang, W. Gong, and D. Towsley. Application layer relays for wireless 802.11 mesh networks. In Proc. of IEEE workshop WiMesh, pages 81--90, 2006.

[22]

N. Jain, L. Amini, H. Andrade, R. King, Y. Park, P. Selo, and C. Venkatramani. Design, implementation, and evaluation of the linear road benchmark on the stream processing core. In Proc. of SIGMOD, pages 431--442, 2006.

Digital Library

[23]

J. Jannotti, D. Gifford, K. Johnson, M. Kaashoek, and J. O. JR. Overcast: Reliable multicasting with an overlay network. In Proc. 4th USENIX OSDI, pages 197--212, 2000.

Digital Library

[24]

P. Jelenkovic, P. Momcilovic, and M. Squillante. Buffer scalability of wireless networks. In Proc. of IEEE Infocom, 2006.

[25]

G. Kwon and J. Byers. Roma: Reliable overlay multicast with loosely coupled tcp connections. In Proc. of IEEE INFOCOM, 2004.

[26]

J. Martin. Large tandem queueing networks with blocking. QUESTA, 41:45--72, 2002.

Digital Library

[27]

M. D. Mascolo, R. David, and Y. Dallery. Modeling and analysis of assembly systems with unreliable machines and finite buffers. 23(4):315--330, 1991.

[28]

P. Mehra and A. Zakhor. Tcp-based video streaming using receiver-driven bandwidth sharing. In Int'l Packet Video Workshop, 2003.

[29]

D. V. Schuehler. TCP Stream Processing at Gigabit Line Rates. PhD thesis, Department of Computer Science and Engineering, Washington University, 2004.

[30]

J. A. Sharp. Data Flow Computing. Ablex Publication Corp., 1991.

Digital Library

[31]

D. Simchi-Levi, P. Kaminsky, and E. Simchi-Levi. Designing and Managing the Supply Chain. McGraw-Hill/Irwin, second edition, 2002.

Digital Library

[32]

D. Stoyan. Comparison Methods for Queues and Other Stochastic Processes, 1983.

[33]

B. Wang, J. Kurose, P. Shenoy, and D. Towsley. Multimedia streaming via tcp: An analytic performance study. In Proc. of ACM Multimedia, 2004.

Digital Library

Cited By

Zeng YTan JXia C(2019)Fork and Join Queueing Networks with Heavy TailsACM SIGMETRICS Performance Evaluation Review10.1145/3308809.330887246:1(122-124)Online publication date: 17-Jan-2019
https://doi.org/10.1145/3308809.3308872
Wang WHarchol-Balter MJiang HScheller-Wolf ASrikant R(2019)Delay asymptotics and bounds for multitask parallel jobsQueueing Systems: Theory and Applications10.1007/s11134-018-09597-591:3-4(207-239)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s11134-018-09597-5
Zeng YChaintreau ATowsley DXia C(2018)Throughput Scalability Analysis of Fork-Join Queueing NetworksOperations Research10.1287/opre.2018.174866:6(1728-1743)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1287/opre.2018.1748
Show More Cited By

Index Terms

Scalability of fork/join queueing networks with blocking
1. General and reference
  1. Cross-computing tools and techniques
    1. Design
    2. Performance

Recommendations

Scalability of fork/join queueing networks with blocking
SIGMETRICS '07 Conference Proceedings

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 ...
A Necessary and Sufficient Condition for Throughput Scalability of Fork and Join Networks with Blocking
Performance evaluation review

Due to emerging applications such as cloud computing and big data analytics, modern information processing systems are growing increasingly large and complex. A critical issue concerns the throughput performance as the system grows in size. This paper ...
A Necessary and Sufficient Condition for Throughput Scalability of Fork and Join Networks with Blocking
SIGMETRICS '16: Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science

Due to emerging applications such as cloud computing and big data analytics, modern information processing systems are growing increasingly large and complex. A critical issue concerns the throughput performance as the system grows in size. This paper ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMETRICS '07: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

June 2007

398 pages

ISBN:9781595936394

DOI:10.1145/1254882

General Chair:
Leana Golubchik
University of Southern California, USA
,
Program Chairs:
Mostafa Ammar
Georgia Institute of Technology, USA
,
Mor Harchol-Balter
Carnegie Mellon University, USA

ACM SIGMETRICS Performance Evaluation Review Volume 35, Issue 1
SIGMETRICS '07 Conference Proceedings
June 2007
382 pages
ISSN:0163-5999
DOI:10.1145/1269899
Issue’s Table of Contents

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGMETRICS07

Sponsor:

SIGMETRICS07: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

June 12 - 16, 2007

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
566
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zeng YTan JXia C(2019)Fork and Join Queueing Networks with Heavy TailsACM SIGMETRICS Performance Evaluation Review10.1145/3308809.330887246:1(122-124)Online publication date: 17-Jan-2019
https://doi.org/10.1145/3308809.3308872
Wang WHarchol-Balter MJiang HScheller-Wolf ASrikant R(2019)Delay asymptotics and bounds for multitask parallel jobsQueueing Systems: Theory and Applications10.1007/s11134-018-09597-591:3-4(207-239)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s11134-018-09597-5
Zeng YChaintreau ATowsley DXia C(2018)Throughput Scalability Analysis of Fork-Join Queueing NetworksOperations Research10.1287/opre.2018.174866:6(1728-1743)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1287/opre.2018.1748
Zeng YTan JXia C(2018)Fork and Join Queueing Networks with Heavy TailsACM SIGMETRICS Performance Evaluation Review10.1145/3292040.321966846:1(122-124)Online publication date: 12-Jun-2018
https://dl.acm.org/doi/10.1145/3292040.3219668
Zeng YTan JXia CPsounis KAkella AWierman A(2018)Fork and Join Queueing Networks with Heavy TailsAbstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems10.1145/3219617.3219668(122-124)Online publication date: 12-Jun-2018
https://dl.acm.org/doi/10.1145/3219617.3219668
Zeng YChaintreau ATowsley DXia C(2016)A Necessary and Sufficient Condition for Throughput Scalability of Fork and Join Networks with BlockingACM SIGMETRICS Performance Evaluation Review10.1145/2964791.290147044:1(25-36)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/2964791.2901470
Zeng YChaintreau ATowsley DXia CAlouf SJean-Marie AHegde NProutière A(2016)A Necessary and Sufficient Condition for Throughput Scalability of Fork and Join Networks with BlockingProceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science10.1145/2896377.2901470(25-36)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/2896377.2901470
Gardner KZbarsky SDoroudi SHarchol-Balter MHyytia E(2015)Reducing Latency via Redundant RequestsACM SIGMETRICS Performance Evaluation Review10.1145/2796314.274587343:1(347-360)Online publication date: 15-Jun-2015
https://dl.acm.org/doi/10.1145/2796314.2745873
Gardner KZbarsky SDoroudi SHarchol-Balter MHyytia ELin BXu JSengupta SShah D(2015)Reducing Latency via Redundant RequestsProceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems10.1145/2745844.2745873(347-360)Online publication date: 15-Jun-2015
https://dl.acm.org/doi/10.1145/2745844.2745873
Thomasian A(2014)Analysis of Fork/Join and Related Queueing SystemsACM Computing Surveys10.1145/262891347:2(1-71)Online publication date: 25-Aug-2014
https://dl.acm.org/doi/10.1145/2628913
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten