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

Proceedings. Data Compression Conference最新文献

筛选
英文 中文
Compression for Similarity Identification: Computing the Error Exponent. 相似性识别的压缩:误差指数的计算。
Proceedings. Data Compression Conference Pub Date : 2015-04-01 Epub Date: 2015-07-06 DOI: 10.1109/DCC.2015.75
Amir Ingber, Tsachy Weissman
{"title":"Compression for Similarity Identification: Computing the Error Exponent.","authors":"Amir Ingber,&nbsp;Tsachy Weissman","doi":"10.1109/DCC.2015.75","DOIUrl":"https://doi.org/10.1109/DCC.2015.75","url":null,"abstract":"<p><p>We consider the problem of compressing discrete memoryless data sequences for the purpose of similarity identification, first studied by Ahlswede et al. (1997). In this setting, a source sequence is compressed, where the goal is to be able to identify whether the original source sequence is similar to another given sequence (called the query sequence). There is no requirement that the source will be reproducible from the compressed version. In the case where no false negatives are allowed, a compression scheme is said to be reliable if the probability of error (false positive) vanishes as the sequence length grows. The minimal compression rate in this sense, which is the parallel of the classical rate distortion function, is called the <i>identification rate</i>. The rate at which the error probability vanishes is measured by its exponent, called the identification exponent (which is the analog of the classical excess distortion exponent). While an information-theoretic expression for the identification exponent was found in past work, it is uncomputable due to a dependency on an auxiliary random variable with unbounded cardinality. The main result of this paper is a cardinality bound on the auxiliary random variable in the identification exponent, thereby making the quantity computable (solving the problem that was left open by Ahlswede et al.). The new proof technique relies on the fact that the Lagrangian in the optimization problem (in the expression for the exponent) can be decomposed by coordinate (of the auxiliary random variable). Then a standard Carathéodory - style argument completes the proof.</p>","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"2015 ","pages":"413-422"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/DCC.2015.75","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35621697","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}
引用次数: 0
ParaDrop: a multi-tenant platform for dynamically installed third party services on home gateways paradop:一个多租户平台，用于在家庭网关上动态安装第三方服务
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627583
Dale Willis, A. Dasgupta, Suman Banerjee
{"title":"ParaDrop: a multi-tenant platform for dynamically installed third party services on home gateways","authors":"Dale Willis, A. Dasgupta, Suman Banerjee","doi":"10.1145/2627566.2627583","DOIUrl":"https://doi.org/10.1145/2627566.2627583","url":null,"abstract":"The landscape of computing capabilities within the home has seen a recent shift from persistent desktops to mobile platforms, which has led to the use of the cloud as the primary computing platform implemented by developers today. Cloud computing platforms, such as Amazon EC2 and Google App Engine, are popular for many reasons including their reliable, always on, and robust nature. The capabilities that centralized computing platforms provide are inherent to their implementation, and unmatched by previous platforms (e.g., Desktop applications). Thus, third-party developers have come to rely on cloud computing platforms to provide high quality services to their end-users.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"5 1","pages":"43-44"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82751208","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}
引用次数: 47
DEIDtect: towards distributed elastic intrusion detection deiddetect:面向分布式弹性入侵检测
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627579
Praveen Kumar Shanmugam, Naveen Dasa Subramanyam, Joe Breen, Corey Roach, J. Merwe
{"title":"DEIDtect: towards distributed elastic intrusion detection","authors":"Praveen Kumar Shanmugam, Naveen Dasa Subramanyam, Joe Breen, Corey Roach, J. Merwe","doi":"10.1145/2627566.2627579","DOIUrl":"https://doi.org/10.1145/2627566.2627579","url":null,"abstract":"We present a distributed elastic intrusion detection architecture called DEIDtect. DEIDtect exploits the increasing deployment of cloud computing and software defined networking technology in enterprise and campus environments to deal with current inflexibilities associated with compute and network resources required by security tools. We present the detailed design and implementation of DEIDtect's networking functionality and illustrate its functionality in an emulated environment.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"11 1","pages":"17-24"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81926029","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}
引用次数: 26
ProActive routing in scalable data centers with PARIS 使用PARIS实现可扩展数据中心的主动路由
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627571
D. Arora, Theophilus A. Benson, J. Rexford
{"title":"ProActive routing in scalable data centers with PARIS","authors":"D. Arora, Theophilus A. Benson, J. Rexford","doi":"10.1145/2627566.2627571","DOIUrl":"https://doi.org/10.1145/2627566.2627571","url":null,"abstract":"Modern data centers must scale to a large number of servers, while offering flexible placement and migration of virtual machines. The traditional approach of connecting layer-two pods through a layer-three core constrains VM placement. More recent 'flat' designs are more flexible but have scalability limitations due to flooding/broadcasting or querying directories of VM locations. Rather than reactively learn VM locations, our PARIS architecture has a controller that pre-positions IP forwarding entries in the switches. Switches within a pod have complete information about the VMs beneath them, while each core switch maintains complete forwarding state for part of the address space. PARIS offers network designers the flexibility to choose a topology that meets their latency and bandwidth requirements. We evaluate our PARIS prototype built using OpenFlow-compliant switches and NOX controller. Using PARIS we can build a data center network that supports up to 100K servers.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"35 1","pages":"5-10"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89125439","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
Green latency-aware data deployment in data centers: balancing latency, energy in networks and servers 数据中心绿色延迟感知数据部署:平衡网络和服务器的延迟、能源
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627584
Yuqi Fan, Hongli Ding, Donghui Hu
{"title":"Green latency-aware data deployment in data centers: balancing latency, energy in networks and servers","authors":"Yuqi Fan, Hongli Ding, Donghui Hu","doi":"10.1145/2627566.2627584","DOIUrl":"https://doi.org/10.1145/2627566.2627584","url":null,"abstract":"Two concerns exist in service provisioning by data centers. One is that users require to experience low latency while accessing data from the data centers. The other is to reduce the power consumed by network transport and servers in the data centers. In this paper, we tackle the problem of green data deployment in the data centers, taking into account the three factors of latency, energy consumption of the data centers and the network transport.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"23 1","pages":"45-46"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76578811","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}
引用次数: 1
Experiences with distributed heterogeneous clouds over community networks 在社区网络上使用分布式异构云的经验
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627581
Mennan Selimi, Felix Freitag, Daniel Martí, R. P. Centelles, P. Garcia, Roger Baig
{"title":"Experiences with distributed heterogeneous clouds over community networks","authors":"Mennan Selimi, Felix Freitag, Daniel Martí, R. P. Centelles, P. Garcia, Roger Baig","doi":"10.1145/2627566.2627581","DOIUrl":"https://doi.org/10.1145/2627566.2627581","url":null,"abstract":"Community networks [1] are decentralized and self-organized communication networks built and operated by citizens and for citizens. They are an emergent model of infrastructure that aims to satisfy a community's demand for Internet and ICT services. There are several large community networks in Europe having from 500 to \u000020000 nodes, such as Guifi.net1, AWMN2, FunkFeuer3 and many more worldwide. Most of them are based on Wi-Fi technology, but also a growing number of optical fiber links start to become deployed.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"1 1","pages":"39-40"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80207119","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}
引用次数: 8
A virtual machine repacking in clouds: faster live migration algorithms 云中的虚拟机重新包装:更快的实时迁移算法
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627580
Makhlouf Hadji, Paul Laborgère
{"title":"A virtual machine repacking in clouds: faster live migration algorithms","authors":"Makhlouf Hadji, Paul Laborgère","doi":"10.1145/2627566.2627580","DOIUrl":"https://doi.org/10.1145/2627566.2627580","url":null,"abstract":"This paper focuses on optimal VM repacking algorithms inphysical infrastructures of Clouds to reduce overall cost andimprove utilization and nd the best tradeo s between theseconicting goals. We investigate algorithms that scale well,minimize SLA violations, converge reasonably fast and pro-vide the best possible tradeo s between the number of usedservers and migrations. These goals lead us to b-matchingalgorithms and a greedy algorithm resolution of a graphicmatroid representation [2] of the repacking problem. A tradi-tional Bin-Packing algorithm [1] is used for comparison andbenchmarks since it provides an upper bound on performance,but it does not scale with problem size.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"15 1","pages":"37-38"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84325383","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
Distributed cloud computing in high energy physics 高能物理中的分布式云计算
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627578
R. Sobie
{"title":"Distributed cloud computing in high energy physics","authors":"R. Sobie","doi":"10.1145/2627566.2627578","DOIUrl":"https://doi.org/10.1145/2627566.2627578","url":null,"abstract":"Cloud computing is increasingly being used for running high energy physics (HEP) applications. We review the motivation for using clouds in HEP and describe how they are gradually being integrated into our systems. In particular, we highlight our use of a distributed cloud computing system that integrates both private and public IaaS clouds into a unified infrastructure. We describe our experience using the distributed cloud and our plans to make the system context-aware in order to scale to larger workloads and run data-intensive HEP applications.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"41 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80879213","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
Performance of network and computing resource sharing in federated cloud systems 联邦云系统中网络和计算资源共享的性能
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627567
W. Cerroni
{"title":"Performance of network and computing resource sharing in federated cloud systems","authors":"W. Cerroni","doi":"10.1145/2627566.2627567","DOIUrl":"https://doi.org/10.1145/2627566.2627567","url":null,"abstract":"The increasing demand of computing, storage and communication resources by cloud-based applications is fostering new forms of infrastructure sharing such as cloud federations, which can take advantage of virtualization technologies and, in particular, of virtual machine live migration techniques. Such a scenario requires a quantitative characterization of the performance of the inter-data center communication considering possible limitations in both network and computing resource availability. This paper provides an analytical model for joint dimensioning of shared network and data center capacity in a federate cloud.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"75 1","pages":"25-30"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74350553","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
Traffic-aware clustering and VM migration in distributed data center 分布式数据中心的流量感知集群和虚拟机迁移
Proceedings. Data Compression Conference Pub Date : 2014-08-18 DOI: 10.1145/2627566.2627582
Marco Cello, Kang Xi, H. J. Chao, M. Marchese
{"title":"Traffic-aware clustering and VM migration in distributed data center","authors":"Marco Cello, Kang Xi, H. J. Chao, M. Marchese","doi":"10.1145/2627566.2627582","DOIUrl":"https://doi.org/10.1145/2627566.2627582","url":null,"abstract":"In this paper we propose an algorithmic approach designed to tackle and reduce the congestion events in a Distributed Data Center (DDC). Our solution is based on virtual machines (VMs) migration and, differently from the literature, it analyzes the VMs communication patterns in order to find 'tight' clusters of VMs to be migrated.","PeriodicalId":91161,"journal":{"name":"Proceedings. Data Compression Conference","volume":"223 1","pages":"41-42"},"PeriodicalIF":0.0,"publicationDate":"2014-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80015375","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
首页 上一页 下一页 尾页
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学术官方微信