Processor-sharing and random-service queues with semi-Markovian arrivals

DOI10.1239/JAP/1118777183zbMath1077.60071OpenAlexW1987585619MaRDI QIDQ5697596

Hideaki Takagi, De-An Wu

Publication date: 18 October 2005

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1118777183

zbMATH Keywords

semi-Markov arrival process

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov renewal processes, semi-Markov processes (60K15)

Related Items (1)

Processor sharing: a survey of the mathematical theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Processor-sharing queues: Some progress in analysis
• The sojourn time in the GI/M/1 queue by processor sharing
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• On processor sharing and random service
• Stationary Waiting-Time Distributions for Single-Server Queues
• A Class of Data Traffic Processes-Covariance Function Characterization and Related Queuing Results
• The gi/m/1 processor-sharing queue and its heavy traffic analysis
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• A QUEUEING MODEL WITH INPUT OF MPEG FRAME SEQUENCE AND INTERFERING TRAFFIC
• Queues with semi-Markovian arrivals
• Waiting Time Distributions for Processor-Sharing Systems
• The single server queue with Poisson input and semi-Markov service times

This page was built for publication: Processor-sharing and random-service queues with semi-Markovian arrivals