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

Proceedings 20th IEEE International Conference on Distributed Computing Systems最新文献

筛选
英文 中文
A client-server approach to virtually synchronous group multicast: specifications and algorithms 实现虚拟同步组多播的客户机-服务器方法:规范和算法
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840946
I. Keidar, R. Khazan
{"title":"A client-server approach to virtually synchronous group multicast: specifications and algorithms","authors":"I. Keidar, R. Khazan","doi":"10.1109/ICDCS.2000.840946","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840946","url":null,"abstract":"This paper presents a formal design for a novel group multicast service that provides virtually synchronous semantics in asynchronous fault-prone environments. The design employs a client-server architecture in which group membership is maintained not by every process but only by dedicated membership servers, while virtually synchronous group multicast is implemented by service end-points running at the clients. Specifically, the paper defines service semantics for the client-server interface, that is, for the group membership service. The paper then specifies virtually synchronous semantics for the new group multicast service, as a collection of commonly used safety and liveness properties. Finally, the paper presents new algorithms that use the defined group membership service to implement the specified properties. The algorithm that provides the complete virtually synchronous semantics executes in a single message round in parallel with the membership service's agreement on views, and is therefore more efficient than previously suggested algorithms providing such semantics.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116757783","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}
引用次数: 35
Deadlock analysis of client/server programs 客户/服务器程序的死锁分析
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840961
Jun Zhou, K. Tai
{"title":"Deadlock analysis of client/server programs","authors":"Jun Zhou, K. Tai","doi":"10.1109/ICDCS.2000.840961","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840961","url":null,"abstract":"Deadlocks are a common type of fault in distributed programs. To detect deadlocks in a distributed program P, one approach is to construct the reachability graph (RG) of P, which contains all possible states of P, and analyze the RG to detect deadlocks. Since the size of RG(P) is an exponential function of the number of processes in P, the use of RG for deadlock detection has limited success. In this paper, we show an efficient technique for deadlock analysis of client/server programs. We present a theory of deadlock analysis of client/server LTS systems, in which a server or client is represented as a labeled transition system (LTS). For a client/server LTS system, we define its client/server reachability graph (CSRG), which has its size being a polynomial function of the number of clients. We show that the use of CSRG not only significantly reduces the effort for deadlock analysis but also provides a basis for proving freedom from deadlock for any number of clients.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117173960","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
A client-server oriented algorithm for virtually synchronous group membership in WANs 面向客户端-服务器的广域网虚拟同步组成员算法
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840947
I. Keidar, Jeremy B. Sussman, K. Marzullo, D. Dolev
{"title":"A client-server oriented algorithm for virtually synchronous group membership in WANs","authors":"I. Keidar, Jeremy B. Sussman, K. Marzullo, D. Dolev","doi":"10.1109/ICDCS.2000.840947","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840947","url":null,"abstract":"We describe a novel scalable group membership service designed explicitly for wide area networks. Our membership service is scalable in the number of groups supported, in the number of members in each group, and in the topology each group spans. Our service also supplies the hooks needed to provide clients with full virtual synchrony semantics. Our service attains, on average, a low message overhead by agreeing on membership within a single message round. Furthermore, our service avoids notifying the application of obsolete membership views when the network is unstable, yet it converges when the network has stabilized.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115624996","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}
引用次数: 72
Self-stabilizing network orientation algorithms in arbitrary rooted networks 任意根网络中的自稳定网络定位算法
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840972
A. Datta, Shivashankar Gurumurthy, F. Petit, V. Villain
{"title":"Self-stabilizing network orientation algorithms in arbitrary rooted networks","authors":"A. Datta, Shivashankar Gurumurthy, F. Petit, V. Villain","doi":"10.1109/ICDCS.2000.840972","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840972","url":null,"abstract":"We present the first deterministic self-stabilizing network orientation algorithms. We present three protocols for arbitrary and asynchronous networks. All the protocols set up a chordal sense of direction in the network. The protocols are self-stabilizing, meaning that starting from an arbitrary state, the protocols are guaranteed to reach a state, in which all edge labels (assigned to the links) are valid (meaning, they satisfy the specification of the orientation problem).","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122824498","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
PARK: a paused-and-run k-stream multimedia synchronization control scheme 一个暂停和运行的k流多媒体同步控制方案
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840939
Chung-Ming Huang, H. Kung, Jiong-Liang Yang
{"title":"PARK: a paused-and-run k-stream multimedia synchronization control scheme","authors":"Chung-Ming Huang, H. Kung, Jiong-Liang Yang","doi":"10.1109/ICDCS.2000.840939","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840939","url":null,"abstract":"In the paper, we propose the pause-and-run approach for k-stream (PARK) multimedia presentations over the Internet to achieve reliable transmission of continuous media. The main characteristics of the PARK approach are as follows: (i) to achieve reliable transmission of continuous media, PARK adopts TCP instead of UDP; (ii) since the slow-start scheme is embedded in TCP, a novel flow adaptation scheme is proposed to reduce the overhead of the network and end hosts. The server adapts its transmission rates to the buffer situation of the client and prevents the client's buffers from overflow and underflow as much as possible; (iii) with the provision of multiple-stream synchronization and multi-level adaptation control, the client achieves smooth multimedia presentations and achieves graceful presentation degradation when the resources are insufficient.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124746506","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}
引用次数: 6
On the burstiness of the TCP congestion-control mechanism in a distributed computing system 分布式计算系统中TCP拥塞控制机制的突发性研究
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840912
P. Tinnakornsrisuphap, Wu-chun Feng, I. Philp
{"title":"On the burstiness of the TCP congestion-control mechanism in a distributed computing system","authors":"P. Tinnakornsrisuphap, Wu-chun Feng, I. Philp","doi":"10.1109/ICDCS.2000.840912","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840912","url":null,"abstract":"Several studies in network traffic characterization have concluded that network traffic is self-similar and therefore not readily amenable to statistical multiplexing in a distributed computing system. This paper examines the effects of the TCP protocol stack on network traffic via an experimental study on the different implementations of TCP. We show that even when aggregate application traffic smooths out as more applications' traffic are multiplexed, TCP introduces burstiness into the aggregate traffic load, reducing network performance when statistical multiplexing is used within the network gateways.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130381741","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
Atomic broadcast in asynchronous crash-recovery distributed systems 异步崩溃恢复分布式系统中的原子广播
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840941
L. Rodrigues, M. Raynal
{"title":"Atomic broadcast in asynchronous crash-recovery distributed systems","authors":"L. Rodrigues, M. Raynal","doi":"10.1109/ICDCS.2000.840941","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840941","url":null,"abstract":"Atomic broadcast is a fundamental problem of distributed systems: it states that messages must be delivered in the same order to their destination processes. This paper describes a solution to this problem in asynchronous distributed systems in which processes can crash and recover. A consensus-based solution to atomic broadcast problem has been designed by Chandra and Toueg (1996) for asynchronous distributed systems where crashed processes do nor recover. Although our solution is based on different algorithmic principles, it follows the same approach: it transforms any consensus protocol suited to the crash-recovery model into an atomic broadcast protocol suited to the same model. We show that atomic broadcast can be implemented without requiring any additional log operations in excess of those required by the consensus. The paper also discusses how additional log operations can improve the protocol in terms of faster recovery and better throughput.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130553402","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}
引用次数: 74
Striping doesn't scale: how to achieve scalability for continuous media servers with replication 条带化不能扩展:如何实现具有复制功能的连续媒体服务器的可伸缩性
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840908
Cheng-Fu Chou, L. Golubchik, John C.S. Lui
{"title":"Striping doesn't scale: how to achieve scalability for continuous media servers with replication","authors":"Cheng-Fu Chou, L. Golubchik, John C.S. Lui","doi":"10.1109/ICDCS.2000.840908","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840908","url":null,"abstract":"Multimedia applications place high demands for QoS, performance, and reliability on storage servers and communication networks. These, often stringent requirements, make design of cost-effective and scalable continuous media (CM) servers difficult. In particular, the choice of data placement techniques can have a significant effect on the scalability of the CM server and its ability to utilize resources efficiently. In the recent past, a great deal of work has focused on \"wide\" data striping. Another approach to dealing with load imbalance problems is replication. The appropriate compromise between the degree of striping and the degree of replication is key do the design of scalable CM servers. Thus, the main focus of the paper is a study of scalability characteristics of CM servers as a function of tradeoffs between striping and replication.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133903037","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}
引用次数: 63
Critical bandwidth allocation techniques for stored video delivery across best-effort networks 跨尽力而为网络存储视频传输的关键带宽分配技术
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840907
W. Feng, Ming Liu
{"title":"Critical bandwidth allocation techniques for stored video delivery across best-effort networks","authors":"W. Feng, Ming Liu","doi":"10.1109/ICDCS.2000.840907","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840907","url":null,"abstract":"We propose two new techniques for the delivery of compressed prerecorded video streams across best-effort networks like the Internet. Current approaches for the delivery of stored video across best-effort networks typically alter the quality of the video frames, the frame rate delivered to the user, or a combination of both. By using network feedback, these algorithms continually adjust the video quality to fit within the available network resources. These approaches, however do not take advantage of the a priori information available from stored video streams, namely the frame sizes that the movie consists of. We show how monitoring the a priori information and actively monitoring a client-side buffer can help smooth the video frame rate delivered to the user, providing a more consistent quality of video.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131281877","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}
引用次数: 27
Mobile Cache Protocol: a dynamic object relocation protocol for wide area networks 移动缓存协议:用于广域网的动态对象重定位协议
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840954
Takashi Watanabe, A. Mori, Yukihisa Yamamoto
{"title":"Mobile Cache Protocol: a dynamic object relocation protocol for wide area networks","authors":"Takashi Watanabe, A. Mori, Yukihisa Yamamoto","doi":"10.1109/ICDCS.2000.840954","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840954","url":null,"abstract":"This paper proposes a relocation protocol of a replicated object in a widely distributed object system called Mobile Cache Protocol (MCP). MCP has four basic features: it creates a replicated object and allocates it on an intermediate site to reduce the latency of object retrieval in a wide area network; it supports both client and server oriented updates to achieve object consistency; it supports reservation of replication of an object; and several clients can share a replicated object to enhance storage efficiency. The protocol is summarized and implementation and various experiments of the protocol are described. Though it is designed for a distributed object based system, MCP also can be applied to dynamic Web caching.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133872751","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信