Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Journal on Sele...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Journal on Selected Areas in Communications
Article . 1991 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Article . 1991
Data sources: DBLP
versions View all 2 versions
addClaim

Queueing analysis of an integrated services TDM system using a matrix-analytic method

Authors: Oliver W. W. Yang; Jon W. Mark;

Queueing analysis of an integrated services TDM system using a matrix-analytic method

Abstract

A matrix-analytic method is used to analyze the queueing behavior of small time division multiplexing (TDM) integrated services systems. Such systems have priority services for time-critical traffics in which adjacent packets exhibit a strong interdependency. The TDM frame with a capacity of M packets is used to transmit the high-priority packets at every time step. Any unused capacity is utilized to transmit low-priority packets. The system can be modeled as a discrete-time system with a fluctuating number of servers for the low-priority packets. Because the number of servers is small and adjacent packets are dependent, the birth-and-death analysis is not appropriate. An algorithm, based on a modification of Neuts' method, is used to determine the boundary points required in the queuing analysis. Numerical results for two integrated services systems, each with different characteristics, are presented to demonstrate the feasibility of the analysis method and the computational algorithm. >

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    14
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
14
Average
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!