Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834726
Yanfei Dong, K. Niu, Jincheng Dai
In this paper, we propose a new class of distributed joint source-channel coding (DJSCC) methods, namely triple polar codes (T-PC), for transmitting a pair of correlated binary sources over noisy channels. In the T-PC structure, one source is protected by a systematic polar code (SPC), and the other source is encoded into a double polar code (D-PC) word. Following this, we prove the T-PC approaches the corner point of the achievable rate-region of DJSCC. We further propose a distributed joint source-channel decoding algorithm, which involves two components: a cyclic redundancy check (CRC) aided successive cancellation list (CA-SCL) decoding of the SPC and a joint successive cancellation list (J-SCL) decoding of the D-PC. The CA-SCL and J-SCL decoding procedures alternately generate hard-decisions of sources which are iteratively exchanged as the side information and result in superior performance compared with the state-of-the-art polar code based DJSCC scheme.
{"title":"Distributed Joint Source-Channel Polar Coding","authors":"Yanfei Dong, K. Niu, Jincheng Dai","doi":"10.1109/ISIT50566.2022.9834726","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834726","url":null,"abstract":"In this paper, we propose a new class of distributed joint source-channel coding (DJSCC) methods, namely triple polar codes (T-PC), for transmitting a pair of correlated binary sources over noisy channels. In the T-PC structure, one source is protected by a systematic polar code (SPC), and the other source is encoded into a double polar code (D-PC) word. Following this, we prove the T-PC approaches the corner point of the achievable rate-region of DJSCC. We further propose a distributed joint source-channel decoding algorithm, which involves two components: a cyclic redundancy check (CRC) aided successive cancellation list (CA-SCL) decoding of the SPC and a joint successive cancellation list (J-SCL) decoding of the D-PC. The CA-SCL and J-SCL decoding procedures alternately generate hard-decisions of sources which are iteratively exchanged as the side information and result in superior performance compared with the state-of-the-art polar code based DJSCC scheme.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115295620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834270
N. Mital, Deniz Gündüz
We consider a distributed computation problem over a multiple access channel (MAC), with N devices. It is known that over-the-air computation (OAC) can provide significant gains for this problem, but existing works are limited to the scenario with matched source and channel bandwidths. We propose OAC schemes for block-fading MACs that modulate the source to fit the available channel bandwidth in a wideband channel, while having channel state information (CSI) only at the transmitter or the receiver. Our results show that the proposed OAC scheme outperforms even ideal capacity-achieving digital schemes when the CSI is available only at the transmitter, and the distortion does not scale with the number of participating devices. We demonstrate the effectiveness of our proposed scheme in federated edge learning (FEEL), where OAC is used to aggregate model updates from the participating devices.
{"title":"Bandwidth Expansion for Over-the-Air Computation with One-Sided CSI","authors":"N. Mital, Deniz Gündüz","doi":"10.1109/ISIT50566.2022.9834270","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834270","url":null,"abstract":"We consider a distributed computation problem over a multiple access channel (MAC), with N devices. It is known that over-the-air computation (OAC) can provide significant gains for this problem, but existing works are limited to the scenario with matched source and channel bandwidths. We propose OAC schemes for block-fading MACs that modulate the source to fit the available channel bandwidth in a wideband channel, while having channel state information (CSI) only at the transmitter or the receiver. Our results show that the proposed OAC scheme outperforms even ideal capacity-achieving digital schemes when the CSI is available only at the transmitter, and the distortion does not scale with the number of participating devices. We demonstrate the effectiveness of our proposed scheme in federated edge learning (FEEL), where OAC is used to aggregate model updates from the participating devices.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115459780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834609
Yujia Mu, Cong Shen, Yonina C. Eldar
Deep fading represents the typical error event when communicating over wireless channels. We show that deep fading is particularly detrimental for federated learning (FL) over wireless communications. In particular, the celebrated FEDAVG and several of its variants break down for FL tasks when deep fading exists in the communication phase. The main contribution of this paper is an optimal global model aggregation method at the parameter server, which allocates different weights to different clients based on not only their learning characteristics but also the instantaneous channel state information at the receiver (CSIR). This is accomplished by first deriving an upper bound on the parallel stochastic gradient descent (SGD) convergence over fading channels, and then solving an optimization problem for the server aggregation weights that minimizes this upper bound. The derived optimal aggregation solution is closed-form, and achieves the well-known O(1/t) convergence rate for strongly-convex loss functions under arbitrary fading and decaying learning rates. We validate our approach using several real-world FL tasks.
{"title":"Optimizing Federated Averaging over Fading Channels","authors":"Yujia Mu, Cong Shen, Yonina C. Eldar","doi":"10.1109/ISIT50566.2022.9834609","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834609","url":null,"abstract":"Deep fading represents the typical error event when communicating over wireless channels. We show that deep fading is particularly detrimental for federated learning (FL) over wireless communications. In particular, the celebrated FEDAVG and several of its variants break down for FL tasks when deep fading exists in the communication phase. The main contribution of this paper is an optimal global model aggregation method at the parameter server, which allocates different weights to different clients based on not only their learning characteristics but also the instantaneous channel state information at the receiver (CSIR). This is accomplished by first deriving an upper bound on the parallel stochastic gradient descent (SGD) convergence over fading channels, and then solving an optimization problem for the server aggregation weights that minimizes this upper bound. The derived optimal aggregation solution is closed-form, and achieves the well-known O(1/t) convergence rate for strongly-convex loss functions under arbitrary fading and decaying learning rates. We validate our approach using several real-world FL tasks.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125203307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834632
Anuj Kumar Yadav, Mohammadreza Alimohammadi, Yihan Zhang, Amitalok J. Budkuley, S. Jaggi
In the classic adversarial communication problem, two parties communicate over a noisy channel in the presence of a malicious jamming adversary. The arbitrarily varying channels (AVCs) offer an elegant framework to study a wide range of interesting adversary models. The optimal throughput or capacity over such AVCs is intimately tied to the underlying adversary model; in some cases, capacity is unknown and the problem is known to be notoriously hard. The omniscient adversary, one which knows the sender’s entire channel transmission a priori, is one of such classic models of interest; the capacity under such an adversary remains an exciting open problem. The myopic adversary is a generalization of that model where the adversary’s observation may be corrupted over a noisy discrete memoryless channel. Through the adversary’s myopicity, one can unify the slew of different adversary models, ranging from the omniscient adversary to one that is completely blind to the transmission (the latter is the well known oblivious model where the capacity is fully characterized).In this work, we present new results on the capacity under both the omniscient and myopic adversary models. We completely characterize the positive capacity threshold over general AVCs with omniscient adversaries. The characterization is in terms of two key combinatorial objects: the set of completely positive distributions and the CP-confusability set. For omniscient AVCs with positive capacity, we present non-trivial lower and upper bounds on the capacity; unlike some of the previous bounds, our bounds hold under fairly general input and jamming constraints. Our lower bound improves upon the generalized Gilbert-Varshamov bound for general AVCs while the upper bound generalizes the well known Elias-Bassalygo bound (known for binary and q-ary alphabets). For the myopic AVCs, we build on prior results known for the so-called sufficiently myopic model, and present new results on the positive rate communication threshold over the so-called insufficiently myopic regime (a completely insufficient myopic adversary specializes to an omniscient adversary). We present interesting examples for the widely studied models of adversarial bit-flip and bit-erasure channels. In fact, for the bit-flip AVC with additive adversarial noise as well as random noise, we completely characterize the omniscient model capacity when the random noise is sufficiently large vis-a-vis the adversary’s budget.
{"title":"New Results on AVCs with Omniscient and Myopic Adversaries","authors":"Anuj Kumar Yadav, Mohammadreza Alimohammadi, Yihan Zhang, Amitalok J. Budkuley, S. Jaggi","doi":"10.1109/ISIT50566.2022.9834632","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834632","url":null,"abstract":"In the classic adversarial communication problem, two parties communicate over a noisy channel in the presence of a malicious jamming adversary. The arbitrarily varying channels (AVCs) offer an elegant framework to study a wide range of interesting adversary models. The optimal throughput or capacity over such AVCs is intimately tied to the underlying adversary model; in some cases, capacity is unknown and the problem is known to be notoriously hard. The omniscient adversary, one which knows the sender’s entire channel transmission a priori, is one of such classic models of interest; the capacity under such an adversary remains an exciting open problem. The myopic adversary is a generalization of that model where the adversary’s observation may be corrupted over a noisy discrete memoryless channel. Through the adversary’s myopicity, one can unify the slew of different adversary models, ranging from the omniscient adversary to one that is completely blind to the transmission (the latter is the well known oblivious model where the capacity is fully characterized).In this work, we present new results on the capacity under both the omniscient and myopic adversary models. We completely characterize the positive capacity threshold over general AVCs with omniscient adversaries. The characterization is in terms of two key combinatorial objects: the set of completely positive distributions and the CP-confusability set. For omniscient AVCs with positive capacity, we present non-trivial lower and upper bounds on the capacity; unlike some of the previous bounds, our bounds hold under fairly general input and jamming constraints. Our lower bound improves upon the generalized Gilbert-Varshamov bound for general AVCs while the upper bound generalizes the well known Elias-Bassalygo bound (known for binary and q-ary alphabets). For the myopic AVCs, we build on prior results known for the so-called sufficiently myopic model, and present new results on the positive rate communication threshold over the so-called insufficiently myopic regime (a completely insufficient myopic adversary specializes to an omniscient adversary). We present interesting examples for the widely studied models of adversarial bit-flip and bit-erasure channels. In fact, for the bit-flip AVC with additive adversarial noise as well as random noise, we completely characterize the omniscient model capacity when the random noise is sufficiently large vis-a-vis the adversary’s budget.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"22 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116635701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834371
Shashank Vatedka, V. Chandar, A. Tchamkerten
This paper investigates the Slepian-Wolf distributed compression of two sources Xn and Yn with the additional property that any pair (Xi, Yi) should reliably be decoded by probing a small number d of compressed bits. We show that for certain source distributions, the error probability of any such local decoder is lower bounded by 2–O(d), in the worst case over index i, whenever one of the sources is compressed below its entropy. Unlike the single-source setup, it is thus impossible to simultaneously achieve constant local decodability d and vanishing local decoding error probability as n increases. We also provide a compression scheme with a local decoder that almost achieves the above lower bound.
{"title":"Locally Decodable Slepian-Wolf Compression","authors":"Shashank Vatedka, V. Chandar, A. Tchamkerten","doi":"10.1109/ISIT50566.2022.9834371","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834371","url":null,"abstract":"This paper investigates the Slepian-Wolf distributed compression of two sources Xn and Yn with the additional property that any pair (Xi, Yi) should reliably be decoded by probing a small number d of compressed bits. We show that for certain source distributions, the error probability of any such local decoder is lower bounded by 2–O(d), in the worst case over index i, whenever one of the sources is compressed below its entropy. Unlike the single-source setup, it is thus impossible to simultaneously achieve constant local decodability d and vanishing local decoding error probability as n increases. We also provide a compression scheme with a local decoder that almost achieves the above lower bound.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"3 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120905079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834579
Aniruddha Phatak, M. Varanasi
A model of device-to-device (D2D) coded caching in which only a subset of users transmit information during the D2D transmission process was recently introduced. Such networks are referred to as partially cooperative D2D networks. Tebbi and Sung proposed a coded caching achievability scheme for such networks that enables all users to obtain their respective file demands. This is done by forming user sets and employing some of the transmitting users to compensate for the non-transmitting users in each such user set. In this paper, we show that this approach is sub-optimal. In particular, we show that by forming groups of such user sets that satisfy certain properties, it is possible to exploit additional coding opportunities across all the user sets in that group that are not exploited in the previously proposed scheme. We also show how to construct such groups and characterize the resulting improvement in the device-to-device transmission rate.
{"title":"An improved coded caching scheme for partially cooperative D2D networks","authors":"Aniruddha Phatak, M. Varanasi","doi":"10.1109/ISIT50566.2022.9834579","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834579","url":null,"abstract":"A model of device-to-device (D2D) coded caching in which only a subset of users transmit information during the D2D transmission process was recently introduced. Such networks are referred to as partially cooperative D2D networks. Tebbi and Sung proposed a coded caching achievability scheme for such networks that enables all users to obtain their respective file demands. This is done by forming user sets and employing some of the transmitting users to compensate for the non-transmitting users in each such user set. In this paper, we show that this approach is sub-optimal. In particular, we show that by forming groups of such user sets that satisfy certain properties, it is possible to exploit additional coding opportunities across all the user sets in that group that are not exploited in the previously proposed scheme. We also show how to construct such groups and characterize the resulting improvement in the device-to-device transmission rate.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127103395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834504
Ali Farsiabi, A. Banihashemi
In this paper, we propose a novel state-space model to represent the behavior of sum-product algorithm (SPA) in the vicinity of a trapping set (TS) of a low-density parity-check (LDPC) code over the additive white Gaussian noise (AWGN) channel in the error floor region. The proposed model takes into account the non-linear behavior of SPA and dynamically adjusts the operating point of the model in accordance to the statistical properties of TS messages. This is in contrast to the existing linear state-space models which linearly approximate such behavior at around the operating point of zero. Simulation results are provided to demonstrate the higher accuracy of the proposed model in estimating the error floor of LDPC codes compared to the linear state-space model.
{"title":"A Semi Linear State Space Model for Error Floor Estimation of LDPC codes over the AWGN Channel","authors":"Ali Farsiabi, A. Banihashemi","doi":"10.1109/ISIT50566.2022.9834504","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834504","url":null,"abstract":"In this paper, we propose a novel state-space model to represent the behavior of sum-product algorithm (SPA) in the vicinity of a trapping set (TS) of a low-density parity-check (LDPC) code over the additive white Gaussian noise (AWGN) channel in the error floor region. The proposed model takes into account the non-linear behavior of SPA and dynamically adjusts the operating point of the model in accordance to the statistical properties of TS messages. This is in contrast to the existing linear state-space models which linearly approximate such behavior at around the operating point of zero. Simulation results are provided to demonstrate the higher accuracy of the proposed model in estimating the error floor of LDPC codes compared to the linear state-space model.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125856967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834855
Lampros Gavalakis, I. Kontoyiannis
An information-theoretic proof of a strengthened version of the classical discrete central limit theorem is presented. Using only information-theoretic and elementary arguments, convergence to zero of the relative entropy between the standardised sum of n independent and identically distributed lattice random variables and an appropriately discretised Gaussian is established.
{"title":"The Entropic Central Limit Theorem for Discrete Random Variables","authors":"Lampros Gavalakis, I. Kontoyiannis","doi":"10.1109/ISIT50566.2022.9834855","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834855","url":null,"abstract":"An information-theoretic proof of a strengthened version of the classical discrete central limit theorem is presented. Using only information-theoretic and elementary arguments, convergence to zero of the relative entropy between the standardised sum of n independent and identically distributed lattice random variables and an appropriately discretised Gaussian is established.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123241975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834874
Xi Zhang, Jingqing Wang, H. Poor
To support increasing demands for real-time multimedia wireless data traffic, there have been considerable efforts toward guaranteeing stringent quality-of-service (QoS) when designing mobile wireless network architectures for ultra-reliable and low-latency communications (URLLC). One of the major design issues raised by URLLC is how to characterize QoS metrics for upper-bounding both delay and error-rate when implementing short-packet data communications, such as finite blocklength coding (FBC), over highly time-varying wireless fading channels. To efficiently accommodate statistical QoS provisioning for URLLC traffic, it is crucial to model and investigate wireless fading channels’ stochastic-characteristics by defining and identifying new statistical QoS metrics and their analytical relationships, such as delay-bound-violating probability, effective capacity, decoding error probability, outage capacity, etc., in the non-asymptotic regime. However, how to rigorously and efficiently characterize the stochastic dynamics of mobile wireless networks in terms of statistically upper-bounding FBC-based both delay and error-rate QoS metrics has been neither well understood nor thoroughly studied before. To overcome these challenges, in this paper we develop analytical modeling frameworks and controlling mechanisms for statistical delay and error-rate bounded QoS provisioning in the non-asymptotic regime. First, we establish FBC-based system models by characterizing various information-theoretic specifications. Second, we characterize the outage-probability and outage capacity functions in the non-asymptotic regime. Third, we develop a set of new statistical delay and error-rate bounded QoS metrics and control mechanisms including delay-bound-violation probability, QoS-exponent functions, and the -effective capacity in the non-asymptotic regime. Finally, the obtained simulation results validate and evaluate our proposed controlling mechanisms for statistical QoS in supporting URLLC.
{"title":"Statistical Delay and Error-Rate Bounded QoS Control for URLLC in the Non-Asymptotic Regime","authors":"Xi Zhang, Jingqing Wang, H. Poor","doi":"10.1109/ISIT50566.2022.9834874","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834874","url":null,"abstract":"To support increasing demands for real-time multimedia wireless data traffic, there have been considerable efforts toward guaranteeing stringent quality-of-service (QoS) when designing mobile wireless network architectures for ultra-reliable and low-latency communications (URLLC). One of the major design issues raised by URLLC is how to characterize QoS metrics for upper-bounding both delay and error-rate when implementing short-packet data communications, such as finite blocklength coding (FBC), over highly time-varying wireless fading channels. To efficiently accommodate statistical QoS provisioning for URLLC traffic, it is crucial to model and investigate wireless fading channels’ stochastic-characteristics by defining and identifying new statistical QoS metrics and their analytical relationships, such as delay-bound-violating probability, effective capacity, decoding error probability, outage capacity, etc., in the non-asymptotic regime. However, how to rigorously and efficiently characterize the stochastic dynamics of mobile wireless networks in terms of statistically upper-bounding FBC-based both delay and error-rate QoS metrics has been neither well understood nor thoroughly studied before. To overcome these challenges, in this paper we develop analytical modeling frameworks and controlling mechanisms for statistical delay and error-rate bounded QoS provisioning in the non-asymptotic regime. First, we establish FBC-based system models by characterizing various information-theoretic specifications. Second, we characterize the outage-probability and outage capacity functions in the non-asymptotic regime. Third, we develop a set of new statistical delay and error-rate bounded QoS metrics and control mechanisms including delay-bound-violation probability, QoS-exponent functions, and the -effective capacity in the non-asymptotic regime. Finally, the obtained simulation results validate and evaluate our proposed controlling mechanisms for statistical QoS in supporting URLLC.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123399340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834759
Somya Singh, F. Alajaji, B. Gharesifard
We construct a system of interacting finite memory Pólya urns to model contagion spread in a network. The urns, which are composed of red and black balls (representing degrees of infection and healthiness, respectively) interact in the sense that the probability at any time instant of drawing a red ball for a given urn not only depends on that urn’s ratio of red balls, but also on the ratio of red balls in the other urns of the network, hence accounting for the effect of spatial contagion. The urns have a finite memory, M, in the sense that reinforcing (black or red) balls added to each urn at time t are only kept in that urn for M future time instants (until time t + M). The resulting vector of all urn drawing variables forms an Mth order time-invariant irreducible and aperiodic Markov chain. We analytically examine the properties of the underlying Markov process and derive its asymptotic behaviour for the case of homogeneous system parameters. We further use mean-field approximation to obtain a class of approximating linear and nonlinear dynamical systems for the non-homogeneous case. Finally, we present simulations to assess the quality of these mean-field approximations.
{"title":"Modeling Network Contagion Via Interacting Finite Memory Pólya Urns","authors":"Somya Singh, F. Alajaji, B. Gharesifard","doi":"10.1109/ISIT50566.2022.9834759","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834759","url":null,"abstract":"We construct a system of interacting finite memory Pólya urns to model contagion spread in a network. The urns, which are composed of red and black balls (representing degrees of infection and healthiness, respectively) interact in the sense that the probability at any time instant of drawing a red ball for a given urn not only depends on that urn’s ratio of red balls, but also on the ratio of red balls in the other urns of the network, hence accounting for the effect of spatial contagion. The urns have a finite memory, M, in the sense that reinforcing (black or red) balls added to each urn at time t are only kept in that urn for M future time instants (until time t + M). The resulting vector of all urn drawing variables forms an Mth order time-invariant irreducible and aperiodic Markov chain. We analytically examine the properties of the underlying Markov process and derive its asymptotic behaviour for the case of homogeneous system parameters. We further use mean-field approximation to obtain a class of approximating linear and nonlinear dynamical systems for the non-homogeneous case. Finally, we present simulations to assess the quality of these mean-field approximations.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126614005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：