首页 > 最新文献

2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)最新文献

英文 中文
Copula-based parameter estimation for Markov-modulated Poisson Process 基于copula的马尔可夫调制泊松过程参数估计
Pub Date : 2017-06-14 DOI: 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.
马尔可夫调制泊松过程(MMPP)在随机过程理论中得到了广泛的研究,并被广泛用作网络流量模型。大多数估计MMPP参数的方法都是基于准确的到达时间。然而,在许多应用程序中,记录每次到达的准确时间是昂贵的。相反,我们只记录固定长度时间段的到达数量,这称为到达计数。由于到达次数数据不包含详细的到达时间,因此开发仅使用到达次数进行MMPP参数估计的有效方法是非简单的。很少有现存的作品处理这一挑战。本文用联结分析法解决了上述问题。利用MMPP中到达次数的理论边际分布和联结,提出了一种新的估计方法MarCpa,即边缘匹配后联结匹配的两步估计方法。评价结果表明,该方法快速、准确。
{"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}
引用次数: 0
Congestion control in Converged Ethernet with heterogeneous and time-varying delays 异构时变时延融合以太网中的拥塞控制
Pub Date : 2017-06-14 DOI: 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.
拥塞控制是增强型以太网作为传统局域网、SAN和高性能计算网络的统一结构的新趋势中不可或缺的机制。IEEE 802.1 Qau工作组已经对CE网络的拥塞管理框架进行了标准化,并在标准草案中推荐QCN作为拥塞控制方案。QCN是针对1/10Gbps以太网启发式设计的,没有考虑延迟的影响。最近的研究发现,QCN将遇到反馈延迟的稳定性问题,随着以太网扩展到40/100Gbps,延迟变得异构和时变,这些问题将更加严重。本研究旨在减轻延迟对CE拥塞控制方案的负面影响。特别地,考虑到延迟的异构性和时变性,我们建立了一个基于标准拥塞管理框架的融合以太网模型。该模型提供了一种新的拥塞检测器来估计延迟影响下的真实拥塞状态,并将异构和时变特征视为干扰。利用新的拥塞检测器和通过滑模控制方法容忍干扰,我们设计了延迟容忍滑模(DSM)拥塞控制方案。大量的仿真表明,当以太网范围从1Gbps到100Gbps,延迟是异构的和时变的时,DSM优于其他拥塞控制方案。
{"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}
引用次数: 0
Multicast scheduling algorithm in software defined fat-tree data center networks 软件定义胖树数据中心网络中的组播调度算法
Pub Date : 2017-06-14 DOI: 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.
组播不仅可以缩短应用程序的任务完成时间,而且可以有效地降低数据中心网络(DCNs)的总体带宽消耗。然而,由于DCNs具有流量巨大的基本特性,负载不均衡和突然的链路阻塞会严重影响网络性能。为了解决这一问题,本文提出了一种新的软件定义胖树DCNs组播调度算法,该算法可以通过减少组播流量阻塞来提高网络性能。其中,组播调度算法选择链路的阻塞代价最小作为最优路径。通过我们的调度算法,组播流被均匀地分布在可用的链路上,从而达到负载均衡。此外,dcn采用软件定义网络(SDN)技术进行全局控制,因此组播流量不会受到意外流请求的干扰。此外,组播调度算法可以使网络阻塞概率渐近最小,并且具有较低的时间复杂度。仿真结果验证了该算法在不同网络流量强度下的有效性。
{"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}
引用次数: 3
Towards a fast packet inspection over compressed HTTP traffic 实现对压缩HTTP流量的快速数据包检测
Pub Date : 2017-06-14 DOI: 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.
多模式匹配是防火墙、入侵检测系统等的关键技术。然而,目前大多数web服务都倾向于压缩其流量,以减少传输数据量和获得更好的用户体验,这对只处理原始内容的多模式匹配提出了挑战。针对这一挑战的简单解决方案要么先对压缩数据进行解压缩,然后应用遗留的多模式匹配方法,要么必须在匹配过程中扫描冗余数据。,它们的速度和内存效率都不高。本文提出了一种压缩检测(COIN)方法,用于对压缩后的HTTP流量进行多模式匹配。COIN在匹配之前不解压缩数据,并且只扫描一次被检查的流量的每个位。我们收集了Alexa.com 500强和Alexa.com cn 20000强网站的真实流量数据,并在1430种SNORT模式下进行了实验。评价结果表明,该方法比现有方法快10-31%。
{"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}
引用次数: 5
EncSIM: An encrypted similarity search service for distributed high-dimensional datasets EncSIM:用于分布式高维数据集的加密相似度搜索服务
Pub Date : 2017-06-14 DOI: 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.
面向相似性的服务是广泛的数据分析应用程序(如机器学习、目标广告和实时决策)的基础。工业界和学术界都在努力寻求高效、可扩展的相似性发现和查询技术,以处理现实世界中大量、复杂的数据记录。除了性能之外,由于数据泄露的日益增加,数据安全和隐私成为服务质量不可或缺的标准。为了解决这个严重的问题,在本文中,我们提出并实现了“EncSIM”,一个加密的、可扩展的相似度搜索服务。EncSIM的架构支持对分布式加密数据记录进行并行查询处理。为了减少客户机开销,EncSIM采用了最先进的相似性搜索算法的一种变体,称为全对位置敏感散列(LSH)。为了在保证服务安全性的同时保留全对LSH的性能优势,提出了一种基于可搜索加密的EncSIM加密索引结构。此外,EncSIM支持数据记录添加,具有很强的安全性。在Redis集群上的密集评估表明,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}
引用次数: 10
Efficient and generalized geometric range search on encrypted spatial data in the cloud 云中加密空间数据的高效广义几何距离搜索
Pub Date : 2017-06-14 DOI: 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.
有了云服务,用户可以很容易地将他们的数据托管在云中,并检索搜索所需的部分。提出了可搜索加密,以保护隐私的方式进行这一过程,允许云服务器根据用户提交的搜索令牌对云中的加密数据进行搜索。然而,现有的研究主要集中在文本数据上,仅对数值空间数据进行了考虑。特别是几何距离搜索是一种重要的空间数据查询,在机器学习、基于位置的服务(LBS)、计算机辅助设计(CAD)和计算几何等领域有着广泛的应用。本文提出了一种高效、通用的对称键几何范围搜索方案,该方案支持不同范围形状和维度的查询。为了提供安全高效的搜索,我们将安全kNN计算扩展为动态几何变换,同时对数据集中的点和查询的几何范围进行动态变换。此外,我们进一步扩展了该方案,通过新颖的树形结构来支持亚线性搜索效率。我们还提出了大量的实验来评估在现实世界数据集上提出的方案。结果表明,所提出的方案在加密数据集上是有效的,并且对奇怪的云服务器是安全的。
{"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}
引用次数: 16
SLA-aware broker for Public Cloud
Pub Date : 2017-06-14 DOI: 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.
云计算代表了供应和管理IT和网络资源方式的颠覆性创新。此范例的主要挑战之一是监视不同云服务提供商提供的实际服务性能。因此,服务级别管理在确保公共云中的服务质量方面发挥着核心作用,并且需要一种结构化方法来支持关键服务和敏感数据的迁移。本文提出了一个概念性的支持sla的代理,充当消费者和云提供商之间的集中控制点,管理运行在不同公共云环境上的业务服务的端到端生命周期。一个在全球电信公司实施的案例研究证明了所提出的解决方案的可行性和有效性。
{"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}
引用次数: 5
An autonomous compensation game to facilitate peer data exchange in crowdsensing 一个自主补偿游戏,以促进群体感知中的对等数据交换
Pub Date : 2017-06-14 DOI: 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.
移动设备的迅速普及为移动设备在对等基础上交换传感数据提供了充足的机会,而无需任何集中的后端。在本文中,我们设计了一个基于对等的数据交换模型,其中中继节点移动到特定位置以连接数据提供者和消费者以促进数据传递。中继者和数据提供者都可以从愿意为数据付费的消费者那里获得奖励。我们首先证明了中继节点分配问题是np困难的,并提供了一种集中式最优方法,以近似比率决定哪些中继节点到哪些位置。然后,我们定义了一个自主补偿博弈,允许继电器在没有任何中央权威的情况下做出个人决定。给出了纳什均衡存在的一个充要条件。我们将这种分布式博弈与集中式社会最优解决方案进行了分析和比较,结果表明,在各种网络规模、供应商数量、消费者数量和设备移动性下,这种博弈产生的有限社会成本很小,而且效率很高。
{"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}
引用次数: 4
QoS evaluation of prioritized data plane service employing queueing model 基于排队模型的优先级数据平面服务QoS评价
Pub Date : 2017-06-14 DOI: 10.1109/IWQoS.2017.7969127
Yongjian Ren, Lei Liu, Li-zhen Cui, Yuliang Shi, Dongyu Zheng
Software Defined Networking (SDN) is emerging as a new paradigm in which the control plane is decoupled from the data plane. SDN architectures enable the abstraction of network elements from the chaos of infrastructures to be service resources. The deployment of applications and network services can be largely simplified by taking advantage of the standardized open Application Program Interface (API). In the open literature, many efforts have been taken to evaluate the forwarding performance of the data plane. Jackson model is frequently employed to characterize the feature of such architectures. Further, network traffic frequently exhibits self-similar characteristic that has got a universal recognition. Analytical models without taking the traffic self-similarity into account may lead to unexpected results. To this end, this paper has proposed an analytical model to evaluate the Quality of Service (QoS) of SDN data plane with self-similar input traffic. Priority service is employed in data plane to decrease the sojourn time of the packets not matched. This is because packets traveled across the control plane are more sensitive to stringent delay bound. The QoS of the model can be evaluated by a decomposition approach. Extensive experimental results suggest that our model has a great accuracy and applicability.
软件定义网络(SDN)作为一种控制平面与数据平面解耦的新范式正在兴起。SDN架构能够从基础设施的混乱中抽象出网元作为业务资源。通过利用标准化的开放应用程序编程接口(API),可以大大简化应用程序和网络服务的部署。在公开的文献中,已经采取了许多努力来评估数据平面的转发性能。Jackson模型经常被用来描述这种结构的特征。此外,网络流量经常表现出自相似的特征,这种特征已经得到了普遍的认可。不考虑流量自相似度的分析模型可能会导致意想不到的结果。为此,本文提出了一种具有自相似输入流量的SDN数据平面服务质量(QoS)的分析模型。数据平面采用优先级服务,减少不匹配报文的停留时间。这是因为通过控制平面传输的数据包对严格的延迟绑定更为敏感。模型的QoS可以通过分解方法来评估。大量的实验结果表明,该模型具有较高的准确性和适用性。
{"title":"QoS evaluation of prioritized data plane service employing queueing model","authors":"Yongjian Ren, Lei Liu, Li-zhen Cui, Yuliang Shi, Dongyu Zheng","doi":"10.1109/IWQoS.2017.7969127","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969127","url":null,"abstract":"Software Defined Networking (SDN) is emerging as a new paradigm in which the control plane is decoupled from the data plane. SDN architectures enable the abstraction of network elements from the chaos of infrastructures to be service resources. The deployment of applications and network services can be largely simplified by taking advantage of the standardized open Application Program Interface (API). In the open literature, many efforts have been taken to evaluate the forwarding performance of the data plane. Jackson model is frequently employed to characterize the feature of such architectures. Further, network traffic frequently exhibits self-similar characteristic that has got a universal recognition. Analytical models without taking the traffic self-similarity into account may lead to unexpected results. To this end, this paper has proposed an analytical model to evaluate the Quality of Service (QoS) of SDN data plane with self-similar input traffic. Priority service is employed in data plane to decrease the sojourn time of the packets not matched. This is because packets traveled across the control plane are more sensitive to stringent delay bound. The QoS of the model can be evaluated by a decomposition approach. Extensive experimental results suggest that our model has a great accuracy and applicability.","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":"115624323","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}
引用次数: 4
Handling scheduling uncertainties through traffic shaping in Time-Triggered train networks 时间触发列车网络交通整形处理调度不确定性
Pub Date : 2017-06-14 DOI: 10.1109/IWQoS.2017.7969171
Qinghan Yu, Xibin Zhao, Hai Wan, Yue Gao, Chenyang Lu, M. Gu
While trains traditionally relied on field bus to support real-time control applications, next-generation trains are moving toward Ethernet as an integrated, high-bandwidth communication infrastructure for real-time control and best-effort consumer traffic. Time-Triggered Ethernet (TT-Ethernet) is a promising technology for train networks because of its capability to achieve deterministic latencies for real-time applications based on pre-computed transmission schedules. However, the deterministic scheduling approach of TT-Ethernet faces significant challenges in handling scheduling uncertainties caused by switch failures and legacy end devices in train networks. Due to the physical constraints on trains, train networks deal with switch failures by bypassing failed switches using a short circuiting mechanism. Unfortunately, this mechanism incurs scheduling errors as frames bypassing the failed switch may arrive ahead of the pre-computed schedule, resulting in early, unexpected, and out of order arrivals. Furthermore, as trains evolve from traditional communication technologies to TT-Ethernet, the network must support legacy end devices that may generate frames at times unknown to the TT-Ethernet. We propose a novel traffic shaping approach to deal with scheduling uncertainties in TT-Ethernet. The traffic shaper of a TT-Ethernet switch buffers early frames and then releases them at their pre-scheduled arrive time. Furthermore, we devise an efficient buffer management method for the traffic shaper in face of fault scenarios. Finally, we use the traffic shaper to integrate legacy devices into TT-Ethernet. We have implemented the traffic shaping approach in a 24-port TT-Ethernet switch specifically designed for train networks. Experiments show the traffic shaping strategy can effectively deal with scheduling uncertainties incurred by switch failures and legacy devices.
传统上,列车依靠现场总线来支持实时控制应用,而下一代列车正朝着以太网的方向发展,作为一种集成的、高带宽的通信基础设施,用于实时控制和尽最大努力实现用户流量。时间触发以太网(TT-Ethernet)是一种很有前途的列车网络技术,因为它能够基于预先计算的传输调度实现实时应用的确定性延迟。然而,tt -以太网的确定性调度方法在处理列车网络中由交换机故障和遗留终端设备引起的调度不确定性方面面临着重大挑战。由于列车的物理限制,列车网络通过使用短路机制绕过故障的开关来处理开关故障。不幸的是,这种机制会导致调度错误,因为绕过故障交换机的帧可能会比预先计算的调度提前到达,从而导致提前、意外和无序到达。此外,随着列车从传统通信技术发展到tt -以太网,网络必须支持可能在tt -以太网未知的情况下生成帧的遗留终端设备。提出了一种新的流量整形方法来处理tt -以太网中的调度不确定性。tt以太网交换机的流量整形器缓冲早期帧,然后在它们预定的到达时间释放它们。此外,我们还设计了一种有效的流量整形器在故障情况下的缓冲管理方法。最后,我们使用流量整形器将遗留设备集成到tt -以太网中。我们已经在专门为列车网络设计的24端口tt -以太网交换机中实现了流量整形方法。实验表明,流量整形策略可以有效地处理交换机故障和遗留设备带来的调度不确定性。
{"title":"Handling scheduling uncertainties through traffic shaping in Time-Triggered train networks","authors":"Qinghan Yu, Xibin Zhao, Hai Wan, Yue Gao, Chenyang Lu, M. Gu","doi":"10.1109/IWQoS.2017.7969171","DOIUrl":"https://doi.org/10.1109/IWQoS.2017.7969171","url":null,"abstract":"While trains traditionally relied on field bus to support real-time control applications, next-generation trains are moving toward Ethernet as an integrated, high-bandwidth communication infrastructure for real-time control and best-effort consumer traffic. Time-Triggered Ethernet (TT-Ethernet) is a promising technology for train networks because of its capability to achieve deterministic latencies for real-time applications based on pre-computed transmission schedules. However, the deterministic scheduling approach of TT-Ethernet faces significant challenges in handling scheduling uncertainties caused by switch failures and legacy end devices in train networks. Due to the physical constraints on trains, train networks deal with switch failures by bypassing failed switches using a short circuiting mechanism. Unfortunately, this mechanism incurs scheduling errors as frames bypassing the failed switch may arrive ahead of the pre-computed schedule, resulting in early, unexpected, and out of order arrivals. Furthermore, as trains evolve from traditional communication technologies to TT-Ethernet, the network must support legacy end devices that may generate frames at times unknown to the TT-Ethernet. We propose a novel traffic shaping approach to deal with scheduling uncertainties in TT-Ethernet. The traffic shaper of a TT-Ethernet switch buffers early frames and then releases them at their pre-scheduled arrive time. Furthermore, we devise an efficient buffer management method for the traffic shaper in face of fault scenarios. Finally, we use the traffic shaper to integrate legacy devices into TT-Ethernet. We have implemented the traffic shaping approach in a 24-port TT-Ethernet switch specifically designed for train networks. Experiments show the traffic shaping strategy can effectively deal with scheduling uncertainties incurred by switch failures and legacy devices.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"61 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":"117130656","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}
引用次数: 3
期刊
2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1