IEEE Journal on Selected Areas in Communications最新文献_第5页

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

IF 16.4 1区计算机科学

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

{"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区计算机科学

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

{"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区计算机科学

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

{"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区计算机科学

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

引用次数: 0

IEEE Communications Society Information IEEE通信协会信息

IF 16.4 1区计算机科学

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区计算机科学

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

{"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区计算机科学

IEEE Journal on Selected Areas in Communications Pub Date : 2018-04-05 DOI: 10.1145/3266276.3266282

Emilio Leonardi, G. Neglia

{"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区计算机科学

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

{"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区计算机科学

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

引用次数: 0

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

IF 16.4 1区计算机科学

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

{"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