Proceedings 21st International Conference on Distributed Computing Systems最新文献_第3页

A multi-threading model for distributed mobile objects and its realization in FarGo 分布式移动对象的多线程模型及其在FarGo中的实现

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918961

Miki Abu, I. Ben-Shaul

引用次数: 6

Combining generality and practicality in a conit-based continuous consistency model for wide-area replication 基于条件的广域复制连续一致性模型的通用性与实用性相结合

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918973

Haifeng Yu, Amin Vahdat

{"title":"Combining generality and practicality in a conit-based continuous consistency model for wide-area replication","authors":"Haifeng Yu, Amin Vahdat","doi":"10.1109/ICDSC.2001.918973","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918973","url":null,"abstract":"Replication is a key approach to scaling wide-area applications. However, the overhead associated with large-scale replication quickly becomes prohibitive across wide-area networks. One effective approach to addressing this limitation is to allow applications to dynamically trade reduced consistency for increased performance and availability. Although extensive study has been performed on relaxed consistency models in traditional replicated databases, none of the models can simultaneously achieve the following two typically conflicting requirements imposed by wide-area applications: generality (capturing application-specific consistency semantics) and practicality (enabling efficient application-independent consistency protocols to be designed and providing natural ways to express application semantics). We propose a conit-based continuous consistency model designed to simultaneously achieve generality and practicality. Our conit theory provides generality, where application-specific consistency requirements are exported as conits. Practicality is achieved by using a simple, spanning set of metrics for conit consistency and by using a per-write weight specification. We demonstrate the generality of our model through representative wide-area applications and by showing that a number of existing models can be expressed as instances of our model. Our efficient, application-independent consistency protocols and prototype implementation verify its practicality.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"61 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":"116146258","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}

引用次数: 28

Distributed network simulations using the dynamic simulation backplane 采用动态仿真背板进行分布式网络仿真

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918947

G. Riley, M. Ammar, R. Fujimoto, Donghua Xu, K. Perumalla

{"title":"Distributed network simulations using the dynamic simulation backplane","authors":"G. Riley, M. Ammar, R. Fujimoto, Donghua Xu, K. Perumalla","doi":"10.1109/ICDSC.2001.918947","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918947","url":null,"abstract":"Presents an approach for creating distributed, component-based simulations of communication networks by interconnecting models of sub-networks drawn from different network simulation packages. This approach supports the rapid construction of simulations for large networks by reusing existing models and software, and fast execution using parallel discrete event simulation techniques. A dynamic simulation backplane is proposed that provides a common format and protocol for message exchange, and services for transmitting data and synchronizing heterogeneous network simulation engines. In order to achieve plug-and-play interoperability, the backplane uses existing network communication standards and dynamically negotiates among the participant simulators to define a minimal subset of required information that each simulator must supply, as well as other optional information. The backplane then automatically creates a message format that can be understood by all participating simulators and dynamically creates the content of each message by using callbacks to the simulation engines. We describe our approach to interoperability as well as an implementation of the backplane. We present results that demonstrate the proper operation of the backplane by distributing a network simulation between two different simulation packages, ns2 and GloMoSim. Performance results show that the overhead for the creation of the dynamic messages is minimal. Although this work is specific to network simulations, we believe our methodology and approach can be used to achieve interoperability in other distributed computing applications as well.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"93 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":"126213102","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}

引用次数: 38

An application-oriented approach for distributed system modeling and simulation 面向应用的分布式系统建模与仿真方法

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918945

M. Nikolaidou, D. Anagnostopoulos

引用次数: 6

An application of parameter estimation to route discovery by on-demand routing protocols 参数估计在按需路由协议路由发现中的应用

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918950

J. Sucec, I. Marsic

引用次数: 11

Performance tuning of distributed applications with CoSMoS 使用CoSMoS对分布式应用程序进行性能调优

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918946

Christoph Steigner, J. Wilke

引用次数: 15

Appia, a flexible protocol kernel supporting multiple coordinated channels Appia，一个灵活的协议内核，支持多个协调通道

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.919005

Hugo M. Miranda, A. Pinto, L. Rodrigues

引用次数: 218

Generalized role-based access control 通用的基于角色的访问控制

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918969

Matthew J. Moyer, M. Ahamad

引用次数: 215

Adaptive parameter collection in dynamic distributed environments 动态分布式环境下的自适应参数采集

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918977

Zhenghua Fu, N. Venkatasubramanian

{"title":"Adaptive parameter collection in dynamic distributed environments","authors":"Zhenghua Fu, N. Venkatasubramanian","doi":"10.1109/ICDSC.2001.918977","DOIUrl":"https://doi.org/10.1109/ICDSC.2001.918977","url":null,"abstract":"Cost-effectively collecting distributed state information is a challenging problem. There is perhaps no single perfect solution since different distributed application environments pose different requirements from the information collection process. Knowledge of the environment, in terms of traffic conditions, load models etc., plays a key role in determining tradeoffs between accuracy (needed to ensure quality-of-service requirements) and cost-effectiveness. We develop an adaptive information collection algorithm that utilizes network traffic knowledge characterized using a time series model. The algorithm utilizes an information collection architecture consisting of a directory service integrated into the middleware layer with monitoring modules distributed across the network. The cost-effectiveness of the proposed information collection algorithm proposed is verified in simulations over diverse network traffic patterns, i.e. Internet WAN (TCP), MPEG (multimedia) and Web access traffic traces. Our results show that the proposed adaptive information collection algorithm compensates for inaccuracies in network traffic predictions in a cost-effective manner.","PeriodicalId":276188,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems","volume":"18 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":"132706147","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

Support for speculative update propagation and mobility in Deno 在Deno中支持推测更新传播和移动性

Proceedings 21st International Conference on Distributed Computing Systems Pub Date : 2001-04-16 DOI: 10.1109/ICDSC.2001.918981

U. Çetintemel, P. Keleher, M. Franklin

引用次数: 34