About: Construction of the Bounded Application-layer Multicast Tree in the OverlayNetwork Model by the Integer Linear Programming

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Construction of the Bounded Application-layer Multicast Tree in the OverlayNetwork Model by the Integer Linear Programming 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Není k dispozici (cs) The geographically distributed system can be interconnected via a overlay multicast network. In this overlay network the multicast data are routed and replicated on the application layer along a multicast tree. This paper presents the techniques of the network reduction and the multicast tree construction. The multicast tree in the form of shortest path tree (SPT) can be build up upon the linear programming formulation. To control the load of each host, the additional constraints on the maximal number of directly outgoing connections and integer variables are added and subsequently form the degree-bounded shortest path tree problem (db-SPT). This theoretically based problem is formulated in integer linear programming framework. The geographically distributed system can be interconnected via a overlay multicast network. In this overlay network the multicast data are routed and replicated on the application layer along a multicast tree. This paper presents the techniques of the network reduction and the multicast tree construction. The multicast tree in the form of shortest path tree (SPT) can be build up upon the linear programming formulation. To control the load of each host, the additional constraints on the maximal number of directly outgoing connections and integer variables are added and subsequently form the degree-bounded shortest path tree problem (db-SPT). This theoretically based problem is formulated in integer linear programming framework. (en)
Title	Construction of the Bounded Application-layer Multicast Tree in the OverlayNetwork Model by the Integer Linear Programming Není k dispozici (cs) Construction of the Bounded Application-layer Multicast Tree in the OverlayNetwork Model by the Integer Linear Programming (en)
skos:prefLabel	Construction of the Bounded Application-layer Multicast Tree in the OverlayNetwork Model by the Integer Linear Programming Není k dispozici (cs) Construction of the Bounded Application-layer Multicast Tree in the OverlayNetwork Model by the Integer Linear Programming (en)
skos:notation	RIV/68407700:21230/05:03110216!RIV07-MPO-21230___
http://linked.open.../vavai/riv/strany	503 ; 510
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(FD-K3/082)
http://linked.open...vai/riv/dodaniDat	2007
http://linked.open...aciTvurceVysledku	Jurčík, Petr Hanzálek, Zdeněk
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	516247
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/05:03110216
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Degree bounded shortest path tree; Mixed integer linear programming; Multicast communication; Overlay networks; Shortest path tree problem (en)
http://linked.open.../riv/klicoveSlovo	Mixed integer linear programming Overlay networks Degree bounded shortest path tree Multicast communication Shortest path tree problem
http://linked.open...ontrolniKodProRIV	[0298AFBE80A4]
http://linked.open...v/mistoKonaniAkce	Catania
http://linked.open...i/riv/mistoVydani	Piscataway
http://linked.open...i/riv/nazevZdroje	Proceedings of the 10th IEEE International Conference on Emerging Technologies and Factory Automation
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	*Advance control system designer.
http://linked.open...UplatneniVysledku	2005
http://linked.open...iv/tvurceVysledku	Hanzálek, Zdeněk Jurčík, Petr
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2005-09-19 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	0-7803-9402-X
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	Construction of the Bounded Application-layer Multicast Tree in the OverlayNetwork Model by the Integer Linear Programming

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software