Degree-optimal routing for P2P systems (Q841622): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4471321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-optimal routing for P2P systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: D2B: A de Bruijn based content-addressable network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Know thy neighbor's neighbor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel architectures for P2P applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709125 / rank
 
Normal rank

Revision as of 23:10, 1 July 2024

scientific article
Language Label Description Also known as
English
Degree-optimal routing for P2P systems
scientific article

    Statements

    Degree-optimal routing for P2P systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 September 2009
    0 references
    peer-to-peer
    0 references
    overlay network
    0 references
    greedy routing
    0 references

    Identifiers