Proceedings 20th IEEE International Conference on Distributed Computing Systems最新文献_第8页

Dynamic adaptive file management in a local area network 局域网中的动态自适应文件管理

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840948

Jiong Yang, Wei Wang, R. Muntz, Silvia Nittel

引用次数: 1

An asymptotically multi-layered decentralized consensus protocol with an initiator 具有发起人的渐进多层分散共识协议

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840940

Zheng-Ru Lin, Ming-Syan Chen

{"title":"An asymptotically multi-layered decentralized consensus protocol with an initiator","authors":"Zheng-Ru Lin, Ming-Syan Chen","doi":"10.1109/ICDCS.2000.840940","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840940","url":null,"abstract":"A decentralized consensus protocol refers to a process for all nodes in a distributed system to collect the information/status from every other node and reach a consensus among them. Two classes of decentralized consensus protocols have been studied before: the one without an initiator and the one with an initiator. While the one without an initiator has been well studied in the literature: it is noted that prior protocols with an initiator mainly relied upon the one without an initiator and thus did not fully exploit the intrinsic properties of having an initiator. By exploiting the concept of multi-layered execution, we develop in this paper an efficient multi-layered decentralized consensus protocol for a distributed system with an initiator. By adapting itself to the number of nodes in the system, the proposed protocol can determine a proper layer for execution and reach the consensus in the minimal numbers of message steps while incurring a much smaller number of messages than required by prior works. It is shown that the decentralized consensus protocols developed in this paper for the case of having an initiator significantly outperform prior schemes.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"143 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":"122086203","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

Achieving per-flow weighted rate fairness in a core stateless network 在核心无状态网络中实现每流加权速率公平性

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840929

Raghupathy Sivakumar, Tae-eun Kim, N. Venkitaraman, Jia-Ru Li, V. Bharghavan

引用次数: 34

Contract type sequencing for reallocative negotiation 用于再分配谈判的合同类型排序

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840917

Martin Andersson, Tuomas Sandholm

{"title":"Contract type sequencing for reallocative negotiation","authors":"Martin Andersson, Tuomas Sandholm","doi":"10.1109/ICDCS.2000.840917","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840917","url":null,"abstract":"The capability to reallocate items-e.g. tasks, securities, bandwidth slices, MW hours of electricity, and collectibles-is a key feature in automated negotiation. Especially when agents have preferences over combinations of items, this is highly nontrivial. Marginal cost based reallocation leads to an anytime algorithm where every agent's utility increases monotonically over time. Different contract types head toward different locally optimal task allocations, and contracts from a recently introduced comprehensive contract type, OCSM-contracts, head toward the global optimum. Reaching it can take an impractically long time, so it is important to trade off solution quality against negotiation time. To construct negotiation protocols that lead to the best achievable allocations in a bounded amount of time, we compared sequences of four contract types. Original, cluster, swap, and multiagent contracts. The experiments show that it is profitable to use multiple contract types in the sequence: significantly better solutions are reached, and faster, than if only one contract type is used. However, the best sequences only include original and cluster contracts. Swap and multiagent contracts lead to bad local optima quickly. Interestingly, the number of contracts using any given contract type does not always decrease over time: contracts play the role of enabling further contracts.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"69 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":"125531739","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}

引用次数: 44

Scalable QoS guaranteed communication services for real-time applications 可扩展的QoS保证实时应用的通信服务

Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840928

B. Choi, D. Xuan, Chengzhi Li, R. Bettati, Wei Zhao

引用次数: 22