Dynamic walks for searching streaming media in Peer-to-Peer Networks

Zhou Su, Jiro Katto, Yasuhiko Yasuda

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    With the advance of network technologies, availability and popularity of streaming media contents over the P2P (Peer-to-Peer) Networks have grown rapidly in recent years. However, how to efficiently search a requested steaming media among P2P peers is still a problem which causes a serious user delay and limited hit ratio. This paper presents an efficient search method for streaming media in P2P, which reduces user response delays and exchange overhead simultaneously. Based on an analytical formulation of both streaming media and P2P peers'characteristics, we derive a search algorithm which solves the next two problems quantitatively. (1) How to decide the number of walkers (queries) at each step of search? (2) How to decide the length of walkers (queries) at each step of search? Simulation results verify that the proposed algorithm efficiently resolves the above problems and provides much better performance than conventional methods.

    Original languageEnglish
    Pages (from-to)147-156
    Number of pages10
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume3331
    Publication statusPublished - 2004

    Fingerprint

    Streaming Media
    Walkers
    Media streaming
    Peer to peer networks
    Peer-to-peer Networks
    Walk
    Query
    P2P Network
    Technology
    Hits
    Search Methods
    Search Algorithm
    Resolve
    Availability
    Verify
    Formulation
    Simulation

    ASJC Scopus subject areas

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

    Cite this

    @article{841e151da4fd4213b651effcf7b87260,
    title = "Dynamic walks for searching streaming media in Peer-to-Peer Networks",
    abstract = "With the advance of network technologies, availability and popularity of streaming media contents over the P2P (Peer-to-Peer) Networks have grown rapidly in recent years. However, how to efficiently search a requested steaming media among P2P peers is still a problem which causes a serious user delay and limited hit ratio. This paper presents an efficient search method for streaming media in P2P, which reduces user response delays and exchange overhead simultaneously. Based on an analytical formulation of both streaming media and P2P peers'characteristics, we derive a search algorithm which solves the next two problems quantitatively. (1) How to decide the number of walkers (queries) at each step of search? (2) How to decide the length of walkers (queries) at each step of search? Simulation results verify that the proposed algorithm efficiently resolves the above problems and provides much better performance than conventional methods.",
    author = "Zhou Su and Jiro Katto and Yasuhiko Yasuda",
    year = "2004",
    language = "English",
    volume = "3331",
    pages = "147--156",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - Dynamic walks for searching streaming media in Peer-to-Peer Networks

    AU - Su, Zhou

    AU - Katto, Jiro

    AU - Yasuda, Yasuhiko

    PY - 2004

    Y1 - 2004

    N2 - With the advance of network technologies, availability and popularity of streaming media contents over the P2P (Peer-to-Peer) Networks have grown rapidly in recent years. However, how to efficiently search a requested steaming media among P2P peers is still a problem which causes a serious user delay and limited hit ratio. This paper presents an efficient search method for streaming media in P2P, which reduces user response delays and exchange overhead simultaneously. Based on an analytical formulation of both streaming media and P2P peers'characteristics, we derive a search algorithm which solves the next two problems quantitatively. (1) How to decide the number of walkers (queries) at each step of search? (2) How to decide the length of walkers (queries) at each step of search? Simulation results verify that the proposed algorithm efficiently resolves the above problems and provides much better performance than conventional methods.

    AB - With the advance of network technologies, availability and popularity of streaming media contents over the P2P (Peer-to-Peer) Networks have grown rapidly in recent years. However, how to efficiently search a requested steaming media among P2P peers is still a problem which causes a serious user delay and limited hit ratio. This paper presents an efficient search method for streaming media in P2P, which reduces user response delays and exchange overhead simultaneously. Based on an analytical formulation of both streaming media and P2P peers'characteristics, we derive a search algorithm which solves the next two problems quantitatively. (1) How to decide the number of walkers (queries) at each step of search? (2) How to decide the length of walkers (queries) at each step of search? Simulation results verify that the proposed algorithm efficiently resolves the above problems and provides much better performance than conventional methods.

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

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

    M3 - Article

    AN - SCOPUS:35048837122

    VL - 3331

    SP - 147

    EP - 156

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -