SIGCOMM12论文简要选读

以下从研究的角度对SIGCOMM 2012上发表的论文有重点的加以总结：

Session A Middleboxes and middleware

1，

Ali Ghodsi, Vyas Sekar, Matei Zaharia, Ion Stoica: Multi-resourcefair queueing for packet processing. 1-12
这篇论文主要针对的是不同middleware对硬件上的资源有不同的需求，原先的研究主要考虑如何对单一资源（如bandwidth）进行优化调度，本文认为各种资源之间是有联系的，通过实验说明一般的针对某一种资源进行调度的算法不能很好的对多种资源进行调度，所以本文提出了一种新的综合对多种资源进行统一调度的方法。

摘要：“Middleboxes are ubiquitous in today’s networks and perform a variety of important functions, including IDS, VPN, firewalling, and WAN optimization. These functions differ vastly in their requirements for hardware resources ( e.g.,CPU cycles and memory bandwidth). Thus, depending on the functions they go through, different flows can consume different amounts of a middlebox’s resources. While there is much literature on weighted fair sharing of link bandwidth to isolate flows, it is unclear how to schedule multiple  resources in a middlebox to achieve similar guarantees. In this paper, we analyze several natural packet scheduling algorithms for multiple resources and show that they have undesirable properties. We propose a new algorithm, Dominant Resource Fair Queuing (DRFQ), that retains the attractive properties that fair sharing provides for one resource. In doing so, we generalize the concept of virtual time in classical fair queuing to multi-resource settings. The resulting algorithm is also applicable in other contexts where several resources need to be multiplexed in the time domain.”

2，Justine Sherry, Shaddi Hasan, Colin Scott, Arvind Krishnamurthy, Sylvia Ratnasamy, Vyas Sekar:  Making middleboxes someone else's problem: network processing as a cloud service. 13-24（系统实现）

本文主要的动机是考虑到middlebox处理服务的复杂性以及昂贵，结合当前火热的云计算技术，将这些作为一种服务转移到云平台上去。但实际中主要的困难在于如何保证这一服务转移后的功能可靠性而又不牺牲性能不增加网络的复杂性。本文的工作中通过实际的进行相关调研，提出了并实现了一种具体的解决方案，而实际的系统效果显示其性能是可以的。

摘要：“Modern enterprises almost ubiquitously deploy middlebox processing services to improve security and performance in their networks. Despite this, we find that today’s middlebox infrastructure is expensive, complex to manage, and creates new failure modes for the networks that use them. Given the promise of cloud computing to decrease costs, ease management, and provide elasticity and fault tolerance, we argue that middlebox processing can benefit from outsourcing the cloud. Arriving at a feasible implementation, however, is challenging due to the need to achieve functional equivalence with traditional middlebox deployments without sacrificing performance or increasing network complexity.

In this paper, we motivate, design, and implement APLOMB, a practical service for outsourcing enterprise middlebox processing  to the cloud. Our discussion of APLOMB is data-driven, guided by  a survey of 57 enterprise networks, the first large-scale academic  study of middlebox deployment. We show that APLOMB solves real  problems faced by network administrators, can outsource over 90%  of middlebox hardware in a typical large enterprise network, and,  in a case study of a real enterprise, imposes an average latency  penalty of 1.1ms and median bandwidth inflation of 3.8%。”

3，

• Robert Escriva, Bernard Wong, Emin Gün Sirer:  HyperDex: a distributed, searchable key-value store. 25-36

对这篇文章的内容比较陌生，主要是介绍对当前NoSQL数据库系统本地与实际远程database之间某一种提高实时性能的方法进行进一步的改进的研究。“The recent trend toward NoSQL data stores has been fueled by scalability and performance concerns at the cost of functionality. HyperDex bridges this gap by providing additional functionality without sacrificing scalability or performance.” 

摘要：“Distributed key-value stores are now a standard component of high-performance web services and cloud computing applications. While key-value stores offer significant performance and scalability advantages compared to traditional databases, they achieve these properties through a restricted API that limits object retrieval—an object can only be retrieved by the (primary and only) key under which it was inserted. This paper presents HyperDex, a novel distributed key-value store that provides a unique search primitive that enables queries on secondary attributes. The key insight behind HyperDex is the concept of hyperspace hashing in which objects with multiple attributes are mapped into a multidimensional hyperspace. This mapping leads to efficient implementations not only for retrieval by primary key, but also for partially-specified secondary attribute searches and range queries. A novel chaining protocol enables the system to achieve strong consistency, maintain availability and guarantee fault tolerance. An evaluation of the full system shows that HyperDex is 12-13×faster than Cassandra and MongoDB for finding partially specified objects. Additionally, HyperDex achieves 2-4 × higher throughput for get/put operations“

session 2 Wireless communication

4