hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Modeling Packet Losses in Communication Networks
ITMO University, Saint Petersburg, Russia & University of Tartu, Tartu, Estonia.
ITMO University, Saint Petersburg, Russia & University of Tartu, Tartu, Estonia.ORCID iD: 0000-0002-5865-5283
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).ORCID iD: 0000-0003-1155-5717
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).ORCID iD: 0000-0003-1460-2988
Show others and affiliations
2019 (English)In: 2019 IEEE International Symposium on Information Theory: Proceedings, 2019, p. 1012-1016Conference paper, Published paper (Refereed)
Abstract [en]

An approach to constructing discrete models of packet losses suitable for a wide variety of communication network applications is studied. It is based on estimating parameters of probabilistic automata described via so-called pseudo-Markov chains. The new technique is applied both to approximating a discrete time analog process at the output of known channel models and to the experimental data stream. Comparison of models is performed by computing probabilities of more than m losses out of n transmitted packets (P (m, n)). It is shown that for the Rician fading channel with exponential correlation and correlation determined by a Bessel filter, the obtained rank-two and rank-three discrete modes, respectively, provide high accuracy coincidence of P (m, n) performances. The rank-three discrete model computed on the experimental data stream obtained from the LTE network provides significantly better approximation of P (≥ m, n) performance than that obtained by the Baum-Welch algorithm.

Place, publisher, year, edition, pages
2019. p. 1012-1016
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:hh:diva-40634DOI: 10.1109/ISIT.2019.8849400ISBN: 978-1-5386-9291-2 (electronic)ISBN: 978-1-5386-9290-5 (print)ISBN: 978-1-5386-9292-9 (print)OAI: oai:DiVA.org:hh-40634DiVA, id: diva2:1355134
Conference
IEEE International Symposium on Information Theory (ISIT), Paris, France, July 7-12, 2019
Projects
AstaMoCA
Funder
Knowledge FoundationSwedish Foundation for Strategic Research ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Note

Funder: European Cooperation in Science and Technology & Estonian Research Council

Available from: 2019-09-27 Created: 2019-09-27 Last updated: 2019-09-30Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Rabi, MabenLyamin, NikitaVinel, Alexey

Search in DiVA

By author/editor
Kudryashov, BorisRabi, MabenLyamin, NikitaDankers, WouterVinel, Alexey
By organisation
Centre for Research on Embedded Systems (CERES)
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 11 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf