{"title":"Data-Driven End-to-End Delay Violation Probability Prediction with Extreme Value Mixture Models","authors":"S. Mostafavi, G. Dán, James Gross","doi":"10.1145/3453142.3493506","DOIUrl":null,"url":null,"abstract":"With the advent of edge computing, there is increasing interest in wireless latency-critical services. Such applications require the end-to-end delay of the network infrastructure (communication and computation) to be less than a target delay with a certain probability, e.g., 10-2-10-5. To deal with this guarantee level, the first step is to predict the transient delay violation probability (DVP) of the packets traversing the network. The guarantee level puts a threshold on the tail of the end-to-end delay distribution; thus, it makes data-driven DVP prediction a challenging task. We propose to use the extreme value mixture model in the mixture density network (MDN) method for this task. We implemented it in a multi-hop queuing-theoretic system to predict the DVP of each packet from the network state variables. This work is a first step toward utilizing the DVP predictions, possibly in the resource allocation scheme or queuing discipline. Numerically, we show that our proposed approach outperforms state-of-the-art Gaussian mixture model-based predictors by orders of magnitude, in particular for scenarios with guarantee levels above 10−2.","PeriodicalId":6779,"journal":{"name":"2021 IEEE/ACM Symposium on Edge Computing (SEC)","volume":"19 1","pages":"416-422"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/ACM Symposium on Edge Computing (SEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3453142.3493506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
With the advent of edge computing, there is increasing interest in wireless latency-critical services. Such applications require the end-to-end delay of the network infrastructure (communication and computation) to be less than a target delay with a certain probability, e.g., 10-2-10-5. To deal with this guarantee level, the first step is to predict the transient delay violation probability (DVP) of the packets traversing the network. The guarantee level puts a threshold on the tail of the end-to-end delay distribution; thus, it makes data-driven DVP prediction a challenging task. We propose to use the extreme value mixture model in the mixture density network (MDN) method for this task. We implemented it in a multi-hop queuing-theoretic system to predict the DVP of each packet from the network state variables. This work is a first step toward utilizing the DVP predictions, possibly in the resource allocation scheme or queuing discipline. Numerically, we show that our proposed approach outperforms state-of-the-art Gaussian mixture model-based predictors by orders of magnitude, in particular for scenarios with guarantee levels above 10−2.