Mostrar el registro sencillo del ítem

dc.contributor.authorDemianiuk, Vitalii 
dc.contributor.authorNikolenko, Sergey
dc.contributor.authorChuprikov, Pavel 
dc.contributor.authorKogan, Kirill
dc.description.abstractGrowing expressiveness of services increases the size of a manageable state at the network data plane. A service policy is an ordered set of classification patterns (classes) with actions; the same class can appear in multiple policies. Previous studies mostly concentrated on efficient representations of a single policy instance. In this work, we study space efficiency of multiple policies, cutting down a classifier size by sharing instances of classes between policies that contain them. In this paper we identify conditions for such sharing, propose efficient algorithms and analyze them analytically. The proposed representations can be deployed transparently on existing packet processing engines. Our results are supported by extensive evaluations.
dc.publisherCo-sponsored by the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communications (SIGCOMM)
dc.titleNew Alternatives to Optimize Policy Classifiers
dc.typejournal article
dc.journal.titleIEEE/ACM Transactions on Networking
dc.subject.keywordHeuristic algorithms
dc.subject.keywordComplexity theory
dc.subject.keywordQuality of service
dc.subject.keywordBiological system modeling
dc.subject.keywordApproximation algorithms
dc.subject.keywordIEEE transactions

Ficheros en el ítem


No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem