Proceedings of the ACM SIGCOMM 2011 conference最新文献_第4页

Implementing ARP-path low latency bridges in NetFPGA 在NetFPGA中实现arp路径低延迟网桥

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018512

Elisa Rojas, Jad Naous, G. Ibáñez, Diego Rivera, J. A. Carral, J. M. Arco

引用次数: 6

Efficient content dissemination in heterogeneous networks prone to episodic connectivity 异构网络中的高效内容传播倾向于情景连接

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018531

Amir Krifa, Marc Mendonca, R. N. B. Rais, C. Barakat, T. Turletti, K. Obraczka

{"title":"Efficient content dissemination in heterogeneous networks prone to episodic connectivity","authors":"Amir Krifa, Marc Mendonca, R. N. B. Rais, C. Barakat, T. Turletti, K. Obraczka","doi":"10.1145/2018436.2018531","DOIUrl":"https://doi.org/10.1145/2018436.2018531","url":null,"abstract":"Ubiquity of portable computing devices coupled with wide availability of wireless communication present new impor- tant opportunities for applications involving media-rich content dissemination. However, as access networks become increasingly more heterogeneous, seamless data delivery across internets consisting of a variety of network technology becomes a real challenge. In this demonstration, we showcase a system that enables content dissemination over heterogeneous internets consisting of wired, infrastructure-based and infrastructure-less wireless networks that may be prone to intermittent connectivity. Using an efficient, yet flexible buffer management scheme, we are able to address application-specific performance requirements such as average delay, delivery probability, energy efficiency, etc. Our system uses the Message Delivery in Heterogeneous, Disruption-prone Networks (MeDeHa) [2]) framework to deliver messages across a heterogeneous internet coupled with History-Based Scheduling and Drop (HBSD) buffer management [1] as a way to optimize resources provided by opportunistic networks. MeDeHa, which is described in detail in [2], provides seamless data delivery over interconnecting networks of different types, i.e., infrastructure-based and infrastructure-less networks. MeDeHa's comprehensive approach to bridging infrastructure-based and infrastructureless networks also copes with intermittent connectivity. For this demonstration, we showcase a \"complete stack\" solution featuring, from to top to bottom, the DTN2 \"bundle\" layer, HBSD as an \"external router\" to DTN2, and MeDeHa, which handles message delivery. We have implemented, on a Linux-based testbed, (i) the MeDeHa framework, (ii) the HBSD [3] external router for the DTN2 [4] architecture.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131914619","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

Detecting and assessing the hybrid IPv4/IPv6 as relationships 检测和评估混合IPv4/IPv6作为关系

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018501

V. Giotsas, Shi Zhou

{"title":"Detecting and assessing the hybrid IPv4/IPv6 as relationships","authors":"V. Giotsas, Shi Zhou","doi":"10.1145/2018436.2018501","DOIUrl":"https://doi.org/10.1145/2018436.2018501","url":null,"abstract":"The business relationships between the Autonomous Systems (ASes) play a central role in the BGP routing. The existing relationship inference algorithms are profoundly based on the valley-free rule and generalize their inference heuristics for both the IPv4 and IPv6 planes, introducing unavoidable inference artifacts. To discover and analyze the Type-of-Relationship (ToR) properties of the IPv6 topology we mine the BGP Communities attribute which provides an unexploited wealth of reliable relationship information. We obtain the actual relationships for 72% of the IPv6 AS links that are visible in the RouteViews and RIPE RIS repositories. Our results show that as many as 13% of AS links that serve both IPv4 and IPv6 traffic have different relationships depending on the IP version. Such relationships are characterized as hybrid. We observe that links with hybrid relationships are present in a large number of IPv6 AS paths. Furthermore, an unusually large portion of IPv6 AS paths violate the valley-free rule, indicating that the global reachability in the IPv6 Internet requires the relaxation of the valley-free rule. Our work highlights the importance of correctly inferring the AS relationships and the need to appreciate the distinct characteristics of IPv6 routing policies.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134069925","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}

引用次数: 14

Design space analysis for modeling incentives in distributed systems 分布式系统激励建模的设计空间分析

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018458

Rameez Rahman, T. Vinkó, David Hales, J. Pouwelse, H. Sips

{"title":"Design space analysis for modeling incentives in distributed systems","authors":"Rameez Rahman, T. Vinkó, David Hales, J. Pouwelse, H. Sips","doi":"10.1145/2018436.2018458","DOIUrl":"https://doi.org/10.1145/2018436.2018458","url":null,"abstract":"Distributed systems without a central authority, such as peer-to-peer (P2P) systems, employ incentives to encourage nodes to follow the prescribed protocol. Game theoretic analysis is often used to evaluate incentives in such systems. However, most game-theoretic analyses of distributed systems do not adequately model the repeated interactions of nodes inherent in such systems. We present a game-theoretic analysis of a popular P2P protocol, Bit-Torrent, that models the repeated interactions in such protocols. We also note that an analytical approach for modeling incentives is often infeasible given the complicated nature of most deployed protocols. In order to comprehensively model incentives in complex protocols, we propose a simulation-based method, which we call Design Space Analysis (DSA). DSA provides a tractable analysis of competing protocol variants within a detailed design space. We apply DSA to P2P file swarming systems. With extensive simulations we analyze a wide-range of protocol variants and gain insights into their robustness and performance. To validate these results and to demonstrate the efficacy of DSA, we modify an instrumented BitTorrent client and evaluate protocols discovered using DSA. We show that they yield higher system performance and robustness relative to the reference implementation.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133338472","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}

引用次数: 44

PANDAA: a physical arrangement detection technique for networked devices through ambient-sound awareness PANDAA:一种通过环境声感知的网络设备物理布置检测技术

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018511

Zheng Sun, Aveek Purohit, Philippe De Wagter, Irina Brinster, C. Hamm, Pei Zhang

引用次数: 3

Session details: Network management -- reasoning and debugging 会话细节:网络管理——推理和调试

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/3256196

S. Katti

引用次数: 0

NetLord: a scalable multi-tenant network architecture for virtualized datacenters NetLord:用于虚拟化数据中心的可扩展多租户网络架构

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018444

Jayaram Mudigonda, P. Yalagandula, J. Mogul, Bryan Stiekes, Yanick Pouffary

引用次数: 168

Eco-Sign: a load-based traffic light control system for environmental protection with vehicular communications Eco-Sign:基于负载的交通信号灯控制系统，具有车辆通信功能

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018509

Lien-Wu Chen, Pranay Sharma, Y. Tseng

引用次数: 7

Inter-datacenter bulk transfers with netstitcher 使用netstitcher进行数据中心间批量传输

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018446

Nikolaos Laoutaris, Michael Sirivianos, Xiaoyuan Yang, P. Rodriguez

{"title":"Inter-datacenter bulk transfers with netstitcher","authors":"Nikolaos Laoutaris, Michael Sirivianos, Xiaoyuan Yang, P. Rodriguez","doi":"10.1145/2018436.2018446","DOIUrl":"https://doi.org/10.1145/2018436.2018446","url":null,"abstract":"Large datacenter operators with sites at multiple locations dimension their key resources according to the peak demand of the geographic area that each site covers. The demand of specific areas follows strong diurnal patterns with high peak to valley ratios that result in poor average utilization across a day. In this paper, we show how to rescue unutilized bandwidth across multiple datacenters and backbone networks and use it for non-real-time applications, such as backups, propagation of bulky updates, and migration of data. Achieving the above is non-trivial since leftover bandwidth appears at different times, for different durations, and at different places in the world. For this purpose, we have designed, implemented, and validated NetStitcher, a system that employs a network of storage nodes to stitch together unutilized bandwidth, whenever and wherever it exists. It gathers information about leftover resources, uses a store-and-forward algorithm to schedule data transfers, and adapts to resource fluctuations. We have compared NetStitcher with other bulk transfer mechanisms using both a testbed and a live deployment on a real CDN. Our testbed evaluation shows that NetStitcher outperforms all other mechanisms and can rescue up to five times additional datacenter bandwidth thus making it a valuable tool for datacenter providers. Our live CDN deployment demonstrates that our solution can perform large data transfers at a much lower cost than naive end-to-end or store-and-forward schemes.","PeriodicalId":350796,"journal":{"name":"Proceedings of the ACM SIGCOMM 2011 conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126784261","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}

引用次数: 301

Covert channels in multiple access protocols 多访问协议中的隐蔽信道

Proceedings of the ACM SIGCOMM 2011 conference Pub Date : 2011-08-15 DOI: 10.1145/2018436.2018490

Seyed Ali Ahmadzadeh, G. Agnew

引用次数: 2