Throughput fairness and capacity improvement of packet-switched networks through space-time scheduling

Emanuela B. Silva; Leonardo S. Cardoso; Tarcisio F. Maciel; Francisco R.P. Cavalcanti; Yuri C.B. Silva

Journal Article

Throughput fairness and capacity improvement of packet-switched networks through space-time scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3124 22-27

DOI: 10.1007/978-3-540-27824-5_4

0Citations

1Readers

Get full text

Abstract

This article discusses some performance issues about space-time scheduling applied to packet data shared channels. Beamforming adaptive antennas (AA) and Spatial Division Multiple Access (SDMA) strategies were evaluated through system-level simulations considering different scheduling algorithms. Throughput fairness among users is discussed and the best antenna and scheduling algorithm configurations considering both capacity and fairness are shown. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Silva, E. B., Cardoso, L. S., Maciel, T. F., Cavalcanti, F. R. P., & Silva, Y. C. B. (2004). Throughput fairness and capacity improvement of packet-switched networks through space-time scheduling. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3124, 22–27. https://doi.org/10.1007/978-3-540-27824-5_4

Throughput fairness and capacity improvement of packet-switched networks through space-time scheduling

Abstract

Cite

Register to see more suggestions