Packet transmission using a blocked unmodified random multiple access stack-algorithm
type: Item
instance of: scholarly article
title: Packet transmission using a blocked unmodified random multiple access stack-algorithm
zbMATH Open document ID: 0613.94001
author: B. S. Tsybakov
author: S. P. Fedortsov
published in: Problems of Information Transmission
publication date: 1986-01-01T00:00:00Z
review text: We derive an upper bound on packet delay in a random multiple access system with an unmodified treelike algorithm. This bound is linear for low intensities of the incoming packet stream.
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 94A40
zbMATH DE Number: 3993441
zbMATH Keywords: upper bound on packet delay
zbMATH Keywords: random multiple access system
zbMATH Keywords: unmodified treelike algorithm
MaRDI profile type: Publication
Recommended article: An random multiple access algorithm with finite stack and packet loss
Recommended article: Q3904495
Recommended article: Packet delay in the case of a multiple-access stack algorithm
Recommended article: Random multiple access of ''impatient'' packets
Recommended article: Random multiple access of packets to a channel with errors
Recommended article: Analysis of a stack algorithm for random multiple-access communication
Recommended article: Random multiple access with known appearance times of successfully transmitted packets
Recommended article: Random multiple access system with impatient packets
Recommended article: Random multiple packet access: part-and-try algorithm
Recommended article: The number of packets transmitted by collision detect random access schemes
description: scientific article; zbMATH DE number 3993441