2,267 research outputs found

    Fast-response receiver-driven layered multicast with multiple servers

    Get PDF
    Almost all the proposed layered multicast algorithms support a single server, i.e. a receiver can only subscribe to at most one server. A common restriction to single server approach Is that the maximum number of subscribed layers, as well as the maximum achievable throughput Is limited by the specific bottleneck link between a receiver and the server. In this paper, a new layered multicast protocol, called Fast-response Receiver-driven Layered Multicast with Multiple Servers (FRLM-MS) Is proposed. Our design allows a receiver to subscribe to more than one servers. A FRLM-MS receiver can benefit from multiple paths to the multiple servers, resulting In a higher achievable bandwidth. It In turn allows the receiver to have a higher layer subscription, and thus a better playback performance. © 2005 IEEE.published_or_final_versio

    Router-assisted layered multicast

    Get PDF
    Several layered multicast protocols have been proposed for congestion control in real-time multicast applications. Most of them are pure end-to-end protocols, thus having difficulty in coordinating receivers and coping with traffic variations. In this paper, we propose RALM, a new receiver-driven router-assisted layered multicast protocol. RALM achieves much better performance at the expense of moderate additional complexity in the network. RALM is incrementally deployable. We evaluate RALM through simulations, and compare its performance with RLM, the well known layered multicast protocol.published_or_final_versio

    Fast-response Receiver-driven Layered Multicast

    Get PDF
    In this paper, a new layered multicast protocol, called Fast-response Receiver-driven Layered Multicast (FRLM), is proposed. The differences between our FRLM and the original RLM are only at the receivers. Our design allows the receivers to track the available network bandwidth faster; this enables the receivers to converge to their optimal number of subscribed layers quicker, and to respond to the network congestion prompter. An early trigger mechanism for shortening IGMP leave latency is also designed. We show that FRLM can avoid several potential problems with the original RLM, which have been overlooked previously. Last but not the least, FRLM is a practical scheme that can be readily implemented in today's best-effort Internet.published_or_final_versio

    STAIR: Practical AIMD Multirate Congestion Control

    Full text link
    Existing approaches for multirate multicast congestion control are either friendly to TCP only over large time scales or introduce unfortunate side effects, such as significant control traffic, wasted bandwidth, or the need for modifications to existing routers. We advocate a layered multicast approach in which steady-state receiver reception rates emulate the classical TCP sawtooth derived from additive-increase, multiplicative decrease (AIMD) principles. Our approach introduces the concept of dynamic stair layers to simulate various rates of additive increase for receivers with heterogeneous round-trip times (RTTs), facilitated by a minimal amount of IGMP control traffic. We employ a mix of cumulative and non-cumulative layering to minimize the amount of excess bandwidth consumed by receivers operating asynchronously behind a shared bottleneck. We integrate these techniques together into a congestion control scheme called STAIR which is amenable to those multicast applications which can make effective use of arbitrary and time-varying subscription levels.National Science Foundation (CAREER ANI-0093296, ANI-9986397

    Smooth Multirate Multicast Congestion Control

    Full text link
    A significant impediment to deployment of multicast services is the daunting technical complexity of developing, testing and validating congestion control protocols fit for wide-area deployment. Protocols such as pgmcc and TFMCC have recently made considerable progress on the single rate case, i.e. where one dynamic reception rate is maintained for all receivers in the session. However, these protocols have limited applicability, since scaling to session sizes beyond tens of participants necessitates the use of multiple rate protocols. Unfortunately, while existing multiple rate protocols exhibit better scalability, they are both less mature than single rate protocols and suffer from high complexity. We propose a new approach to multiple rate congestion control that leverages proven single rate congestion control methods by orchestrating an ensemble of independently controlled single rate sessions. We describe SMCC, a new multiple rate equation-based congestion control algorithm for layered multicast sessions that employs TFMCC as the primary underlying control mechanism for each layer. SMCC combines the benefits of TFMCC (smooth rate control, equation-based TCP friendliness) with the scalability and flexibility of multiple rates to provide a sound multiple rate multicast congestion control policy.National Science Foundation (ANI-9986397, ANI-0092196
    corecore