Logo: to the web site of Uppsala University

uu.sePublications from Uppsala University
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Change Point Detection with Adaptive Measurement Schedules for Network Performance Verification
Ericsson Res, Kista, Sweden.;KTH Royal Inst Technol, Stockholm, Sweden..
KTH Royal Inst Technol, Stockholm, Sweden..
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computer Systems. Ericsson Res, Kista, Sweden.ORCID iD: 0000-0003-3743-9431
2023 (English)In: Proceedings of the ACM on Measurement and Analysis of Computing Systems, E-ISSN 2476-1249, Vol. 7, no 3, article id 53Article in journal (Refereed) Published
Abstract [en]

When verifying that a communications network fulfills its specified performance, it is critical to note sudden shifts in network behavior as quickly as possible. Change point detection methods can be useful in this endeavor, but classical methods rely on measuring with a fixed measurement period, which can often be suboptimal in terms of measurement costs. In this paper, we extend the existing framework of change point detection with a notion of physical time. Instead of merely deciding when to stop, agents must now also decide at which future time to take the next measurement. Agents must now minimize the necessary number of measurements pre- and post-change, while maintaining a trade-off between post-change delay and false alarm rate. We establish, through this framework, the suboptimality of typical periodic measurements and propose a simple alternative, called crisis mode agents. We show analytically that crisis mode agents significantly outperform periodic measurements schemes. We further verify this in numerical evaluation, both on an array of synthetic change point detection problems as well as on the problem of detecting traffic load changes in a 5G test bed through end-to-end RTT measurements.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2023. Vol. 7, no 3, article id 53
Keywords [en]
Change detection, Network measurements, Network management, Applied statistics, Hypothesis testing
National Category
Control Engineering Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-522453DOI: 10.1145/3626784ISI: 001137927100012OAI: oai:DiVA.org:uu-522453DiVA, id: diva2:1835967
Funder
Knut and Alice Wallenberg FoundationVinnova, C2020/2-2Wallenberg AI, Autonomous Systems and Software Program (WASP)Available from: 2024-02-07 Created: 2024-02-07 Last updated: 2025-08-28Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Johnsson, Andreas

Search in DiVA

By author/editor
Johnsson, Andreas
By organisation
Computer Architecture and Computer CommunicationDivision of Computer Systems
In the same journal
Proceedings of the ACM on Measurement and Analysis of Computing Systems
Control EngineeringComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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