Publication detail

Bandwidth Redistribution Algorithm for Single Source Multicast

Dan Komosny, Vit Novotny, Miroslav Balik

Original Title

Bandwidth Redistribution Algorithm for Single Source Multicast

English Title

Bandwidth Redistribution Algorithm for Single Source Multicast

Type

conference paper

Language

en

Original Abstract

In this paper, we propose a new bandwidth redistribution algorithm for subgroups within a single source multicast (SSM) session. Our work has been inspired by the biasing algorithm developed for SSM with the summarization model. Both algorithms are based on the idea that not all feedback is of equal value. The bandwidth redistribution algorithm provides a new approach to the feedback of selected session members, which allows increasing their feedback rate. The algorithm is applicable to one-to-many multicast session and its overlay real-time monitoring applications. For these applications, a minimum feedback rate of a preferred group is usually of interest. Using the bandwidth redistribution algorithm, the feedback rate increased above its minimum value offers reporting more precise results. We present a basic outline of the bandwidth redistribution algorithm and also a theoretical comparison with the biasing algorithm.

English abstract

In this paper, we propose a new bandwidth redistribution algorithm for subgroups within a single source multicast (SSM) session. Our work has been inspired by the biasing algorithm developed for SSM with the summarization model. Both algorithms are based on the idea that not all feedback is of equal value. The bandwidth redistribution algorithm provides a new approach to the feedback of selected session members, which allows increasing their feedback rate. The algorithm is applicable to one-to-many multicast session and its overlay real-time monitoring applications. For these applications, a minimum feedback rate of a preferred group is usually of interest. Using the bandwidth redistribution algorithm, the feedback rate increased above its minimum value offers reporting more precise results. We present a basic outline of the bandwidth redistribution algorithm and also a theoretical comparison with the biasing algorithm.

Keywords

Multicast, Bandwidth, Source Specific, IP, RTP, RTCP

RIV year

2006

Released

05.04.2006

Publisher

IEEE Computer Society

Location

Mauritius

ISBN

0-7695-2570-9

Book

Proceedings of International Conference on Networking

Pages from

1

Pages to

7

Pages count

7

Documents

BibTex


@inproceedings{BUT18547,
  author="Dan {Komosný} and Vít {Novotný} and Miroslav {Balík}",
  title="Bandwidth Redistribution Algorithm for Single Source Multicast",
  annote="In this paper, we propose a new bandwidth redistribution algorithm for subgroups within a single source multicast (SSM) session. Our work has been inspired by the biasing algorithm developed for SSM with the summarization model. Both algorithms are based on the idea that not all feedback is of equal value.  The bandwidth redistribution algorithm provides a new approach to the feedback of selected session members, which allows increasing their feedback rate. The algorithm  is applicable to one-to-many multicast session and its overlay real-time monitoring applications.  For these applications,  a minimum feedback rate of a preferred group is usually of interest. Using the bandwidth redistribution algorithm, the feedback rate increased above its minimum value offers reporting more precise results. We present a basic outline  of the bandwidth redistribution algorithm and also a theoretical comparison with the biasing algorithm.",
  address="IEEE Computer Society",
  booktitle="Proceedings of International Conference on Networking",
  chapter="18547",
  institution="IEEE Computer Society",
  year="2006",
  month="april",
  pages="1",
  publisher="IEEE Computer Society",
  type="conference paper"
}