Layered multicast recovery

Injong Rhee, Srinath R. Joshi, Minsuk Lee, Shanmugavelayutham Muthukrishnan, Volkan Ozdemir

    Research output: Contribution to journalConference article

    Abstract

    We study the problem of localizing repair packets when packets are lost during multicasts. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast `group' with duplicate repair packets thereby wasting bandwidth; thus, the protocols need repair locality. We present a multicast layering scheme where the sender proactively distributes FEC repair packets among multiple multicast groups. Each receiver can selectively tune in to a subset of these multicast groups to obtain packets close in number to what it needs. We develop an efficient algorithm that dynamically determines the optimal distribution of FEC repair packets to a given (small constant) number of multicast groups. The running time of this algorithm is independent of the number of receivers in the multicast session, and is hence highly scalable. However, the optimal algorithm requires the knowledge of the FEC repair requirements of all the receivers in the multicast group, and hence is subject to the implosion problem. To handle the implosion problem, we develop a heuristic algorithm that achieves repair locality very similar to that of the optimal algorithm, but does not require as much global knowledge. Our multicast layering scheme can be integrated into known reliable multicast protocols to make them more scalable. For concreteness, we focus on (i) singly scoped SRM, (ii) hierarchically scoped SRM, and (iii) a tree-based reliable multicasting protocol RMTP, and present combined protocols incorporating our solutions into each of them. Simulation experiments show that our solutions can substantially enhance the scalability of these reliable multicast protocols.

    Original languageEnglish (US)
    Pages (from-to)805-813
    Number of pages9
    JournalProceedings - IEEE INFOCOM
    Volume2
    StatePublished - Jan 1 2000
    Event19th Annual Joint Conference of the IEEE Computer and Communications Societies - IEEE INFOCOM2000: 'Reaching the Promised Land of Communications' - Tel Aviv, Isr
    Duration: Mar 26 2000Mar 30 2000

    Fingerprint

    Repair
    Recovery
    Network protocols
    Multicasting
    Heuristic algorithms
    Scalability
    Bandwidth
    Experiments

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Cite this

    Rhee, I., Joshi, S. R., Lee, M., Muthukrishnan, S., & Ozdemir, V. (2000). Layered multicast recovery. Proceedings - IEEE INFOCOM, 2, 805-813.

    Layered multicast recovery. / Rhee, Injong; Joshi, Srinath R.; Lee, Minsuk; Muthukrishnan, Shanmugavelayutham; Ozdemir, Volkan.

    In: Proceedings - IEEE INFOCOM, Vol. 2, 01.01.2000, p. 805-813.

    Research output: Contribution to journalConference article

    Rhee, I, Joshi, SR, Lee, M, Muthukrishnan, S & Ozdemir, V 2000, 'Layered multicast recovery', Proceedings - IEEE INFOCOM, vol. 2, pp. 805-813.
    Rhee I, Joshi SR, Lee M, Muthukrishnan S, Ozdemir V. Layered multicast recovery. Proceedings - IEEE INFOCOM. 2000 Jan 1;2:805-813.
    Rhee, Injong ; Joshi, Srinath R. ; Lee, Minsuk ; Muthukrishnan, Shanmugavelayutham ; Ozdemir, Volkan. / Layered multicast recovery. In: Proceedings - IEEE INFOCOM. 2000 ; Vol. 2. pp. 805-813.
    @article{fb132216400d4672a0702c5de702fd2c,
    title = "Layered multicast recovery",
    abstract = "We study the problem of localizing repair packets when packets are lost during multicasts. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast `group' with duplicate repair packets thereby wasting bandwidth; thus, the protocols need repair locality. We present a multicast layering scheme where the sender proactively distributes FEC repair packets among multiple multicast groups. Each receiver can selectively tune in to a subset of these multicast groups to obtain packets close in number to what it needs. We develop an efficient algorithm that dynamically determines the optimal distribution of FEC repair packets to a given (small constant) number of multicast groups. The running time of this algorithm is independent of the number of receivers in the multicast session, and is hence highly scalable. However, the optimal algorithm requires the knowledge of the FEC repair requirements of all the receivers in the multicast group, and hence is subject to the implosion problem. To handle the implosion problem, we develop a heuristic algorithm that achieves repair locality very similar to that of the optimal algorithm, but does not require as much global knowledge. Our multicast layering scheme can be integrated into known reliable multicast protocols to make them more scalable. For concreteness, we focus on (i) singly scoped SRM, (ii) hierarchically scoped SRM, and (iii) a tree-based reliable multicasting protocol RMTP, and present combined protocols incorporating our solutions into each of them. Simulation experiments show that our solutions can substantially enhance the scalability of these reliable multicast protocols.",
    author = "Injong Rhee and Joshi, {Srinath R.} and Minsuk Lee and Shanmugavelayutham Muthukrishnan and Volkan Ozdemir",
    year = "2000",
    month = "1",
    day = "1",
    language = "English (US)",
    volume = "2",
    pages = "805--813",
    journal = "Proceedings - IEEE INFOCOM",
    issn = "0743-166X",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - JOUR

    T1 - Layered multicast recovery

    AU - Rhee, Injong

    AU - Joshi, Srinath R.

    AU - Lee, Minsuk

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Ozdemir, Volkan

    PY - 2000/1/1

    Y1 - 2000/1/1

    N2 - We study the problem of localizing repair packets when packets are lost during multicasts. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast `group' with duplicate repair packets thereby wasting bandwidth; thus, the protocols need repair locality. We present a multicast layering scheme where the sender proactively distributes FEC repair packets among multiple multicast groups. Each receiver can selectively tune in to a subset of these multicast groups to obtain packets close in number to what it needs. We develop an efficient algorithm that dynamically determines the optimal distribution of FEC repair packets to a given (small constant) number of multicast groups. The running time of this algorithm is independent of the number of receivers in the multicast session, and is hence highly scalable. However, the optimal algorithm requires the knowledge of the FEC repair requirements of all the receivers in the multicast group, and hence is subject to the implosion problem. To handle the implosion problem, we develop a heuristic algorithm that achieves repair locality very similar to that of the optimal algorithm, but does not require as much global knowledge. Our multicast layering scheme can be integrated into known reliable multicast protocols to make them more scalable. For concreteness, we focus on (i) singly scoped SRM, (ii) hierarchically scoped SRM, and (iii) a tree-based reliable multicasting protocol RMTP, and present combined protocols incorporating our solutions into each of them. Simulation experiments show that our solutions can substantially enhance the scalability of these reliable multicast protocols.

    AB - We study the problem of localizing repair packets when packets are lost during multicasts. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast `group' with duplicate repair packets thereby wasting bandwidth; thus, the protocols need repair locality. We present a multicast layering scheme where the sender proactively distributes FEC repair packets among multiple multicast groups. Each receiver can selectively tune in to a subset of these multicast groups to obtain packets close in number to what it needs. We develop an efficient algorithm that dynamically determines the optimal distribution of FEC repair packets to a given (small constant) number of multicast groups. The running time of this algorithm is independent of the number of receivers in the multicast session, and is hence highly scalable. However, the optimal algorithm requires the knowledge of the FEC repair requirements of all the receivers in the multicast group, and hence is subject to the implosion problem. To handle the implosion problem, we develop a heuristic algorithm that achieves repair locality very similar to that of the optimal algorithm, but does not require as much global knowledge. Our multicast layering scheme can be integrated into known reliable multicast protocols to make them more scalable. For concreteness, we focus on (i) singly scoped SRM, (ii) hierarchically scoped SRM, and (iii) a tree-based reliable multicasting protocol RMTP, and present combined protocols incorporating our solutions into each of them. Simulation experiments show that our solutions can substantially enhance the scalability of these reliable multicast protocols.

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

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

    M3 - Conference article

    AN - SCOPUS:0033901077

    VL - 2

    SP - 805

    EP - 813

    JO - Proceedings - IEEE INFOCOM

    JF - Proceedings - IEEE INFOCOM

    SN - 0743-166X

    ER -