2 citations
- IMDEA NetworksES3 papers
- Pace UniversityUS3 papers
- Universidad Carlos III de MadridES2 papers
- University of LiverpoolGB2 papers
- Centre National de la Recherche ScientifiqueFR1 paper
- Chinese Academy of SciencesCN1 paper
- Institute of Computing TechnologyCN1 paper
- Institut Polytechnique de BordeauxFR1 paper
- Laboratoire Bordelais de Recherche en InformatiqueFR1 paper
- Laboratoire d'Analyse et d'Architecture des SystèmesFR1 paper
- Las Cumbres Observatory Global Telescope NetworkUS1 paper
- Purdue University West LafayetteUS1 paper
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2016
Counting in Practical Anonymous Dynamic Networks is Polynomial
Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro
Anonymous Dynamic Networks is a harsh computational environment due to changing topology and lack of identifiers. Computing the size of the network, a problem known as Counting, is…
cs.DC2015
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki
We study a dynamic version of the Multiple-Message Broadcast problem, where packets are continuously injected in network nodes for dissemination throughout the network. Our perform…
cs.DC2011★ 2 cited
Unbounded Contention Resolution in Multiple-Access Channels
Antonio Fernández Anta, Miguel A. Mosteiro, Jorge Ramón Muñoz
A frequent problem in settings where a unique resource must be shared among users is how to resolve the contention that arises when all of them must use it, but the resource allows…