About: Towards asymptotic optimality in probabilistic packet marking     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
  • 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.
  • 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. (en)
  • 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ů. (cs)
Title
  • Towards asymptotic optimality in probabilistic packet marking
  • Asymptotická optimalita v pravděpodobnostním značkování paketů (cs)
  • Towards asymptotic optimality in probabilistic packet marking (en)
skos:prefLabel
  • Towards asymptotic optimality in probabilistic packet marking
  • Asymptotická optimalita v pravděpodobnostním značkování paketů (cs)
  • Towards asymptotic optimality in probabilistic packet marking (en)
skos:notation
  • RIV/00216208:11320/05:00000966!RIV06-MSM-11320___
http://linked.open.../vavai/riv/strany
  • 450;459
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), Z(MSM0021620838)
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
  • 546962
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/05:00000966
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Towards; asymptotic; optimality; probabilistic; packet; marking (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [AE0DA8225778]
http://linked.open...v/mistoKonaniAkce
  • New York, NY, USA
http://linked.open...i/riv/mistoVydani
  • New York, NY, USA
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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...iv/tvurceVysledku
  • Matoušek, Jiří
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • ACM Press
https://schema.org/isbn
  • 1-58113-960-8
http://localhost/t...ganizacniJednotka
  • 11320
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software