A BGP-based mechanism for lowest-cost routing (Q1953638): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation and collusion in multicast cost sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for multicast cost sharing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BGP-based mechanism for lowest-cost routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the cost of multicast transmissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism design for policy routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive generalized auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in Teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification faithfulness in networks with rational nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Auction protocols for decentralized scheduling / rank
 
Normal rank

Latest revision as of 11:39, 6 July 2024

scientific article
Language Label Description Also known as
English
A BGP-based mechanism for lowest-cost routing
scientific article

    Statements

    A BGP-based mechanism for lowest-cost routing (English)
    0 references
    0 references
    0 references
    0 references
    7 June 2013
    0 references
    distributed algorithms
    0 references
    mechanism design
    0 references
    interdomain routing
    0 references

    Identifiers