This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n10http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n8http://localhost/temp/predkladatel/
n5http://purl.org/net/nknouf/ns/bibtex#
n21http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F05%3A00000966%21RIV06-MSM-11320___/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F05%3A00000966%21RIV06-MSM-11320___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
We consider probabilistic algorithms (packed marking schemes) for sending information from nodes (routers) along a path traveled by a stream of packets to an end-host. We investigate tradeoffs between the number of possible states of marking bits in a packet, the number of bits of information sent, and the number of packets needed to reconstruct the information reliably. We establish a connection of near-optimal schemes to a geometric problem, the existence of d-dimensional k-reptiles simplices. Uvažujeme pravděpodobnostní algoritmy (značkovací schémata) pro posílání informace z uzlů podél cesty do koncového uzlu pomocí proudu paketů. Vyšetřujeme kompromisy mezi počtem stavů značkovacích bitů v paketu, počtem bitů poslané informace a počtem paketů nutných ke spolehlivé rekonstrukci informace. Ukážeme souvislost téměř optimálních schémat s geometrickým problémem - existencí k-reptile simplexů. We consider probabilistic algorithms (packed marking schemes) for sending information from nodes (routers) along a path traveled by a stream of packets to an end-host. We investigate tradeoffs between the number of possible states of marking bits in a packet, the number of bits of information sent, and the number of packets needed to reconstruct the information reliably. We establish a connection of near-optimal schemes to a geometric problem, the existence of d-dimensional k-reptiles simplices.
dcterms:title
Towards asymptotic optimality in probabilistic packet marking Towards asymptotic optimality in probabilistic packet marking Asymptotická optimalita v pravděpodobnostním značkování paketů
skos:prefLabel
Asymptotická optimalita v pravděpodobnostním značkování paketů Towards asymptotic optimality in probabilistic packet marking Towards asymptotic optimality in probabilistic packet marking
skos:notation
RIV/00216208:11320/05:00000966!RIV06-MSM-11320___
n3:strany
450;459
n3:aktivita
n22:Z n22:P
n3:aktivity
P(1M0545), Z(MSM0021620838)
n3:dodaniDat
n4:2006
n3:domaciTvurceVysledku
n21:3374041
n3:druhVysledku
n11:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
546962
n3:idVysledku
RIV/00216208:11320/05:00000966
n3:jazykVysledku
n7:eng
n3:klicovaSlova
Towards; asymptotic; optimality; probabilistic; packet; marking
n3:klicoveSlovo
n18:Towards n18:optimality n18:probabilistic n18:marking n18:asymptotic n18:packet
n3:kontrolniKodProRIV
[AE0DA8225778]
n3:mistoKonaniAkce
New York, NY, USA
n3:mistoVydani
New York, NY, USA
n3:nazevZdroje
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
n3:obor
n14:BD
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n19:1M0545
n3:rokUplatneniVysledku
n4:2005
n3:tvurceVysledku
Matoušek, Jiří
n3:typAkce
n10:WRD
n3:zahajeniAkce
2005-01-01+01:00
n3:zamer
n16:MSM0021620838
s:numberOfPages
10
n5:hasPublisher
ACM Press
n17:isbn
1-58113-960-8
n8:organizacniJednotka
11320