Online Admission Control and Embedding of Service Chains (Q3460710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Derandomized graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive and deterministic embeddings of virtual networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating \(k\)-set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank

Latest revision as of 06:59, 11 July 2024

scientific article
Language Label Description Also known as
English
Online Admission Control and Embedding of Service Chains
scientific article

    Statements

    Online Admission Control and Embedding of Service Chains (English)
    0 references
    0 references
    0 references
    8 January 2016
    0 references
    computer networks
    0 references
    network virtualization
    0 references
    virtual circuit routing
    0 references
    online call admission
    0 references
    competitive analysis
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references