Pub Date : 2017-10-05DOI: 10.1109/JSAC.2017.2760158
Ruozhou Yu, G. Xue, Xiang Zhang
The ever-increasing mobile traffic has inspired deployment of capacity and performance enhancing network services within mobile networks. Owing to recent advances in network function virtualization, such network services can be flexibly and cost-efficiently deployed in the mobile network as software components, avoiding the need for costly hardware deployment. Nevertheless, this complicates network planning by bringing the need for service function chaining. In this paper, we study mobile network planning through a software-defined approach, considering both quality-of-service and reliability of different classes of traffic. We define and formulate the traffic steering problem for service function chaining in mobile networks, which turns out to be $mathcal {NP}$ -hard. We then develop a fast approximation scheme for the problem, and evaluate its performance via extensive simulation experiments. The results show that our algorithm is near-optimal, and achieves much better performance compared with baseline algorithms.
{"title":"QoS-Aware and Reliable Traffic Steering for Service Function Chaining in Mobile Networks","authors":"Ruozhou Yu, G. Xue, Xiang Zhang","doi":"10.1109/JSAC.2017.2760158","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2760158","url":null,"abstract":"The ever-increasing mobile traffic has inspired deployment of capacity and performance enhancing network services within mobile networks. Owing to recent advances in network function virtualization, such network services can be flexibly and cost-efficiently deployed in the mobile network as software components, avoiding the need for costly hardware deployment. Nevertheless, this complicates network planning by bringing the need for service function chaining. In this paper, we study mobile network planning through a software-defined approach, considering both quality-of-service and reliability of different classes of traffic. We define and formulate the traffic steering problem for service function chaining in mobile networks, which turns out to be $mathcal {NP}$ -hard. We then develop a fast approximation scheme for the problem, and evaluate its performance via extensive simulation experiments. The results show that our algorithm is near-optimal, and achieves much better performance compared with baseline algorithms.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2522-2531"},"PeriodicalIF":16.4,"publicationDate":"2017-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760158","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47037388","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}
Pub Date : 2017-10-05DOI: 10.1109/JSAC.2017.2760184
Qiang Li, Wennian Shi, Xiaohu Ge, Z. Niu
In this paper, content caching is considered in a software-defined hyper-cellular network (SD-HCN) with capacity-limited backhaul connections. To achieve efficient content caching and delivery at the network edge, an analytical framework of minimizing the average content provisioning cost of SD-HCN, e.g., latency, bandwidth, and so on, is first formulated subjected to a sum storage capacity constraint. An optimal solution to this problem requires a joint design of storage allocation and content placement at the centralized control base station (CBS) and distributed traffic base stations (TBSs), which is NP-hard in general. To provide insights, a baseline non-cooperative caching strategy is first introduced between the CBS and TBSs. Then, an efficient cooperative edge caching strategy is proposed by leveraging the vertical cooperation between the CBS and TBSs, and horizontal cooperation between the TBSs. Analytical results demonstrate that the content provisioning cost of SD-HCN is significantly reduced by using the analytically obtained optimal storage allocation between the CBS and TBSs, and the proposed cooperative edge caching strategy always outperforms the non-cooperative caching strategy. Furthermore, by switching between the vertical and horizontal cooperative caching modes, extra performance gains can be achieved by the proposed cooperative edge caching strategy.
{"title":"Cooperative Edge Caching in Software-Defined Hyper-Cellular Networks","authors":"Qiang Li, Wennian Shi, Xiaohu Ge, Z. Niu","doi":"10.1109/JSAC.2017.2760184","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2760184","url":null,"abstract":"In this paper, content caching is considered in a software-defined hyper-cellular network (SD-HCN) with capacity-limited backhaul connections. To achieve efficient content caching and delivery at the network edge, an analytical framework of minimizing the average content provisioning cost of SD-HCN, e.g., latency, bandwidth, and so on, is first formulated subjected to a sum storage capacity constraint. An optimal solution to this problem requires a joint design of storage allocation and content placement at the centralized control base station (CBS) and distributed traffic base stations (TBSs), which is NP-hard in general. To provide insights, a baseline non-cooperative caching strategy is first introduced between the CBS and TBSs. Then, an efficient cooperative edge caching strategy is proposed by leveraging the vertical cooperation between the CBS and TBSs, and horizontal cooperation between the TBSs. Analytical results demonstrate that the content provisioning cost of SD-HCN is significantly reduced by using the analytically obtained optimal storage allocation between the CBS and TBSs, and the proposed cooperative edge caching strategy always outperforms the non-cooperative caching strategy. Furthermore, by switching between the vertical and horizontal cooperative caching modes, extra performance gains can be achieved by the proposed cooperative edge caching strategy.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2596-2605"},"PeriodicalIF":16.4,"publicationDate":"2017-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760184","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43796985","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}
Pub Date : 2017-10-05DOI: 10.1109/JSAC.2017.2760159
Shuhao Liu, Baochun Li
Modern Internet applications are typically hosted in the public cloud, with multiple server instances running within geographically distributed datacenters. Thanks to the abundantly available bandwidth on wide-area links that interconnect these datacenters, it is conceivable that bandwidth-intensive applications may improve their performance by relaying their traffic through such an inter-datacenter network. However, there does not yet exist a cloud service that provides a turn-key solution to tap into such available bandwidth resources conveniently. In this paper, we design and implement Stemflow, a new system framework that provides Inter-Datacenter Overlay as a Service based on the software-defined networking principle. It offers an attractive foundation that helps an Internet application to transparently improve its scalability and performance by using inter-datacenter networks for its traffic. With Stemflow, all deployed server instances will construct an overlay atop an inter-datacenter network, and the routing decisions to relay application traffic are made by a centralized controller. The algorithms needed to make these decisions are customized to meet the needs of individual applications, and are cached within the data plane. We motivate and describe the design decisions, and present an extensive experimental evaluation in public cloud infrastructures, using two example applications as our case studies.
{"title":"Stemflow: Software-Defined Inter-Datacenter Overlay as a Service","authors":"Shuhao Liu, Baochun Li","doi":"10.1109/JSAC.2017.2760159","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2760159","url":null,"abstract":"Modern Internet applications are typically hosted in the public cloud, with multiple server instances running within geographically distributed datacenters. Thanks to the abundantly available bandwidth on wide-area links that interconnect these datacenters, it is conceivable that bandwidth-intensive applications may improve their performance by relaying their traffic through such an inter-datacenter network. However, there does not yet exist a cloud service that provides a turn-key solution to tap into such available bandwidth resources conveniently. In this paper, we design and implement Stemflow, a new system framework that provides Inter-Datacenter Overlay as a Service based on the software-defined networking principle. It offers an attractive foundation that helps an Internet application to transparently improve its scalability and performance by using inter-datacenter networks for its traffic. With Stemflow, all deployed server instances will construct an overlay atop an inter-datacenter network, and the routing decisions to relay application traffic are made by a centralized controller. The algorithms needed to make these decisions are customized to meet the needs of individual applications, and are cached within the data plane. We motivate and describe the design decisions, and present an extensive experimental evaluation in public cloud infrastructures, using two example applications as our case studies.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2563-2573"},"PeriodicalIF":16.4,"publicationDate":"2017-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760159","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44255848","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}
Pub Date : 2017-09-13DOI: 10.1109/JSAC.2017.2760185
G. Siracusano, R. Bifulco, Martino Trevisan, Tobias Jacobs, Simon Kuenzer, S. Salsano, N. Blefari-Melazzi, Felipe Huici
We explore the opportunities and design options enabled by novel SDN and NFV technologies, by re-designing a dynamic content delivery network (CDN) service. Our system, named MOSTO, provides performance levels comparable to that of a regular CDN, but does not require the deployment of a large distributed infrastructure. In the process of designing the system, we identify relevant functions that could be integrated in the future Internet infrastructure. Such functions greatly simplify the design and effectiveness of services, such as MOSTO. We demonstrate our system using a mixture of simulation, emulation, testbed experiments, and by realizing a proof-of-concept deployment in a planet-wide commercial cloud system.
{"title":"Re-Designing Dynamic Content Delivery in the Light of a Virtualized Infrastructure","authors":"G. Siracusano, R. Bifulco, Martino Trevisan, Tobias Jacobs, Simon Kuenzer, S. Salsano, N. Blefari-Melazzi, Felipe Huici","doi":"10.1109/JSAC.2017.2760185","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2760185","url":null,"abstract":"We explore the opportunities and design options enabled by novel SDN and NFV technologies, by re-designing a dynamic content delivery network (CDN) service. Our system, named MOSTO, provides performance levels comparable to that of a regular CDN, but does not require the deployment of a large distributed infrastructure. In the process of designing the system, we identify relevant functions that could be integrated in the future Internet infrastructure. Such functions greatly simplify the design and effectiveness of services, such as MOSTO. We demonstrate our system using a mixture of simulation, emulation, testbed experiments, and by realizing a proof-of-concept deployment in a planet-wide commercial cloud system.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2574-2585"},"PeriodicalIF":16.4,"publicationDate":"2017-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760185","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49549953","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}
Pub Date : 2017-09-10DOI: 10.1109/JSAC.2017.2760179
T. He, E. Ciftcioglu, Shiqiang Wang, K. Chan
In this paper, we consider user location privacy in mobile edge clouds (MECs). MECs are small clouds deployed at the network edge to offer cloud services close to mobile users, and many solutions have been proposed to maximize service locality by migrating services to follow their users. Co-location of a user and his service, however, implies that a cyber eavesdropper observing service migrations between MECs can localize the user up to one MEC coverage area, which can be fairly small (e.g., a femtocell). We consider using chaff services to defend against such an eavesdropper, with a focus on strategies to control the chaffs. Assuming the eavesdropper performs maximum likelihood detection, we consider both heuristic strategies that mimic the user’s mobility and optimized strategies designed to minimize the detection or tracking accuracy. We show that a single chaff controlled by the optimal strategy or its online variation can drive the eavesdropper’s tracking accuracy to zero when the user’s mobility is sufficiently random. We further propose extended strategies that utilize randomization to defend against an advanced eavesdropper aware of the strategy. The efficacy of our solutions is verified through both synthetic and trace-driven simulations.
{"title":"Location Privacy in Mobile Edge Clouds: A Chaff-Based Approach","authors":"T. He, E. Ciftcioglu, Shiqiang Wang, K. Chan","doi":"10.1109/JSAC.2017.2760179","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2760179","url":null,"abstract":"In this paper, we consider user location privacy in mobile edge clouds (MECs). MECs are small clouds deployed at the network edge to offer cloud services close to mobile users, and many solutions have been proposed to maximize service locality by migrating services to follow their users. Co-location of a user and his service, however, implies that a cyber eavesdropper observing service migrations between MECs can localize the user up to one MEC coverage area, which can be fairly small (e.g., a femtocell). We consider using chaff services to defend against such an eavesdropper, with a focus on strategies to control the chaffs. Assuming the eavesdropper performs maximum likelihood detection, we consider both heuristic strategies that mimic the user’s mobility and optimized strategies designed to minimize the detection or tracking accuracy. We show that a single chaff controlled by the optimal strategy or its online variation can drive the eavesdropper’s tracking accuracy to zero when the user’s mobility is sufficiently random. We further propose extended strategies that utilize randomization to defend against an advanced eavesdropper aware of the strategy. The efficacy of our solutions is verified through both synthetic and trace-driven simulations.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2625-2636"},"PeriodicalIF":16.4,"publicationDate":"2017-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760179","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44658520","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}
Pub Date : 2017-09-08DOI: 10.1109/JSAC.2017.2760160
Yuxuan Sun, Sheng Zhou, Jie Xu
Merging mobile edge computing (MEC) functionality with the dense deployment of base stations (BSs) provides enormous benefits such as a real proximity, low latency access to computing resources. However, the envisioned integration creates many new challenges, among which mobility management (MM) is a critical one. Simply applying existing radio access-oriented MM schemes leads to poor performance mainly due to the co-provisioning of radio access and computing services of the MEC-enabled BSs. In this paper, we develop a novel user-centric energy-aware mobility management (EMM) scheme, in order to optimize the delay due to both radio access and computation, under the long-term energy consumption constraint of the user. Based on Lyapunov optimization and multi-armed bandit theories, EMM works in an online fashion without future system state information, and effectively handles the imperfect system state information. Theoretical analysis explicitly takes radio handover and computation migration cost into consideration and proves a bounded deviation on both the delay performance and energy consumption compared with the oracle solution with exact and complete future system information. The proposed algorithm also effectively handles the scenario in which candidate BSs randomly switch ON/OFF during the offloading process of a task. Simulations show that the proposed algorithms can achieve close-to-optimal delay performance while satisfying the user energy consumption constraint.
{"title":"EMM: Energy-Aware Mobility Management for Mobile Edge Computing in Ultra Dense Networks","authors":"Yuxuan Sun, Sheng Zhou, Jie Xu","doi":"10.1109/JSAC.2017.2760160","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2760160","url":null,"abstract":"Merging mobile edge computing (MEC) functionality with the dense deployment of base stations (BSs) provides enormous benefits such as a real proximity, low latency access to computing resources. However, the envisioned integration creates many new challenges, among which mobility management (MM) is a critical one. Simply applying existing radio access-oriented MM schemes leads to poor performance mainly due to the co-provisioning of radio access and computing services of the MEC-enabled BSs. In this paper, we develop a novel user-centric energy-aware mobility management (EMM) scheme, in order to optimize the delay due to both radio access and computation, under the long-term energy consumption constraint of the user. Based on Lyapunov optimization and multi-armed bandit theories, EMM works in an online fashion without future system state information, and effectively handles the imperfect system state information. Theoretical analysis explicitly takes radio handover and computation migration cost into consideration and proves a bounded deviation on both the delay performance and energy consumption compared with the oracle solution with exact and complete future system information. The proposed algorithm also effectively handles the scenario in which candidate BSs randomly switch ON/OFF during the offloading process of a task. Simulations show that the proposed algorithms can achieve close-to-optimal delay performance while satisfying the user energy consumption constraint.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2637-2646"},"PeriodicalIF":16.4,"publicationDate":"2017-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760160","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44969150","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}
Pub Date : 2017-09-01Epub Date: 2017-01-30DOI: 10.1089/ars.2016.6642
Sonia Martínez-Revelles, Ana B García-Redondo, María S Avendaño, Saray Varona, Teresa Palao, Mar Orriols, Fernanda R Roque, Ana Fortuño, Rhian M Touyz, Jose Martínez-González, Mercedes Salaices, Cristina Rodríguez, Ana M Briones
Aims: Vascular stiffness, structural elastin abnormalities, and increased oxidative stress are hallmarks of hypertension. Lysyl oxidase (LOX) is an elastin crosslinking enzyme that produces H2O2 as a by-product. We addressed the interplay between LOX, oxidative stress, vessel stiffness, and elastin.
Results: Angiotensin II (Ang II)-infused hypertensive mice and spontaneously hypertensive rats (SHR) showed increased vascular LOX expression and stiffness and an abnormal elastin structure. Mice over-expressing LOX in vascular smooth muscle cells (TgLOX) exhibited similar mechanical and elastin alterations to those of hypertensive models. LOX inhibition with β-aminopropionitrile (BAPN) attenuated mechanical and elastin alterations in TgLOX mice, Ang II-infused mice, and SHR. Arteries from TgLOX mice, Ang II-infused mice, and/or SHR exhibited increased vascular H2O2 and O2.- levels, NADPH oxidase activity, and/or mitochondrial dysfunction. BAPN prevented the higher oxidative stress in hypertensive models. Treatment of TgLOX and Ang II-infused mice and SHR with the mitochondrial-targeted superoxide dismutase mimetic mito-TEMPO, the antioxidant apocynin, or the H2O2 scavenger polyethylene glycol-conjugated catalase (PEG-catalase) reduced oxidative stress, vascular stiffness, and elastin alterations. Vascular p38 mitogen-activated protein kinase (p38MAPK) activation was increased in Ang II-infused and TgLOX mice and this effect was prevented by BAPN, mito-TEMPO, or PEG-catalase. SB203580, the p38MAPK inhibitor, normalized vessel stiffness and elastin structure in TgLOX mice.
Innovation: We identify LOX as a novel source of vascular reactive oxygen species and a new pathway involved in vascular stiffness and elastin remodeling in hypertension.
Conclusion: LOX up-regulation is associated with enhanced oxidative stress that promotes p38MAPK activation, elastin structural alterations, and vascular stiffness. This pathway contributes to vascular abnormalities in hypertension. Antioxid. Redox Signal. 27, 379-397.
{"title":"Lysyl Oxidase Induces Vascular Oxidative Stress and Contributes to Arterial Stiffness and Abnormal Elastin Structure in Hypertension: Role of p38MAPK.","authors":"Sonia Martínez-Revelles, Ana B García-Redondo, María S Avendaño, Saray Varona, Teresa Palao, Mar Orriols, Fernanda R Roque, Ana Fortuño, Rhian M Touyz, Jose Martínez-González, Mercedes Salaices, Cristina Rodríguez, Ana M Briones","doi":"10.1089/ars.2016.6642","DOIUrl":"10.1089/ars.2016.6642","url":null,"abstract":"<p><strong>Aims: </strong>Vascular stiffness, structural elastin abnormalities, and increased oxidative stress are hallmarks of hypertension. Lysyl oxidase (LOX) is an elastin crosslinking enzyme that produces H<sub>2</sub>O<sub>2</sub> as a by-product. We addressed the interplay between LOX, oxidative stress, vessel stiffness, and elastin.</p><p><strong>Results: </strong>Angiotensin II (Ang II)-infused hypertensive mice and spontaneously hypertensive rats (SHR) showed increased vascular LOX expression and stiffness and an abnormal elastin structure. Mice over-expressing LOX in vascular smooth muscle cells (TgLOX) exhibited similar mechanical and elastin alterations to those of hypertensive models. LOX inhibition with β-aminopropionitrile (BAPN) attenuated mechanical and elastin alterations in TgLOX mice, Ang II-infused mice, and SHR. Arteries from TgLOX mice, Ang II-infused mice, and/or SHR exhibited increased vascular H<sub>2</sub>O<sub>2</sub> and O<sub>2</sub><sup>.-</sup> levels, NADPH oxidase activity, and/or mitochondrial dysfunction. BAPN prevented the higher oxidative stress in hypertensive models. Treatment of TgLOX and Ang II-infused mice and SHR with the mitochondrial-targeted superoxide dismutase mimetic mito-TEMPO, the antioxidant apocynin, or the H<sub>2</sub>O<sub>2</sub> scavenger polyethylene glycol-conjugated catalase (PEG-catalase) reduced oxidative stress, vascular stiffness, and elastin alterations. Vascular p38 mitogen-activated protein kinase (p38MAPK) activation was increased in Ang II-infused and TgLOX mice and this effect was prevented by BAPN, mito-TEMPO, or PEG-catalase. SB203580, the p38MAPK inhibitor, normalized vessel stiffness and elastin structure in TgLOX mice.</p><p><strong>Innovation: </strong>We identify LOX as a novel source of vascular reactive oxygen species and a new pathway involved in vascular stiffness and elastin remodeling in hypertension.</p><p><strong>Conclusion: </strong>LOX up-regulation is associated with enhanced oxidative stress that promotes p38MAPK activation, elastin structural alterations, and vascular stiffness. This pathway contributes to vascular abnormalities in hypertension. Antioxid. Redox Signal. 27, 379-397.</p>","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"27 1","pages":"379-397"},"PeriodicalIF":6.6,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5563924/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84360353","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}
Pub Date : 2017-08-24DOI: 10.1109/JSAC.2017.2760147
N. Zhang, Ya-Feng Liu, H. Farmanbar, Tsung-Hui Chang, Mingyi Hong, Z. Luo
To support multiple on-demand services over fixed communication networks, network operators must allow flexible customization and fast provision of their network resources. One effective approach to this end is network virtualization, whereby each service is mapped to a virtual subnetwork providing dedicated on-demand support to network users. In practice, each service consists of a prespecified sequence of functions, called a service function chain (SFC), while each service function in a SFC can only be provided by some given network nodes. Thus, to support a given service, we must select network function nodes according to the SFC and determine the routing strategy through the function nodes in a specified order. A crucial network slicing problem that needs to be addressed is how to optimally localize the service functions in a physical network as specified by the SFCs, subject to link and node capacity constraints. In this paper, we formulate the network slicing problem as a mixed binary linear program and establish its strong NP-hardness. Furthermore, we propose efficient penalty successive upper bound minimization (PSUM) and PSUM-R(ounding) algorithms, and two heuristic algorithms to solve the problem. Simulation results are shown to demonstrate the effectiveness of the proposed algorithms.
{"title":"Network Slicing for Service-Oriented Networks Under Resource Constraints","authors":"N. Zhang, Ya-Feng Liu, H. Farmanbar, Tsung-Hui Chang, Mingyi Hong, Z. Luo","doi":"10.1109/JSAC.2017.2760147","DOIUrl":"https://doi.org/10.1109/JSAC.2017.2760147","url":null,"abstract":"To support multiple on-demand services over fixed communication networks, network operators must allow flexible customization and fast provision of their network resources. One effective approach to this end is network virtualization, whereby each service is mapped to a virtual subnetwork providing dedicated on-demand support to network users. In practice, each service consists of a prespecified sequence of functions, called a service function chain (SFC), while each service function in a SFC can only be provided by some given network nodes. Thus, to support a given service, we must select network function nodes according to the SFC and determine the routing strategy through the function nodes in a specified order. A crucial network slicing problem that needs to be addressed is how to optimally localize the service functions in a physical network as specified by the SFCs, subject to link and node capacity constraints. In this paper, we formulate the network slicing problem as a mixed binary linear program and establish its strong NP-hardness. Furthermore, we propose efficient penalty successive upper bound minimization (PSUM) and PSUM-R(ounding) algorithms, and two heuristic algorithms to solve the problem. Simulation results are shown to demonstrate the effectiveness of the proposed algorithms.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"35 1","pages":"2512-2521"},"PeriodicalIF":16.4,"publicationDate":"2017-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/JSAC.2017.2760147","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41625135","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}
We study a problem of minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We cast this as an equivalent caching gain maximization problem, and consider both source routing and hop-by-hop routing settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologies. Our algorithms reduce routing costs by several orders of magnitude compared with prior art, including algorithms optimizing caching under fixed routing.
{"title":"Jointly Optimal Routing and Caching for Arbitrary Network Topologies","authors":"Stratis Ioannidis, E. Yeh","doi":"10.1145/3125719.3125730","DOIUrl":"https://doi.org/10.1145/3125719.3125730","url":null,"abstract":"We study a problem of minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We cast this as an equivalent caching gain maximization problem, and consider both source routing and hop-by-hop routing settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologies. Our algorithms reduce routing costs by several orders of magnitude compared with prior art, including algorithms optimizing caching under fixed routing.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"36 1","pages":"1258-1275"},"PeriodicalIF":16.4,"publicationDate":"2017-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3125719.3125730","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43181517","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}
Samta Shukla, Onkar Bhardwaj, A. Abouzeid, T. Salonidis, T. He
We consider the problem of proactive retention aware caching in a heterogeneous wireless edge network consisting of mobile users accessing content from a server and associated to one or more edge caches. Our goal is to design a caching policy that minimizes the sum of content storage costs and server access costs over two design variables: the retention time of each cached content and the probability that a user routes content requests to each of its associated caches. We develop a model that captures multiple aspects such as cache storage costs and several capabilities of modern wireless technologies, such as server multicast/unicast transmissions, device multi-path routing, and cache access constraints. We formulate the problem of Proactive Retention Routing Optimization as a non-convex, non-linear mixed-integer program. We prove that it is NP-hard under both multicast/unicast modes—even when the caches have a large capacity and storage costs are linear—and develop greedy algorithms that have provable performance bounds for the case of uncapacitated caches. Finally, we propose heuristics with low computational complexity for the capacitated cache case as well as for the case of convex storage costs. Systematic evaluations based on real-world data demonstrate the effectiveness of our approach, compared to the existing caching schemes.
{"title":"Proactive Retention-Aware Caching With Multi-Path Routing for Wireless Edge Networks","authors":"Samta Shukla, Onkar Bhardwaj, A. Abouzeid, T. Salonidis, T. He","doi":"10.1145/3084041.3084053","DOIUrl":"https://doi.org/10.1145/3084041.3084053","url":null,"abstract":"We consider the problem of proactive retention aware caching in a heterogeneous wireless edge network consisting of mobile users accessing content from a server and associated to one or more edge caches. Our goal is to design a caching policy that minimizes the sum of content storage costs and server access costs over two design variables: the retention time of each cached content and the probability that a user routes content requests to each of its associated caches. We develop a model that captures multiple aspects such as cache storage costs and several capabilities of modern wireless technologies, such as server multicast/unicast transmissions, device multi-path routing, and cache access constraints. We formulate the problem of Proactive Retention Routing Optimization as a non-convex, non-linear mixed-integer program. We prove that it is NP-hard under both multicast/unicast modes—even when the caches have a large capacity and storage costs are linear—and develop greedy algorithms that have provable performance bounds for the case of uncapacitated caches. Finally, we propose heuristics with low computational complexity for the capacitated cache case as well as for the case of convex storage costs. Systematic evaluations based on real-world data demonstrate the effectiveness of our approach, compared to the existing caching schemes.","PeriodicalId":13243,"journal":{"name":"IEEE Journal on Selected Areas in Communications","volume":"36 1","pages":"1286-1299"},"PeriodicalIF":16.4,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3084041.3084053","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43747200","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：