Queueing network models of credit-based flow control

DOI10.1016/J.CAMWA.2005.04.008zbMATH Open1129.90311OpenAlexW2027361353MaRDI QIDQ814310FDOQ814310

Authors: Muhammad El-Taha, John R. Heath 

Publication date: 6 February 2006

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2005.04.008

Recommendations

• Flow control in high-speed communication networks
• scientific article; zbMATH DE number 1263988
• A two-server queueing system with periodic and credit-based server availabilities
• scientific article; zbMATH DE number 3882174
• Models and analysis of queueing networks

zbMATH Keywords

Performance evaluationBulk-arrival processCredit-based flow controlFibre ChannelFork-join queuesInfiniBand

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Stochastic network models in operations research (90B15)

Cites Work

• Title not available (Why is that?)

Cited In (9)

• Flow control in ServerNet\circledR\ clusters
• Modeling queueing systems using hierarchical control flow graph models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization of the departure process in a closed fork-join synchronization network
• Unified Analysis of Local Flow Control Mechanisms in Message-Switched Networks
• A two-server queueing system with periodic and credit-based server availabilities
• Departure process in a mixed fork-join synchronization network

This page was built for publication: Queueing network models of credit-based flow control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814310)