About: Optimizing Feedback Path in Hierarchical Aggregation     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The main motivation for this work is to allow IPTV to be used by large scale groups of clients (up to millions) in one session. We have implemented 2 main methods to achieve this goal by reducing data, witch are transferred via feedback channel. These methods are summarization of client's data in nodes and creation of hierarchical feedback tree, thanks to which we can virtually extend the bandwidth used by end clients. The TTP protocol was developed based on these requirements. It includes the creation of a balanced hierarchical feedback tree, synchronization of created FT nodes and monitoring the created FT network. TTP can secure feedback channel stability by activating another FT instead of the corrupted one if necessary.
  • The main motivation for this work is to allow IPTV to be used by large scale groups of clients (up to millions) in one session. We have implemented 2 main methods to achieve this goal by reducing data, witch are transferred via feedback channel. These methods are summarization of client's data in nodes and creation of hierarchical feedback tree, thanks to which we can virtually extend the bandwidth used by end clients. The TTP protocol was developed based on these requirements. It includes the creation of a balanced hierarchical feedback tree, synchronization of created FT nodes and monitoring the created FT network. TTP can secure feedback channel stability by activating another FT instead of the corrupted one if necessary. (en)
Title
  • Optimizing Feedback Path in Hierarchical Aggregation
  • Optimizing Feedback Path in Hierarchical Aggregation (en)
skos:prefLabel
  • Optimizing Feedback Path in Hierarchical Aggregation
  • Optimizing Feedback Path in Hierarchical Aggregation (en)
skos:notation
  • RIV/00216305:26220/08:PU75740!RIV10-MSM-26220___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET301710508), Z(MSM0021630513)
http://linked.open...iv/cisloPeriodika
  • 2
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 385269
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26220/08:PU75740
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • feedback, aggregation, summarization (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • BG - Bulharská republika
http://linked.open...ontrolniKodProRIV
  • [E5C414044C34]
http://linked.open...i/riv/nazevZdroje
  • Electronics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 2008
http://linked.open...iv/tvurceVysledku
  • Burget, Radim
  • Müller, Jakub
  • Komosný, Dan
http://linked.open...n/vavai/riv/zamer
issn
  • 1313-1842
number of pages
http://localhost/t...ganizacniJednotka
  • 26220
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software