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

Topology-aware content-centric networking 拓扑感知的以内容为中心的网络

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491729

Xinggong Zhang, Tong Niu, F. Lao, Zongming Guo

{"title":"Topology-aware content-centric networking","authors":"Xinggong Zhang, Tong Niu, F. Lao, Zongming Guo","doi":"10.1145/2486001.2491729","DOIUrl":"https://doi.org/10.1145/2486001.2491729","url":null,"abstract":"Making data the first class entity, Information-Centric Networking (ICN) replaces conventional host-to-host model with content sharing model. However, the huge amount of content and the volatility of replicas cached across the Internet pose significant challenges for addressing content only by name. In this paper, we propose a topology-aware name-based routing protocol which combines the benefits of location-oriented routing and content-centric routing together. We adopt a URL-like naming scheme, which defines register locations and content identifier. Node with copies sends Register messages towards a register using location-oriented routing protocols. All en-path routers record forwarding entries in forwarding table (FIB) as the \"bread crumb\" to this content. Following the bread crumb, routers know the \"best\" topology path to the available copies. An Interest is either forwarded towards a \"known\" copy by the content identifier, or towards the register nodes where it would find the bread crumb to the \"best\" copies. Compared with the existing flooding or name resolution methods, Our design shows a good potential in terms of scalability, availability and overhead.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"230 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114151606","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

The contagion of malicious behaviors in online games 网络游戏中恶意行为的传染

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491712

Jiyoung Woo, Ah Reum Kang, H. Kim

引用次数: 18

Which flows are hiding behind my wildcard rule?: adding packet sampling to openflow 哪些流隐藏在通配符规则后面?:在openflow中增加包采样

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2534169.2491710

P. Wette, H. Karl

引用次数: 18

B4: experience with a globally-deployed software defined wan B4:具有全球部署的软件定义广域网的经验

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2486019

Susha Jain, Alok Kumar, Subhasree Mandal, J. Ong, L. Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, J. Zolla, Urs Hölzle, Stephen Stuart, Amin Vahdat

引用次数: 2334

An empirical study of analog channel feedback 模拟信道反馈的实证研究

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491716

Wei-Liang Shen, K. Lin, Ming-Syan Chen

引用次数: 0

OpenRAN: a software-defined ran architecture via virtualization OpenRAN:通过虚拟化实现的软件定义的运行架构

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491732

Mao Yang, Yong Li, Depeng Jin, L. Su, Shaowu Ma, Lieguang Zeng

引用次数: 166

Towards efficient traffic-analysis resistant anonymity networks 迈向高效流量分析抗匿名网络

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2486002

Stevens Le Blond, D. Choffnes, Wenxuan Zhou, P. Druschel, Hitesh Ballani, P. Francis

{"title":"Towards efficient traffic-analysis resistant anonymity networks","authors":"Stevens Le Blond, D. Choffnes, Wenxuan Zhou, P. Druschel, Hitesh Ballani, P. Francis","doi":"10.1145/2486001.2486002","DOIUrl":"https://doi.org/10.1145/2486001.2486002","url":null,"abstract":"Existing IP anonymity systems tend to sacrifice one of low latency, high bandwidth, or resistance to traffic-analysis. High-latency mix-nets like Mixminion batch messages to resist traffic-analysis at the expense of low latency. Onion routing schemes like Tor deliver low latency and high bandwidth, but are not designed to withstand traffic analysis. Designs based on DC-nets or broadcast channels resist traffic analysis and provide low latency, but are limited to low bandwidth communication. In this paper, we present the design, implementation, and evaluation of Aqua, a high-bandwidth anonymity system that resists traffic analysis. We focus on providing strong anonymity for BitTorrent, and evaluate the performance of Aqua using traces from hundreds of thousands of actual BitTorrent users. We show that Aqua achieves latency low enough for efficient bulk TCP flows, bandwidth sufficient to carry BitTorrent traffic with reasonable efficiency, and resistance to traffic analysis within anonymity sets of hundreds of clients. We conclude that Aqua represents an interesting new point in the space of anonymity network designs.","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"89 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114128105","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}

引用次数: 76

Session details: Content delivery and congestion control 1 会话细节:内容交付和拥塞控制

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/3261533

Georgios Smaragdakis

引用次数: 0

Automated configuration and measurement of emulated networks with AutoNetkit 自动化配置和测量模拟网络与AutoNetkit

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491692

Simon Knight

引用次数: 1

Design and implementation of a framework for software-defined middlebox networking 软件定义的中间件网络框架的设计与实现

Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM Pub Date : 2013-08-12 DOI: 10.1145/2486001.2491686

Aaron Gember, Robert Grandl, Junaid Khalid, Aditya Akella

{"title":"Design and implementation of a framework for software-defined middlebox networking","authors":"Aaron Gember, Robert Grandl, Junaid Khalid, Aditya Akella","doi":"10.1145/2486001.2491686","DOIUrl":"https://doi.org/10.1145/2486001.2491686","url":null,"abstract":"Middleboxes (MBs) are used widely to ensure security (e.g., intrusion detection systems), improve performance (e.g., WAN optimizers), and provide other novel network functionality [4, 6]. Recently, researchers have proposed several new architectures for MB deployment, including Stratos [2], CoMb [4], and APLOMB [6]. These frameworks all advocate dynamic deployment of software-based MBs with the goal of increasing flexibility, improving efficiency, and reducing management overhead. However, approaches for controlling the behavior of MBs (i.e., how MBs examine and modify network traffic) remain limited. Today, configuration policies and parameters are manipulated using narrow, MB-specific configuration interfaces, while internal algorithms and state are completely inaccessible and unmodifiable. This apparent lack of finegrained control over MBs and their state precludes correct and performant implementation of control scenarios that involve re-allocating live flows across MBs: e.g., server migration, scale up/down of MBs to meet cost-performance trade-offs, recovery from network or MB failures, etc. Several key requirements must be satisfied to effectively support the above scenarios. To illustrate these requirements, we consider a scenario where MB instances are added and removed based on current network load [2] (Figure 1). When scaling up, some in-progress flows may need to be moved to a new MB instance to reduce the load on the original instance. To preserve the correctness and fidelity of MB operations, the new instance must receive the internal MB state associated with the moved flows, while the old instance still has the internal state associated with the remaining flows. For some MBs (e.g., an intrusion prevention","PeriodicalId":159374,"journal":{"name":"Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114428066","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}

引用次数: 35