. "ACM Press" . "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." . "[AE0DA8225778]" . . "11320" . "Uva\u017Eujeme pravd\u011Bpodobnostn\u00ED algoritmy (zna\u010Dkovac\u00ED sch\u00E9mata) pro pos\u00EDl\u00E1n\u00ED informace z uzl\u016F pod\u00E9l cesty do koncov\u00E9ho uzlu pomoc\u00ED proudu paket\u016F. Vy\u0161et\u0159ujeme kompromisy mezi po\u010Dtem stav\u016F zna\u010Dkovac\u00EDch bit\u016F v paketu, po\u010Dtem bit\u016F poslan\u00E9 informace a po\u010Dtem paket\u016F nutn\u00FDch ke spolehliv\u00E9 rekonstrukci informace. Uk\u00E1\u017Eeme souvislost t\u00E9m\u011B\u0159 optim\u00E1ln\u00EDch sch\u00E9mat s geometrick\u00FDm probl\u00E9mem - existenc\u00ED k-reptile simplex\u016F."@cs . "10"^^ . . "RIV/00216208:11320/05:00000966" . "Matou\u0161ek, Ji\u0159\u00ED" . "New York, NY, USA" . . "Proceedings of the thirty-seventh annual ACM symposium on Theory of computing" . "New York, NY, USA" . . . . "546962" . . "Towards asymptotic optimality in probabilistic packet marking"@en . . "1-58113-960-8" . . "RIV/00216208:11320/05:00000966!RIV06-MSM-11320___" . . "Asymptotick\u00E1 optimalita v pravd\u011Bpodobnostn\u00EDm zna\u010Dkov\u00E1n\u00ED paket\u016F"@cs . . "Towards asymptotic optimality in probabilistic packet marking"@en . "Towards; asymptotic; optimality; probabilistic; packet; marking"@en . . "Towards asymptotic optimality in probabilistic packet marking" . . . "1"^^ . . "3"^^ . "450;459" . "Towards asymptotic optimality in probabilistic packet marking" . . . . "P(1M0545), Z(MSM0021620838)" . "2005-01-01+01:00"^^ . . "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 . . "Asymptotick\u00E1 optimalita v pravd\u011Bpodobnostn\u00EDm zna\u010Dkov\u00E1n\u00ED paket\u016F"@cs .