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

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

筛选
英文 中文
Multimedia service configuration and reservation in heterogeneous environments 异构环境下的多媒体业务配置与预留
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840964
Dongyan Xu, D. Wichadakul, K. Nahrstedt
{"title":"Multimedia service configuration and reservation in heterogeneous environments","authors":"Dongyan Xu, D. Wichadakul, K. Nahrstedt","doi":"10.1109/ICDCS.2000.840964","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840964","url":null,"abstract":"Widely deployed multimedia services are expected to accommodate clients in a highly heterogeneous environment. Clients of a multimedia service may vary greatly in processing and communication capabilities. In addition, due to workload, location, and service time differences, the availability of end-to-end resources between a client and a server may also vary. Current solutions tend to focus on either the qualitative heterogeneity (in client and resource types) or the quantitative heterogeneity (in resource availability) problem. We present a framework for dynamic end-to-end multimedia service configuration and reservation: an integrated solution to both aspects of the heterogeneity problem. Service configuration is responsible for choosing appropriate service components to compose a customized service deliver to each client; while service reservation is responsible for reserving the end-to-end resources in a coordinated manner and providing the best possible quality within the chosen configuration. We have implemented a prototype of this framework as part of the 2K operating system and tested it by building a proof-of-concept video streaming service on top of it. Our experiments show the soundness of this framework.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"117 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":"122496040","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}
引用次数: 34
A semantic broadcast scheme for a mobile environment based on dynamic chunking
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840966
Ken C. K. Lee, H. Leong, A. Si
{"title":"A semantic broadcast scheme for a mobile environment based on dynamic chunking","authors":"Ken C. K. Lee, H. Leong, A. Si","doi":"10.1109/ICDCS.2000.840966","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840966","url":null,"abstract":"Data broadcast is an effective approach to disseminate information from a database server to numerous mobile clients in a mobile environment. Since a broadcast session contains only a subset of the database items, a client might not be able to obtain all its items from the broadcast and is forced to request additional ones from the server on demand. We describe a semantic-based broadcast approach which attaches a semantic description to each broadcast unit, called a chunk, which is a cluster of data items. This allows a client to determine if a query can be answered entirely using a broadcast as well as defining the precise nature of the remaining items in the form of a \"supplementary\" query. Chunks could be of different sizes and are hierarchically organized. We propose a heuristic to schedule the broadcast order of the chunks to improve the tuning time, access time, and a new metric called a data affinity index. The performances are evaluated via experiments based on a simulation model.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"193 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":"125059040","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}
引用次数: 24
A new network layer protocol with routing address and tables auto-configuration mechanism 一个新的网络层协议，具有路由地址和表自动配置机制
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840910
H. Mori, K. Sakamura
{"title":"A new network layer protocol with routing address and tables auto-configuration mechanism","authors":"H. Mori, K. Sakamura","doi":"10.1109/ICDCS.2000.840910","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840910","url":null,"abstract":"We propose a network layer protocol denoted ACRP (Auto-Configurated Routing Protocol) equipped with a function that automatically configures routing addresses and routing tables for a large scale network system made up of multiple connected physical networks. The goals of the work presented, are to enable adding and deleting physical networks during practical use and designing the protocol in such a way that the auto-configuration is finished within a few minutes. By simulating ACRP, we have succeeded in determining the algorithm structures for the routing tables protocol, that satisfy these requirements in a network with approximately 400000 nodes. This work will contribute to the improvement of expandability and maintainability of control LANs for intelligent buildings, etc.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"22 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":"117175495","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
An efficient cache maintenance scheme for mobile environment 一种高效的移动环境缓存维护方案
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840967
Anurag Kahol, R. Khurana, S. Gupta, P. Srimani
{"title":"An efficient cache maintenance scheme for mobile environment","authors":"Anurag Kahol, R. Khurana, S. Gupta, P. Srimani","doi":"10.1109/ICDCS.2000.840967","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840967","url":null,"abstract":"We present a new cache maintenance scheme, called AS, suitable for the wireless mobile environment. Our scheme integrates the mobility management scheme of Mobile IP with cache maintenance scheme used in the CODA file system. As opposed to broadcasting invalidation report schemes, AS supports arbitrary disconnection patterns and uses less wireless bandwidth. We present analytical and simulation results to show the superiority of our caching scheme.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"5 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":"124201232","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
A relaxed mutual exclusion problem with application to channel allocation in mobile cellular networks 一种松弛互斥问题及其在移动蜂窝网络信道分配中的应用
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840974
T. Lai, Jianping Jiang, T. Ma
{"title":"A relaxed mutual exclusion problem with application to channel allocation in mobile cellular networks","authors":"T. Lai, Jianping Jiang, T. Ma","doi":"10.1109/ICDCS.2000.840974","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840974","url":null,"abstract":"Distributed channel allocation is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem (because a channel may be reused in different cells). However it is still not clear what is the relationship between the two problems. We establish the exact relationship between the two. Specifically, we introduce the problem of relaxed mutual exclusion to model the problem of distributed channel allocation. We develop a general algorithm that guarantees relaxed mutual exclusion for a single resource, prove a necessary and sufficient condition for the information structure, and address the issues that arise in relaxed mutual exclusion, including deadlock resolution, dealing with multiple resources, and design of efficient information structure.","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":"128071755","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
Paradigm-oriented distributed computing using mobile agents 使用移动代理的面向范例的分布式计算
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840902
Hairong Kuang, L. Bic, M. Dillencourt
{"title":"Paradigm-oriented distributed computing using mobile agents","authors":"Hairong Kuang, L. Bic, M. Dillencourt","doi":"10.1109/ICDCS.2000.840902","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840902","url":null,"abstract":"We describe the implementation underlying an environment for distributed computing that uses the concept of well-known paradigms. The main advantage of paradigm oriented distributed computing is that the user only needs to specify application-specific sequential code, while the underlying infrastructure takes care of the parallelization and distribution. The main features of the proposed approach, called PODC, which differentiate it from other approaches, are the following: (1) it is intended for loosely-coupled network environments, not specialized multiprocessors; (2) it is based on an infrastructure of mobile agents; (3) it supports programming in C, rather than a functional or special-purpose language, and (4) it provides a Web based interactive graphics interface through which programs are constructed, invoked, and monitored. The three paradigms presently supported in PODC are the bag-of-tasks, the branch-and-bound and genetic programming. We describe their implementation and performance within the mobile agent based PODC environment.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"132 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":"128301908","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
Distributed Java Virtual Machine for message passing architectures 用于消息传递体系结构的分布式Java虚拟机
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840914
M. Surdeanu
{"title":"Distributed Java Virtual Machine for message passing architectures","authors":"M. Surdeanu","doi":"10.1109/ICDCS.2000.840914","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840914","url":null,"abstract":"This paper introduces a distributed shared memory Java Virtual Machine architecture. This project is targeted for any distributed message-passing architecture, and specifically for networks of workstations. The whole system is implemented in user space which offers portability and flexibility. The memory consistency is provided by one of four protocols implementing release consistency. The novelty of the consistency protocols presented is that access faults are avoided by replicating objects ahead-of-time where necessary. The relative performance of these protocols is evaluated for three benchmark applications. Our experimental results indicate that, in the majority of cases, update protocols outperform invalidate protocols.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"29 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":"128316838","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
Partitionable light-weight groups 可分区的轻量级群
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840905
L. Rodrigues, Katherine Guo
{"title":"Partitionable light-weight groups","authors":"L. Rodrigues, Katherine Guo","doi":"10.1109/ICDCS.2000.840905","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840905","url":null,"abstract":"Group communication, providing virtual synchrony semantics, is a powerful paradigm for building distributed applications. For applications that require a large number of groups, significant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps multiple user groups onto a small number of instances of a virtually synchronous implementation is called a Light-Weight Group Service. The paper describes the design of a light-weight group service able to operate in partitionable networks. Partitions pose challenges to the design of this service, in particular because inconsistent mapping decisions can be made when the system is partitioned. The paper focuses on the design of reconciliation mechanisms needed when a partition is healed.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"5 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":"131245601","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}
引用次数: 10
Static and adaptive data replication algorithms for fast information access in large distributed systems 大型分布式系统中用于快速信息访问的静态和自适应数据复制算法
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840950
Thanasis Loukopoulos, I. Ahmad
{"title":"Static and adaptive data replication algorithms for fast information access in large distributed systems","authors":"Thanasis Loukopoulos, I. Ahmad","doi":"10.1109/ICDCS.2000.840950","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840950","url":null,"abstract":"Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time. On the contrary, data replication in the presence of writes incurs extra cost due to multiple updates. The set of sites at which an object is replicated constitutes its replication scheme. Finding an optimal replication scheme that minimizes the amount of network traffic given read and write frequencies for various objects, is NP-complete in general. We propose two heuristics to deal with this problem for static read and write patterns. The first is a simple and fast greedy heuristic that yields good solutions when the system is predominantly read-oriented. The second is a genetic algorithm that through an efficient exploration of the solution space provides better solutions for cases where the greedy heuristic does not perform well. We also propose an extended genetic algorithm that rapidly adapts to the dynamically changing characteristics such as the frequency of reads and writes for particular objects.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"61 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":"133958721","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}
引用次数: 76
Index structures of user profiles for efficient Web page filtering services 用于高效Web页面过滤服务的用户配置文件的索引结构
Proceedings 20th IEEE International Conference on Distributed Computing Systems Pub Date : 2000-04-10 DOI: 10.1109/ICDCS.2000.840981
Yi-Hung Wu, Arbee L. P. Chen
{"title":"Index structures of user profiles for efficient Web page filtering services","authors":"Yi-Hung Wu, Arbee L. P. Chen","doi":"10.1109/ICDCS.2000.840981","DOIUrl":"https://doi.org/10.1109/ICDCS.2000.840981","url":null,"abstract":"Searching information from the WWW efficiently and effectively has become a very important issue. We apply the information filtering concept to finding good matches of Web pages to what the user needs. Furthermore, we propose four new methods for indexing user information needs and show their efficiency in comparison with two well-known approaches.","PeriodicalId":284992,"journal":{"name":"Proceedings 20th IEEE International Conference on Distributed Computing Systems","volume":"171 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":"133632979","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}
引用次数: 10
首页 上一页 下一页 尾页
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学术官方微信