286 0

A Performance Analysis of Binary Exponential Backoff Algorithm in the Random Access Packet Networks

Title
A Performance Analysis of Binary Exponential Backoff Algorithm in the Random Access Packet Networks
Author
허선
Issue Date
2005-05
Publisher
SPRINGER-VERLAG BERLIN
Citation
Asian Simulation Conference; AsiaSim 2004: Systems Modeling and Simulation: Theory and Applications, Page. 270-278
Abstract
We analyze the performance of binary exponential backoff (BEB) algorithm under the slotted ALOHA protocol. When a node’s message which tries to reserve a channel is involved in a collision for the n th time, it chooses one of the next 2″ frames with equal probability and attempts the reservation again. We derive the expected access delay and throughput which is defined as the expected number of messages that reserve a channel in a frame. A simulation study shows that the system is stable if the number of request slots is more than 3 times of the arrival rate.
URI
https://link.springer.com/chapter/10.1007/978-3-540-30585-9_30https://repository.hanyang.ac.kr/handle/20.500.11754/110697
ISBN
978-3-540-24477-6
DOI
10.1007/978-3-540-30585-9_30
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE