26,433 research outputs found
SecureAngle: Improving wireless security using angle-of-arrival information
Based on paper for ACM SIGCOMM Conference, August 30-September 3, 2010, New Delhi, India</p
Towards Transiently Secure Updates in Asynchronous SDNs
© ACM 2016. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 2016 Conference on ACM SIGCOMM 2016 Conference - SIGCOMM ’16, http://dx.doi.org/10.1145/2934872.2959083.Software-Defined Networks (SDNs) promise to overcome the often complex and error-prone operation of tradi- tional computer networks, by enabling programmabil- ity, automation and verifiability. Yet, SDNs also in- troduce new challenges, for example due to the asyn- chronous communication channel between the logically centralized control platform and the switches in the data plane. In particular, the asynchronous commu- nication of network update commands (e.g., OpenFlow FlowMod messages) may lead to transient inconsisten- cies, such as loops or bypassed waypoints (e.g., fire- walls). One approach to ensure transient consistency even in asynchronous environments is to employ smart scheduling algorithms: algorithms which update subsets of switches in each communication round only, where each subset in itself guarantees consistency. In this demo, we show how to change routing policies in a transiently consistent manner. We demonstrate two al- gorithms, namely, Wayup [5] and Peacock [4], which partition the network updates sent from SDN controller towards OpenFlow software switches into multiple rounds as per respective algorithms. Later, the barrier mes- sages are utilized to ensure reliable network updates.EC/FP7/619609/EU/Unifying Cloud and Carrier Networks/UNIF
On Optimal Neighbor Discovery
Mobile devices apply neighbor discovery (ND) protocols to wirelessly initiate
a first contact within the shortest possible amount of time and with minimal
energy consumption. For this purpose, over the last decade, a vast number of ND
protocols have been proposed, which have progressively reduced the relation
between the time within which discovery is guaranteed and the energy
consumption. In spite of the simplicity of the problem statement, even after
more than 10 years of research on this specific topic, new solutions are still
proposed even today. Despite the large number of known ND protocols, given an
energy budget, what is the best achievable latency still remains unclear. This
paper addresses this question and for the first time presents safe and tight,
duty-cycle-dependent bounds on the worst-case discovery latency that no ND
protocol can beat. Surprisingly, several existing protocols are indeed optimal,
which has not been known until now. We conclude that there is no further
potential to improve the relation between latency and duty-cycle, but future ND
protocols can improve their robustness against beacon collisions.Comment: Conference of the ACM Special Interest Group on Data Communication
(ACM SIGCOMM), 201
Overbooking Network Slices End-to-End: Implementation and Demonstration
This paper has been presented at: ACM SIGCOMM 2018 Conference on Posters and DemosThe novel network slicing paradigm allows service providers to open their infrastructure to new business players such as vertical industries. In this demo, we showcase the benefits of our proposed end-to-end network slicing orchestration solution that blends together i) an admission control engine able to handle heterogeneous network slice requests, ii) a resource allocation solution across multiple network domains: radio access, edge, transport and core networks and iii) a monitoring, forecasting and dynamic configuration solution that maximizes the statistical multiplexing of network slices resources. Our orchestration solution is operated through a dashboard that allows requesting network slices on-demand, monitors their performance once deployed and displays the achieved multiplexing gain through overbooking
An Internet Heartbeat
Obtaining sound inferences over remote networks via active or passive
measurements is difficult. Active measurement campaigns face challenges of
load, coverage, and visibility. Passive measurements require a privileged
vantage point. Even networks under our own control too often remain poorly
understood and hard to diagnose. As a step toward the democratization of
Internet measurement, we consider the inferential power possible were the
network to include a constant and predictable stream of dedicated lightweight
measurement traffic. We posit an Internet "heartbeat," which nodes periodically
send to random destinations, and show how aggregating heartbeats facilitates
introspection into parts of the network that are today generally obtuse. We
explore the design space of an Internet heartbeat, potential use cases,
incentives, and paths to deployment
Packet Transactions: High-level Programming for Line-Rate Switches
Many algorithms for congestion control, scheduling, network measurement,
active queue management, security, and load balancing require custom processing
of packets as they traverse the data plane of a network switch. To run at line
rate, these data-plane algorithms must be in hardware. With today's switch
hardware, algorithms cannot be changed, nor new algorithms installed, after a
switch has been built.
This paper shows how to program data-plane algorithms in a high-level
language and compile those programs into low-level microcode that can run on
emerging programmable line-rate switching chipsets. The key challenge is that
these algorithms create and modify algorithmic state. The key idea to achieve
line-rate programmability for stateful algorithms is the notion of a packet
transaction : a sequential code block that is atomic and isolated from other
such code blocks. We have developed this idea in Domino, a C-like imperative
language to express data-plane algorithms. We show with many examples that
Domino provides a convenient and natural way to express sophisticated
data-plane algorithms, and show that these algorithms can be run at line rate
with modest estimated die-area overhead.Comment: 16 page
- …