Cathy H. Xia
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.
- D. J. Abadi et al. The design of the borealis stream processing engine. In Proc. of CIDR, pages 277--289, 2005.Google Scholar
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- F. Baccelli and Z. Liu. On the stability condition of a precedence-based queueing discipline. Adv. Appl. Prob., 21:883--887, 1989.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- F. Baccelli and Z. Liu. Comparison properties of stochastic decision free petri nets. IEEE Trans. on Automatic Control, 37:1905--1920, 1992.Google ScholarCross Ref
- D. Bhattacharyya, D. Towsley, and J. Kurose. The loss path multiplicity problem in multicast congestion control. In Proc. of IEEE INFOCOM, 1999.Google ScholarCross Ref
- A. Chaintreau. Processes of Interaction in Data Networks. PhD thesis, Ecole Normale Suprieure and Universit Paris 6, 2006.Google Scholar
- A. Chaintreau, F. Baccelli, and C. Diot. Impact of network delay variations on multicast sessions with tcp-like congestion control. pages 1133--1142, 2001.Google Scholar
- Y. Chawathe, S. McCanne, and E. Brewer. Rmx: Reliable multicast in heterogeneous networks. In Proc. of IEEE INFOCOM, 2000.Google ScholarCross Ref
- L. Chen, K. Reddy, and G. Agrawal. Gates: A gridbased middleware for processing distributed data streams. In Proc. of HPDC, 2004. Google ScholarDigital Library
- M. Cherniack et al. Scalable distributed stream processing. In Proc. of CIDR, 2003.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- A. Das, J. Gehrke, and M. Riedewald. Approximate join processing over data streams. In Proc. ACM SIGMOD, 2003. Google ScholarDigital Library
- Z. Fu, X. Meng, and S. Lu. How bad tcp can perform in mobile adhoc networks. IEEE Symposium on Computers and Communications, 2002. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. Galambos. The Asymptotic Theory of Extreme Order Statistics. Wiley, NY, 1978.Google Scholar
- 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. Google ScholarDigital Library
- P. Hsiao, H. Kung, and K. Tan. Active delay control for tcp. In IEEE Globecom, 2001.Google Scholar
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- P. Jelenkovic, P. Momcilovic, and M. Squillante. Buffer scalability of wireless networks. In Proc. of IEEE Infocom, 2006.Google ScholarCross Ref
- G. Kwon and J. Byers. Roma: Reliable overlay multicast with loosely coupled tcp connections. In Proc. of IEEE INFOCOM, 2004.Google Scholar
- J. Martin. Large tandem queueing networks with blocking. QUESTA, 41:45--72, 2002. Google ScholarDigital Library
- 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.Google Scholar
- P. Mehra and A. Zakhor. Tcp-based video streaming using receiver-driven bandwidth sharing. In Int'l Packet Video Workshop, 2003.Google Scholar
- D. V. Schuehler. TCP Stream Processing at Gigabit Line Rates. PhD thesis, Department of Computer Science and Engineering, Washington University, 2004.Google Scholar
- J. A. Sharp. Data Flow Computing. Ablex Publication Corp., 1991. Google ScholarDigital Library
- D. Simchi-Levi, P. Kaminsky, and E. Simchi-Levi. Designing and Managing the Supply Chain. McGraw-Hill/Irwin, second edition, 2002. Google ScholarDigital Library
- D. Stoyan. Comparison Methods for Queues and Other Stochastic Processes, 1983.Google Scholar
- B. Wang, J. Kurose, P. Shenoy, and D. Towsley. Multimedia streaming via tcp: An analytic performance study. In Proc. of ACM Multimedia, 2004. Google ScholarDigital Library
Index Terms
- Scalability of fork/join queueing networks with blocking
Recommendations
Scalability of fork/join queueing networks with blocking
SIGMETRICS '07: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systemsThis 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 reviewDue 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 ScienceDue 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