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

Link Failure Recovery Mechanism in Software Defined Networks 软件定义网络中的链路故障恢复机制

IF 16.4 1区计算机科学

IEEE Journal on Selected Areas in Communications Pub Date : 2020-04-13 DOI: 10.1109/JSAC.2020.2986668

Shrinivas Petale, Jaisingh Thangaraj

{"title":"Link Failure Recovery Mechanism in Software Defined Networks","authors":"Shrinivas Petale, Jaisingh Thangaraj","doi":"10.1109/JSAC.2020.2986668","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986668","url":null,"abstract":"In traditional networks, the pre-routed packets are dropped during the link failure leading to a huge data loss. Survivability techniques such as protection and restoration are available to provide the solution before and after the link failure. But, the new flow entries that are to be added in the flow table increase the initial network demand leading to an increase in memory demand per switch. The saved data not only reduces the network speed but also demands of repeated processing of entries. In this paper, we propose a new scheme of Group Table based Rerouting (GTR) technique to find the response against single link failure through Fast Fail-over (FF) group table feature provided by OpenFlow. This scheme provides equal roles for both controllers and forwarding OpenFlow enabled switches. Here, the controller maintains a look-up table which is updated periodically according to the change in network structure. Also, it has to update the FF group table simultaneously corresponding to every active port of the switches. The controller relabels the packets and updates the flow entries on respective switches.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1285-1292"},"PeriodicalIF":16.4,"publicationDate":"2020-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986668","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45088320","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}

引用次数: 25

SFC-Based Service Provisioning for Reconfigurable Space-Air-Ground Integrated Networks 基于SFC的可重构空-地综合网络服务配置

IF 16.4 1区计算机科学

IEEE Journal on Selected Areas in Communications Pub Date : 2020-04-13 DOI: 10.1109/JSAC.2020.2986851

Guangchao Wang, Sheng Zhou, Shan Zhang, Z. Niu, Xuemin Shen

{"title":"SFC-Based Service Provisioning for Reconfigurable Space-Air-Ground Integrated Networks","authors":"Guangchao Wang, Sheng Zhou, Shan Zhang, Z. Niu, Xuemin Shen","doi":"10.1109/JSAC.2020.2986851","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986851","url":null,"abstract":"Space-air-ground integrated networks (SAGIN) extend the capability of wireless networks and will be the essential building block for many advanced applications, like autonomous driving, earth monitoring, and etc. However, coordinating heterogeneous physical resources is very challenging in such a large-scale dynamic network. In this paper, we propose a reconfigurable service provisioning framework based on service function chaining (SFC) for SAGIN. In SFC, the network functions are virtualized and the service data needs to flow through specific network functions in a predefined sequence. The inherent issue is how to plan the service function chains over large-scale heterogeneous networks, subject to the resource limitations of both communication and computation. Specifically, we must jointly consider the virtual network functions (VNFs) embedding and service data routing. We formulate the SFC planning problem as an integer non-linear programming problem, which is NP-hard. Then, a heuristic greedy algorithm is proposed, which concentrates on leveraging different features of aerial and ground nodes and balancing the resource consumptions. Furthermore, a new metric, aggregation ratio (AR) is proposed to elaborate the communication-computation tradeoff. Extensive simulations shows that our proposed algorithm achieves near-optimal performance. We also find that the SAGIN significantly reduces the service blockage probability and improves the efficiency of resource utilization. Finally, a case study on multiple intersection traffic scheduling is provided to demonstrate the effectiveness of our proposed SFC-based service provisioning framework.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1478-1489"},"PeriodicalIF":16.4,"publicationDate":"2020-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986851","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43763025","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}

引用次数: 70

On Reconfiguring 5G Network Slices 论5G网络切片的重构

IF 16.4 1区计算机科学

IEEE Journal on Selected Areas in Communications Pub Date : 2020-04-13 DOI: 10.1109/JSAC.2020.2986898

Matteo Pozza, Patrick K. Nicholson, D. Lugones, Ashwin Rao, H. Flinck, S. Tarkoma

{"title":"On Reconfiguring 5G Network Slices","authors":"Matteo Pozza, Patrick K. Nicholson, D. Lugones, Ashwin Rao, H. Flinck, S. Tarkoma","doi":"10.1109/JSAC.2020.2986898","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986898","url":null,"abstract":"The virtual resources of 5G networks are expected to scale and support migration to other locations within the substrate. In this context, a configuration for 5G network slices details the instantaneous mapping of the virtual resources across all slices on the substrate, and a feasible configuration satisfies the Service-Level Objectives (SLOs) without overloading the substrate. Reconfiguring a network from a given source configuration to the desired target configuration involves identifying an ordered sequence of feasible configurations from the source to the target. The proposed solutions for finding such a sequence are optimized for data centers and cannot be used as-is for reconfiguring 5G network slices. We present Matryoshka, our divide-and-conquer approach for finding a sequence of feasible configurations that can be used to reconfigure 5G network slices. Unlike previous approaches, Matryoshka also considers the bandwidth and latency constraints between the network functions of network slices. Evaluating Matryoshka required a dataset of pairs of source and target configurations. Because such a dataset is currently unavailable, we analyze proof of concept roll-outs, trends in standardization bodies, and research sources to compile an input dataset. On using Matryoshka on our dataset, we observe that it yields close-to-optimal reconfiguration sequences 10X faster than existing approaches.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1542-1554"},"PeriodicalIF":16.4,"publicationDate":"2020-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986898","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48580963","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}

引用次数: 16

RoSCo: Robust Updates for Software-Defined Networks RoSCo:软件定义网络的稳健更新

IF 16.4 1区计算机科学

IEEE Journal on Selected Areas in Communications Pub Date : 2020-04-13 DOI: 10.1109/JSAC.2020.2986959

James Lembke, Srivatsan Ravi, P. Eugster, S. Schmid

{"title":"RoSCo: Robust Updates for Software-Defined Networks","authors":"James Lembke, Srivatsan Ravi, P. Eugster, S. Schmid","doi":"10.1109/JSAC.2020.2986959","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2986959","url":null,"abstract":"In many Software-Defined Networking (SDN) deployments the control plane ends up being actually centralized, yielding a single point of failure and attack. This paper models the interaction between the data plane and a distributed control plane consisting of a set of failure-prone and potentially malicious (compromised) control devices, and implements a secure and robust controller platform that allows network administrators to integrate new network functionality as with a centralized approach. Concretely, the network administrator may program the data plane from the perspective of a centralized controller without worrying about distribution, asynchrony, failures, attacks, or coordination problems that any of these could cause. We introduce a formal SDN computation model for applying network policies and show that it is impossible to implement asynchronous non-blocking and strongly consistent SDN controller platforms in that model. We then present a robust SDN controller protocol (RoSCo) which implements (i) a protocol with provably linearizable semantics for applying network policies that is resilient against faulty/malicious control devices as long as a correct majority exists, and (ii) a modification to the protocol that improves performance by relaxing the guarantees of linearizability to exploit commutativity among updates. Extensive experiments conducted with a functional prototype of RoSCo over a large networked infrastructure supporting Open vSwitch (OVS)-compatible Agilio CX™ SmartNIC hardware show that RoSCo induces bearable overhead. In fact, RoSCo achieves higher throughput in most cases investigated than the seminal Ravana platform which addresses only benign (crash) failures.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1352-1365"},"PeriodicalIF":16.4,"publicationDate":"2020-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2986959","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46461784","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

DeepCP: Deep Learning Driven Cascade Prediction-Based Autonomous Content Placement in Closed Social Network DeepCP:封闭社交网络中基于深度学习驱动级联预测的自主内容放置

IF 16.4 1区计算机科学

IEEE Journal on Selected Areas in Communications Pub Date : 2020-03-09 DOI: 10.1109/JSAC.2020.2999687

Qiong Wu, Muhong Wu, Xu Chen, Zhi Zhou, Kaiwen He, Liang Chen

{"title":"DeepCP: Deep Learning Driven Cascade Prediction-Based Autonomous Content Placement in Closed Social Network","authors":"Qiong Wu, Muhong Wu, Xu Chen, Zhi Zhou, Kaiwen He, Liang Chen","doi":"10.1109/JSAC.2020.2999687","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2999687","url":null,"abstract":"Online social networks (OSNs) are emerging as the most popular mainstream platform for content cascade diffusion. In order to provide satisfactory quality of experience (QoE) for users in OSNs, much research dedicates to proactive content placement by using the propagation pattern, user’s personal profiles and social relationships in open social network scenarios (e.g., Twitter and Weibo). In this paper, we take a new direction of popularity-aware content placement in a closed social network (e.g., WeChat Moment) where user’s privacy is highly enhanced. We propose a novel data-driven holistic deep learning framework, namely DeepCP, for joint diffusion-aware cascade prediction and autonomous content placement without utilizing users’ personal and social information. We first devise a time-window LSTM model for content popularity prediction and cascade geo-distribution estimation. Accordingly, we further propose a novel autonomous content placement mechanism CP-GAN which adopts the generative adversarial network (GAN) for agile placement decision making to reduce the content access latency and enhance users’ QoE. We conduct extensive experiments using cascade diffusion traces in WeChat Moment (WM). Evaluation results corroborate that the proposed DeepCP framework can predict the content popularity with a high accuracy, generate efficient placement decision in a real-time manner, and achieve significant content access latency reduction over existing schemes.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"1570-1583"},"PeriodicalIF":16.4,"publicationDate":"2020-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2020.2999687","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46405333","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}

引用次数: 3

Optimal Pricing of Internet of Things: A Machine Learning Approach 物联网的最优定价：一种机器学习方法

IF 16.4 1区计算机科学

IEEE Journal on Selected Areas in Communications Pub Date : 2020-02-05 DOI: 10.1109/JSAC.2020.2971898 10.1109/JSAC.2020.2971898

Mohammad Abu Alsheikh, D. Hoang, D. Niyato, Derek Leong, Ping Wang, Zhu Han

{"title":"Optimal Pricing of Internet of Things: A Machine Learning Approach","authors":"Mohammad Abu Alsheikh, D. Hoang, D. Niyato, Derek Leong, Ping Wang, Zhu Han","doi":"10.1109/JSAC.2020.2971898 10.1109/JSAC.2020.2971898","DOIUrl":"https://doi.org/10.1109/JSAC.2020.2971898 10.1109/JSAC.2020.2971898","url":null,"abstract":"Internet of things (IoT) produces massive data from devices embedded with sensors. The IoT data allows creating profitable services using machine learning. However, previous research does not address the problem of optimal pricing and bundling of machine learning-based IoT services. In this paper, we define the data value and service quality from a machine learning perspective. We present an IoT market model which consists of data vendors selling data to service providers, and service providers offering IoT services to customers. Then, we introduce optimal pricing schemes for the standalone and bundled selling of IoT services. In standalone service sales, the service provider optimizes the size of bought data and service subscription fee to maximize its profit. For service bundles, the subscription fee and data sizes of the grouped IoT services are optimized to maximize the total profit of cooperative service providers. We show that bundling IoT services maximizes the profit of service providers compared to the standalone selling. For profit sharing of bundled services, we apply the concepts of core and Shapley solutions from cooperative game theory as efficient and fair allocations of payoffs among the cooperative service providers in the bundling coalition.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"38 1","pages":"669-684"},"PeriodicalIF":16.4,"publicationDate":"2020-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45978675","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}

引用次数: 11

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