{"title":"基于动态TDD的单元间协调流级建模与优化","authors":"Prajwal Osti, S. Aalto, P. Lassila","doi":"10.1145/2642687.2642698","DOIUrl":null,"url":null,"abstract":"We study the intercell coordination problem between two interfering cells combined with dynamic time-division duplexing (TDD). In dynamic TDD, each station selects in each time slot whether it is serving uplink (u) or downlink (d) traffic. Thus, the system has four possible operation modes (uu, ud, du, dd). The amount of intercell interference between the stations clearly depends on the operation mode. We consider a flow-level model where traffic consists of elastic data flows in both cells (cells 1 and 2) and in both directions (uplink and downlink). We first characterize the maximal stability region, and then determine the optimal static (i.e., state-independent) policy. Our main objective is to analyze the potential gains from applying dynamic (i.e., state-dependent) policies, where the chosen operation mode depends on the instantaneous state of the system. To this end, motivated by certain stochastic optimality results in the literature, we define several priority policies. As a reference policy, we have the well-known max-weight policy, and we also develop another dynamic policy by applying the policy iteration algorithm. Notably we prove that certain simple priority policies are, in fact, stochastically optimal in some special cases, but which policy is optimal depends on the setting. To study the exact performance gains achieved by the dynamic policies, we perform extensive simulations. While our stochastic optimality results require exponential service times, in the simulations, we also study the impact of nonexponential service times and consider a physical model where the service time distribution is determined by the joint distribution of flow sizes and the random location of the corresponding user in the cell area. The max-weight policy is, as expected, performing well but the various priority policies are sometimes better and even optimal. Jointly the results indicate that dynamic policies give significant performance gains compared with the optimal static policy.","PeriodicalId":369459,"journal":{"name":"Q2S and Security for Wireless and Mobile Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Flow-level modeling and optimization of intercell coordination with dynamic TDD\",\"authors\":\"Prajwal Osti, S. Aalto, P. Lassila\",\"doi\":\"10.1145/2642687.2642698\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the intercell coordination problem between two interfering cells combined with dynamic time-division duplexing (TDD). In dynamic TDD, each station selects in each time slot whether it is serving uplink (u) or downlink (d) traffic. Thus, the system has four possible operation modes (uu, ud, du, dd). The amount of intercell interference between the stations clearly depends on the operation mode. We consider a flow-level model where traffic consists of elastic data flows in both cells (cells 1 and 2) and in both directions (uplink and downlink). We first characterize the maximal stability region, and then determine the optimal static (i.e., state-independent) policy. Our main objective is to analyze the potential gains from applying dynamic (i.e., state-dependent) policies, where the chosen operation mode depends on the instantaneous state of the system. To this end, motivated by certain stochastic optimality results in the literature, we define several priority policies. As a reference policy, we have the well-known max-weight policy, and we also develop another dynamic policy by applying the policy iteration algorithm. Notably we prove that certain simple priority policies are, in fact, stochastically optimal in some special cases, but which policy is optimal depends on the setting. To study the exact performance gains achieved by the dynamic policies, we perform extensive simulations. While our stochastic optimality results require exponential service times, in the simulations, we also study the impact of nonexponential service times and consider a physical model where the service time distribution is determined by the joint distribution of flow sizes and the random location of the corresponding user in the cell area. The max-weight policy is, as expected, performing well but the various priority policies are sometimes better and even optimal. Jointly the results indicate that dynamic policies give significant performance gains compared with the optimal static policy.\",\"PeriodicalId\":369459,\"journal\":{\"name\":\"Q2S and Security for Wireless and Mobile Networks\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Q2S and Security for Wireless and Mobile Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2642687.2642698\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Q2S and Security for Wireless and Mobile Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2642687.2642698","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
摘要
结合动态时分双工(TDD)技术,研究了两个干扰小区间的协调问题。在动态TDD中,每个站点在每个时隙中选择是上行(u)还是下行(d)业务。因此,系统有四种可能的运行模式(uu, ud, du, dd)。基站间的干扰量显然取决于操作方式。我们考虑一个流级模型,其中流量由两个单元(单元1和单元2)和两个方向(上行链路和下行链路)中的弹性数据流组成。我们首先描述最大稳定区域,然后确定最优静态(即状态独立)策略。我们的主要目标是分析应用动态(即依赖于状态的)策略的潜在收益,其中选择的操作模式取决于系统的瞬时状态。为此,在文献中某些随机最优结果的激励下,我们定义了几个优先级策略。作为参考策略,我们有众所周知的最大权值策略,我们还通过策略迭代算法开发了另一种动态策略。值得注意的是,我们证明了某些简单的优先级策略实际上在某些特殊情况下是随机最优的,但哪种策略是最优的取决于设置。为了研究动态策略所获得的确切性能增益,我们进行了大量的模拟。虽然我们的随机优化结果需要指数服务时间,但在模拟中,我们还研究了非指数服务时间的影响,并考虑了一个物理模型,其中服务时间分布由流量大小的联合分布和相应用户在小区区域的随机位置决定。正如预期的那样,最大权重策略表现良好,但各种优先级策略有时更好,甚至是最优的。结果表明,与最优静态策略相比,动态策略具有显著的性能提升。
Flow-level modeling and optimization of intercell coordination with dynamic TDD
We study the intercell coordination problem between two interfering cells combined with dynamic time-division duplexing (TDD). In dynamic TDD, each station selects in each time slot whether it is serving uplink (u) or downlink (d) traffic. Thus, the system has four possible operation modes (uu, ud, du, dd). The amount of intercell interference between the stations clearly depends on the operation mode. We consider a flow-level model where traffic consists of elastic data flows in both cells (cells 1 and 2) and in both directions (uplink and downlink). We first characterize the maximal stability region, and then determine the optimal static (i.e., state-independent) policy. Our main objective is to analyze the potential gains from applying dynamic (i.e., state-dependent) policies, where the chosen operation mode depends on the instantaneous state of the system. To this end, motivated by certain stochastic optimality results in the literature, we define several priority policies. As a reference policy, we have the well-known max-weight policy, and we also develop another dynamic policy by applying the policy iteration algorithm. Notably we prove that certain simple priority policies are, in fact, stochastically optimal in some special cases, but which policy is optimal depends on the setting. To study the exact performance gains achieved by the dynamic policies, we perform extensive simulations. While our stochastic optimality results require exponential service times, in the simulations, we also study the impact of nonexponential service times and consider a physical model where the service time distribution is determined by the joint distribution of flow sizes and the random location of the corresponding user in the cell area. The max-weight policy is, as expected, performing well but the various priority policies are sometimes better and even optimal. Jointly the results indicate that dynamic policies give significant performance gains compared with the optimal static policy.