Decreasing Loss Probabilities by Redundancy and Interleaving: A Queueing Analysis

Alain Jean-Marie 1 Parijat Dube 2 Damien Artiges 3 Eitan Altman 3
1 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 IBM - IBM [Yorktown]
3 MISTRAL - Modeling of Computer Systems and Telecommunication Networks : Research and Software Development
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : See document.
Document type :
Conference papers
Complete list of metadatas
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00269744
Contributor : Christine Carvalho de Matos <>
Submitted on : Tuesday, July 7, 2015 - 12:48:00 PM
Last modification on : Tuesday, November 13, 2018 - 2:38:01 AM
Long-term archiving on: Wednesday, April 26, 2017 - 12:41:19 AM

File

itc03parijat.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-00269744, version 1

Collections

CNRS | INRIA | APR | APR-LIRMM | LIRMM | MIPS | UNIV-MONTPELLIER

Citation

Alain Jean-Marie, Parijat Dube, Damien Artiges, Eitan Altman. Decreasing Loss Probabilities by Redundancy and Interleaving: A Queueing Analysis. ITC'03: International Teletraffic Conference, Sep 2003, Berlin, Germany. pp.791-80. ⟨lirmm-00269744⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

169

Files downloads

496

Contact

Informations

CCSD