Publication result detail

Advantage of Hierarchical Aggregation

MÜLLER, J.; KOMOSNÝ, D.; BURGET, R.; MORÁVEK, P.

Original Title

Advantage of Hierarchical Aggregation

English Title

Advantage of Hierarchical Aggregation

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

Running a service for millions of clients based on Real-Time Protocol/Real-Time Control Protocol (RTP/RTCP) entails a huge amount of data periodically generated by the clients. These data have to be transferred to the sender as soon as possible because of the quality measurement of the real-time service. The solution lies in the hierarchical aggregation and the summarization in a feedback channel. Based on these requirements a new type of a protocol will be presented in this paper.

English abstract

Running a service for millions of clients based on Real-Time Protocol/Real-Time Control Protocol (RTP/RTCP) entails a huge amount of data periodically generated by the clients. These data have to be transferred to the sender as soon as possible because of the quality measurement of the real-time service. The solution lies in the hierarchical aggregation and the summarization in a feedback channel. Based on these requirements a new type of a protocol will be presented in this paper.

Keywords

hierarchical aggregation, summarization, localization, feedback channel

Key words in English

hierarchical aggregation, summarization, localization, feedback channel

Authors

MÜLLER, J.; KOMOSNÝ, D.; BURGET, R.; MORÁVEK, P.

RIV year

2010

Released

30.11.2008

ISBN

1738-7906

Periodical

International Journal of Computer Science and Network Security

Volume

2008

Number

8

State

Republic of Korea

Pages from

1

Pages to

7

Pages count

7

BibTex

@article{BUT49661,
  author="Jakub {Müller} and Dan {Komosný} and Radim {Burget} and Patrik {Morávek}",
  title="Advantage of Hierarchical Aggregation",
  journal="International Journal of Computer Science and Network Security",
  year="2008",
  volume="2008",
  number="8",
  pages="1--7",
  issn="1738-7906"
}