Pub Date : 2017-06-01DOI: 10.1109/IWQoS.2017.7969152
Jingyuan Fan, Meiling Jiang, C. Qiao
Network Function Virtualization (NFV) is a promising technique to greatly improve the effectiveness and flexibility of network services through a process named Service Function Chain (SFC) mapping, with which network functions (NFs) are deployed over virtualized and shared platforms in data centers. NFV typically requires a higher availability at the carrier grade than conventional cloud-based IT services, provided by native IaaS mechanism, for example. To achieve the high availability, each VNFs in an SFC can be provisioned with sufficient on-site backups. However, having too many backups may greatly decrease the resource utilization. Therefore, an open challenge is to find an effective method to allocate backup resource in order to maximize the number of SFC requests that can be served while meeting their heterogeneous availability requirements. To address this challenge, we first study how to allocate a minimum amount of backup resource for a single SFC request as an integer nonlinear program and provide an optimal solution. Based on the solution, we then propose an online heuristic algorithm for mapping multiple SFC requests with the objective of maximizing the number of SFC requests that can be served. Last but not least, we introduce a novel backup pooling mechanism to further improve the efficiency of backup resource usage. Through simulations, we show that our proposed algorithm can significantly reduce resource consumption due to backups and increase the number of co-existing SFC requests that can be served.
网络功能虚拟化(Network Function Virtualization, NFV)是一种很有前途的技术，它通过SFC (Service Function Chain)映射过程，将网络功能部署在数据中心的虚拟化和共享平台上，极大地提高了网络服务的有效性和灵活性。与传统的基于云的IT服务(例如，由本地IaaS机制提供)相比，NFV通常要求运营商级的可用性更高。为了实现高可用性，可以为SFC中的每个VNFs提供足够的现场备份。但是，备份太多可能会大大降低资源利用率。因此，一个开放的挑战是找到一种有效的方法来分配备份资源，以便在满足异构可用性需求的同时最大限度地服务SFC请求的数量。为了解决这一挑战，我们首先研究了如何为单个SFC请求分配最小数量的备份资源作为整数非线性程序，并提供了最优解决方案。基于该解决方案，我们提出了一种在线启发式算法，用于映射多个SFC请求，目标是最大化可服务的SFC请求数量。最后，我们引入了一种新的备份池机制，进一步提高了备份资源的使用效率。通过仿真，我们表明我们提出的算法可以显著减少由于备份而导致的资源消耗，并增加可服务的共存SFC请求的数量。
{"title":"Carrier-grade availability-aware mapping of Service Function Chains with on-site backups","authors":"Jingyuan Fan, Meiling Jiang, C. Qiao","doi":"10.1109/IWQoS.2017.7969152","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969152","url":null,"abstract":"Network Function Virtualization (NFV) is a promising technique to greatly improve the effectiveness and flexibility of network services through a process named Service Function Chain (SFC) mapping, with which network functions (NFs) are deployed over virtualized and shared platforms in data centers. NFV typically requires a higher availability at the carrier grade than conventional cloud-based IT services, provided by native IaaS mechanism, for example. To achieve the high availability, each VNFs in an SFC can be provisioned with sufficient on-site backups. However, having too many backups may greatly decrease the resource utilization. Therefore, an open challenge is to find an effective method to allocate backup resource in order to maximize the number of SFC requests that can be served while meeting their heterogeneous availability requirements. To address this challenge, we first study how to allocate a minimum amount of backup resource for a single SFC request as an integer nonlinear program and provide an optimal solution. Based on the solution, we then propose an online heuristic algorithm for mapping multiple SFC requests with the objective of maximizing the number of SFC requests that can be served. Last but not least, we introduce a novel backup pooling mechanism to further improve the efficiency of backup resource usage. Through simulations, we show that our proposed algorithm can significantly reduce resource consumption due to backups and increase the number of co-existing SFC requests that can be served.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131326546","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-01DOI: 10.1109/IWQoS.2017.7969162
E. Khorov, A. Krasilov, A. Malyshev
In this paper, we consider the problem of radio resource scheduling for Industrial Internet and Tactile Internet. Both paradigms — being revolutionary drivers of 5G — are tightly connected with low-latency communications (i.e. latency of the order of 10 ms or even less). We give an original mathematical statement of the radio resource scheduling problem and propose a novel algorithm which solves this problem using the dynamic programming method. With simulations we show that the proposed algorithm outperforms ones found in literature both in terms of goodput (i.e. the amount of data delivered to users within delay budget) and number of users with satisfied QoS requirements. Finally, we discuss how the developed algorithm can be implemented in real networking equipment.
{"title":"Radio resource scheduling for low-latency communications in LTE and beyond","authors":"E. Khorov, A. Krasilov, A. Malyshev","doi":"10.1109/IWQoS.2017.7969162","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969162","url":null,"abstract":"In this paper, we consider the problem of radio resource scheduling for Industrial Internet and Tactile Internet. Both paradigms — being revolutionary drivers of 5G — are tightly connected with low-latency communications (i.e. latency of the order of 10 ms or even less). We give an original mathematical statement of the radio resource scheduling problem and propose a novel algorithm which solves this problem using the dynamic programming method. With simulations we show that the proposed algorithm outperforms ones found in literature both in terms of goodput (i.e. the amount of data delivered to users within delay budget) and number of users with satisfied QoS requirements. Finally, we discuss how the developed algorithm can be implemented in real networking equipment.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116513673","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-01DOI: 10.1109/IWQoS.2017.7969178
Jihong Yu, Jiangchuan Liu, Lin Chen, Yifei Zhu
Ever-increasing research effort has been dedicated to multi-group radio frequency identification (RFID) systems where all tags are partitioned into multiple groups, such as group-level queries, and multi-group missing tag detection. However, it is assumed in the existing work that all tags know their individual group IDs, which thus leaves group labeling problem unaddressed. To tackle the under-investigated problem, this paper is devoted to devising an efficient group labeling protocol to inform each tag of its corresponding group ID fast and accurately. To this end, we employ multiple seeds to build a Composite Indicator Vector (CIV) indicating the assigned seed in each slot, which reduces transmissions of useless information and thus improves time efficiency. Specifically, we first theoretically show that the Seed Assignment Problem (SAP) arising in establishing the CIV is NP-hard and then develop a myopic approximation algorithm. Finally, the simulation results confirm the superiority of the proposed protocol over the state-of-the-art solution in terms of time efficiency.
{"title":"Efficient group labeling for multi-group RFID systems","authors":"Jihong Yu, Jiangchuan Liu, Lin Chen, Yifei Zhu","doi":"10.1109/IWQoS.2017.7969178","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969178","url":null,"abstract":"Ever-increasing research effort has been dedicated to multi-group radio frequency identification (RFID) systems where all tags are partitioned into multiple groups, such as group-level queries, and multi-group missing tag detection. However, it is assumed in the existing work that all tags know their individual group IDs, which thus leaves group labeling problem unaddressed. To tackle the under-investigated problem, this paper is devoted to devising an efficient group labeling protocol to inform each tag of its corresponding group ID fast and accurately. To this end, we employ multiple seeds to build a Composite Indicator Vector (CIV) indicating the assigned seed in each slot, which reduces transmissions of useless information and thus improves time efficiency. Specifically, we first theoretically show that the Seed Assignment Problem (SAP) arising in establishing the CIV is NP-hard and then develop a myopic approximation algorithm. Finally, the simulation results confirm the superiority of the proposed protocol over the state-of-the-art solution in terms of time efficiency.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125318829","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-01DOI: 10.1109/IWQoS.2017.7969128
Xiang Hu, L. Jiao
IEEE 802.15.4 is the standard protocol for low-rate, low-power wireless personal area networks, including the physical layer and media access control layer specifications. Particularly, some mechanisms for certain purposes, such as transmission efficiency and power saving, are introduced. It is worthwhile to evaluate how the protocol can fulfill the quality of service requirements. Coloured Petri nets are chosen for the modeling and analyzing purposes because of the enhanced modeling power and abundant analysis techniques. The modeling method for wireless network protocols using coloured Petri nets is summarized, which is general enough and can be directly used to model various wireless network protocols like IEEE 802.15.4. During the modeling process, some modeling techniques are utilized, e.g., building the model in the hierarchical and modular way, reducing the model by the folding technique, and normalizing the modeling process by the modeling patterns. Simulation is conducted on the coloured Petri net model to compute some performance metrics such as throughput, delivery ratio, delay, and energy cost. All the above show that coloured Petri nets can play an important role in modeling and analyzing wireless network protocols.
{"title":"Efficient modeling and performance analysis for IEEE 802.15.4 with coloured Petri nets","authors":"Xiang Hu, L. Jiao","doi":"10.1109/IWQoS.2017.7969128","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969128","url":null,"abstract":"IEEE 802.15.4 is the standard protocol for low-rate, low-power wireless personal area networks, including the physical layer and media access control layer specifications. Particularly, some mechanisms for certain purposes, such as transmission efficiency and power saving, are introduced. It is worthwhile to evaluate how the protocol can fulfill the quality of service requirements. Coloured Petri nets are chosen for the modeling and analyzing purposes because of the enhanced modeling power and abundant analysis techniques. The modeling method for wireless network protocols using coloured Petri nets is summarized, which is general enough and can be directly used to model various wireless network protocols like IEEE 802.15.4. During the modeling process, some modeling techniques are utilized, e.g., building the model in the hierarchical and modular way, reducing the model by the folding technique, and normalizing the modeling process by the modeling patterns. Simulation is conducted on the coloured Petri net model to compute some performance metrics such as throughput, delivery ratio, delay, and energy cost. All the above show that coloured Petri nets can play an important role in modeling and analyzing wireless network protocols.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122194288","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-01DOI: 10.1109/IWQoS.2017.7969181
Lei Zhang, Feng Wang, Jiangchuan Liu, Yifei Zhu
During the past decade, we have witnessed the pervasive penetration of mobile smart devices such as smartphones, tablets, and wearable devices, which significantly enrich Internet applications and improve user experience. In the foreseeable future, mobile smart devices are predicted to take up over 50% of global devices/connections and surpass 4/5 of mobile data traffic by 2021 [1]. Such mobile smart devices as smartphones, phablets, and tablets, undoubtedly reshape the way that users access Internet services, e.g., web browsing. Different from traditional desktop applications, in which users interact via interfaces like large displays, keyboards, and mouses, mobile applications require users to enter the inputs through touch screens and allow them to view the outputs on limited size of displays. This distinct feature introduced by mobile hardware interfaces brings both challenges and opportunities to mobile-based Internet applications. On one hand, mobile service providers should prepare multiple copies of media contents with different resolutions and even multiple versions of application UI layouts to fit various sizes of screens on heterogeneous devices. On the other hand, as media contents are usually organized in certain order in mobile-based Internet applications, it is possible to predict the viewing region (referred as viewport hereafter) given the user inputs and the fixed size of display.
{"title":"Accelerating mobile web browsing with screen scrolling","authors":"Lei Zhang, Feng Wang, Jiangchuan Liu, Yifei Zhu","doi":"10.1109/IWQoS.2017.7969181","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969181","url":null,"abstract":"During the past decade, we have witnessed the pervasive penetration of mobile smart devices such as smartphones, tablets, and wearable devices, which significantly enrich Internet applications and improve user experience. In the foreseeable future, mobile smart devices are predicted to take up over 50% of global devices/connections and surpass 4/5 of mobile data traffic by 2021 [1]. Such mobile smart devices as smartphones, phablets, and tablets, undoubtedly reshape the way that users access Internet services, e.g., web browsing. Different from traditional desktop applications, in which users interact via interfaces like large displays, keyboards, and mouses, mobile applications require users to enter the inputs through touch screens and allow them to view the outputs on limited size of displays. This distinct feature introduced by mobile hardware interfaces brings both challenges and opportunities to mobile-based Internet applications. On one hand, mobile service providers should prepare multiple copies of media contents with different resolutions and even multiple versions of application UI layouts to fit various sizes of screens on heterogeneous devices. On the other hand, as media contents are usually organized in certain order in mobile-based Internet applications, it is possible to predict the viewing region (referred as viewport hereafter) given the user inputs and the fixed size of display.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116291612","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-01DOI: 10.1109/IWQoS.2017.7969179
Yifei Zhu, Jiangchuan Liu
Live video contents in crowdsourced live streaming services are transcoded into multiple quality versions to better service viewers with different network and device configurations. Cloud computing becomes a natural choice to handle this transcoding service due to its elasticity and significant computational power. However, given the huge concurrent channel numbers in this crowdsourced live streaming service, even the cloud becomes significantly expensive for providing transcoding services to the whole community. In this poster, after observing that abundant computational resources reside in end viewers, we propose a Cloud-Crowd collaborative system, C2, which incentivizes idle end-viewers to join with the cloud to do video transcoding. Specifically, we propose an auction mechanism to carefully select stable viewers and determine the proper payment for them. Desirable economic properties, like incentive compatibility, can be achieved in our mechanism. Large-scale trace-driven simulations further demonstrate the superiority of our mechanisms in cost reduction and service stability.
{"title":"C2: Procuring uncertain freelancers for interactive live video transcoding","authors":"Yifei Zhu, Jiangchuan Liu","doi":"10.1109/IWQoS.2017.7969179","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969179","url":null,"abstract":"Live video contents in crowdsourced live streaming services are transcoded into multiple quality versions to better service viewers with different network and device configurations. Cloud computing becomes a natural choice to handle this transcoding service due to its elasticity and significant computational power. However, given the huge concurrent channel numbers in this crowdsourced live streaming service, even the cloud becomes significantly expensive for providing transcoding services to the whole community. In this poster, after observing that abundant computational resources reside in end viewers, we propose a Cloud-Crowd collaborative system, C2, which incentivizes idle end-viewers to join with the cloud to do video transcoding. Specifically, we propose an auction mechanism to carefully select stable viewers and determine the proper payment for them. Desirable economic properties, like incentive compatibility, can be achieved in our mechanism. Large-scale trace-driven simulations further demonstrate the superiority of our mechanisms in cost reduction and service stability.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130413998","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-01DOI: 10.1109/IWQoS.2017.7969133
Hongli Xu, Jinyuan Fan, Jianhuai Wu, C. Qiao, Liusheng Huang
To take advantage of software defined networking (SDN) within a limited budget constraint, a natural strategy is to incrementally deploy a few SDN switches (and a limited amount of additional link bandwidth) into the legacy optical network. In such a hybrid optical network, operators can only change the routes of flows that traverse SDN switches. Therefore, to optimize SDN deployment, it is essential to decide the best places to deploy SDN resources (including SDN switches and link bandwidth) while taking the network traffic into consideration. In this paper, we propose a new SDN deployment scheme, called duplicated deployment, to provide a simple and efficient way for a hybrid network. Based on the proposed deployment scheme, we for the first time define the joint duplicated deployment and routing (DDR) problem for throughput maximization (or optimal deployment) with a given budget constraint on the additional SDN resource cost. Due to the NP-Hardness of the DDR problem, we then present an approximation algorithm based on the traffic mapping and randomized rounding methods, and prove that the approximation factor is (O(log n);O(log n)) in the worst case and (O(1);O(1)) under most practical situations for link capacity and flow-table size constraints, where n is the number of devices (including SDN switches and legacy routers) in the hybrid network. Through extensive simulations, we demonstrate high efficiency of our joint deployment and routing algorithm. For example, our proposed algorithm can improve the network throughput by about 26% compared with existing routing mechanisms with the same amount of extra resources.
{"title":"Joint deployment and routing in hybrid SDNs","authors":"Hongli Xu, Jinyuan Fan, Jianhuai Wu, C. Qiao, Liusheng Huang","doi":"10.1109/IWQoS.2017.7969133","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969133","url":null,"abstract":"To take advantage of software defined networking (SDN) within a limited budget constraint, a natural strategy is to incrementally deploy a few SDN switches (and a limited amount of additional link bandwidth) into the legacy optical network. In such a hybrid optical network, operators can only change the routes of flows that traverse SDN switches. Therefore, to optimize SDN deployment, it is essential to decide the best places to deploy SDN resources (including SDN switches and link bandwidth) while taking the network traffic into consideration. In this paper, we propose a new SDN deployment scheme, called duplicated deployment, to provide a simple and efficient way for a hybrid network. Based on the proposed deployment scheme, we for the first time define the joint duplicated deployment and routing (DDR) problem for throughput maximization (or optimal deployment) with a given budget constraint on the additional SDN resource cost. Due to the NP-Hardness of the DDR problem, we then present an approximation algorithm based on the traffic mapping and randomized rounding methods, and prove that the approximation factor is (O(log n);O(log n)) in the worst case and (O(1);O(1)) under most practical situations for link capacity and flow-table size constraints, where n is the number of devices (including SDN switches and legacy routers) in the hybrid network. Through extensive simulations, we demonstrate high efficiency of our joint deployment and routing algorithm. For example, our proposed algorithm can improve the network throughput by about 26% compared with existing routing mechanisms with the same amount of extra resources.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116165782","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-01DOI: 10.1109/IWQoS.2017.7969141
Yan Li, Deke Guo, Honghui Chen, Junjie Xie
In multi-tenant shared clouds, applications of different tenants compete for the shared network and thus suffer significant unpredictability of performance. The progress is an essential metric to measure the overall data transfer rate of a tenant and to indicate how fast a tenant can complete data transfer. Most previous work of network allocation or schedule focus on achieving the tradeoff among the fairness, performance, and efficiency. They, however, often do not make each tenant achieve noticeable progress. In this paper, we motivate to maximize tenant's progress by using information about the underlying network and traffic patterns of tenants' applications. To illustrate the feasibility of maximizing progress, we develop a network sharing framework for multi-tenant datacenter, by exploiting the benefits of careful placement of tenant's applications. Furthermore, the tenants' progress and network utilization would be further improved without impacting performance isolation, if the bandwidth demand of each application can be rescheduled. Our evaluation results show that our method provides higher tenant progress and better tenant-level performance than HUG.
{"title":"Application-aware network sharing for enabling high progress of multi-tenants","authors":"Yan Li, Deke Guo, Honghui Chen, Junjie Xie","doi":"10.1109/IWQoS.2017.7969141","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969141","url":null,"abstract":"In multi-tenant shared clouds, applications of different tenants compete for the shared network and thus suffer significant unpredictability of performance. The progress is an essential metric to measure the overall data transfer rate of a tenant and to indicate how fast a tenant can complete data transfer. Most previous work of network allocation or schedule focus on achieving the tradeoff among the fairness, performance, and efficiency. They, however, often do not make each tenant achieve noticeable progress. In this paper, we motivate to maximize tenant's progress by using information about the underlying network and traffic patterns of tenants' applications. To illustrate the feasibility of maximizing progress, we develop a network sharing framework for multi-tenant datacenter, by exploiting the benefits of careful placement of tenant's applications. Furthermore, the tenants' progress and network utilization would be further improved without impacting performance isolation, if the bandwidth demand of each application can be rescheduled. Our evaluation results show that our method provides higher tenant progress and better tenant-level performance than HUG.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128079390","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-01DOI: 10.1109/IWQoS.2017.7969157
Wei Chang, Huanyang Zheng, Jie Wu
In the smart cities of the future, people expect to gather data from moving vehicles. Due to the existence of malicious users who claim to be in a traffic flow but actually are in others, a location proof for vehicular trajectory-based data needs to be developed. RoadSide Units (RSUs) are commonly used in smart cities, and a vehicular trajectory's location proof can be generated based on messages collected from RSUs along the trajectory. This paper studies the optimal RSU placement problem: Given a set of traffic flows, the objective is to place a minimum number of RSUs to securely distinguish all flows. A traffic flow is securely distinguishable if the set of its passing RSUs is unique among all traffic flows and unforgeable. To solve this problem, an RSU placement algorithm with an approximation ratio O(ln n) is proposed. In order to further reduce the number of deployed RSUs, this paper explores the credential propagation mechanism via Car-to-Car (C2C) communications, which essentially extend the coverage of an RSU. Approximation algorithms are proposed to solve the problem, and extensive real data-driven experiments demonstrate the efficiency and effectiveness of the proposed algorithms.
{"title":"On the RSU-based secure distinguishability among vehicular flows","authors":"Wei Chang, Huanyang Zheng, Jie Wu","doi":"10.1109/IWQoS.2017.7969157","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969157","url":null,"abstract":"In the smart cities of the future, people expect to gather data from moving vehicles. Due to the existence of malicious users who claim to be in a traffic flow but actually are in others, a location proof for vehicular trajectory-based data needs to be developed. RoadSide Units (RSUs) are commonly used in smart cities, and a vehicular trajectory's location proof can be generated based on messages collected from RSUs along the trajectory. This paper studies the optimal RSU placement problem: Given a set of traffic flows, the objective is to place a minimum number of RSUs to securely distinguish all flows. A traffic flow is securely distinguishable if the set of its passing RSUs is unique among all traffic flows and unforgeable. To solve this problem, an RSU placement algorithm with an approximation ratio O(ln n) is proposed. In order to further reduce the number of deployed RSUs, this paper explores the credential propagation mechanism via Car-to-Car (C2C) communications, which essentially extend the coverage of an RSU. Approximation algorithms are proposed to solve the problem, and extensive real data-driven experiments demonstrate the efficiency and effectiveness of the proposed algorithms.","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-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127903616","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-01DOI: 10.1109/IWQoS.2017.7969153
Zhili Chen, Xuemei Wei, Hong Zhong, Jie Cui, Yan Xu, Shun Zhang
Truthful spectrum auction is believed to be an effective method for spectrum redistribution. However, privacy concerns have largely hampered the practical applications of truthful spectrum auctions. In this paper, to make the applications of double spectrum auctions practical, we present a secure, efficient and practical double spectrum auction design, SDSA. Specifically, by combining three security techniques: homomorphic encryption, secret sharing and garbled circuits, we design a secure two-party protocol computing a socially efficient double spectrum auction, TDSA, without leaking any information about sellers' requests or buyers' bids beyond the auction outcome. We give the formal security definition in our context, and theoretically prove the security that our design achieves. Experimental results show that our design is efficient and practical even for large-scale double spectrum auctions.
{"title":"Secure, efficient and practical double spectrum auction","authors":"Zhili Chen, Xuemei Wei, Hong Zhong, Jie Cui, Yan Xu, Shun Zhang","doi":"10.1109/IWQoS.2017.7969153","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969153","url":null,"abstract":"Truthful spectrum auction is believed to be an effective method for spectrum redistribution. However, privacy concerns have largely hampered the practical applications of truthful spectrum auctions. In this paper, to make the applications of double spectrum auctions practical, we present a secure, efficient and practical double spectrum auction design, SDSA. Specifically, by combining three security techniques: homomorphic encryption, secret sharing and garbled circuits, we design a secure two-party protocol computing a socially efficient double spectrum auction, TDSA, without leaking any information about sellers' requests or buyers' bids beyond the auction outcome. We give the formal security definition in our context, and theoretically prove the security that our design achieves. Experimental results show that our design is efficient and practical even for large-scale double spectrum auctions.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"474 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124397138","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
扫码关注我们
求助内容：
应助结果提醒方式：