Massively parallel priority queue for high-speed switches and routers

Research output: Chapter in Book/Report/Conference proceedingChapter or book articleProfessional

1 Citation (Scopus)

Abstract

The need for better quality of service is growing as new quality sensitive services are becoming more and more important in data networks. The key element in providing quality-of-service or grade-of-service in packet networks is deciding when or in what order the incoming packets should depart the system. In other words the departing packets have to be somehow scheduled. Implementing this scheduling becomes harder and harder as line-speeds and number items to schedule increases. One way to implement the scheduling function is to use a priority queue that can be realised by using simple and scalable heap data structure. The problem is that traditional sequential heap cannot be made fast enough. In this paper a massively parallel system based on set of heaps is presented. It will be shown that such system can be scaled to support very large priority queues at STM-256 speeds and beyond.
Original languageEnglish
Title of host publicationAdvances in Communications and Software Technologies
PublisherWSEAS Press
Pages71-76
ISBN (Print)960-8052-718
Publication statusPublished - 2002
MoE publication typeNot Eligible

Fingerprint

Routers
Quality of service
Scheduling
Switches
Packet networks
Data structures

Keywords

  • Ip routers
  • packet switches
  • parallel heap
  • priority queue

Cite this

Seppänen, K. (2002). Massively parallel priority queue for high-speed switches and routers. In Advances in Communications and Software Technologies (pp. 71-76). WSEAS Press.
Seppänen, Kari. / Massively parallel priority queue for high-speed switches and routers. Advances in Communications and Software Technologies. WSEAS Press, 2002. pp. 71-76
@inbook{8250b751d6fb4692b7472271aa75bf06,
title = "Massively parallel priority queue for high-speed switches and routers",
abstract = "The need for better quality of service is growing as new quality sensitive services are becoming more and more important in data networks. The key element in providing quality-of-service or grade-of-service in packet networks is deciding when or in what order the incoming packets should depart the system. In other words the departing packets have to be somehow scheduled. Implementing this scheduling becomes harder and harder as line-speeds and number items to schedule increases. One way to implement the scheduling function is to use a priority queue that can be realised by using simple and scalable heap data structure. The problem is that traditional sequential heap cannot be made fast enough. In this paper a massively parallel system based on set of heaps is presented. It will be shown that such system can be scaled to support very large priority queues at STM-256 speeds and beyond.",
keywords = "Ip routers, packet switches, parallel heap, priority queue",
author = "Kari Sepp{\"a}nen",
note = "Project code: T1SU00011",
year = "2002",
language = "English",
isbn = "960-8052-718",
pages = "71--76",
booktitle = "Advances in Communications and Software Technologies",
publisher = "WSEAS Press",
address = "Greece",

}

Seppänen, K 2002, Massively parallel priority queue for high-speed switches and routers. in Advances in Communications and Software Technologies. WSEAS Press, pp. 71-76.

Massively parallel priority queue for high-speed switches and routers. / Seppänen, Kari.

Advances in Communications and Software Technologies. WSEAS Press, 2002. p. 71-76.

Research output: Chapter in Book/Report/Conference proceedingChapter or book articleProfessional

TY - CHAP

T1 - Massively parallel priority queue for high-speed switches and routers

AU - Seppänen, Kari

N1 - Project code: T1SU00011

PY - 2002

Y1 - 2002

N2 - The need for better quality of service is growing as new quality sensitive services are becoming more and more important in data networks. The key element in providing quality-of-service or grade-of-service in packet networks is deciding when or in what order the incoming packets should depart the system. In other words the departing packets have to be somehow scheduled. Implementing this scheduling becomes harder and harder as line-speeds and number items to schedule increases. One way to implement the scheduling function is to use a priority queue that can be realised by using simple and scalable heap data structure. The problem is that traditional sequential heap cannot be made fast enough. In this paper a massively parallel system based on set of heaps is presented. It will be shown that such system can be scaled to support very large priority queues at STM-256 speeds and beyond.

AB - The need for better quality of service is growing as new quality sensitive services are becoming more and more important in data networks. The key element in providing quality-of-service or grade-of-service in packet networks is deciding when or in what order the incoming packets should depart the system. In other words the departing packets have to be somehow scheduled. Implementing this scheduling becomes harder and harder as line-speeds and number items to schedule increases. One way to implement the scheduling function is to use a priority queue that can be realised by using simple and scalable heap data structure. The problem is that traditional sequential heap cannot be made fast enough. In this paper a massively parallel system based on set of heaps is presented. It will be shown that such system can be scaled to support very large priority queues at STM-256 speeds and beyond.

KW - Ip routers

KW - packet switches

KW - parallel heap

KW - priority queue

UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-4944248937&partnerID=MN8TOARS

M3 - Chapter or book article

SN - 960-8052-718

SP - 71

EP - 76

BT - Advances in Communications and Software Technologies

PB - WSEAS Press

ER -

Seppänen K. Massively parallel priority queue for high-speed switches and routers. In Advances in Communications and Software Technologies. WSEAS Press. 2002. p. 71-76