27th International Conference on Distributed Computing Systems (ICDCS '07)最新文献_第2页

Flashback: A Peer-to-PeerWeb Server for Flash Crowds 闪回:一个点对点网络服务器的闪人群

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.112

Mayur Deshpande, Abhishek Amit, Mason Chang, N. Venkatasubramanian, S. Mehrotra

{"title":"Flashback: A Peer-to-PeerWeb Server for Flash Crowds","authors":"Mayur Deshpande, Abhishek Amit, Mason Chang, N. Venkatasubramanian, S. Mehrotra","doi":"10.1109/ICDCS.2007.112","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.112","url":null,"abstract":"We present Flashback, a ready-to-use system for scalably handling large unexpected traffic spikes on web-sites. Unlike previous systems, our approach does not rely on any intermediate nodes to cache content. Instead, the clients (browsers) create a dynamic, self-scaling peer-to-peer (P2P) Web-server that grows and shrinks according to the load. This approach translates into a challenging problem - a P2P data exchange protocol that can operate in churn rates where more than 90% of peers can leave the overlay in under 10 seconds. This is at least an order of magnitude higher churn rate than previously addressed research. Additionally, our system operates under two strict constraints - users are assured that they upload only as much as they download and second, end-user browsing experience is preserved, i.e., low latency downloads and zero configuration or download of any software. Various innovations were required to meet these challenges. Key among them are (a) A TCP-friendly, UDP protocol (Roulette) for tit-for-tat data exchange under extreme churn, (b) A novel data structure (NOIS) for partial-data management and (c) A distributed hole-punching protocol for automatic NAT traversal. Experimental results show the effectiveness and near optimal scaling of Flashback. For a Web-server (and clients) running on a DSL-like connection, end-user latency increases only one second for every doubling in Web-server load.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"475 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131674165","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}

引用次数: 23

Automated Storage Reclamation Using Temporal Importance Annotations 使用时间重要性注释的自动存储回收

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.86

Surendar Chandra, Ashish Gehani, Xuwen Yu

引用次数: 3

Efficient Backbone Construction Methods in MANETs Using Directional Antennas 基于定向天线的manet高效主干网构建方法

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.105

Shuhui Yang, Jie Wu, Fei Dai

引用次数: 26

STEP: Sequentiality and Thrashing Detection Based Prefetching to Improve Performance of Networked Storage Servers 步骤:基于序列和抖动检测的预取提高网络存储服务器的性能

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.141

Shuang Liang, Song Jiang, Xiaodong Zhang

{"title":"STEP: Sequentiality and Thrashing Detection Based Prefetching to Improve Performance of Networked Storage Servers","authors":"Shuang Liang, Song Jiang, Xiaodong Zhang","doi":"10.1109/ICDCS.2007.141","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.141","url":null,"abstract":"State-of-the-art networked storage servers are equipped with increasingly powerful computing capability and large DRAM memory as storage caches. However, their contribution to the performance improvement of networked storage system has become increasingly limited. This is because the client-side memory sizes are also increasing, which reduces capacity misses in the client buffer caches as well as access locality in the storage servers, thus weakening the caching effectiveness of server storage caches. Proactive caching in storage servers is highly desirable to reduce cold misses in clients. We propose an effective way to improve the utilization of storage server resources through prefetching in storage servers for clients. In particular, our design well utilizes two unique strengths of networked storage servers which are not leveraged in existing storage server prefetching schemes. First, powerful storage servers have idle CPU cycles, under-utilized disk bandwidth, and abundant memory space, providing many opportunities for aggressive disk data prefetching. Second, the servers have the knowledge about high-latency operations in storage devices, such as disk head positioning, which enables efficient disk data prefetching based on an accurate cost-benefit analysis of prefetch operations. We present STEP - a Sequentiality and Thrashing dEtec- tion based Prefetching scheme, and its implementation with Linux Kernel 2.6.16. Our performance evaluation by replaying storage performance council (SPC) 's OLTP traces shows that server performance improvements are up to 94% with an average of 25%. Improvements with frequently used Unix applications are up to 53% with an average of 12%. Our experiments also show that STEP has little effect on workloads with random access patterns, such as SPC Web-search traces.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130722925","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}

引用次数: 61

Scheduling to Minimize theWorst-Case Loss Rate 最小化最坏情况损失率的调度

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.135

Mahmoud Elhaddad, H. Iqbal, T. Znati, R. Melhem

引用次数: 0

Supporting Multi-Dimensional Range Query for Sensor Networks 支持传感器网络的多维距离查询

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.143

Yu-Chi Chung, I-Fang Su, Chiang Lee

引用次数: 11

Heuristic Approaches to Energy-Efficient Network Design Problem 节能网络设计问题的启发式方法

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.114

C. Sengul, R. Kravets

引用次数: 13

Temporal Privacy in Wireless Sensor Networks 无线传感器网络中的时间隐私

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.146

P. Kamat, Wenyuan Xu, W. Trappe, Yanyong Zhang

引用次数: 82

Differentiated Data Persistence with Priority Random Linear Codes 基于优先级随机线性码的差分数据持久性

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.99

Yunfeng Lin, Baochun Li, B. Liang

引用次数: 58

Communication-Efficient Tracking of Distributed Cumulative Triggers 分布式累积触发器的通信高效跟踪

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.93

Ling Huang, M. Garofalakis, A. Joseph, N. Taft

引用次数: 41