Proceedings 22nd International Conference on Distributed Computing Systems最新文献_第3页

Convergence refinement 收敛细化

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022309

M. Demirbas, A. Arora

引用次数: 17

Dynamic data broadcasting with traffic awareness 具有流量感知的动态数据广播

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022248

Chih-Lin Hu, Ming-Syan Chen

{"title":"Dynamic data broadcasting with traffic awareness","authors":"Chih-Lin Hu, Ming-Syan Chen","doi":"10.1109/ICDCS.2002.1022248","DOIUrl":"https://doi.org/10.1109/ICDCS.2002.1022248","url":null,"abstract":"Data dissemination has significantly served as a scalable data delivery mechanism in wireless networks. However, even though the broadcast traffic has the nature of dynamic changes, most previous research efforts were elaborated upon the premise of static workloads and access patterns without having proper traffic awareness. In this paper, we address the existence of client impatience and accordingly devise an online traffic awareness mechanism based on a novel selective deferment and reflection (SDR) technique to estimate the dynamic workloads and access patterns in a granularity of a broadcast cycle. In comparison with prior probing and feedback approaches, our design is of practical usefulness in that it has low complexity and is light-weight without performance degradation. With various dynamic traffic scenarios, the experimental results show that with an increasing/decreasing workload, the real access frequency distribution is bounded by two specific estimated distributions. This fact in turn suggests us to employ a trigonometric tuning method to further enhance the estimation. In addition, we examine that the mean difference between the estimated access frequency distribution and the real one is very small, consequently indicating the feasibility and reliability of our proposed data broadcast mechanism with traffic awareness.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124469138","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}

引用次数: 31

Architecture of a large-scale location service 大规模位置服务的体系结构

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022292

Alexander Leonhardi, K. Rothermel

引用次数: 49

Distributed bandwidth broker for QoS multicast traffic 用于QoS多播流量的分布式带宽代理

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022269

E. Pagani, G. P. Rossi

引用次数: 10

A pluggable service-to-service communication mechanism for VNA architecture VNA架构的可插拔服务对服务通信机制

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022290

J. Nakazawa, Y. Tobe, H. Tokuda

引用次数: 1

Migratory TCP: connection migration for service continuity in the Internet 迁移TCP:为保证互联网业务的连续性，迁移连接

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022294

F. Sultan, Kiran Srinivasan, D. Iyer, L. Iftode

{"title":"Migratory TCP: connection migration for service continuity in the Internet","authors":"F. Sultan, Kiran Srinivasan, D. Iyer, L. Iftode","doi":"10.1109/ICDCS.2002.1022294","DOIUrl":"https://doi.org/10.1109/ICDCS.2002.1022294","url":null,"abstract":"Today's Internet services are commonly built over TCP, the standard Internet connection-oriented reliable transport protocol. The endpoint naming scheme of TCP, based on network layer (IP) addresses, creates an implicit binding between a service and the IP address of a server providing it, throughout the lifetime of a client connection. This makes a TCP client prone to all adverse conditions that may affect the server endpoint or the internetwork in between, after the connection is established: congestion or failure in the network, server overloaded, failed or under DoS attack. Studies that quantify the effects of network stability and route availability demonstrate that connectivity failures can significantly impact Internet services. As a result, although highly available servers can be deployed, sustaining continuous service remains a problem. We propose cooperative service model, in which a pool of similar servers, possibly geographically distributed across the Internet, cooperate in sustaining a service by migration of client connections within the pool. The control traffic between servers, needed to support migrated connections, can be carried either over the Internet or over a private network. From client's viewpoint, at any point during the lifetime of its service session, the remote endpoint of its connection may transparently migrate between servers.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114736264","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}

引用次数: 124

Balancing performance, energy, and quality in pervasive computing 在普适计算中平衡性能、能量和质量

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022259

J. Flinn, Soyoung Park, M. Satyanarayanan

引用次数: 322

Routing indices for peer-to-peer systems 对等系统的路由索引

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022239

Arturo Crespo, H. Garcia-Molina

引用次数: 916

Distributing MPEG movies over the Internet using programmable networks 使用可编程网络在因特网上分发MPEG电影

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022253

Dan He, Gilles Muller, J. Lawall

{"title":"Distributing MPEG movies over the Internet using programmable networks","authors":"Dan He, Gilles Muller, J. Lawall","doi":"10.1109/ICDCS.2002.1022253","DOIUrl":"https://doi.org/10.1109/ICDCS.2002.1022253","url":null,"abstract":"Distributing video over the Internet is an increasingly important application. Nevertheless, the real-time and high bandwidth requirements of video make video distribution over today's Internet a challenge. Adaptive approaches can be used to respond to changes in bandwidth availability while limiting the effect of such changes on perceptual quality and resource consumption. Nevertheless, most existing adaptation mechanisms have limited scalability and do not effectively exploit the heterogeneity of the Internet. In this paper, we describe the design and implementation of a MPEG video broadcasting service based on active networks. In an active network, routers can be programmed to make routing decisions based on local conditions. Because decisions are made locally, adaptation reacts rapidly to changing conditions and is unaffected by conditions elsewhere in the network. Programmability allows the adaptation policy to be tuned to the structure of the transmitted data, and to the properties of local clients. We use the PLAN-P domain-specific language for programming active routers; this language provides high-level abstractions and safety guarantees that allow complex protocols to be developed rapidly and reliably. Our experiments show that our approach to video distribution permits the decoding of up to 9 times as many frames in a heavily loaded network as distribution using standard routers.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123346259","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

The complexity of adding failsafe fault-tolerance 增加故障安全容错的复杂性

Proceedings 22nd International Conference on Distributed Computing Systems Pub Date : 2002-07-02 DOI: 10.1109/ICDCS.2002.1022271

S. Kulkarni, Ali Ebnenasir

{"title":"The complexity of adding failsafe fault-tolerance","authors":"S. Kulkarni, Ali Ebnenasir","doi":"10.1109/ICDCS.2002.1022271","DOIUrl":"https://doi.org/10.1109/ICDCS.2002.1022271","url":null,"abstract":"In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) program. A failsafe fault-tolerant program satisfies its specification (including safety and liveness) in the absence of faults. And, in the presence of faults, it satisfies its safety specification. We present a somewhat unexpected result that, in general, the problem of adding failsafe fault-tolerance in distributed programs is NP-hard. Towards this end, we reduce the 3-SAT problem to the problem of adding failsafe fault-tolerance. We also identify a class of specifications, monotonic specifications and a class of programs, monotonic programs. Given a (positive) monotonic specification and a (negative) monotonic program, we show that failsafe fault-tolerance can be added in polynomial time. We note that the monotonicity restrictions are met for commonly encountered problems such as Byzantine agreement, distributed consensus, and atomic commitment. Finally, we argue that the restrictions on the specifications and programs are necessary to add failsafe fault-tolerance in polynomial time; we prove that if only one of these conditions is satisfied, the addition of failsafe fault-tolerance is still NP-hard.","PeriodicalId":186210,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems","volume":"249 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133515259","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}

引用次数: 40