A generalized analysis of message delay in STDMA

Lee, H. W.; Liang, Lung-Sing

doi:10.1016/0169-7552(90)90115-9

Cited by 7 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Expressions (7.a-c) for the probability generating function of the buffer contents are well-known results, and have been quoted in the literature on various occasions (e.g. see [6][7][8], [15][16]). …”

Section: Infinite-buffer Resultsmentioning

confidence: 99%

Accurate Approximation of the Cell Loss Ratio in ATM Buffers with Multiple Servers

Steyaert

Bruneel

1995

Performance Modelling and Evaluation of ATM Networks

View full text Add to dashboard Cite

In this paper, we focus attention on discrete-time buffer models with general independent arrivals and multiple output links, a class of queueing models which is well-suited to address performance issues in slotted systems, such as ATM. Calculating the Cell Loss Ratio (CLR), a key performance measure whenever finite-capacity buffers are involved, requires solving a set of linear equations, the size of which depends on the buffer capacity J(. Therefore, the CLR is often approximated by some appropriate tail probability of the buffer contents in the corresponding infinite-capacity queueing model; however, how these two quantities are related, is generally not very well known. In this paper, using a generating-functions approach,. we establish an exact relation between the distribution of the number of cells lost pelf slot in a finite-capacity queue, and the distribution of the buffer contents in the corresponding iniinite-capacity queue. This eventually leads to an extremely accurate dosed-form approximation for the CLR in the finite-buffer system, that is easily evaluated.

show abstract

Section: Infinite-buffer Resultsmentioning

confidence: 99%

Accurate Approximation of the Cell Loss Ratio in ATM Buffers with Multiple Servers

Steyaert

Bruneel

1995

Performance Modelling and Evaluation of ATM Networks

View full text Add to dashboard Cite

show abstract

“…Capacity in the form of b ≥ 1 time slots per frame is allocated to each traffic source sharing the channel, and one fixed-length packet is transmitted per time slot. For a particular traffic source, Reference [31] gives an exact message delay analysis for generic arrival and message length distributions. An infinite capacity buffer is assumed with FCFS queueing at the traffic source.…”

Section: A Secondary Voip Friendliness Using An Stdma Message Delay mentioning

confidence: 99%

“…M(z) is the probability generating function of the number of packets per message,m, with mean µ, and b is the number of slots per frame assigned to the traffic source. Reference [31] also obtains the message delay analysis based on the queueing length result. As shown in Figure 17, the total message delay is divided into three components, i.e.,…”

Section: A Secondary Voip Friendliness Using An Stdma Message Delay mentioning

confidence: 99%

“…In [31], a message delay analysis was presented for a synchronous time division multiple access (STDMA) system for multiple consecutive outputs and multi-packet messages. In this model, time is divided into frames, each consisting of T F time slots.…”

Section: A Secondary Voip Friendliness Using An Stdma Message Delay mentioning

confidence: 99%

“…17. Components of STDMA Message Delay [31] the transmission of the tagged message, which is given bỹ…”

Section: A Secondary Voip Friendliness Using An Stdma Message Delay mentioning

confidence: 99%

See 2 more Smart Citations

Secondary VoIP Capacity in Opportunistic Spectrum Access Networks with Friendly Scheduling

Hassanein

Todd

2016

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

In conventional cognitive radio, the primary network usually remains unchanged. In some cases however, the primary network operator may wish to accommodate secondary user access. In this paper we assess the secondary user VoIP capacity when primary basestation scheduling is designed to be secondary network friendly. Friendliness is measured by the number of connections that can be supported subject to typical quality of service constraints in the presence of delay tolerant primary traffic. An offline scheduler is first derived that maximizes friendliness using an integer linear program formulation. We show that this schedule can be found using a minimum cost flow graph construction in time complexity that is polynomial in the number of time slots. Two online scheduling algorithms are then compared that achieve various levels of friendliness. The first algorithm operates by having the primary network temporally shape its residual capacity subject to satisfying its own packet deadline constraints. The second algorithm assumes virtual secondary calls and applies scheduling to both primary traffic and virtual secondary traffic. Results are presented for a variety of parameters that show the degree to which friendly scheduling can improve secondary user VoIP capacity compared to non-friendly primary scheduling 1 .

show abstract

Real-time communications using TDMA-based multi-access protocol

Simonot¹,

Song

1997

Computer Communications

View full text Add to dashboard Cite

A generalized analysis of message delay in STDMA

Cited by 7 publications

References 14 publications

Accurate Approximation of the Cell Loss Ratio in ATM Buffers with Multiple Servers

Accurate Approximation of the Cell Loss Ratio in ATM Buffers with Multiple Servers

Secondary VoIP Capacity in Opportunistic Spectrum Access Networks with Friendly Scheduling

Real-time communications using TDMA-based multi-access protocol

Contact Info

Product

Resources

About