skip to main content
research-article

Per-Flow Queue Management with Succinct Priority Indexing Structures for High Speed Packet Scheduling

Published: 01 July 2013 Publication History

Abstract

Priority queues are essential building blocks for implementing advanced per-flow service disciplines and hierarchical quality-of-service at high-speed network links. Scalable priority queue implementation requires solutions to two fundamental problems. The first is to sort queue elements in real time at ever increasing line speeds (e.g., at OC-768 rates). The second is to store a huge number of packets (e.g., millions of packets). In this paper, we propose novel solutions by decomposing the problem into two parts, a succinct priority index (PI) in SRAM that can efficiently maintain a real-time sorting of priorities, coupled with a DRAM-based implementation of large packet buffers. In particular, we propose three related novel succinct PI data structures for implementing high-speed PIs: a PI, a counting priority index (CPI), and a pipelined counting priority index (pCPI). We show that all three structures can be very compactly implemented in SRAM using only $(\Theta (U))$ space, where $(U)$ is the size of the universe required to implement the priority keys (time stamps). We also show that our proposed PI structures can be implemented very efficiently as well by leveraging hardware-optimized instructions that are readily available in modern 64-bit processors. The operations on the PI and CPI structures take $(\Theta (\log_W U))$ time complexity, where $(W)$ is the processor word length (i.e., $(W = 64)$). Alternatively, operations on the pCPI structure take amortized constant time with only $(\Theta (\log_W U))$ pipeline stages (e.g., only four pipeline stages for $(U = 16)$ million). Finally, we show the application of our proposed PI structures for the scalable management of large packet buffers at line speeds. The pCPI structure can be implemented efficiently in high-performance network processing applications such as advanced per-flow scheduling with quality-of-service guarantee.

Cited By

View all
  1. Per-Flow Queue Management with Succinct Priority Indexing Structures for High Speed Packet Scheduling

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Parallel and Distributed Systems
    IEEE Transactions on Parallel and Distributed Systems  Volume 24, Issue 7
    July 2013
    212 pages

    Publisher

    IEEE Press

    Publication History

    Published: 01 July 2013

    Author Tags

    1. Complexity theory
    2. Data structures
    3. Indexing
    4. Priority queues
    5. Program processors
    6. Radiation detectors
    7. Random access memory
    8. per-flow scheduling
    9. pipelined data structure

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 05 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media