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

Proceedings of 17th International Conference on Distributed Computing Systems最新文献

筛选
英文 中文
Load management in distributed video servers 分布式视频服务器的负载管理
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603406
N. Venkatasubramanian, S. Ramanathan
{"title":"Load management in distributed video servers","authors":"N. Venkatasubramanian, S. Ramanathan","doi":"10.1109/ICDCS.1997.603406","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603406","url":null,"abstract":"We define and formulate various policies for load management in distributed video servers. We propose a predictive placement policy that determines the degree of replication necessary for popular videos using a cost based optimization procedure based on a priori predictions of expected subscriber requests. For scheduling requests, we propose an adaptive scheduling policy that compares the relative utilization of resources in a video server to determine an assignment of requests to replicas. To optimize storage utilization, we also devise methods for dereplication of videos based on changes in their popularities and in server usage patterns. Performance evaluations indicate that a load management procedure which uses a judicious combination of the different policies performs best for most server configurations. Advances in storage technologies are making high performance video servers a reality. These video servers are being deployed over emerging broadband networks to deliver a variety of interactive, digital video services to thousands of residential subscribers. To meet the scalability requirements in such large deployments, distributed video server architectures are being considered (M. Buddhikot and G. Parulkar, 1995). We propose various methods for load management that are targeted at improving the cost effectiveness of distributed video servers.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130699559","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}
引用次数: 83
Maintaining strong cache consistency in the World-Wide Web 在万维网中保持强大的缓存一致性
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597804
P. Cao, Chengjie Liu
{"title":"Maintaining strong cache consistency in the World-Wide Web","authors":"P. Cao, Chengjie Liu","doi":"10.1109/ICDCS.1997.597804","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597804","url":null,"abstract":"As the Web continues to explode in size, caching becomes increasingly important. With caching comes the problem of cache consistency. Conventional wisdom holds that strong cache consistency is too expensive for the Web, and weak consistency methods such as Time-To-Live (TTL) are most appropriate. The article compares three consistency approaches: adaptive TTL, polling-every-time, and invalidation, using prototype implementation and trace replay in a simulated environment. Our results show that invalidation generates less or a comparable amount of network traffic and server workload than adaptive TTL and has a slightly lower average client response time, while polling-every-time generates more network traffic and longer client response times. We show that, contrary to popular belief, strong cache consistency can be maintained for the Web with little or no extra cost than the current weak consistency approaches, and it should be maintained using an invalidation based protocol.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121638108","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}
引用次数: 426
The hierarchical daisy architecture for causal delivery 用于因果交付的分层雏菊架构
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603422
R. Baldoni, R. Beraldi, R. Friedman, R. V. Renesse
{"title":"The hierarchical daisy architecture for causal delivery","authors":"R. Baldoni, R. Beraldi, R. Friedman, R. V. Renesse","doi":"10.1109/ICDCS.1997.603422","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603422","url":null,"abstract":"We propose the hierarchical daisy architecture, which provides causal delivery of messages sent to any subset of processes. The architecture provides fault tolerance and maintains the amount of control information within a reasonable size. It divides processes into logical groups. Messages inside a logical group are sent directly, while messages that need to cross logical group boundaries are forwarded by servers. We prove the correctness of the daisy architecture and discuss possible optimizations.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128992338","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}
引用次数: 45
Fast dissemination of link states using bounded sequence numbers with no periodic updates or age fields 使用有界序列号的链路状态快速传播，不需要定期更新或年龄字段
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597852
Jochen Behrens, J. Garcia-Luna-Aceves
{"title":"Fast dissemination of link states using bounded sequence numbers with no periodic updates or age fields","authors":"Jochen Behrens, J. Garcia-Luna-Aceves","doi":"10.1109/ICDCS.1997.597852","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597852","url":null,"abstract":"Routing protocols based on the distribution of link-state information rely on sequence numbers to validate information that a router receives. A fundamental problem is to bound the sequence-number space. We propose a new sequence-number reset algorithm that needs neither periodic retransmissions nor age fields. It is based on a recursive query-response procedure and is designed to handle resource failures during operation. This new algorithm is applicable to routing protocols based on both flooding and selective distribution of link-state information. The correctness of the algorithm is verified in the context of selective dissemination of topology information, and its complexity analyzed. Because the reset algorithm does not use any aging, the distribution of new link-state information or the purging of old information is always done in a time proportional to the time it takes to traverse the network.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126914819","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
Total order multicast to multiple groups 总订单多播到多个组
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603426
R. Guerraoui, A. Schiper
{"title":"Total order multicast to multiple groups","authors":"R. Guerraoui, A. Schiper","doi":"10.1109/ICDCS.1997.603426","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603426","url":null,"abstract":"We present a fault tolerant algorithm that ensures total order delivery of messages sent to multiple groups of processes. Our algorithm is a multiple group \"genuine\" multicast algorithm in the sense that: (1) any process can send a message to any set of process groups; and (2) only the sender and the receivers of a message take part in the algorithm needed to deliver the message. The correctness of our algorithm does not require reliable failure detectors, but requires causal order delivery of messages. This establishes a new and interesting link between causal order delivery and fault tolerance with unreliable failure detectors.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132195231","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}
引用次数: 48
Concurrency control and view notification algorithms for collaborative replicated objects 协作复制对象的并发控制和视图通知算法
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598029
R. Strom, G. Banavar, K. Miller, A. Prakash, Michael J. Ward
{"title":"Concurrency control and view notification algorithms for collaborative replicated objects","authors":"R. Strom, G. Banavar, K. Miller, A. Prakash, Michael J. Ward","doi":"10.1109/ICDCS.1997.598029","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598029","url":null,"abstract":"This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objects may be atomically updated, and these objects automatically maintain consistency with their replicas using an optimistic algorithm. Changes to these objects may be optimistically or pessimistically observed by view objects by taking consistent snapshots. The algorithms for both update propagation and view notification are based upon optimistic guess propagation principles, adapted for fast commit by using primary copy replication techniques. The main contribution of the paper is the synthesis of these two algorithmic techniques-guess propagation and primary copy replication-for implementing a framework that is easy to program and is well suited for the needs of groupware applications.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132858676","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}
引用次数: 65
Reliable support for a persistent distributed shared memory 对持久分布式共享内存的可靠支持
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.597854
A. Knaff, P. Dechamboux
{"title":"Reliable support for a persistent distributed shared memory","authors":"A. Knaff, P. Dechamboux","doi":"10.1109/ICDCS.1997.597854","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.597854","url":null,"abstract":"This paper describes a reliable distributed storage server used to back segments located in a distributed virtual shared memory (DVSM). It focuses on the design of a generic logging support and gives hints about its implementation. The prototype developed within the AIX system is evaluated and exhibits good results. Using these results, some evolutions are proposed to improve performance.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122372368","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
Effect of virtual circuit rerouting on application performance 虚电路重路由对应用性能的影响
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.598071
P. Mishra, M. Srivastava
{"title":"Effect of virtual circuit rerouting on application performance","authors":"P. Mishra, M. Srivastava","doi":"10.1109/ICDCS.1997.598071","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.598071","url":null,"abstract":"One of the key problems in extending ATM protocols to support host mobility is designing virtual circuit rerouting protocols to maintain continual network connectivity to a mobile host. Ideally, VC rerouting must be done fast enough so as to cause minimal disruption to applications, running on mobile hosts. In this paper, we evaluate the impact of several virtual circuit rerouting strategies on application performance. Our results show that using simple and fast rerouting policies results in good performance for both data and real-time traffic.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127205239","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
Characterizing multicast orderings using concurrency control theory 用并发控制理论描述组播排序
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603430
P. A. Jensen, N. Soparkar, A. Mathur
{"title":"Characterizing multicast orderings using concurrency control theory","authors":"P. A. Jensen, N. Soparkar, A. Mathur","doi":"10.1109/ICDCS.1997.603430","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603430","url":null,"abstract":"Coordinating distributed executions is achieved by two widely used approaches: process groups and transactions. Typically, the two represent a trade-off in terms of the degrees of consistency and performance. By applying transaction concurrency control techniques to characterize and design process group multicast orderings, we aim to provide aspects of both ends of the trade-off. In particular, we propose a framework in which each message multicast is regarded as a transaction. Appropriate message ordering protocols are devised and shown to be correct using a variant of concurrency control theory. Also, we are able do incorporate certain aspects of application semantics for which existing process group approaches are inadequate. Finally, our framework provides a means to characterize the performance of orderings to allow a comparison of different ordering protocols.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125450036","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}
引用次数: 12
A framework for designing materialized views in data warehousing environment 在数据仓库环境中设计实体化视图的框架
Proceedings of 17th International Conference on Distributed Computing Systems Pub Date : 1997-05-27 DOI: 10.1109/ICDCS.1997.603380
Jian Yang, K. Karlapalem, Qing Li
{"title":"A framework for designing materialized views in data warehousing environment","authors":"Jian Yang, K. Karlapalem, Qing Li","doi":"10.1109/ICDCS.1997.603380","DOIUrl":"https://doi.org/10.1109/ICDCS.1997.603380","url":null,"abstract":"Data warehouses are accessed by different queries with different frequencies. The portions of data accessed by a query can be treated as a view. When these views are related to each other and defined over overlapping portions of the base data, then it may be more efficient not to materialize all the views, but rather to materialize certain \"shared views\" from which the query results can be generated. We address some issues related to determining this set of shared views to be materialized in order to achieve the best combination of good performance and low maintenance, and provide an algorithm for achieving this goal.","PeriodicalId":122990,"journal":{"name":"Proceedings of 17th International Conference on Distributed Computing Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116683864","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}
引用次数: 86
首页 上一页 下一页 尾页
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学术官方微信