Interrelation of characteristics of blocked RMA stack algorithms

Authors:
G. S. Evseev;A. M. Turlikov
Affiliations:
St. Petersburg State University of Aerospace Instrumentation, Russia;St. Petersburg State University of Aerospace Instrumentation, Russia
Venue:
Problems of Information Transmission
Year:
2007

Citing 0
Cited 3

SICTA Modifications with Single Memory Location and Resistant to Cancellation Errors

NEW2AN '08 / ruSMART '08 Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Conflict-resolving tree algorithm stable to incomplete interference damping

Automation and Remote Control
A practical tree algorithm with successive interference cancellation for delay reduction in IEEE 802.16 networks

ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method to analyze the duration of collision resolution for blocked RMA stack algorithms is proposed. Simple formulas are obtained that express the average length of a collision resolution interval for the modified (frugal) algorithm in a noisy and in a noiseless channel, as well as for the basic algorithm in a noisy channel, through the corresponding parameters for the basic algorithm in a noiseless channel. From estimates of the throughput of the basic algorithm in a noiseless channel, estimates for the throughput in the other three cases are directly constructed.