Mostrar el registro sencillo del ítem

dc.contributor.authorDemianiuk, Vitalii 
dc.contributor.authorGorinsky, Sergey 
dc.contributor.authorNikolenko, Sergey
dc.contributor.authorKogan, Kirill 
dc.date.accessioned2021-07-13T09:34:09Z
dc.date.available2021-07-13T09:34:09Z
dc.date.issued2018-06-18
dc.identifier.urihttp://hdl.handle.net/20.500.12761/574
dc.description.abstractNetwork devices need packet counters for a variety of applications. For a large number of concurrent flows, on-chip memories can be too small to support a separate counter per flow. While a single network element might struggle to implement flow accounting on its own, in this work we study alternatives leveraging underutilized resources elsewhere in the network and implement flow accounting on multiple network devices. This paper takes the first step towards understanding the design principles for robust network-wide accounting with lossy unidirectional channels without feedback.
dc.language.isoeng
dc.titleDistributed Counting along Lossy Paths without Feedbacken
dc.typeconference object
dc.conference.date18-21 June 2018
dc.conference.placeMa'ale HaHamisha, Israel
dc.conference.titleThe 25th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2018)*
dc.event.typeconference
dc.pres.typepaper
dc.type.hasVersionVoR
dc.rights.accessRightsopen access
dc.page.final4
dc.page.initial1
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/1820


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem