Detail publikačního výsledku

Advantage of Hierarchical Aggregation

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

Originální název

Advantage of Hierarchical Aggregation

Anglický název

Advantage of Hierarchical Aggregation

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

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.

Anglický abstrakt

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.

Klíčová slova

hierarchical aggregation, summarization, localization, feedback channel

Klíčová slova v angličtině

hierarchical aggregation, summarization, localization, feedback channel

Autoři

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

Rok RIV

2010

Vydáno

30.11.2008

ISSN

1738-7906

Periodikum

International Journal of Computer Science and Network Security

Svazek

2008

Číslo

8

Stát

Korejská republika

Strany od

1

Strany do

7

Strany počet

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"
}