C. Muthukrishnan, V. Paxson, M. Allman, Aditya Akella
Today's networks discriminate towards or against traffic for a wide range of reasons, and in response end users and their applications increasingly attempt to evade monitoring and control, resulting in an ongoing tussle whose roots run deep. In this work we explore an architectural paradigm that can accommodate such tussles in a systematic and transparent fashion. The key idea at the core of our design is strongly typed networking: the notion that application messages contain type information that fully describes the content being transferred. Our framework allows for transparency between parties which then leads to dialog and choice for both users and service providers. While in the early stages, we provide a possible framework for directly addressing the tussle between end users and "the network" without resorting to an ever-increasing degree of obfuscation and inference.
{"title":"Using strongly typed networking to architect for tussle","authors":"C. Muthukrishnan, V. Paxson, M. Allman, Aditya Akella","doi":"10.1145/1868447.1868456","DOIUrl":"https://doi.org/10.1145/1868447.1868456","url":null,"abstract":"Today's networks discriminate towards or against traffic for a wide range of reasons, and in response end users and their applications increasingly attempt to evade monitoring and control, resulting in an ongoing tussle whose roots run deep. In this work we explore an architectural paradigm that can accommodate such tussles in a systematic and transparent fashion. The key idea at the core of our design is strongly typed networking: the notion that application messages contain type information that fully describes the content being transferred. Our framework allows for transparency between parties which then leads to dialog and choice for both users and service providers. While in the early stages, we provide a possible framework for directly addressing the tussle between end users and \"the network\" without resorting to an ever-increasing degree of obfuscation and inference.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116805363","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}
Ankit Singla, Atul Singh, Kishore Ramachandran, Lei Xu, Yueping Zhang
Full-bandwidth connectivity between all servers of a data center may be necessary for all-to-all traffic patterns, but such interconnects suffer from high cost, complexity, and energy consumption. Recent work has argued that if all-to-all traffic is uncommon, oversubscribed network architectures that can adapt the topology to meet traffic demands, are sufficient. In line with this work, we propose Proteus, an all-optical architecture targeting unprecedented topology-flexibility, lower complexity and higher energy efficiency.
{"title":"Proteus: a topology malleable data center network","authors":"Ankit Singla, Atul Singh, Kishore Ramachandran, Lei Xu, Yueping Zhang","doi":"10.1145/1868447.1868455","DOIUrl":"https://doi.org/10.1145/1868447.1868455","url":null,"abstract":"Full-bandwidth connectivity between all servers of a data center may be necessary for all-to-all traffic patterns, but such interconnects suffer from high cost, complexity, and energy consumption. Recent work has argued that if all-to-all traffic is uncommon, oversubscribed network architectures that can adapt the topology to meet traffic demands, are sufficient. In line with this work, we propose Proteus, an all-optical architecture targeting unprecedented topology-flexibility, lower complexity and higher energy efficiency.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128211910","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}
This paper examines an extreme point in the design space of programmable switches and network policy enforcement. Rather than relying on extensive changes to switches to provide more programmability, SideCar distributes custom processing code between shims running on every end host and general purpose sidecar processors, such as server blades, connected to each switch via commonly available redirection mechanisms. This provides applications with pervasive network instrumentation and programmability on the forwarding plane. While not a perfect replacement for programmable switches, this solves several pressing problems while requiring little or no change to existing switches. In particular, in the context of public cloud data centers with 1000s of tenants, we present novel solutions for multicast, controllable network bandwidth allocation (e.g., use-what-you-pay-for), and reachability isolation (e.g., a tenant's VM only sees other VMs of the tenant and shared services).
{"title":"SideCar: building programmable datacenter networks without programmable switches","authors":"Alan Shieh, Srikanth Kandula, E. G. Sirer","doi":"10.1145/1868447.1868468","DOIUrl":"https://doi.org/10.1145/1868447.1868468","url":null,"abstract":"This paper examines an extreme point in the design space of programmable switches and network policy enforcement. Rather than relying on extensive changes to switches to provide more programmability, SideCar distributes custom processing code between shims running on every end host and general purpose sidecar processors, such as server blades, connected to each switch via commonly available redirection mechanisms. This provides applications with pervasive network instrumentation and programmability on the forwarding plane. While not a perfect replacement for programmable switches, this solves several pressing problems while requiring little or no change to existing switches. In particular, in the context of public cloud data centers with 1000s of tenants, we present novel solutions for multicast, controllable network bandwidth allocation (e.g., use-what-you-pay-for), and reachability isolation (e.g., a tenant's VM only sees other VMs of the tenant and shared services).","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126830908","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}
Souvik Sen, N. Santhapuri, Romit Roy Choudhury, Srihari Nelakuditi
Successive interference cancellation (SIC) is a physical layer capability that allows a receiver to decode packets that arrive simultaneously. While the technique is well known in communications literature, emerging software radios are making practical experimentation feasible. This motivates us to study the extent of throughput gains possible with SIC from a MAC layer perspective. Contrary to our initial expectation, we find that the gains from SIC are not easily available in many realistic situations. Moreover, we observe that the scope for SIC gets squeezed by the advances in bitrate adaptation, casting doubt on the future of SIC based protocols.
{"title":"Successive interference cancellation: a back-of-the-envelope perspective","authors":"Souvik Sen, N. Santhapuri, Romit Roy Choudhury, Srihari Nelakuditi","doi":"10.1145/1868447.1868464","DOIUrl":"https://doi.org/10.1145/1868447.1868464","url":null,"abstract":"Successive interference cancellation (SIC) is a physical layer capability that allows a receiver to decode packets that arrive simultaneously. While the technique is well known in communications literature, emerging software radios are making practical experimentation feasible. This motivates us to study the extent of throughput gains possible with SIC from a MAC layer perspective. Contrary to our initial expectation, we find that the gains from SIC are not easily available in many realistic situations. Moreover, we observe that the scope for SIC gets squeezed by the advances in bitrate adaptation, casting doubt on the future of SIC based protocols.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125163285","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}
Mininet is a system for rapidly prototyping large networks on the constrained resources of a single laptop. The lightweight approach of using OS-level virtualization features, including processes and network namespaces, allows it to scale to hundreds of nodes. Experiences with our initial implementation suggest that the ability to run, poke, and debug in real time represents a qualitative change in workflow. We share supporting case studies culled from over 100 users, at 18 institutions, who have developed Software-Defined Networks (SDN). Ultimately, we think the greatest value of Mininet will be supporting collaborative network research, by enabling self-contained SDN prototypes which anyone with a PC can download, run, evaluate, explore, tweak, and build upon.
{"title":"A network in a laptop: rapid prototyping for software-defined networks","authors":"Bob Lantz, Brandon Heller, N. McKeown","doi":"10.1145/1868447.1868466","DOIUrl":"https://doi.org/10.1145/1868447.1868466","url":null,"abstract":"Mininet is a system for rapidly prototyping large networks on the constrained resources of a single laptop. The lightweight approach of using OS-level virtualization features, including processes and network namespaces, allows it to scale to hundreds of nodes. Experiences with our initial implementation suggest that the ability to run, poke, and debug in real time represents a qualitative change in workflow. We share supporting case studies culled from over 100 users, at 18 institutions, who have developed Software-Defined Networks (SDN). Ultimately, we think the greatest value of Mininet will be supporting collaborative network research, by enabling self-contained SDN prototypes which anyone with a PC can download, run, evaluate, explore, tweak, and build upon.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122565327","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}
Links and content references form the foundation of the way that users interact today. Unfortunately, the links used today (URLs) are fragile since they tightly specify a protocol, host, and filename. Some past efforts have decoupled this binding to a certain degree; e.g., creating links that bind to byte-level data. We argue that these systems do not go far enough. Our key observation is that users really care about the intent of the referenced link and are relatively agnostic to the byte-level representation. Based on this observation, we argue that references should be bound to the underlying information associated with the referenced content. We call such references Information-Bound References (IBR). In this paper, we focus on the challenges of creating IBRs for multimedia data, since these form a dominant fraction of Internet traffic today. We explore the trade-offs of various alternatives for generating and using IBRs. We identify that it is possible to adapt multimedia fingerprinting algorithms in the literature to generate IBRs.
{"title":"A case for information-bound referencing","authors":"Ashok Anand, Aditya Akella, V. Sekar, S. Seshan","doi":"10.1145/1868447.1868451","DOIUrl":"https://doi.org/10.1145/1868447.1868451","url":null,"abstract":"Links and content references form the foundation of the way that users interact today. Unfortunately, the links used today (URLs) are fragile since they tightly specify a protocol, host, and filename. Some past efforts have decoupled this binding to a certain degree; e.g., creating links that bind to byte-level data. We argue that these systems do not go far enough. Our key observation is that users really care about the intent of the referenced link and are relatively agnostic to the byte-level representation. Based on this observation, we argue that references should be bound to the underlying information associated with the referenced content. We call such references Information-Bound References (IBR). In this paper, we focus on the challenges of creating IBRs for multimedia data, since these form a dominant fraction of Internet traffic today. We explore the trade-offs of various alternatives for generating and using IBRs. We identify that it is possible to adapt multimedia fingerprinting algorithms in the literature to generate IBRs.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134564194","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}
Souvik Sen, Romit Roy Choudhury, Srihari Nelakuditi
Conventional WiFi networks perform channel contention in time domain. This is known to be wasteful because the channel is forced to remain idle, while all contending nodes are backing off for multiple time slots. This paper proposes to break away from convention and recreate the backing off operation in the frequency domain. Our basic idea is to pretend that OFDM subcarriers are integer numbers, and thereby, view today's random backoff process as equivalent to transmitting on a randomly chosen subcarrier. By employing a second antenna to listen to all the subcarriers, each node can determine whether its chosen integer (or subcarrier) is the smallest among all others. In fact, each node can even determine the rank of its chosen integer, enabling the feasibility of a TDMA-like schedule from every round of contention. We develop these ideas into a Time to Frequency (T2F) protocol and prototype it on a small testbed of 8 USRPs. Experiments confirm its feasibility, along with promising throughput gains of more than 35% at high bit rates. A fuller design and thorough evaluation of T2F is a topic of ongoing work.
{"title":"Listen (on the frequency domain) before you talk","authors":"Souvik Sen, Romit Roy Choudhury, Srihari Nelakuditi","doi":"10.1145/1868447.1868463","DOIUrl":"https://doi.org/10.1145/1868447.1868463","url":null,"abstract":"Conventional WiFi networks perform channel contention in time domain. This is known to be wasteful because the channel is forced to remain idle, while all contending nodes are backing off for multiple time slots. This paper proposes to break away from convention and recreate the backing off operation in the frequency domain. Our basic idea is to pretend that OFDM subcarriers are integer numbers, and thereby, view today's random backoff process as equivalent to transmitting on a randomly chosen subcarrier. By employing a second antenna to listen to all the subcarriers, each node can determine whether its chosen integer (or subcarrier) is the smallest among all others. In fact, each node can even determine the rank of its chosen integer, enabling the feasibility of a TDMA-like schedule from every round of contention. We develop these ideas into a Time to Frequency (T2F) protocol and prototype it on a small testbed of 8 USRPs. Experiments confirm its feasibility, along with promising throughput gains of more than 35% at high bit rates. A fuller design and thorough evaluation of T2F is a topic of ongoing work.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"104 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114094100","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}
Wireless networks play an important role in our everyday lives, at the workplace and at home. However, they are also relatively vulnerable: physically located off site, attackers can circumvent wireless security protocols such as WEP, WPA, and even to some extent WPA2, presenting a security risk to the entire network. To address this problem, we propose SecureAngle, a system designed to operate alongside existing wireless security protocols, adding defense in depth. SecureAngle leverages multi-antenna APs to profile the directions at which a client's signal arrives, using this angle-of-arrival (AoA) information to construct signatures that uniquely identify each client. We identify SecureAngle's role of providing a fine-grained location service in a multi-path indoor environment. With this location information, we investigate how an AP might create a "virtual fence" that drops frames received from clients physically located outside a building or office. With SecureAngle signatures, we also identify how an AP can prevent malicious parties from spoofing the link-layer address of legitimate clients. We discuss how SecureAngle might aid whitespace radios in yielding to incumbent transmitters, as well as its role in directional downlink transmissions with uplink AoA information.
{"title":"SecureAngle: improving wireless security using angle-of-arrival information","authors":"Jie Xiong, K. Jamieson","doi":"10.1145/1868447.1868458","DOIUrl":"https://doi.org/10.1145/1868447.1868458","url":null,"abstract":"Wireless networks play an important role in our everyday lives, at the workplace and at home. However, they are also relatively vulnerable: physically located off site, attackers can circumvent wireless security protocols such as WEP, WPA, and even to some extent WPA2, presenting a security risk to the entire network. To address this problem, we propose SecureAngle, a system designed to operate alongside existing wireless security protocols, adding defense in depth. SecureAngle leverages multi-antenna APs to profile the directions at which a client's signal arrives, using this angle-of-arrival (AoA) information to construct signatures that uniquely identify each client. We identify SecureAngle's role of providing a fine-grained location service in a multi-path indoor environment. With this location information, we investigate how an AP might create a \"virtual fence\" that drops frames received from clients physically located outside a building or office. With SecureAngle signatures, we also identify how an AP can prevent malicious parties from spoofing the link-layer address of legitimate clients. We discuss how SecureAngle might aid whitespace radios in yielding to incumbent transmitters, as well as its role in directional downlink transmissions with uplink AoA information.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124711197","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}
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or node failures. The technique employs only one bit in the packet header to cover any single link failures, and in the order of log2(d) bits to cover all non-disconnecting failure combinations, where d is the diameter of the network. We show that our routing strategy is effective and that its path length stretch is acceptable for realistic topologies. The packet header overhead incurred by PR is very small, and the extra memory and packet processing time required to implement it at each router are insignificant. This makes PR suitable for loss-sensitive, mission-critical network applications.
{"title":"Packet re-cycling: eliminating packet losses due to network failures","authors":"Suksant Sae Lor, R. Landa, M. Rio","doi":"10.1145/1868447.1868449","DOIUrl":"https://doi.org/10.1145/1868447.1868449","url":null,"abstract":"This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or node failures. The technique employs only one bit in the packet header to cover any single link failures, and in the order of log2(d) bits to cover all non-disconnecting failure combinations, where d is the diameter of the network. We show that our routing strategy is effective and that its path length stretch is acceptable for realistic topologies. The packet header overhead incurred by PR is very small, and the extra memory and packet processing time required to implement it at each router are insignificant. This makes PR suitable for loss-sensitive, mission-critical network applications.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127774088","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}
J. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, Andrew R. Curtis, S. Banerjee
The OpenFlow framework enables flow-level control over Ethernet switching, as well as centralized visibility of the flows in the network. OpenFlow's coupling of these features comes with costs, however: the distributed-system costs of involving the OpenFlow controller on flow setups, and the switch-implementation costs of involving the switch's control plane too often. In this paper, we analyze the overheads, and we propose DevoFlow, a modification of the OpenFlow model in which we try to gently break the coupling between centralized control and centralized visibility, in a way that maintains a useful amount of visibility without imposing unnecessary costs.
{"title":"DevoFlow: cost-effective flow management for high performance enterprise networks","authors":"J. Mogul, J. Tourrilhes, P. Yalagandula, P. Sharma, Andrew R. Curtis, S. Banerjee","doi":"10.1145/1868447.1868448","DOIUrl":"https://doi.org/10.1145/1868447.1868448","url":null,"abstract":"The OpenFlow framework enables flow-level control over Ethernet switching, as well as centralized visibility of the flows in the network. OpenFlow's coupling of these features comes with costs, however: the distributed-system costs of involving the OpenFlow controller on flow setups, and the switch-implementation costs of involving the switch's control plane too often.\u0000 In this paper, we analyze the overheads, and we propose DevoFlow, a modification of the OpenFlow model in which we try to gently break the coupling between centralized control and centralized visibility, in a way that maintains a useful amount of visibility without imposing unnecessary costs.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114221802","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：