Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969116
Fang Dong, Kui Wu, Venkatesh Srinivasan
Markov-modulated Poisson Process (MMPP) has been extensively studied in random process theory and widely used as a network traffic model. Most methods for estimating MMPP parameters are based on the exact arrival times. Nevertheless, in many applications it is costly to record the exact time of each arrival. Instead, we only record the number of arrivals in fixed-length time slots, which is called arrival count. Since arrival count data does not maintain detailed arrival times, it is non trivial to develop effective methods for MMPP parameter estimation with arrival counts only. Very few existing works deal with this challenge. This paper tackles the above challenge with copula analysis. The theoretical marginal distribution and copula of arrival counts in MMPP are applied to develop a new estimation method, MarCpa, which is a two-step estimation method involving marginal matching followed by copula matching. Our evaluation results demonstrate that the proposed method is fast and accurate.
{"title":"Copula-based parameter estimation for Markov-modulated Poisson Process","authors":"Fang Dong, Kui Wu, Venkatesh Srinivasan","doi":"10.1109/IWQoS.2017.7969116","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969116","url":null,"abstract":"Markov-modulated Poisson Process (MMPP) has been extensively studied in random process theory and widely used as a network traffic model. Most methods for estimating MMPP parameters are based on the exact arrival times. Nevertheless, in many applications it is costly to record the exact time of each arrival. Instead, we only record the number of arrivals in fixed-length time slots, which is called arrival count. Since arrival count data does not maintain detailed arrival times, it is non trivial to develop effective methods for MMPP parameter estimation with arrival counts only. Very few existing works deal with this challenge. This paper tackles the above challenge with copula analysis. The theoretical marginal distribution and copula of arrival counts in MMPP are applied to develop a new estimation method, MarCpa, which is a two-step estimation method involving marginal matching followed by copula matching. Our evaluation results demonstrate that the proposed method is fast and accurate.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122978946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969115
Wenxue Cheng, Wanchun Jiang, Tong Zhang, Bo Wang, Kun Qian, Fengyuan Ren
Congestion control is an indispensable mechanism in the new trend of enhanced Ethernet as a unified fabric for traditional LAN, SAN, and high-performance computing networks. A congestion management framework for Converged Ethernet (CE) networks has been standardized by IEEE 802.1 Qau work group, and QCN is recommended as the congestion control scheme in the standard draft. QCN is heuristically designed for 1/10Gbps Ethernet without considering the impact of delays. Recent work find that QCN will encounter stability issues with feedback delays, and these issues will be more serious as Ethernet extends to 40/100Gbps and the delays become heterogeneous and time-varying. This work aims to mitigate the negative impact of delays on congestion control scheme in CE. Specially, considering the delays are heterogeneous and time-varying, we build a model for Converged Ethernet with the standard congestion management framework. The model provides a new congestion detector to estimate the real congestion status under the impact of delays and regards the heterogeneous and time-varying feature as disturbances. Leveraging the new congestion detector and tolerating the disturbance through the sliding mode control method, we design the Delay-tolerant Sliding Mode (DSM) congestion control scheme. Extensive simulations show that DSM outperforms other congestion control schemes when the Ethernet ranges from 1Gbps to 100Gbps and the delays are heterogeneous and time-varying.
{"title":"Congestion control in Converged Ethernet with heterogeneous and time-varying delays","authors":"Wenxue Cheng, Wanchun Jiang, Tong Zhang, Bo Wang, Kun Qian, Fengyuan Ren","doi":"10.1109/IWQoS.2017.7969115","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969115","url":null,"abstract":"Congestion control is an indispensable mechanism in the new trend of enhanced Ethernet as a unified fabric for traditional LAN, SAN, and high-performance computing networks. A congestion management framework for Converged Ethernet (CE) networks has been standardized by IEEE 802.1 Qau work group, and QCN is recommended as the congestion control scheme in the standard draft. QCN is heuristically designed for 1/10Gbps Ethernet without considering the impact of delays. Recent work find that QCN will encounter stability issues with feedback delays, and these issues will be more serious as Ethernet extends to 40/100Gbps and the delays become heterogeneous and time-varying. This work aims to mitigate the negative impact of delays on congestion control scheme in CE. Specially, considering the delays are heterogeneous and time-varying, we build a model for Converged Ethernet with the standard congestion management framework. The model provides a new congestion detector to estimate the real congestion status under the impact of delays and regards the heterogeneous and time-varying feature as disturbances. Leveraging the new congestion detector and tolerating the disturbance through the sliding mode control method, we design the Delay-tolerant Sliding Mode (DSM) congestion control scheme. Extensive simulations show that DSM outperforms other congestion control schemes when the Ethernet ranges from 1Gbps to 100Gbps and the delays are heterogeneous and time-varying.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117252262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969134
Guozhi Li, Songtao Guo, Yuanyuan Yang
Multicast can not only shorten task completion time of applications, but also effectively reduce overall bandwidth consumption in data center networks (DCNs). However, load imbalance and sudden link blocking will seriously impact the network performance owing to the fundamental characteristics of huge traffic in DCNs. To address this problem, in this paper, we propose a novel multicast scheduling algorithm in software defined fat-tree DCNs, which can improve network performance by reducing the blocking of multicast traffic. In particular, the multicast scheduling algorithm selects the minimum blocking cost of links as optimal paths. By our scheduling algorithm, multicast flows are evenly distributed over the available links so as to achieve load balance. In addition, the DCNs are controlled globally by the software defined networking (SDN) technology, therefore, the multicast traffic cannot be interfered by the unexpected flow requests. Furthermore, the multicast scheduling algorithm can lead to asymptotically minimum network blocking probability, and has a low time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm in different network traffic intensities.
{"title":"Multicast scheduling algorithm in software defined fat-tree data center networks","authors":"Guozhi Li, Songtao Guo, Yuanyuan Yang","doi":"10.1109/IWQoS.2017.7969134","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969134","url":null,"abstract":"Multicast can not only shorten task completion time of applications, but also effectively reduce overall bandwidth consumption in data center networks (DCNs). However, load imbalance and sudden link blocking will seriously impact the network performance owing to the fundamental characteristics of huge traffic in DCNs. To address this problem, in this paper, we propose a novel multicast scheduling algorithm in software defined fat-tree DCNs, which can improve network performance by reducing the blocking of multicast traffic. In particular, the multicast scheduling algorithm selects the minimum blocking cost of links as optimal paths. By our scheduling algorithm, multicast flows are evenly distributed over the available links so as to achieve load balance. In addition, the DCNs are controlled globally by the software defined networking (SDN) technology, therefore, the multicast traffic cannot be interfered by the unexpected flow requests. Furthermore, the multicast scheduling algorithm can lead to asymptotically minimum network blocking probability, and has a low time complexity. Simulation results verify the effectiveness of our proposed multicast scheduling algorithm in different network traffic intensities.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114770688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969144
Xiuwen Sun, Kaiyu Hou, Hao Li, Chengchen Hu
Matching multiple patterns is the key technology in firewall, Intrusion Detection Systems, etc. However, most of the web services nowadays tend to compress their traffic for less transferring data and better user experience, which has challenged the multi-pattern matching original working only on raw content. Naive and straightforward solutions towards this challenge either decompress the compressed data first and apply legacy multi-pattern matching methods, or have to scan redundant data during the matching., which are not fast and memory efficient. In this paper, we propose COmpression INspection (COIN) method for multi-pattern matching on compressed HTTP traffic. COIN does not decompress the data before matching and only scans once each bit of the traffic under inspection. We have collected real traffic data from Alexa.com top 500 and Alexa.cn top 20000 web sites and have performed the experiments under 1430 SNORT patterns. The evaluation results show that COIN is 10–31% faster than state-of-the-art approach.
{"title":"Towards a fast packet inspection over compressed HTTP traffic","authors":"Xiuwen Sun, Kaiyu Hou, Hao Li, Chengchen Hu","doi":"10.1109/IWQoS.2017.7969144","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969144","url":null,"abstract":"Matching multiple patterns is the key technology in firewall, Intrusion Detection Systems, etc. However, most of the web services nowadays tend to compress their traffic for less transferring data and better user experience, which has challenged the multi-pattern matching original working only on raw content. Naive and straightforward solutions towards this challenge either decompress the compressed data first and apply legacy multi-pattern matching methods, or have to scan redundant data during the matching., which are not fast and memory efficient. In this paper, we propose COmpression INspection (COIN) method for multi-pattern matching on compressed HTTP traffic. COIN does not decompress the data before matching and only scans once each bit of the traffic under inspection. We have collected real traffic data from Alexa.com top 500 and Alexa.cn top 20000 web sites and have performed the experiments under 1430 SNORT patterns. The evaluation results show that COIN is 10–31% faster than state-of-the-art approach.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131487039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969151
Xiaoning Liu, Xingliang Yuan, Cong Wang
Similarity-oriented services serve as a foundation in a wide range of data analytic applications such as machine learning, target advertising, and real-time decisions. Both industry and academia strive for efficient and scalable similarity discovery and querying techniques to handle massive, complex data records in the real world. In addition to performance, data security and privacy become an indispensable criterion in the quality of service due to progressively increased data breaches. To address this serious concern, in this paper, we propose and implement “EncSIM”, an encrypted and scalable similarity search service. The architecture of EncSIM enables parallel query processing over distributed, encrypted data records. To reduce client overhead, EncSIM resorts to a variant of the state-of-the-art similarity search algorithm, called all-pairs locality-sensitive hashing (LSH). We describe a novel encrypted index construction for EncSIM based on searchable encryption to guarantee the security of service while preserving performance benefits of all-pairs LSH. Moreover, EncSIM supports data record addition with a strong security notion. Intensive evaluations on a cluster of Redis demonstrate low client cost, linear scalability, and satisfied query performance of EncSIM.
{"title":"EncSIM: An encrypted similarity search service for distributed high-dimensional datasets","authors":"Xiaoning Liu, Xingliang Yuan, Cong Wang","doi":"10.1109/IWQoS.2017.7969151","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969151","url":null,"abstract":"Similarity-oriented services serve as a foundation in a wide range of data analytic applications such as machine learning, target advertising, and real-time decisions. Both industry and academia strive for efficient and scalable similarity discovery and querying techniques to handle massive, complex data records in the real world. In addition to performance, data security and privacy become an indispensable criterion in the quality of service due to progressively increased data breaches. To address this serious concern, in this paper, we propose and implement “EncSIM”, an encrypted and scalable similarity search service. The architecture of EncSIM enables parallel query processing over distributed, encrypted data records. To reduce client overhead, EncSIM resorts to a variant of the state-of-the-art similarity search algorithm, called all-pairs locality-sensitive hashing (LSH). We describe a novel encrypted index construction for EncSIM based on searchable encryption to guarantee the security of service while preserving performance benefits of all-pairs LSH. Moreover, EncSIM supports data record addition with a strong security notion. Intensive evaluations on a cluster of Redis demonstrate low client cost, linear scalability, and satisfied query performance of EncSIM.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"212 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132618422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969108
Yuchuan Luo, Shaojing Fu, Dongsheng Wang, Ming Xu, X. Jia
With cloud services, users can easily host their data in the cloud and retrieve the part needed by search. Searchable encryption is proposed to conduct such process in a privacy-preserving way, which allows a cloud server to perform search over the encrypted data in the cloud according to the search token submitted by the user. However, existing works mainly focus on textual data and merely take numerical spatial data into account. Especially, geometric range search is an important queries on spatial data and has wide applications in machine learning, location-based services(LBS), computer-aided design(CAD), and computational geometry. In this paper, we proposed an efficient and generalized symmetric-key geometric range search scheme on encrypted spatial data in the cloud, which supports queries with different range shapes and dimensions. To provide secure and efficient search, we extend the secure kNN computation with dynamic geometric transformation, which dynamically transforms the points in the dataset and the queried geometric range simultaneously. Besides, we further extend the proposed scheme to support sub-linear search efficiency through novel usage of tree structures. We also present extensive experiments to evaluate the proposed schemes on a real-world dataset. The results show that the proposed schemes are efficient over encrypted datasets and secure against the curious cloud servers.
{"title":"Efficient and generalized geometric range search on encrypted spatial data in the cloud","authors":"Yuchuan Luo, Shaojing Fu, Dongsheng Wang, Ming Xu, X. Jia","doi":"10.1109/IWQoS.2017.7969108","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969108","url":null,"abstract":"With cloud services, users can easily host their data in the cloud and retrieve the part needed by search. Searchable encryption is proposed to conduct such process in a privacy-preserving way, which allows a cloud server to perform search over the encrypted data in the cloud according to the search token submitted by the user. However, existing works mainly focus on textual data and merely take numerical spatial data into account. Especially, geometric range search is an important queries on spatial data and has wide applications in machine learning, location-based services(LBS), computer-aided design(CAD), and computational geometry. In this paper, we proposed an efficient and generalized symmetric-key geometric range search scheme on encrypted spatial data in the cloud, which supports queries with different range shapes and dimensions. To provide secure and efficient search, we extend the secure kNN computation with dynamic geometric transformation, which dynamically transforms the points in the dataset and the queried geometric range simultaneously. Besides, we further extend the proposed scheme to support sub-linear search efficiency through novel usage of tree structures. We also present extensive experiments to evaluate the proposed schemes on a real-world dataset. The results show that the proposed schemes are efficient over encrypted datasets and secure against the curious cloud servers.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"43 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115540396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969136
N. Sfondrini, G. Motta
Cloud computing represents a disruptive innovation in the way of provisioning and managing IT and network resources. One of the main challenge of this paradigm is the monitoring of the actual services performance offered by different Cloud service providers. For this reason, service level management plays a central role to ensure the quality of services in Public Cloud and requires a structured approach to support the migration of critical services and sensitive data. This paper presents a conceptual SLA-aware broker, acting as a centralized control point between consumers and Cloud providers, to manage the end-to-end lifecycle of business services running on different Public Cloud environments. A case study implementation in a global telecommunication company demonstrates the feasibility and effectiveness of the proposed solution.
{"title":"SLA-aware broker for Public Cloud","authors":"N. Sfondrini, G. Motta","doi":"10.1109/IWQoS.2017.7969136","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969136","url":null,"abstract":"Cloud computing represents a disruptive innovation in the way of provisioning and managing IT and network resources. One of the main challenge of this paradigm is the monitoring of the actual services performance offered by different Cloud service providers. For this reason, service level management plays a central role to ensure the quality of services in Public Cloud and requires a structured approach to support the migration of critical services and sensitive data. This paper presents a conceptual SLA-aware broker, acting as a centralized control point between consumers and Cloud providers, to manage the end-to-end lifecycle of business services running on different Public Cloud environments. A case study implementation in a global telecommunication company demonstrates the feasibility and effectiveness of the proposed solution.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"84 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126081149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969169
X. Yan, Fan Ye, Yuanyuan Yang, Xiaotie Deng
The rapid penetration of mobile devices has provided ample opportunities for mobile devices to exchange sensing data on a peer basis without any centralized backend. In this paper, we design a peer based data exchanging model, where relay nodes move to certain locations to connect data providers and consumers to facilitate data delivery. Both relays and data providers can gain rewards from consumers who are willing to pay for the data. We first prove the problem of relay node assignment is NP-hard, and provide a centralized optimal method to decide which relay nodes goes to which location with an approximation ratio. Then we define an autonomous compensation game to allow relays make individual decisions without any central authority. We derive a sufficient and necessary condition for the existence of Nash equilibrium. We analyze and compare this distributed game to the centralized social optimal solution, and show that the game incurs small bounded social costs, and efficient under various network sizes, numbers of providers, consumers, and device mobility.
{"title":"An autonomous compensation game to facilitate peer data exchange in crowdsensing","authors":"X. Yan, Fan Ye, Yuanyuan Yang, Xiaotie Deng","doi":"10.1109/IWQoS.2017.7969169","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969169","url":null,"abstract":"The rapid penetration of mobile devices has provided ample opportunities for mobile devices to exchange sensing data on a peer basis without any centralized backend. In this paper, we design a peer based data exchanging model, where relay nodes move to certain locations to connect data providers and consumers to facilitate data delivery. Both relays and data providers can gain rewards from consumers who are willing to pay for the data. We first prove the problem of relay node assignment is NP-hard, and provide a centralized optimal method to decide which relay nodes goes to which location with an approximation ratio. Then we define an autonomous compensation game to allow relays make individual decisions without any central authority. We derive a sufficient and necessary condition for the existence of Nash equilibrium. We analyze and compare this distributed game to the centralized social optimal solution, and show that the game incurs small bounded social costs, and efficient under various network sizes, numbers of providers, consumers, and device mobility.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134453319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969166
Xincai Fei, Fangming Liu, Hong Xu, Hai Jin
Network functions virtualization (NFV) is increasingly adopted by telecommunications (telecos) service providers for cost savings and flexible management. However, deploying virtual network functions (VNFs) in geo-distributed central offices (COs) is not straightforward. Unlike most existing centralized schemes in clouds, VNFs of a service chain usually need to be deployed in multiple COs due to limited resource capacity and uneven setup cost at various locations. To ensure the Quality of Service of service chains, a key problem for service providers is to determine where a VNF should go, in order to achieve cost-efficiency and load balancing of both computing and bandwidth resources, across all selected COs. To this end, we present a framework of CO Selection (CS) and VNF Assignment (VA) for distributed deployment of NFV. Specifically, we first select a set of COs that minimizes the communication cost among the selected COs. Then, we employ a shadow-routing based approach, which minimizes the maximum of appropriately defined CO utilizations, to jointly solve the VNF-CO and VNF-server assignment problem. Simulations demonstrate the effectiveness of CS algorithm, and asymptotic optimality, scalability and high adaptivity of the VNF assignment approach.
{"title":"Towards load-balanced VNF assignment in geo-distributed NFV Infrastructure","authors":"Xincai Fei, Fangming Liu, Hong Xu, Hai Jin","doi":"10.1109/IWQoS.2017.7969166","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969166","url":null,"abstract":"Network functions virtualization (NFV) is increasingly adopted by telecommunications (telecos) service providers for cost savings and flexible management. However, deploying virtual network functions (VNFs) in geo-distributed central offices (COs) is not straightforward. Unlike most existing centralized schemes in clouds, VNFs of a service chain usually need to be deployed in multiple COs due to limited resource capacity and uneven setup cost at various locations. To ensure the Quality of Service of service chains, a key problem for service providers is to determine where a VNF should go, in order to achieve cost-efficiency and load balancing of both computing and bandwidth resources, across all selected COs. To this end, we present a framework of CO Selection (CS) and VNF Assignment (VA) for distributed deployment of NFV. Specifically, we first select a set of COs that minimizes the communication cost among the selected COs. Then, we employ a shadow-routing based approach, which minimizes the maximum of appropriately defined CO utilizations, to jointly solve the VNF-CO and VNF-server assignment problem. Simulations demonstrate the effectiveness of CS algorithm, and asymptotic optimality, scalability and high adaptivity of the VNF assignment approach.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122341977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-14DOI: 10.1109/IWQoS.2017.7969109
Lin Yao, Dong Liu, Xin Wang, Guowei Wu
With the constant increase of social-network data published, the privacy preservation becomes more and more important. Although some literature algorithms apply K-anonymity to the relational data to prevent an adversary from significantly perpetrating privacy breaches, the inappropriate choice of K has a big impact on the quality of privacy protection and data utility. We propose a technique named Relationship Privacy Preservation based on Compressive Sensing (RPPCS) in this paper to anonymize the relationship data of social networks. The network links are randomized from the recovery of the random measurements of the sparse relationship matrix to both preserve the privacy and data utility. Two comprehensive sets of real-world relationship data on social networks are applied to evaluate the performance of our anonymization technique. Our performance evaluations based on Collaboration Network and Gnutella Network demonstrate that our scheme can better preserve the utility of the anonymized data compared to peer schemes. Privacy analysis shows that our scheme can resist the background knowledge attack.
{"title":"Preserving the Relationship Privacy of the published social-network data based on Compressive Sensing","authors":"Lin Yao, Dong Liu, Xin Wang, Guowei Wu","doi":"10.1109/IWQoS.2017.7969109","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969109","url":null,"abstract":"With the constant increase of social-network data published, the privacy preservation becomes more and more important. Although some literature algorithms apply K-anonymity to the relational data to prevent an adversary from significantly perpetrating privacy breaches, the inappropriate choice of K has a big impact on the quality of privacy protection and data utility. We propose a technique named Relationship Privacy Preservation based on Compressive Sensing (RPPCS) in this paper to anonymize the relationship data of social networks. The network links are randomized from the recovery of the random measurements of the sparse relationship matrix to both preserve the privacy and data utility. Two comprehensive sets of real-world relationship data on social networks are applied to evaluate the performance of our anonymization technique. Our performance evaluations based on Collaboration Network and Gnutella Network demonstrate that our scheme can better preserve the utility of the anonymized data compared to peer schemes. Privacy analysis shows that our scheme can resist the background knowledge attack.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116661281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：