Work

Finite and infinite QBD chains: a simple and unifying algorithmic approach

Year: 2002

Type: conference-paper

Source: IEEE Conference on Computer Communications (INFOCOM)

DOI: 10.1109/infcom.1997.631131

Authors: N. Akar, K. Sohraby

Institution: University of Missouri–Kansas City

Language: English

Topic: Advanced Queuing Theory Analysis

Subfield: Management Information Systems

Field: Business, Management and Accounting

Domain: Social Sciences

Open Access status: closed

OpenAlex ID: W2130189455

FWCI: 3.692

Cites: 14

Cited by: 34

Related to: 10