Topology-centric look-up service

L. Garcés-Erice, Keith Ross, E. W. Biersack, P. A. Felber, G. Urvoy-Keller

    Research output: Contribution to journalArticle

    Abstract

    Topological considerations are of paramount importance in the design of a P2P lookup service. We present TOPLUS, a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. TOPLUS is fully distributed and symmetric, in the sense that all nodes have the same role. Packets are routed to their destination along a path that mimics the router-level shortest-path, thereby providing a small "stretch". Experimental evaluation confirms that a lookup in TOPLUS takes time comparable to that of IP routing.

    Original languageEnglish (US)
    Pages (from-to)58-69
    Number of pages12
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2816
    StatePublished - 2003

    Fingerprint

    Peer to peer networks
    Routers
    Topology
    IP Networks
    Peer-to-peer Networks
    Prefix
    Stretch
    Router
    Experimental Evaluation
    Shortest path
    Grouping
    Routing
    Path
    Vertex of a graph
    Design

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    Topology-centric look-up service. / Garcés-Erice, L.; Ross, Keith; Biersack, E. W.; Felber, P. A.; Urvoy-Keller, G.

    In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2816, 2003, p. 58-69.

    Research output: Contribution to journalArticle

    Garcés-Erice, L. ; Ross, Keith ; Biersack, E. W. ; Felber, P. A. ; Urvoy-Keller, G. / Topology-centric look-up service. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2003 ; Vol. 2816. pp. 58-69.
    @article{9b1a3fdff33547c08c51728712987fe4,
    title = "Topology-centric look-up service",
    abstract = "Topological considerations are of paramount importance in the design of a P2P lookup service. We present TOPLUS, a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. TOPLUS is fully distributed and symmetric, in the sense that all nodes have the same role. Packets are routed to their destination along a path that mimics the router-level shortest-path, thereby providing a small {"}stretch{"}. Experimental evaluation confirms that a lookup in TOPLUS takes time comparable to that of IP routing.",
    author = "L. Garc{\'e}s-Erice and Keith Ross and Biersack, {E. W.} and Felber, {P. A.} and G. Urvoy-Keller",
    year = "2003",
    language = "English (US)",
    volume = "2816",
    pages = "58--69",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - Topology-centric look-up service

    AU - Garcés-Erice, L.

    AU - Ross, Keith

    AU - Biersack, E. W.

    AU - Felber, P. A.

    AU - Urvoy-Keller, G.

    PY - 2003

    Y1 - 2003

    N2 - Topological considerations are of paramount importance in the design of a P2P lookup service. We present TOPLUS, a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. TOPLUS is fully distributed and symmetric, in the sense that all nodes have the same role. Packets are routed to their destination along a path that mimics the router-level shortest-path, thereby providing a small "stretch". Experimental evaluation confirms that a lookup in TOPLUS takes time comparable to that of IP routing.

    AB - Topological considerations are of paramount importance in the design of a P2P lookup service. We present TOPLUS, a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. TOPLUS is fully distributed and symmetric, in the sense that all nodes have the same role. Packets are routed to their destination along a path that mimics the router-level shortest-path, thereby providing a small "stretch". Experimental evaluation confirms that a lookup in TOPLUS takes time comparable to that of IP routing.

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

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

    M3 - Article

    VL - 2816

    SP - 58

    EP - 69

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -