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

On Hit Inflation Techniques and Detection in Streams of Web Advertising Networks 网络广告流中的点击膨胀技术与检测

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

Ahmed A. Metwally, D. Agrawal, A. E. Abbadi, Qi Zheng

{"title":"On Hit Inflation Techniques and Detection in Streams of Web Advertising Networks","authors":"Ahmed A. Metwally, D. Agrawal, A. E. Abbadi, Qi Zheng","doi":"10.1109/ICDCS.2007.124","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.124","url":null,"abstract":"Click fraud is jeopardizing the industry of Internet advertising. Internet advertising is crucial for the thriving of the entire Internet, since it allows producers to advertise their products, and hence contributes to the well being of e-commerce. Moreover, advertising supports the intellectual value of the Internet by covering the running expenses of the content publishers' sites. Some publishers are dishonest, and use automation to generate traffic to defraud the advertisers. Similarly, some advertisers automate clicks on the advertisements of their competitors to deplete their competitors ' advertising budgets. In this paper, we describe the advertising network model, and discuss the issue of fraud that is an integral problem in such setting. We propose using online algorithms on aggregate data to accurately and proactively detect automated traffic, preserve surfers' privacy, while not altering the industry model. We provide a complete classification of the hit inflation techniques; and devise stream analysis techniques that detect a variety of fraud attacks. We abstract detecting the fraud attacks of some classes as theoretical stream analysis problems that we bring to the data management research community as open problems. A framework is outlined for deploying the proposed detection algorithms on a generic architecture. We conclude by some successful preliminary findings of our attempt to detect fraud on a real network.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"93 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":"115161716","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

Modeling Propagation Dynamics of Bluetooth Worms 蓝牙蠕虫的传播动力学建模

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

Guanhua Yan, S. Eidenbenz

引用次数: 52

Secure Event Dissemination in Publish-Subscribe Networks 发布-订阅网络中的安全事件传播

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

M. Srivatsa, Ling Liu

引用次数: 56

Overlay Node Placement: Analysis, Algorithms and Impact on Applications 覆盖节点放置:分析、算法和对应用的影响

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

Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C. Hu, L. Qiu

{"title":"Overlay Node Placement: Analysis, Algorithms and Impact on Applications","authors":"Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C. Hu, L. Qiu","doi":"10.1109/ICDCS.2007.127","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.127","url":null,"abstract":"Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under the constraints of deployment costs in terms of hardware, network connectivity and human effort, it is critical to carefully place infrastructure overlay nodes to balance the trade-off between performance and resource constraints. In this paper, we investigate approaches to perform intelligent placement of overlay nodes to facilitate (i) resilient routing and (ii) TCP performance improvement. We formulate objective functions to accurately capture application behavior: reliability and TCP performance, and develop several placement algorithms, which offer a wide range of trade-offs in complexity and required knowledge of the client- server location and traffic load. Using simulations on synthetic and real Internet topologies, and PlanetLab experiments, we demonstrate the effectiveness of the placement algorithms and objective functions developed, respectively. We conclude that an approach, hybrid of random and greedy approaches, provides the best tradeoff between computational efficiency and accuracy. We also uncover the fundamental challenge in simultaneously optimizing for reliability and TCP performance, and propose a simple unified algorithm to achieve the same.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"98 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":"116452236","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}

引用次数: 41

An Empirical Study of Collusion Behavior in the Maze P2P File-Sharing System 迷宫P2P文件共享系统合谋行为的实证研究

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

Qiao Lian, Zheng Zhang, Mao Yang, Ben Y. Zhao, Yafei Dai, Xiaoming Li

引用次数: 185

Distributed Density Estimation Using Non-parametric Statistics 使用非参数统计的分布密度估计

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

Yusuo Hu, Hua Chen, Jian-Guang Lou, Jiang Li

引用次数: 38

Supporting Robust and Secure Interactions in Open Domains through Recovery of Trust Negotiations 通过恢复信任协商支持开放域中稳健和安全的交互

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

A. Squicciarini, Alberto Trombetta, E. Bertino

{"title":"Supporting Robust and Secure Interactions in Open Domains through Recovery of Trust Negotiations","authors":"A. Squicciarini, Alberto Trombetta, E. Bertino","doi":"10.1109/ICDCS.2007.144","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.144","url":null,"abstract":"Trust negotiation supports authentication and access control across multiple security domains by allowing parties to use non-forgeable digital credentials to establish trust. By their nature trust negotiation systems are used in environments that are not always reliable. In particular, it is important not only to protect negotiations against malicious attacks, but also against failures and crashes of the parties or of the communication means. To address the problem of failures and crashes, we propose an efficient and secure recovery mechanism. The mechanism includes two recovery protocols, one for each of the two main negotiation phases. In fact, because of the requirements that both services and credentials have to be protected on the basis of the associated disclosure policies, most approaches distinguish between a phase of disclosure policy evaluation from a phase devoted to actual credentials exchange. We prove that the protocols, besides being efficient, are secure with respect to integrity, and confidentiality and are idempotent. To the best of our knowledge, this is the first effort for achieving robustness and fault tolerance of trust negotiation systems.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"22 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":"131651595","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}

引用次数: 18

An Asymmetric Quorum-based Power Saving Protocol for Clustered Ad Hoc Networks 基于非对称群体的集群自组织网络节能协议

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

Shan-Hung Wu, Chung-Min Chen, Ming-Syan Chen

{"title":"An Asymmetric Quorum-based Power Saving Protocol for Clustered Ad Hoc Networks","authors":"Shan-Hung Wu, Chung-Min Chen, Ming-Syan Chen","doi":"10.1109/ICDCS.2007.4561532","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.4561532","url":null,"abstract":"Clustering in Mobile Ad Hoc Networks (MANETs) has shown to be a promising technique to ensure the scalability and efficiency of various communication protocols. Since stations in MANETs are usually equipped with batteries as the power source, it is critical to ensure the energy efficiency of clustering schemes. The Quorum-based Power Saving (QPS) protocols render extensive energy conservation as compared with IEEE 802.11 Power Saving (PS) mode and are widely studied over the past years. However, most existing QPS protocols adopt a symmetric design where stations in the network are guaranteed to discover each other. Observing that in clustered environments there is no need to insist in all-pair neighbor discovery, we propose an Asymmetric Cyclic Quorum (ACQ) system. The ACQ system guarantees the neighbor discovery between each member node and the clusterhead in a cluster, and between clusterheads in the network. A construction scheme is presented in this work, which assembles the ACQ system in O(1) time. We show that by taxing slightly more energy consumption on the clusterhead, the average energy consumption of stations in a cluster can reduce substantially than can be achieved by traditional QPS protocols. Simulation results show that the ACQ system outperforms the previous studies up to 52% in energy efficiency, while introducing no extra worst-case latency.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"12 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":"131442141","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

EnviroMic: Towards Cooperative Storage and Retrieval in Audio Sensor Networks 环境:迈向音频传感器网络的协同存储与检索

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

L. Luo, Qing Cao, Chengdu Huang, T. Abdelzaher, J. Stankovic, Michael Ward

引用次数: 91

Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks 构建一个，免费获得一个:利用多个P2P覆盖网络的共存

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

B. Maniymaran, M. Bertier, Anne-Marie Kermarrec

{"title":"Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks","authors":"B. Maniymaran, M. Bertier, Anne-Marie Kermarrec","doi":"10.1109/ICDCS.2007.88","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.88","url":null,"abstract":"Many different P2P overlay networks providing various functionalities, targeting specific applications, have been proposed in the past five years. It is now reasonable to consider that multiple overlays may be deployed over a large set of nodes so that the most appropriate overlay might be chosen depending on the application. A physical peer may then host several instances of logical peers belonging to different overlay networks. In this paper, we show that the coexistence of a structured P2P overlay and an unstructured one may be leveraged so that, by building one, the other is automatically constructed as well. More specifically, we show that the randomness provided by an unstructured gossip-based overlay can be used to build the routing table of a structured P2P overlay and the randomness in the numerical proximity links in the structured networks provides the random peer sampling required by gossip-based unstructured overlays. In this paper, we show that maintaining the leaf set of Pastry and the proximity links of an unstructured overlay is enough to build the complete overlays. Simulation results comparing our approach with both a Pastry-like system and a gossip-based unstructured overlay show that we significantly reduce the overlay maintenance overhead without sacrificing the performance.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"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":"132497353","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