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

Proceedings 21st International Conference on Distributed Computing Systems最新文献

筛选
英文 中文
Endpoint admission control: network based approach 端点允许控制:基于网络的方法
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918952
B. Choi, R. Bettati
{"title":"Endpoint admission control: network based approach","authors":"B. Choi, R. Bettati","doi":"10.1109/ICDSC.2001.918952","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918952","url":null,"abstract":"Proposes a network-based endpoint admission control system for scalable QoS-guaranteed real-time communication services. This system is based on a sink tree-based resource management strategy and is particularly well-suited for differentiated services-based architectures. By performing the admission decision at the endpoints, the flow setup latency and the signaling overhead are kept to a minimum. In addition, the proposed system integrates routing and resource reservation along the routes, and therefore displays higher admission probability and better link resource utilization. This approach achieves a low overall admission control overhead because much of the delay computation is done during system configuration, and so resources can effectively be pre-allocated before run time. We investigate a number of resource-sharing approaches that allow resources to be efficiently re-allocated at run time with minimized additional overhead. We provide simulation experiments that illustrate the benefits of using sink tree-based resource management for resource pre-allocation and for routing, both with and without resource sharing.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127695510","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}
引用次数: 25
OSU-MAC: a new, real-time medium access control protocol for wireless WANs with asymmetric wireless links OSU-MAC:用于具有非对称无线链路的无线广域网的一种新的实时介质访问控制协议
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918984
Chunlei Liu, Y. Ge, M. Fitz, J. Hou, Wei-Peng Chen, R. Jain
{"title":"OSU-MAC: a new, real-time medium access control protocol for wireless WANs with asymmetric wireless links","authors":"Chunlei Liu, Y. Ge, M. Fitz, J. Hou, Wei-Peng Chen, R. Jain","doi":"10.1109/ICDSC.2001.918984","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918984","url":null,"abstract":"In this paper, we document our design of a MAC protocol, called OSU-MAC, subject to the physical layer characteristics and constraints of a narrow-band wireless modem testbed currently being built at the Ohio State University. The narrow-band wireless modem testbed is expected to support both real-time (bus location tracking) and non-real-time (regular) data applications. A number of techniques are proposed to support QoS imposed by the real-time applications, to deal with the asymmetry on the forward and reverse channels and the half-duplex transmission constraint imposed by the physical layer, and to enhance the error control capability of OSU-MAC. We also present simulation results to demonstrate the key functional characteristics of OSU-MAC.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128099824","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
A lattice based framework of shared memory consistency models 基于点阵的共享内存一致性模型框架
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919004
R. Steinke, G. Nutt
{"title":"A lattice based framework of shared memory consistency models","authors":"R. Steinke, G. Nutt","doi":"10.1109/ICDSC.2001.919004","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919004","url":null,"abstract":"A memory consistency model specifies certain aspects of the behavior of a memory system. Stronger consistency models are easier for programmers to use, but provide less flexibility for optimizing the memory implementation. More relaxed consistency models are just the opposite. The goal of our work is to develop a framework that captures the relationships among existing models, and maps the territory of possible models that have not yet been discovered. This work is based on the idea of orthogonal consistency properties. hypothesize that all consistency models can be represented by different combinations of a few primitive properties. The work comes from examining the PRAM, cache, processor, and causal consistency models. Processor is a combination of PRAM and cache, and causal is a combination of PRAM plus an additional requirement. These factors suggest an underlying structure to the models.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134408297","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 hierarchical cluster algorithm for dynamic, centralized timestamps 一种用于动态、集中时间戳的分层聚类算法
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918989
Paul A. S. Ward, David J. Taylor
{"title":"A hierarchical cluster algorithm for dynamic, centralized timestamps","authors":"Paul A. S. Ward, David J. Taylor","doi":"10.1109/ICDSC.2001.918989","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918989","url":null,"abstract":"Partial-order data structures used in distributed-system observation tools typically use vector timestamps to efficiently determine event precedence. Unfortunately all current dynamic vector-timestamp algorithms either require a vector of size equal to the number of processes in the computation or require a graph search operation to determine event precedence. This fundamentally limits the scalability of such observation systems. In this paper we present an algorithm for hierarchical, clustered vector time-stamps. We present results for a variety of computation environments that demonstrate such timestamps can reduce space consumption by more than an order-of-magnitude over Fidge/Mattern timestamps while still providing acceptable time bounds for computing timestamps and determining event precedence.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121914432","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}
引用次数: 17
Enforcing perfect failure detection 强制完美的故障检测
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918965
C. Fetzer
{"title":"Enforcing perfect failure detection","authors":"C. Fetzer","doi":"10.1109/ICDSC.2001.918965","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918965","url":null,"abstract":"Perfect failure detectors can correctly decide whether a computer is crashed. However it is impossible to implement a perfect failure detector in purely asynchronous systems. We show how to enforce perfect failure detection in timed distributed systems with hardware watchdogs. The two main system model assumptions are: each computer can measure time intervals with a known maximum error; and each computer has a watchdog that crashes the computer unless the watchdog is periodically updated. We have implemented a system that satisfies both assumptions using a combination of off-the-shelf software and hardware.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114556562","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}
引用次数: 18
Pushing the limits of multicast in ad hoc networks 推动组播在自组织网络中的极限
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919008
K. Obraczka, G. Tsudik, K. Viswanath
{"title":"Pushing the limits of multicast in ad hoc networks","authors":"K. Obraczka, G. Tsudik, K. Viswanath","doi":"10.1109/ICDSC.2001.919008","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.919008","url":null,"abstract":"Focuses on the requirements of \"better than best effort\" (high hop-by-hop delivery guarantee) broadcasting in highly dynamic mobile multi-hop ad-hoc networks (MANETs). Our work is motivated by mission-critical applications, such as disaster relief and military operations. This class of applications is characterized by: (1) high delivery guarantee requirements, even in the presence of high mobility, and (2) a broadcast style of communication, where all nodes are receivers. Extensive simulations conducted on two different platforms show that, as node speeds, network traffic load and number of senders increase, the performance of existing multicast protocols (exemplified by ODMRP and MAODV) degrades in terms of packet delivery and overhead. In contrast, simple flooding, while clearly not a panacea, performs comparatively well and shows promise as a foundation for more specialized protocols for highly dynamic MANETs of the future.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130831816","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}
引用次数: 53
On-line realignment of clients in networked databases 网络数据库中客户端在线重新排列
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918972
Je-Ho Park, A. Delis
{"title":"On-line realignment of clients in networked databases","authors":"Je-Ho Park, A. Delis","doi":"10.1109/ICDSC.2001.918972","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918972","url":null,"abstract":"Upper bounds on the scalability of client-server databases (CSDs) persist due to long delays experienced at the servers' queues. To this end, we have proposed a three-tier architecture that exploits similarities in object access behavior demonstrated by clients. Clients are statically grouped into logical clusters and object requests can be then served in an \"internal to cluster\" fashion. This is achieved with the introduction of an intermediate directory tier. Good client clustering yields more scalable CSD configurations as it minimizes the number of inter-cluster data accesses. We introduce the problem of client realignment in light of changing client localities and propose an online reclustering framework to address it. Online reclustering facilitates adaptive reconfiguration and redistribution of sites. The core of our proposal is a change detection approach that uses meta-data extracted from observed clients' access patterns. We evaluate the impact of employing a multi-featured change detection scheme in the three-tier CSD architecture and experimentally investigate its performance and trade-offs involved.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129751350","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
MAGE: a distributed programming model MAGE:分布式编程模型
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918960
Earl T. Barr, R. Pandey, Michael Haungs
{"title":"MAGE: a distributed programming model","authors":"Earl T. Barr, R. Pandey, Michael Haungs","doi":"10.1109/ICDSC.2001.918960","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918960","url":null,"abstract":"Writing distributed programs is difficult. To ease this task, we introduce a new programming abstraction which we call a mobility attribute. Mobility attributes provide a syntax that describes the mobility semantics of program components. Programmers attach mobility attributes to program components to dynamically control the placement of these components within the network. Mobility attributes intercept component invocations and decide whether and where to move a component before the component executes. This allows the programmer to improve her program's runtime efficiency by colocating components and resources. We present MAGE, an object oriented distributed system, that supports mobility attributes and illustrates their utility.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128145131","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
Object distribution with local information 具有本地信息的对象分布
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918968
Bujor D. Silaghi, P. Keleher
{"title":"Object distribution with local information","authors":"Bujor D. Silaghi, P. Keleher","doi":"10.1109/ICDSC.2001.918968","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918968","url":null,"abstract":"We investigate the problem of distributing communicating objects across wide-area environments. Our goals are to balance load, minimize network communication, and use resources efficiently. However, applications running in such environments are often dynamic and highly unpredictable. Furthermore, synchronous communication is usually too expensive to be used in disseminating load information. We therefore investigate policies that use local information to approximate desired global behaviors. Our results with Java applications show that simple, local approaches are surprisingly effective in capturing load information and object relationships, and in making migration and clustering decisions based on profiled information.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114446233","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}
引用次数: 7
Tight space self-stabilizing uniform l-mutual exclusion 紧空间自稳定均匀互斥
Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918936
M. Potop-Butucaru, S. Tixeuil
{"title":"Tight space self-stabilizing uniform l-mutual exclusion","authors":"M. Potop-Butucaru, S. Tixeuil","doi":"10.1109/ICDSC.2001.918936","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918936","url":null,"abstract":"A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler of backward recovery. The l-mutual exclusion is a generalization of the fundamental problem of mutual exclusion: the system has to guarantee the fair sharing of a resource that can be used by l processors simultaneously. We present a space efficient solution to the l-mutual exclusion problem that performs on uniform unidirectional ring networks and that is self-stabilizing. Our solution improves the space complexity of previously known approaches by a factor of min(n/sup 2//spl times/log(n), 1/l/spl times/log/sup l-1/ (n)), while retaining none of their drawbacks in terms of system hypothesis (we support unfair scheduler and ensure strong correctness) or specification verification (we guarantee high level 2-mutual exclusion). When l is fixed, the space complexity at each node is constant in average, making our approach suitable for scalable systems.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123843892","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学术官方微信
小红书