IEEE Journal on Selected Areas in Communications最新文献

英文中文

Optimal State Replication in Stateful Data Planes 有状态数据平面的最优状态复制

IF 16.4 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2019-12-06 DOI: 10.1109/JSAC.2020.2986939

A. Muqaddas, G. Sviridov, P. Giaccone, A. Bianco

In SDN stateful data planes, switches can execute algorithms to process traffic based on local states. This approach permits to offload decisions from the controller to the switches, thus reducing the latency when reacting to network events. We consider distributed network applications that process traffic at each switch based on local replicas of network-wide states. Replicating a state across multiple switches poses many challenges, because the number of state replicas and their placement affects both the data traffic distribution and the amount of synchronization traffic among the replicas. In this paper, we formulate the optimal placement problem for replicated states, taking into account the data traffic routing, to ensure that traffic flows are properly managed by network applications, and the synchronization traffic between replicas, to ensure state coherence. Due to the high complexity required to find the optimal solution, we also propose an approximated algorithm to scale to large network instances. We numerically show that this algorithm, despite its simplicity, well approximates the optimal solution. We also show the beneficial effects of state replication with respect to the single-replica scenario, so far considered in the literature. Finally, we provide an asymptotic analysis to find the optimal number of replicas.

在SDN状态数据平面中，交换机可以根据本地状态执行处理流量的算法。这种方法允许将决策从控制器转移到交换机，从而减少对网络事件作出反应时的延迟。我们考虑分布式网络应用程序，这些应用程序基于网络范围状态的本地副本来处理每个交换机上的流量。跨多个交换机复制状态会带来许多挑战，因为状态副本的数量及其位置会影响副本之间的数据流量分布和同步流量。在本文中，我们制定了复制状态的最优放置问题，考虑了数据流量路由，以确保网络应用程序正确管理流量流，并考虑了副本之间的同步流量，以确保状态一致性。由于寻找最优解决方案需要很高的复杂性，我们还提出了一种近似算法来扩展到大型网络实例。数值结果表明，该算法虽然简单，但却能很好地逼近最优解。我们还展示了相对于单副本场景的状态复制的有益效果，到目前为止在文献中已经考虑过了。最后，我们提供了一个渐近分析，以找到最优的副本数量。

{"title":"Optimal State Replication in Stateful Data Planes","authors":"A. Muqaddas, G. Sviridov, P. Giaccone, A. Bianco","doi":"10.1109/JSAC.2020.2986939","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986939","url":null,"abstract":"In SDN stateful data planes, switches can execute algorithms to process traffic based on local states. This approach permits to offload decisions from the controller to the switches, thus reducing the latency when reacting to network events. We consider distributed network applications that process traffic at each switch based on local replicas of network-wide states. Replicating a state across multiple switches poses many challenges, because the number of state replicas and their placement affects both the data traffic distribution and the amount of synchronization traffic among the replicas. In this paper, we formulate the optimal placement problem for replicated states, taking into account the data traffic routing, to ensure that traffic flows are properly managed by network applications, and the synchronization traffic between replicas, to ensure state coherence. Due to the high complexity required to find the optimal solution, we also propose an approximated algorithm to scale to large network instances. We numerically show that this algorithm, despite its simplicity, well approximates the optimal solution. We also show the beneficial effects of state replication with respect to the single-replica scenario, so far considered in the literature. Finally, we provide an asymptotic analysis to find the optimal number of replicas.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1388-1400"},"PeriodicalIF":16.4,"publicationDate":"2019-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986939","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44013282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Post-operative colorectal cancer surveillance: preference for optical colonoscopy over computerized tomographic colonography. 大肠癌术后监测：光学结肠镜检查优于计算机断层扫描结肠成像。

IF 2.3 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2019-11-01 Epub Date: 2019-09-17 DOI: 10.1007/s10552-019-01231-w

David S Weinberg, Jeremy Mitnick, Eileen Keenan, Tianyu Li, Eric A Ross

Purpose: Post-operative surveillance strategies for colorectal cancer (CRC) include periodic optical colonoscopy (OC) and abdominal-pelvic CT scan. Adherence with these recommendations is limited. For CRC screening, CT colonography (CTC) identifies larger adenomas and cancers nearly as well as OC. Most screening studies demonstrate that patients prefer CTC. However, CTC has never been compared to OC in the post-operative surveillance setting.

Methods: We hypothesized that CTC might represent an attractive substitute for the standard OC/CT scan combination. Here, 223 patients underwent CTC followed by same day OC 1 year after curative CRC resection.

Results: Of the 144/223 (64.6%) participants with a preference, 65.9% (95/144) preferred OC. This preference was more pronounced in women and in patients with polyps detected. No additional patient level factors significantly altered this primary result.

Conclusions: In contrast to CRC screening, this first study in CRC post-operative surveillance patients demonstrates a preference for OC. Assuming patient preference is an important determinant, introduction of CTC as a method to increase patient adherence with CRC surveillance is unlikely to be effective.

Trial registration: Clinical Trials.gov registration number: NCT02143115.

目的：结直肠癌 (CRC) 术后监测策略包括定期进行光学结肠镜检查 (OC) 和腹盆腔 CT 扫描。这些建议的坚持率有限。在 CRC 筛查中，CT 结肠造影 (CTC) 几乎能像 OC 一样识别较大的腺瘤和癌症。大多数筛查研究表明，患者更喜欢 CTC。但在术后监测方面，CTC 还从未与 OC 进行过比较：我们假设 CTC 可能是标准 OC/CT 扫描组合的一种有吸引力的替代方法。在此，223 名患者在接受治愈性 CRC 切除术 1 年后接受了 CTC，随后在同一天接受了 OC：在144/223（64.6%）名有偏好的参与者中，65.9%（95/144）的人偏好OC。这种偏好在女性和发现息肉的患者中更为明显。没有其他患者层面的因素会明显改变这一主要结果：与 CRC 筛查不同，这项针对 CRC 术后监测患者的首次研究表明，患者更倾向于选择 OC。假设患者的偏好是一个重要的决定因素，那么采用 CTC 作为提高患者对 CRC 监测的依从性的方法不太可能有效：试验注册：Clinical Trials.gov 注册号：NCT02143115：试验注册：Clinical Trials.gov 注册号：NCT02143115。

{"title":"Post-operative colorectal cancer surveillance: preference for optical colonoscopy over computerized tomographic colonography.","authors":"David S Weinberg, Jeremy Mitnick, Eileen Keenan, Tianyu Li, Eric A Ross","doi":"10.1007/s10552-019-01231-w","DOIUrl":"10.1007/s10552-019-01231-w","url":null,"abstract":"Purpose: Post-operative surveillance strategies for colorectal cancer (CRC) include periodic optical colonoscopy (OC) and abdominal-pelvic CT scan. Adherence with these recommendations is limited. For CRC screening, CT colonography (CTC) identifies larger adenomas and cancers nearly as well as OC. Most screening studies demonstrate that patients prefer CTC. However, CTC has never been compared to OC in the post-operative surveillance setting.Methods: We hypothesized that CTC might represent an attractive substitute for the standard OC/CT scan combination. Here, 223 patients underwent CTC followed by same day OC 1 year after curative CRC resection.Results: Of the 144/223 (64.6%) participants with a preference, 65.9% (95/144) preferred OC. This preference was more pronounced in women and in patients with polyps detected. No additional patient level factors significantly altered this primary result.Conclusions: In contrast to CRC screening, this first study in CRC post-operative surveillance patients demonstrates a preference for OC. Assuming patient preference is an important determinant, introduction of CTC as a method to increase patient adherence with CRC surveillance is unlikely to be effective.Trial registration: Clinical Trials.gov registration number: NCT02143115.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"22 1","pages":"1269-1273"},"PeriodicalIF":2.3,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7534185/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84346880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

How to Use the IEEEtran LATEX Class 如何使用ieetran LATEX类

IF 16.4 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2019-07-09 DOI: 10.1109/jsac.2019.2927066

P. Bellavista, Antonio Corradi, L. Foschini, S. Luciano, M. Solimando

Many IT companies are embracing the new softwarization paradigm through the adoption of new architecture models, such as software-defined network and network function virtualization, primarily to limit the costs of maintaining and deploying their network infrastructures, by giving the possibility to service/application providers to reconfigure and programmatically perform actions on the network. Accordingly, the dynamic management of the data center networks requires complex operations to ensure high availability and continuous reliability in order to guarantee full functionality of the virtualized resources. In this context, simulator-based approaches are helpful for planning and evaluating the deployment of the cloud data center networking, but existing cloud simulators have several limitations: they have too high overhead for wide-scale data center networks, complex configuration, and too abstract deployment models. For these motivations, we propose DCNs-2, a novel extension for the Ns-2 simulator, as a valid solution to efficiently simulate a cloud network infrastructure, with all the involved entities, such as switches, physical/virtual machines, and racks. The proposed solution not only makes configuration easier, but through extensive tests, we show that its execution overhead is limited to less than 130 MB of memory and the execution time is acceptable even for very wide-scale and complex deployment environments.

{"title":"How to Use the IEEEtran LATEX Class","authors":"P. Bellavista, Antonio Corradi, L. Foschini, S. Luciano, M. Solimando","doi":"10.1109/jsac.2019.2927066","DOIUrl":"https://doi.org/10.1109/jsac.2019.2927066","url":null,"abstract":"Many IT companies are embracing the new softwarization paradigm through the adoption of new architecture models, such as software-defined network and network function virtualization, primarily to limit the costs of maintaining and deploying their network infrastructures, by giving the possibility to service/application providers to reconfigure and programmatically perform actions on the network. Accordingly, the dynamic management of the data center networks requires complex operations to ensure high availability and continuous reliability in order to guarantee full functionality of the virtualized resources. In this context, simulator-based approaches are helpful for planning and evaluating the deployment of the cloud data center networking, but existing cloud simulators have several limitations: they have too high overhead for wide-scale data center networks, complex configuration, and too abstract deployment models. For these motivations, we propose DCNs-2, a novel extension for the Ns-2 simulator, as a valid solution to efficiently simulate a cloud network infrastructure, with all the involved entities, such as switches, physical/virtual machines, and racks. The proposed solution not only makes configuration easier, but through extensive tests, we show that its execution overhead is limited to less than 130 MB of memory and the execution time is acceptable even for very wide-scale and complex deployment environments.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"1 1","pages":"1808-1819"},"PeriodicalIF":16.4,"publicationDate":"2019-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/jsac.2019.2927066","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62351780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

How Will the New Global Polycystic Ovary Syndrome Guideline Change Our Clinical Practice? 新的全球多囊卵巢综合症指南将如何改变我们的临床实践？

1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2019-07-03 eCollection Date: 2019-01-01 DOI: 10.1177/1179558119849605

Susie Jacob, Adam H Balen

Polycystic ovary syndrome (PCOS) is a far reaching condition that has a number of reproductive and general health implications. There has been much debate in recent years about the diagnosis and definition of PCOS and a plethora of studies assessing its management, ranging from the psychosocial aspects of the conditions, to the treatment of hyperandrogenism, anovulatory infertility, and the long-term metabolic and reproductive consequences. There has been a need to synthesise the evidence and produce an international consensus guideline for all aspects of the management of PCOS and this was achieved with the publication of the International evidence-based guideline for the assessment and management of polycystic ovary syndrome. The guideline is broadly categorised into 5 sections, which focus on diagnosis, holistic management and safe, effective fertility treatment. This article summarises the key points of the guidance and brings the management of PCOS up to date for the 21st century.

多囊卵巢综合症（PCOS）是一种影响深远的疾病，对生殖健康和全身健康都有影响。近年来，人们对多囊卵巢综合症的诊断和定义争论不休，对其治疗方法的评估研究也层出不穷，从疾病的社会心理方面，到高雄激素、无排卵性不孕症的治疗，以及长期代谢和生殖后果，不一而足。因此，有必要对证据进行综合，并针对多囊卵巢综合症管理的各个方面制定一份国际共识指南，《多囊卵巢综合症评估与管理国际循证指南》的出版实现了这一目标。该指南大致分为 5 个部分，分别侧重于诊断、整体管理和安全有效的生育治疗。本文总结了该指南的要点，并将多囊卵巢综合症的治疗方法推向 21 世纪。

引用次数: 0

IEEE Communications Society Information IEEE通信协会信息

IF 16.4 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2018-11-01 DOI: 10.1109/jsac.2018.2883229

引用次数: 0

Delay-Constrained Input-Queued Switch 延迟约束输入排队交换机

IF 16.4 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2018-06-26 DOI: 10.1145/3209582.3225206

Lei Deng, W. Wong, Po-Ning Chen, Y. Han

In this paper, we study the delay-constrained input-queued switch, where each packet has a deadline and it will expire if it is not delivered before its deadline. Such new scenario is motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, networked controlled systems, and cyber-physical systems. The delay-constrained input-queued switch is completely different from the well-understood delay-unconstrained one and thus poses new challenges. We focus on three fundamental problems centering around the performance metric of timely throughput: (i) how to characterize the capacity region? (ii) how to design a feasibility/throughput-optimal scheduling policy? and (iii) how to design a network-utility-maximization scheduling policy? We use three different approaches to solve these three fundamental problems. The first approach is based on Markov Decision Process (MDP) theory, which can solve all three problems. However, it suffers from the curse of dimensionality. The second approach breaks the curse of dimensionality by exploiting the combinatorial features of the problem. It gives a new capacity region characterization with only a polynomial number of linear constraints. The third approach is based on the framework of Lyapunov optimization, where we design a polynomial-time maximum-weight $T$ -disjoint-matching scheduling policy which is proved to be feasibility/throughput-optimal. Our three approaches apply to the frame-synchronized traffic pattern but our MDP-based approach can be extended to more general traffic patterns.

在本文中，我们研究了延迟约束的输入排队交换机，其中每个数据包都有一个截止日期，如果它没有在截止日期之前交付，它就会过期。这种新场景的动机是多媒体通信系统、触觉互联网、网络控制系统和网络物理系统中实时应用的激增。延迟约束的输入排队交换机与众所周知的延迟无约束的输入队列交换机完全不同，因此提出了新的挑战。我们专注于围绕及时吞吐量的性能指标的三个基本问题：（i）如何表征容量区域？（ii）如何设计可行性/吞吐量最优调度策略？以及（iii）如何设计网络效用最大化调度策略？我们用三种不同的方法来解决这三个基本问题。第一种方法基于马尔可夫决策过程（MDP）理论，可以解决这三个问题。然而，它遭受着维度的诅咒。第二种方法通过利用问题的组合特征打破了维度诅咒。它给出了一种仅具有多项式数量线性约束的新的容量区域特征。第三种方法基于李雅普诺夫优化框架，设计了一种多项式时间最大权值$T$-不相交匹配调度策略，该策略被证明是可行的/吞吐量最优的。我们的三种方法适用于帧同步流量模式，但我们基于MDP的方法可以扩展到更通用的流量模式。

{"title":"Delay-Constrained Input-Queued Switch","authors":"Lei Deng, W. Wong, Po-Ning Chen, Y. Han","doi":"10.1145/3209582.3225206","DOIUrl":"https://doi.org/10.1145/3209582.3225206","url":null,"abstract":"In this paper, we study the delay-constrained input-queued switch, where each packet has a deadline and it will expire if it is not delivered before its deadline. Such new scenario is motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, networked controlled systems, and cyber-physical systems. The delay-constrained input-queued switch is completely different from the well-understood delay-unconstrained one and thus poses new challenges. We focus on three fundamental problems centering around the performance metric of timely throughput: (i) how to characterize the capacity region? (ii) how to design a feasibility/throughput-optimal scheduling policy? and (iii) how to design a network-utility-maximization scheduling policy? We use three different approaches to solve these three fundamental problems. The first approach is based on Markov Decision Process (MDP) theory, which can solve all three problems. However, it suffers from the curse of dimensionality. The second approach breaks the curse of dimensionality by exploiting the combinatorial features of the problem. It gives a new capacity region characterization with only a polynomial number of linear constraints. The third approach is based on the framework of Lyapunov optimization, where we design a polynomial-time maximum-weight $T$ -disjoint-matching scheduling policy which is proved to be feasibility/throughput-optimal. Our three approaches apply to the frame-synchronized traffic pattern but our MDP-based approach can be extended to more general traffic patterns.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"36 1","pages":"2464-2474"},"PeriodicalIF":16.4,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3209582.3225206","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42441469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles 未知流行概况下小蜂窝网络中缓存的隐式协调

IF 16.4 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2018-04-05 DOI: 10.1145/3266276.3266282

Emilio Leonardi, G. Neglia

We focus on a dense cellular network, in which a limited-size cache is available at every base station (BS). In order to optimize the overall performance of the system in such scenario, where a significant fraction of the users is covered by several BSs, a tight coordination among nearby caches is needed. To this end, this paper introduces a class of simple and fully distributed caching policies, which require neither direct communication among BSs nor a priori knowledge of content popularity. Furthermore, we propose a novel approximate analytical methodology to assess the performance of interacting caches under such policies. Our approach builds upon the well-known characteristic time approximation [1] and provides predictions that are surprisingly accurate (hardly distinguishable from the simulations) in most of the scenarios. Both synthetic and trace-driven results show that our caching policies achieve an excellent performance (in some cases provably optimal). They outperform state-of-the-art dynamic policies for interacting caches, and, in some cases, also the greedy content placement, which is known to be the best performing polynomial algorithm under static and perfectly known content popularity profiles.

我们关注的是密集蜂窝网络，其中每个基站（BS）都有有限大小的缓存。在这种情况下，为了优化系统的整体性能，需要在附近的缓存之间进行紧密的协调，其中相当一部分用户被几个BS覆盖。为此，本文介绍了一类简单且完全分布式的缓存策略，该策略既不需要BS之间的直接通信，也不需要内容流行度的先验知识。此外，我们提出了一种新的近似分析方法来评估在这种策略下交互缓存的性能。我们的方法建立在众所周知的特征时间近似[1]的基础上，并在大多数情况下提供了令人惊讶的准确预测（几乎无法与模拟区分）。综合和跟踪驱动的结果都表明，我们的缓存策略实现了出色的性能（在某些情况下可以证明是最优的）。它们在交互缓存方面优于最先进的动态策略，在某些情况下，还优于贪婪内容放置，贪婪内容放置是已知的在静态和完全已知的内容流行情况下性能最好的多项式算法。

{"title":"Implicit Coordination of Caches in Small Cell Networks Under Unknown Popularity Profiles","authors":"Emilio Leonardi, G. Neglia","doi":"10.1145/3266276.3266282","DOIUrl":"https://doi.org/10.1145/3266276.3266282","url":null,"abstract":"We focus on a dense cellular network, in which a limited-size cache is available at every base station (BS). In order to optimize the overall performance of the system in such scenario, where a significant fraction of the users is covered by several BSs, a tight coordination among nearby caches is needed. To this end, this paper introduces a class of simple and fully distributed caching policies, which require neither direct communication among BSs nor a priori knowledge of content popularity. Furthermore, we propose a novel approximate analytical methodology to assess the performance of interacting caches under such policies. Our approach builds upon the well-known characteristic time approximation [1] and provides predictions that are surprisingly accurate (hardly distinguishable from the simulations) in most of the scenarios. Both synthetic and trace-driven results show that our caching policies achieve an excellent performance (in some cases provably optimal). They outperform state-of-the-art dynamic policies for interacting caches, and, in some cases, also the greedy content placement, which is known to be the best performing polynomial algorithm under static and perfectly known content popularity profiles.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"36 1","pages":"1276-1285"},"PeriodicalIF":16.4,"publicationDate":"2018-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3266276.3266282","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43054405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 32

Secure Transmission and Self-Energy Recycling for Wireless-Powered Relay Systems with Partial Eavesdropper Channel State Information 具有部分窃听信道状态信息的无线供电中继系统的安全传输和自能量回收

IF 16.4 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2017-12-29 DOI: 10.1109/JSAC.2018.2825541

Jingping Qiao, Haixia Zhang, Feng Zhao, D. Yuan

This paper focuses on the secure transmission of wireless-powered relay systems with imperfect eavesdropper channel state information (ECSI). For efficient energy transfer and information relaying, a novel two-phase protocol is proposed, in which the relay operates in full-duplex (FD) mode to achieve simultaneous wireless power and information transmission. Compared with those existing protocols, the proposed design possesses two main advantages: 1) it fully exploits the available hardware resource (antenna element) of relay and can offer higher secrecy rate; 2) it enables self-energy recycling (S-ER) at relay, in which the loopback interference (LI) generated by FD operation is harvested and reused for information relaying. To maximize the worst-case secrecy rate (WCSR) through jointly designing the source and relay beamformers coupled with the power allocation ratio, an optimization problem is formulated. This formulated problem is proved to be non-convex and the challenge to solve it is how to concurrently solve out the beamformers and the power allocation ratio. To cope with this difficulty, an alternative approach is proposed by converting the original problem into three subproblems. By solving these subproblems iteratively, the closed form solutions of robust beamformers and power allocation ratio for the original problem are achieved. Simulations are done and results reveal that the proposed S-ER based secure transmission scheme outperforms the traditional time-switching based relaying (TSR) scheme at a maximum WCSR gain of 80%. Results also demonstrate that the WCSR performance of the scheme reusing idle antennas for information reception is much better than that of schemes exploiting only one receive antenna.

研究了不完全窃听信道状态信息(ECSI)下无线供电中继系统的安全传输问题。为了实现高效的能量传输和信息中继，提出了一种新的两相协议，该协议中中继工作在全双工(FD)模式，实现无线电力和信息的同时传输。与现有协议相比，本设计具有两个主要优点:1)充分利用了中继可用的硬件资源(天线单元)，可以提供更高的保密率;2)在中继中实现自能量回收(S-ER)，即收集FD操作产生的环回干扰(LI)并重新用于信息中继。为了通过联合设计源波束形成器和中继波束形成器，结合功率分配比，使最坏保密率(WCSR)最大化，提出了一个优化问题。证明了该公式问题的非凸性，其难点在于如何同时求解波束形成器和功率分配比。为了解决这一困难，提出了一种将原问题转化为三个子问题的替代方法。通过对这些子问题的迭代求解，得到了原问题的鲁棒波束形成器和功率分配比的封闭解。仿真结果表明，基于S-ER的安全传输方案在最大WCSR增益为80%的情况下优于传统的基于时间交换的中继(TSR)方案。结果还表明，利用空闲天线进行信息接收的方案的WCSR性能远优于仅利用一个接收天线的方案。

{"title":"Secure Transmission and Self-Energy Recycling for Wireless-Powered Relay Systems with Partial Eavesdropper Channel State Information","authors":"Jingping Qiao, Haixia Zhang, Feng Zhao, D. Yuan","doi":"10.1109/JSAC.2018.2825541","DOIUrl":"https://doi.org/10.1109/JSAC.2018.2825541","url":null,"abstract":"This paper focuses on the secure transmission of wireless-powered relay systems with imperfect eavesdropper channel state information (ECSI). For efficient energy transfer and information relaying, a novel two-phase protocol is proposed, in which the relay operates in full-duplex (FD) mode to achieve simultaneous wireless power and information transmission. Compared with those existing protocols, the proposed design possesses two main advantages: 1) it fully exploits the available hardware resource (antenna element) of relay and can offer higher secrecy rate; 2) it enables self-energy recycling (S-ER) at relay, in which the loopback interference (LI) generated by FD operation is harvested and reused for information relaying. To maximize the worst-case secrecy rate (WCSR) through jointly designing the source and relay beamformers coupled with the power allocation ratio, an optimization problem is formulated. This formulated problem is proved to be non-convex and the challenge to solve it is how to concurrently solve out the beamformers and the power allocation ratio. To cope with this difficulty, an alternative approach is proposed by converting the original problem into three subproblems. By solving these subproblems iteratively, the closed form solutions of robust beamformers and power allocation ratio for the original problem are achieved. Simulations are done and results reveal that the proposed S-ER based secure transmission scheme outperforms the traditional time-switching based relaying (TSR) scheme at a maximum WCSR gain of 80%. Results also demonstrate that the WCSR performance of the scheme reusing idle antennas for information reception is much better than that of schemes exploiting only one receive antenna.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"95 1","pages":""},"PeriodicalIF":16.4,"publicationDate":"2017-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2018.2825541","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62351137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Guest Editorial Emerging Technologies in Software- Driven Communication 软件驱动通信中的新兴技术

IF 16.4 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2017-11-01 DOI: 10.1109/JSAC.2017.2760479

Mathias Fischer, M. Brunner, A. Dutta, Toktam Mahmoodi

Computer networks fundamentally changed the way we communicate and interact with each other. In fact, they now form the backbone of our modern societies. While early networks were merely a mechanism for exchanging data between end-hosts, current computer and telecommunication networks are way more than that. Compared to the early days of the networking not only the hardware of networks has changed fundamentally, but with it also the software deployed to control and manage these networks. To reduce the significant management cost of large networks, automated management, including autonomic computing and communications evolved.

计算机网络从根本上改变了我们彼此交流和互动的方式。事实上，它们现在构成了我们现代社会的支柱。虽然早期的网络仅仅是在终端主机之间交换数据的机制，但当前的计算机和电信网络远不止于此。与早期的网络相比，不仅网络的硬件发生了根本性的变化，用于控制和管理这些网络的软件也发生了根本性的变化。为了显著降低大型网络的管理成本，包括自主计算和通信在内的自动化管理不断发展。

引用次数: 0

Scheduling Congestion- and Loop-Free Network Update in Timed SDNs 定时sdn中无拥塞和无环路的网络更新调度

IF 16.4 1区计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

IEEE Journal on Selected Areas in Communications

Pub Date : 2017-11-01 DOI: 10.1109/JSAC.2017.2760146

Jiaqi Zheng, Guihai Chen, S. Schmid, Haipeng Dai, Jie Wu, Q. Ni

Software-defined networks (SDNs) introduce interesting new opportunities in how network routes can be defined, verified, and changed over time. Despite the logically-centralized perspective offered, however, an SDN still needs to be considered a distributed system: rule updates communicated from the controller to the individual switches traverse an asynchronous network and may arrive out-of-order. This can lead to (temporary or permanent) inconsistencies and triggered much research over the last years. We, in this paper, initiate the study of algorithms for consistent network updates in “timed SDNs”—SDNs in which individual node updates can be scheduled at specific times. While technology enabling tightly synchronized SDNs is emerging, the resulting algorithmic problems have not been studied yet. This paper presents, implements and evaluates Chronus, a system which provides provably congestion- and loop-free network updates, while avoiding the flow table space headroom required by existing two-phase update approaches. We formulate the minimum update time problem as an optimization program and propose two polynomial-time algorithms which lie at the heart of Chronus: a decision algorithm to check feasibility and a greedy algorithm to find a good update sequence. Extensive experiments on Mininet and numerical simulations show that Chronus can substantially reduce transient congestion and save over 60% of the rules compared with the state of the art.

软件定义网络(sdn)为如何定义、验证和更改网络路由带来了有趣的新机会。然而，尽管提供了逻辑集中化的视角，SDN仍然需要被视为分布式系统:从控制器传递到各个交换机的规则更新遍历异步网络，并且可能无序到达。这可能导致(暂时的或永久的)不一致，并在过去几年引发了许多研究。在本文中，我们开始研究“定时sdn”中一致网络更新的算法- sdn中可以在特定时间安排单个节点更新。虽然实现紧密同步sdn的技术正在出现，但由此产生的算法问题尚未得到研究。本文提出、实现并评估了Chronus系统，该系统提供了可证明的无拥塞和无环路的网络更新，同时避免了现有两阶段更新方法所需的流表空间上限。我们将最小更新时间问题描述为一个优化程序，并提出了两种多项式时间算法，这是Chronus的核心:一种决策算法来检查可行性，一种贪婪算法来寻找一个好的更新序列。在Mininet上进行的大量实验和数值模拟表明，与现有技术相比，Chronus可以大幅减少瞬态拥塞，节省超过60%的规则。

{"title":"Scheduling Congestion- and Loop-Free Network Update in Timed SDNs","authors":"Jiaqi Zheng, Guihai Chen, S. Schmid, Haipeng Dai, Jie Wu, Q. Ni","doi":"10.1109/JSAC.2017.2760146","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2760146","url":null,"abstract":"Software-defined networks (SDNs) introduce interesting new opportunities in how network routes can be defined, verified, and changed over time. Despite the logically-centralized perspective offered, however, an SDN still needs to be considered a distributed system: rule updates communicated from the controller to the individual switches traverse an asynchronous network and may arrive out-of-order. This can lead to (temporary or permanent) inconsistencies and triggered much research over the last years. We, in this paper, initiate the study of algorithms for consistent network updates in “timed SDNs”—SDNs in which individual node updates can be scheduled at specific times. While technology enabling tightly synchronized SDNs is emerging, the resulting algorithmic problems have not been studied yet. This paper presents, implements and evaluates Chronus, a system which provides provably congestion- and loop-free network updates, while avoiding the flow table space headroom required by existing two-phase update approaches. We formulate the minimum update time problem as an optimization program and propose two polynomial-time algorithms which lie at the heart of Chronus: a decision algorithm to check feasibility and a greedy algorithm to find a good update sequence. Extensive experiments on Mininet and numerical simulations show that Chronus can substantially reduce transient congestion and save over 60% of the rules compared with the state of the art.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2542-2552"},"PeriodicalIF":16.4,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760146","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46432264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 21

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

IEEE Journal on Selected Areas in Communications

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀