FINE: A multicast scheduling algorithm for high-speed ATM switches

M. Gamvrili, N. Papazaharias, K. Chondropoulos, D. N. Serpanos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

High-speed ATM switches mostly implement the memory architecture of advanced input queuing for unicast traffic. When handling multicast traffic this is infeasible due to the high cost it inserts. A set of multicast scheduling algorithms implementing input queuing has been proposed in the past. In this paper we present a new multicast scheduling algorithm, FINE, that maintains multiple queues for incoming packets in an M × N switch, a total of 2N - 1 queues. FINE provides improved characteristics over alternatives as to the throughput it achieves and the fairness it ensures. In addition, it presents suppleness in keeping with the system's properties and its applications features.

Original languageEnglish
Title of host publicationProceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages343-346
Number of pages4
ISBN (Print)0780382927, 9780780382923
DOIs
Publication statusPublished - 2003
Externally publishedYes
Event3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003 - Darmstadt, Germany
Duration: 14 Dec 200317 Dec 2003

Other

Other3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003
CountryGermany
CityDarmstadt
Period14/12/0317/12/03

Fingerprint

Automatic teller machines
Scheduling algorithms
Switches
Memory architecture
Throughput
Costs

Keywords

  • Asynchronous transfer mode
  • Memory architecture
  • Multicast algorithms
  • Packet switching
  • Scheduling algorithm
  • Switches
  • Telecommunication traffic
  • Throughput
  • Traffic control
  • Unicast

ASJC Scopus subject areas

  • Signal Processing

Cite this

Gamvrili, M., Papazaharias, N., Chondropoulos, K., & Serpanos, D. N. (2003). FINE: A multicast scheduling algorithm for high-speed ATM switches. In Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003 (pp. 343-346). [1341128] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISSPIT.2003.1341128

FINE : A multicast scheduling algorithm for high-speed ATM switches. / Gamvrili, M.; Papazaharias, N.; Chondropoulos, K.; Serpanos, D. N.

Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003. Institute of Electrical and Electronics Engineers Inc., 2003. p. 343-346 1341128.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gamvrili, M, Papazaharias, N, Chondropoulos, K & Serpanos, DN 2003, FINE: A multicast scheduling algorithm for high-speed ATM switches. in Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003., 1341128, Institute of Electrical and Electronics Engineers Inc., pp. 343-346, 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003, Darmstadt, Germany, 14/12/03. https://doi.org/10.1109/ISSPIT.2003.1341128
Gamvrili M, Papazaharias N, Chondropoulos K, Serpanos DN. FINE: A multicast scheduling algorithm for high-speed ATM switches. In Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 343-346. 1341128 https://doi.org/10.1109/ISSPIT.2003.1341128
Gamvrili, M. ; Papazaharias, N. ; Chondropoulos, K. ; Serpanos, D. N. / FINE : A multicast scheduling algorithm for high-speed ATM switches. Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003. Institute of Electrical and Electronics Engineers Inc., 2003. pp. 343-346
@inproceedings{d308958fdc254f83a2a5828d090be82f,
title = "FINE: A multicast scheduling algorithm for high-speed ATM switches",
abstract = "High-speed ATM switches mostly implement the memory architecture of advanced input queuing for unicast traffic. When handling multicast traffic this is infeasible due to the high cost it inserts. A set of multicast scheduling algorithms implementing input queuing has been proposed in the past. In this paper we present a new multicast scheduling algorithm, FINE, that maintains multiple queues for incoming packets in an M × N switch, a total of 2N - 1 queues. FINE provides improved characteristics over alternatives as to the throughput it achieves and the fairness it ensures. In addition, it presents suppleness in keeping with the system's properties and its applications features.",
keywords = "Asynchronous transfer mode, Memory architecture, Multicast algorithms, Packet switching, Scheduling algorithm, Switches, Telecommunication traffic, Throughput, Traffic control, Unicast",
author = "M. Gamvrili and N. Papazaharias and K. Chondropoulos and Serpanos, {D. N.}",
year = "2003",
doi = "10.1109/ISSPIT.2003.1341128",
language = "English",
isbn = "0780382927",
pages = "343--346",
booktitle = "Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - FINE

T2 - A multicast scheduling algorithm for high-speed ATM switches

AU - Gamvrili, M.

AU - Papazaharias, N.

AU - Chondropoulos, K.

AU - Serpanos, D. N.

PY - 2003

Y1 - 2003

N2 - High-speed ATM switches mostly implement the memory architecture of advanced input queuing for unicast traffic. When handling multicast traffic this is infeasible due to the high cost it inserts. A set of multicast scheduling algorithms implementing input queuing has been proposed in the past. In this paper we present a new multicast scheduling algorithm, FINE, that maintains multiple queues for incoming packets in an M × N switch, a total of 2N - 1 queues. FINE provides improved characteristics over alternatives as to the throughput it achieves and the fairness it ensures. In addition, it presents suppleness in keeping with the system's properties and its applications features.

AB - High-speed ATM switches mostly implement the memory architecture of advanced input queuing for unicast traffic. When handling multicast traffic this is infeasible due to the high cost it inserts. A set of multicast scheduling algorithms implementing input queuing has been proposed in the past. In this paper we present a new multicast scheduling algorithm, FINE, that maintains multiple queues for incoming packets in an M × N switch, a total of 2N - 1 queues. FINE provides improved characteristics over alternatives as to the throughput it achieves and the fairness it ensures. In addition, it presents suppleness in keeping with the system's properties and its applications features.

KW - Asynchronous transfer mode

KW - Memory architecture

KW - Multicast algorithms

KW - Packet switching

KW - Scheduling algorithm

KW - Switches

KW - Telecommunication traffic

KW - Throughput

KW - Traffic control

KW - Unicast

UR - http://www.scopus.com/inward/record.url?scp=84948156007&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948156007&partnerID=8YFLogxK

U2 - 10.1109/ISSPIT.2003.1341128

DO - 10.1109/ISSPIT.2003.1341128

M3 - Conference contribution

AN - SCOPUS:84948156007

SN - 0780382927

SN - 9780780382923

SP - 343

EP - 346

BT - Proceedings of the 3rd IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2003

PB - Institute of Electrical and Electronics Engineers Inc.

ER -