发布求助
文献互助 智能选刊 最新文献

Proceedings. Data Compression Conference最新文献

筛选
英文 中文
Design and implementation of an OpenFlow hardware abstraction layer OpenFlow硬件抽象层的设计与实现
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627577
D. Parniewicz, R. D. Corin, L. Ogrodowczyk, Mehdi Rashidi-Fard, J. Matías, M. Gerola, Victor Fuentes, U. Toseef, A. Zaalouk, B. Belter, E. Jacob, K. Pentikousis
{"title":"Design and implementation of an OpenFlow hardware abstraction layer","authors":"D. Parniewicz, R. D. Corin, L. Ogrodowczyk, Mehdi Rashidi-Fard, J. Matías, M. Gerola, Victor Fuentes, U. Toseef, A. Zaalouk, B. Belter, E. Jacob, K. Pentikousis","doi":"10.1145/2627566.2627577","DOIUrl":"https://doi.org/10.1145/2627566.2627577","url":null,"abstract":"OpenFlow is a leading standard for Software-Defined Networking (SDN) and has already played a significant role in reshaping network infrastructures. However, a wide range of existing provider domains is still not equipped with a framework that supports wider deployment of an OpenFlow-based control plane beyond Ethernet-dominated networks. We address this gap by introducing a Hardware Abstraction Layer (HAL) which can transform legacy network elements into OpenFlow capable devices. This paper details the functional architecture of HAL, discusses the key design aspects and explains how HAL can support a number of network device classes. In addition, this paper presents the implementation details of HAL for hardware platforms such as DOCSIS (Data over Cable Service Interface Specification) and DWDM (Dense Wavelength Division Multiplexing) which have so far received little attention by the OpenFlow research community despite their wide real-world deployment.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"262 1","pages":"71-76"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79787047","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}
引用次数: 33
Response time-optimized distributed cloud resource allocation 响应时间优化的分布式云资源分配
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627570
Matthias Keller, H. Karl
{"title":"Response time-optimized distributed cloud resource allocation","authors":"Matthias Keller, H. Karl","doi":"10.1145/2627566.2627570","DOIUrl":"https://doi.org/10.1145/2627566.2627570","url":null,"abstract":"In the near future many more compute resources will be available at different geographical locations. To minimize the response time of requests, application servers closer to the user can hence be used to shorten network round trip times. However, this advantage is neutralized if the used data centre is highly loaded as the processing time of requests is important as well. We model the request response time as the network round trip time plus the processing time at a data centre.We present a capacitated facility location problem formalization where the processing time is modelled as the sojourn time of a queueing model. We discuss the emph{Pareto trade-off} between the number of used data centres and the resulting response time. For example, using fewer data centres could cut expenses but results in high utilization, high response time, and smaller revenues.Previous work presented a non-linear cost function. We prove its emph{convexity} and exploit this property in two ways: First, we transform the convex model into a linear model while controlling the maximum approximation error. Second, we used a convex solver instead of a slower non-linear solver.Numerical results on network topologies exemplify our work.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"39 1","pages":"47-52"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80764460","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}
引用次数: 21
Achieving efficient and fast update for multiple flows in software-defined networks 实现软件定义网络中多个流的高效快速更新
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627572
Yujie Liu, Yong Li, Yue Wang, A. Vasilakos, Jian Yuan
{"title":"Achieving efficient and fast update for multiple flows in software-defined networks","authors":"Yujie Liu, Yong Li, Yue Wang, A. Vasilakos, Jian Yuan","doi":"10.1145/2627566.2627572","DOIUrl":"https://doi.org/10.1145/2627566.2627572","url":null,"abstract":"Aiming to adapt traffic dynamics, deal with network errors, perform planned maintenance, etc., flow update is carried out frequently in Software-Defined Networks (SDN) to change the data plane configuration, and how to update the flows efficiently and successfully is an important and challenging problem. In this work, we address the multi-flow update problem and present a polynomial-time heuristic algorithm, which aims at completing the update in the shortest time considering link bandwidth and flow table size constraints. By extensive simulations under real network settings, we demonstrate the effectiveness and efficiency of our algorithm, which has near-optimal performance and is hundreds of times faster than the optimal solution.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"73 1","pages":"77-82"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79167536","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}
引用次数: 9
Modeling and simulation of concurrent workload processing in cloud-distributed enterprise information systems 云分布式企业信息系统中并发工作负载处理的建模与仿真
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627575
Alexandru-Florian Antonescu, T. Braun
{"title":"Modeling and simulation of concurrent workload processing in cloud-distributed enterprise information systems","authors":"Alexandru-Florian Antonescu, T. Braun","doi":"10.1145/2627566.2627575","DOIUrl":"https://doi.org/10.1145/2627566.2627575","url":null,"abstract":"Cloud Computing enables provisioning and distribution of highly scalable services in a reliable, on-demand and sustainable manner. Distributed Enterprise Information Systems (dEIS) are a class of applications with important economic value and with strong requirements in terms of performance and reliability. In order to validate dEIS architectures, stability, scaling and SLA compliance, large testing deployments are necessary, adding complexity to the design and testing of such systems. To fill this gap, we present and validate a methodology for modeling and simulating such complex distributed systems using the CloudSim cloud computing simulator, based on measurement data from an actual distributed system. We present an approach for creating a performance-based model of a distributed cloud application using recorded service performance traces. We then show how to integrate the created model into CloudSim. We validate the CloudSim simulation model by comparing performance traces gathered during distributed concurrent experiments with simulation results using different VM configurations. We demonstrate the usefulness of using a cloud simulator for modeling properties of real cloud-distributed applications.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"2003 1","pages":"11-16"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82911463","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}
引用次数: 11
Capacity of inter-cloud layer-2 virtual networking 云间第二层虚拟组网容量
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627573
Yufeng Xin, I. Baldin, Chris Heermann, A. Mandal, P. Ruth
{"title":"Capacity of inter-cloud layer-2 virtual networking","authors":"Yufeng Xin, I. Baldin, Chris Heermann, A. Mandal, P. Ruth","doi":"10.1145/2627566.2627573","DOIUrl":"https://doi.org/10.1145/2627566.2627573","url":null,"abstract":"Due to the economy of scale of Ethernet networks and available dynamic circuit capability from the major national research and educational networks, VLAN (Virtual LAN) based virtual networking solution has been successfully adopted in some advanced distributed cloud systems. However, there are two major constraints in this adaptation: (1) dynamic circuit service is far from pervasive; (2) there is only limited VLAN tags offered by regional network service providers.\u0000 In this paper, after examining layer-2 networking in large-scale distributed cloud environments, we present a graph theoretical model to study the network capacity in terms of the number of inter-cloud connections that can co-exist. We further design the algorithms to achieve this capacity for both point-to-point and multi-point inter-cloud connections in both static and dynamic scenarios. We also study a general topology embedding problem based on this model. As tagging is a common mechanism for isolating communication channels in other network layers, the proposed models and algorithms can be extended to optical and IP networks.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"9 1","pages":"31-36"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74348847","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
Optimizing job reliability via contention-free, distributed scheduling of vm checkpointing 通过无争用、分布式调度vm检查点来优化作业可靠性
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627568
Yu Xiang, Hang Liu, Tian Lan, H. H. Huang, S. Subramaniam
{"title":"Optimizing job reliability via contention-free, distributed scheduling of vm checkpointing","authors":"Yu Xiang, Hang Liu, Tian Lan, H. H. Huang, S. Subramaniam","doi":"10.1145/2627566.2627568","DOIUrl":"https://doi.org/10.1145/2627566.2627568","url":null,"abstract":"Checkpointing a virtual machine (VM) is a proven technique to improve the reliability in modern datacenters. Inspired by the CSMA protocol in wireless congestion control, we propose a novel framework for distributed and contention-free scheduling of VM checkpointing to offer reliability as a transparent, elastic service in datacenters. In this work, we quantify the reliability in closed form by studying system stationary behaviors, and maximize the job reliability through utility optimization. We implement a proof-of-concept prototype based on our design. Evaluation results show that the proposed checkpoint scheduling can significantly reduce the performance interference from checkpointing and improve reliability by as much as one order of magnitude over contention-oblivious scheme.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"207 1","pages":"59-64"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77131825","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}
引用次数: 2
A decomposition-based architecture for distributed virtual network embedding 基于分解的分布式虚拟网络嵌入体系结构
Proceedings. Data Compression Conference Pub Date : 2014-03-14 DOI: 10.1145/2627566.2627569
Flavio Esposito, I. Matta
{"title":"A decomposition-based architecture for distributed virtual network embedding","authors":"Flavio Esposito, I. Matta","doi":"10.1145/2627566.2627569","DOIUrl":"https://doi.org/10.1145/2627566.2627569","url":null,"abstract":"Network protocols have historically been developed on an ad-hoc basis, and cloud computing is no exception. A fundamental management protocol, not yet standardized, that cloud providers need to run to support wide-area virtual network services is the virtual network (VN) embedding protocol.\u0000 In this paper, we use decomposition theory to provide a unifying architecture for the VN embedding problem. We show how our architecture subsumes existing solutions, and how it can be used by cloud providers to design a distributed VN embedding protocol that adapts to different scenarios, by merely instantiating different decomposition policies. We analyze key representative tradeoffs via simulation, and with our VN embedding testbed that uses a Linux system architecture to reserve virtual node and link capacities. In contrast with existing VN embedding solutions, we found that partitioning a VN request not only increases the signaling overhead, but may decrease cloud providers' revenue.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"39 1","pages":"53-58"},"PeriodicalIF":0.0,"publicationDate":"2014-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85336295","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}
引用次数: 11
An Adaptive Difference Distribution-based Coding with Hierarchical Tree Structure for DNA Sequence Compression. 基于层次树结构的DNA序列自适应差分编码。
Proceedings. Data Compression Conference Pub Date : 2013-01-01 Epub Date: 2013-03-22 DOI: 10.1109/DCC.2013.45
Wenrui Dai, Hongkai Xiong, Xiaoqian Jiang, Lucila Ohno-Machado
{"title":"An Adaptive Difference Distribution-based Coding with Hierarchical Tree Structure for DNA Sequence Compression.","authors":"Wenrui Dai,&nbsp;Hongkai Xiong,&nbsp;Xiaoqian Jiang,&nbsp;Lucila Ohno-Machado","doi":"10.1109/DCC.2013.45","DOIUrl":"https://doi.org/10.1109/DCC.2013.45","url":null,"abstract":"<p><p>Previous reference-based compression on DNA sequences do not fully exploit the intrinsic statistics by merely concerning the approximate matches. In this paper, an adaptive difference distribution-based coding framework is proposed by the fragments of nucleotides with a hierarchical tree structure. To keep the distribution of difference sequence from the reference and target sequences concentrated, the sub-fragment size and matching offset for predicting are flexible to the stepped size structure. The matching with approximate repeats in reference will be imposed with the Hamming-like weighted distance measure function in a local region closed to the current fragment, such that the accuracy of matching and the overhead of describing matching offset can be balanced. A well-designed coding scheme will make compact both the difference sequence and the additional parameters, e.g. sub-fragment size and matching offset. Experimental results show that the proposed scheme achieves 150% compression improvement in comparison with the best reference-based compressor GReEn.</p>","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"2013 ","pages":"371-380"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/DCC.2013.45","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34117399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Virtual Impression Networks for Capturing Deep Impressions 虚拟印象网络捕捉深刻的印象
Proceedings. Data Compression Conference Pub Date : 2011-09-01 DOI: 10.1007/978-94-007-0510-4_30
T. Taura, E. Yamamoto, M. Y. N. Fasiha, Y. Nagai
{"title":"Virtual Impression Networks for Capturing Deep Impressions","authors":"T. Taura, E. Yamamoto, M. Y. N. Fasiha, Y. Nagai","doi":"10.1007/978-94-007-0510-4_30","DOIUrl":"https://doi.org/10.1007/978-94-007-0510-4_30","url":null,"abstract":"","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"7 1","pages":"559-578"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90778402","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}
引用次数: 20
A Redefinition of the Paradox of Choice 重新定义选择悖论
Proceedings. Data Compression Conference Pub Date : 2011-09-01 DOI: 10.1007/978-94-007-0510-4_19
M. Piasecki, S. Hanna
{"title":"A Redefinition of the Paradox of Choice","authors":"M. Piasecki, S. Hanna","doi":"10.1007/978-94-007-0510-4_19","DOIUrl":"https://doi.org/10.1007/978-94-007-0510-4_19","url":null,"abstract":"","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"38 1","pages":"347-366"},"PeriodicalIF":0.0,"publicationDate":"2011-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79028315","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}
引用次数: 15
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信