JOURNAL ARTICLE

On Bandwidth Allocation for Demand-Assignment Multiple Access Systems

Abstract

Demand-assignment multiple access is an efficient dynamic bandwidth allocation protocol based on resource reservation on-demand for a wide range of wireless scenarios. The use of wireless networks, especially those satellite-based, to transport Internet traffic has increased. Since Internet traffic is expected to be bursty due to its self-similar nature, the correct planning of the necessary bandwidth of these networks becomes very complex. In this paper, an accurate estimative of the bandwidth required by these systems taking into account traffic self-similarity is introduced.

Keywords:
Computer science Computer network Dynamic bandwidth allocation Bandwidth (computing) Bandwidth allocation Reservation Channel allocation schemes The Internet Wireless Resource allocation Wireless network Bandwidth management Telecommunications

Metrics

2
Cited By
0.00
FWCI (Field Weighted Citation Impact)
13
Refs
0.41
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Network Traffic and Congestion Control
Physical Sciences →  Computer Science →  Computer Networks and Communications
Wireless Communication Networks Research
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Wireless Network Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

BOOK-CHAPTER

demand assignment multiple access

Martin H. Weik

Year: 2000 Pages: 383-383
DISSERTATION

Capacity allocations for demand assignment multiple access systems.

Kevin Wong

University:   uO Research (University of Ottawa) Year: 1984
JOURNAL ARTICLE

Circuit switched demand assignment multiple access

T.T. Ha

Journal:   Telematics and Informatics Year: 1986 Vol: 3 (1)Pages: 11-24
BOOK-CHAPTER

Multiple-Access and Demand-Assignment Techniques

American Institute of Aeronautics and Astronautics eBooks Year: 1971 Pages: 493-506
© 2026 ScienceGate Book Chapters — All rights reserved.