Tradeoffs for packet classification

Anja Feldmann, Shanmugavelayutham Muthukrishnan

    Research output: Contribution to journalConference article

    Abstract

    We present an algorithmic framework for solving the packet classification problem that allows various access time vs. memory tradeoffs. It reduces the multi-dimensional packet classification problem to solving a few instances of the one-dimensional IP lookup problem. It gives the best known lookup performance with moderately large memory space. Furthermore, it efficiently supports a reasonable number of additions and deletions to the rulesets without degrading the lookup performance. We perform a thorough experimental study of the tradeoffs for the two-dimensional packet classification problem on rulesets derived from datasets collected from AT&T WorldNet, an Internet Service Provider.

    Original languageEnglish (US)
    Pages (from-to)1193-1202
    Number of pages10
    JournalProceedings - IEEE INFOCOM
    Volume3
    StatePublished - Jan 1 2000
    Event19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications' - Tel Aviv, Isr
    Duration: Mar 26 2000Mar 30 2000

    Fingerprint

    Internet service providers
    Data storage equipment

    ASJC Scopus subject areas

    • Computer Science(all)
    • Electrical and Electronic Engineering

    Cite this

    Feldmann, A., & Muthukrishnan, S. (2000). Tradeoffs for packet classification. Proceedings - IEEE INFOCOM, 3, 1193-1202.

    Tradeoffs for packet classification. / Feldmann, Anja; Muthukrishnan, Shanmugavelayutham.

    In: Proceedings - IEEE INFOCOM, Vol. 3, 01.01.2000, p. 1193-1202.

    Research output: Contribution to journalConference article

    Feldmann, A & Muthukrishnan, S 2000, 'Tradeoffs for packet classification', Proceedings - IEEE INFOCOM, vol. 3, pp. 1193-1202.
    Feldmann A, Muthukrishnan S. Tradeoffs for packet classification. Proceedings - IEEE INFOCOM. 2000 Jan 1;3:1193-1202.
    Feldmann, Anja ; Muthukrishnan, Shanmugavelayutham. / Tradeoffs for packet classification. In: Proceedings - IEEE INFOCOM. 2000 ; Vol. 3. pp. 1193-1202.
    @article{86be358b9a014e7784ad6fd463d94119,
    title = "Tradeoffs for packet classification",
    abstract = "We present an algorithmic framework for solving the packet classification problem that allows various access time vs. memory tradeoffs. It reduces the multi-dimensional packet classification problem to solving a few instances of the one-dimensional IP lookup problem. It gives the best known lookup performance with moderately large memory space. Furthermore, it efficiently supports a reasonable number of additions and deletions to the rulesets without degrading the lookup performance. We perform a thorough experimental study of the tradeoffs for the two-dimensional packet classification problem on rulesets derived from datasets collected from AT&T WorldNet, an Internet Service Provider.",
    author = "Anja Feldmann and Shanmugavelayutham Muthukrishnan",
    year = "2000",
    month = "1",
    day = "1",
    language = "English (US)",
    volume = "3",
    pages = "1193--1202",
    journal = "Proceedings - IEEE INFOCOM",
    issn = "0743-166X",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - JOUR

    T1 - Tradeoffs for packet classification

    AU - Feldmann, Anja

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2000/1/1

    Y1 - 2000/1/1

    N2 - We present an algorithmic framework for solving the packet classification problem that allows various access time vs. memory tradeoffs. It reduces the multi-dimensional packet classification problem to solving a few instances of the one-dimensional IP lookup problem. It gives the best known lookup performance with moderately large memory space. Furthermore, it efficiently supports a reasonable number of additions and deletions to the rulesets without degrading the lookup performance. We perform a thorough experimental study of the tradeoffs for the two-dimensional packet classification problem on rulesets derived from datasets collected from AT&T WorldNet, an Internet Service Provider.

    AB - We present an algorithmic framework for solving the packet classification problem that allows various access time vs. memory tradeoffs. It reduces the multi-dimensional packet classification problem to solving a few instances of the one-dimensional IP lookup problem. It gives the best known lookup performance with moderately large memory space. Furthermore, it efficiently supports a reasonable number of additions and deletions to the rulesets without degrading the lookup performance. We perform a thorough experimental study of the tradeoffs for the two-dimensional packet classification problem on rulesets derived from datasets collected from AT&T WorldNet, an Internet Service Provider.

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

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

    M3 - Conference article

    AN - SCOPUS:0033876524

    VL - 3

    SP - 1193

    EP - 1202

    JO - Proceedings - IEEE INFOCOM

    JF - Proceedings - IEEE INFOCOM

    SN - 0743-166X

    ER -