Analysis of balanced fork-join queueing networks
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Credit-based flow control for ATM networks
IEEE Network: The Magazine of Global Internetworking
Departure process in a mixed fork-join synchronization network
Computers & Mathematics with Applications
A latency simulator for many-core systems
Proceedings of the 44th Annual Simulation Symposium
| Hi-index | 0.09 |
Credit-based flow control schemes are a commonly used means of preventing buffer overflow in high-speed networks spanning a local area. Fibre Channel, a widely-used storage area networking technology, and InfiniBand, a recently developed system area network technology, are examples of two network technologies that employ credit-based flow control. With credit-based flow control, the receiver sends credits to the sender to indicate the availability of receive buffers; the sender waits for credits before transmitting messages to the receiver. We present two models of credit-based flow control operation. In particular, we consider a fork-join queueing system with two input queues; the message population feeds one queue and the credit population the other. We consider the case of bulk message arrivals and single arrivals drawn from a finite population. Our analysis yields stationary probability distributions for message queue length and number of available credits. We provide equations for mean message queue length, mean number of credits, throughput, and mean message waiting time.