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

Defragmenting DHT-based Distributed File Systems 整理基于dht的分布式文件系统

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

Jeffrey Pang, Phillip B. Gibbons, M. Kaminsky, S. Seshan, Haifeng Yu

引用次数: 14

Embedded Gossip: Lightweight Online Measurement for Large-Scale Applications 嵌入式八卦:大规模应用的轻量级在线测量

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

Wenbin Zhu, P. Bridges, A. Maccabe

{"title":"Embedded Gossip: Lightweight Online Measurement for Large-Scale Applications","authors":"Wenbin Zhu, P. Bridges, A. Maccabe","doi":"10.1109/ICDCS.2007.107","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.107","url":null,"abstract":"For large-scale parallel applications, lightweight online monitoring can enable a wide range of online adaptations, including load balancing, power management, and progress monitoring. The processing and monitoring overhead of centralized global tracing techniques make them unsuitable for such tasks. Purely local tools, on the other hand, fail to provide the global information necessary for many desirable online adaptations of large-scale applications. In this paper, we describe a novel distributed online measurement method for large-scale applications called Embedded Gossip (EG). EG works by piggybacking performance information about application behavior on existing application messages and merging received information with previously known data in a fashion customized to the needs of a particular monitoring task. EG thus provides each process with both local and global views of application behavior with low overhead. To illustrate the capabilities of Embedded Gossip, we also show that it disseminates global information in a timely fashion for a wide range of monitoring tasks, including critical path profiling, workload imbalance monitoring, and progress monitoring. This global information has a wide range of potential uses, including imbalance detection for load balancing and energy management tools, progress monitoring for batch schedulers, and a wide range of other performance debugging and optimization techniques.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"108 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":"114955656","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

Non-Threshold based Event Detection for 3D Environment Monitoring in Sensor Networks 基于非阈值的传感器网络三维环境监测事件检测

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

Mo Li, Yunhao Liu, Lei Chen

引用次数: 78

D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution D-Swoosh:一组通用分布式实体解析算法

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

O. Benjelloun, H. Garcia-Molina, Heng Gong, H. Kawai, T. E. Larson, David Menestrina, Sutthipong Thavisomboon

引用次数: 50

SCAP: Smart Caching inWireless Access Points to Improve P2P Streaming SCAP:无线接入点中的智能缓存以改进P2P流媒体

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

Enhua Tan, Lei Guo, Songqing Chen, Xiaodong Zhang

{"title":"SCAP: Smart Caching inWireless Access Points to Improve P2P Streaming","authors":"Enhua Tan, Lei Guo, Songqing Chen, Xiaodong Zhang","doi":"10.1109/ICDCS.2007.134","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.134","url":null,"abstract":"The increasing number of wireless users in Internet P2P applications causes two new performance problems due to the requirement of uploading the downloaded traffic for other peers, limited bandwidth of wireless communications, and resource competition between the access point and wireless stations. First, an active P2P wireless user can significantly reduce the downloading throughput of other wireless users in the WLAN. Second, the slowdown of a P2P wireless user communication can also delay its relay and data sharing service for other dependent wired/wireless peers. In order to address these problems, in this paper, we propose an efficient caching mechanism called SCAP (Smart Caching in Access Points). Conducting intensive Internet measurements on representative P2P streaming applications, we observe a high percentage of duplicated data packets in successive downloading and uploading data streams. Through duplication detection and caching at the access point, these duplicated packets can be compressed so that the uploading traffic in the WLAN is significantly reduced. Our prototype-based experimental evaluation demonstrates that by effectively reducing the redundant P2P traffic in the WLAN, SCAP improves the throughput of the WLAN by up to 88% and reduces the response delay to other Internet users meanwhile.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"33 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":"133002477","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}

引用次数: 42

Protocol Design for Dynamic Delaunay Triangulation 动态Delaunay三角剖分协议设计

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

Dong-Young Lee, S. Lam

引用次数: 29

Location Verification Algorithms forWireless Sensor Networks 无线传感器网络的位置验证算法

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

Yawen Wei, Zhen Yu, Y. Guan

引用次数: 39

Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach 测试协议实现的安全属性-基于机器学习的方法

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

Guoqiang Shu, David Lee

引用次数: 75

Selfishness, Not Always A Nightmare: Modeling Selfish MAC Behaviors in Wireless Mobile Ad Hoc Networks 自私，并不总是噩梦:无线移动自组织网络中自私MAC行为的建模

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

Lin Chen, J. Leneutre

{"title":"Selfishness, Not Always A Nightmare: Modeling Selfish MAC Behaviors in Wireless Mobile Ad Hoc Networks","authors":"Lin Chen, J. Leneutre","doi":"10.1109/ICDCS.2007.138","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.138","url":null,"abstract":"In wireless mobile ad hoc networks where nodes are selfish and non-cooperative, a natural and crucial question is how well or how bad the MAC layer protocol IEEE 802.11 DCF performs. In this paper, we study this question by modeling the selfish MAC protocol as a non- cooperative repeated game where players follow the TIT- FOR-TAT (TFT) strategy which is regarded as the best strategy in such environments. We show for single-hop ad hoc networks the game admits a number of Nash Equilibria (NE). We then perform NE refinement to eliminate the inefficient NE and show that there exists one efficient NE maximizing both local and global payoff. We also propose an algorithm to approach the efficient NE. We then extend our efforts to multi-hop case by showing that the game converges to a NE which may not be globally optimal but quasi- optimal in the sense that the global payoff is only slightly less than the optimal case. As conclusion, we answer the posed question by showing that selfishness does not always lead to network collapse. On the contrary, it can help the network operate at a NE globally which is optimal or quasi-optimal under the condition that players are long-sighted and follow the TFT strategy.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"1 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":"128981802","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

Fast Algorithms for Heavy Distinct Hitters using Associative Memories 使用联想记忆的重型不同击球手的快速算法

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

Nagender Bandi, D. Agrawal, A. E. Abbadi

{"title":"Fast Algorithms for Heavy Distinct Hitters using Associative Memories","authors":"Nagender Bandi, D. Agrawal, A. E. Abbadi","doi":"10.1109/ICDCS.2007.110","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.110","url":null,"abstract":"Real-time detection of worm attacks, port scans and distributed denial of service (DDoS) attacks, as network packets belonging to these security attacks flow through a network router, is of paramount importance. In a typical worm attack, a worm infected host tries to spread the worm by scanning a number of other hosts thus resulting in significant number of network connections at an intermediate router. Detecting such attacks amounts to finding all hosts that are associated with unusually high number of other hosts, which is equivalent to solving the classic heavy distinct hitter problem over data streams. While several heavy distinct hitter solutions have been proposed and evaluated in a standard CPU setting, most of the above applications typically execute on special networking architectures called network processing units (NPUs). These NPUs interface with special associative memories known as the ternary content addressable memories (TCAMs) to provide gigabit rate forwarding at network routers. In this paper, we describe how the integrated architecture of NPU and TCAMs can be exploited to develop high-speed solutions for heavy distinct hitters.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"220 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":"116365580","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}

引用次数: 22