13 December 2017 in IEEE/ACM Transactions on Networking
Ternary content addressable memories (TCAMs) are frequently used for fast matching of packets against a given ruleset. While TCAMs can achieve fast matching, they are plagued by high update costs that can make them unusable in a high churn rate environment. We present, in this paper, a systematic and in-depth analysis of the TCAM update problem. We apply partial order theory to derive fundamental constraints on any rule ordering on TCAMs, which ensures correct checking against a given ruleset. This theoretical insight enables us to fully explore the TCAM update algorithms design space, to derive the optimal TCAM update algorithm (though it might not be suitable to be used in practice), and to obtain upper and lower bounds on the performance of practical update algorithms. Having lower bounds, we checked if the smallest update costs are compatible with the churn rate observed in practice, and we observed that this is not always the case. We therefore developed a heuristic based on ruleset splitting, with more than a single TCAM chip, that achieves significant update cost reductions (1.05~11.3x) compared with state-of-the-art techniques.
27 July 2016 in IEEE Transactions on Circuits and Systems for Video Technology
In mobile live streaming systems, users have fairly limited interactions with streaming objects due to the constraints coming from mobile devices and the event-driven nature of live content. The constraints could lead to unique user behavior characteristics, which have yet to be explored. This paper investigates over 9 million access logs collected from the PPTV live streaming system, with an emphasis on the discrepancies that might exist when users access the live streaming catalog from mobile and nonmobile terminals. We observe a much higher likelihood of abandoning sessions by mobile users and examine the structure of abandoned sessions from the perspectives of time of day, channel content, and mobile device types. Surprisingly, we find relatively low abandonment rates during peak-load time periods and a notable impact of mobile device type (i.e., Android or iOS) on the abandonment behavior. To further capture the intrinsic characteristics of user behavior, we develop a series of models for session duration, user activity, and time dynamics of user arrivals/departures. More importantly, we relate the model parameters to physical and real-life meanings. The observations and models shed light on a video delivery system, telco-content delivery networks, and mobile applications.
30 June 2011 in IEEE Communications Magazine
Programmable routers supporting virtualization are a key building block for bridging the gap between new Internet protocols and their deployment in real operational networks. This article presents the design and implementation of PEARL, a programmable virtual router platform with relatively high performance. It offers high flexibility by allowing users to control the configuration of both hardware and software data paths. The platform makes use of fast lookup in hardware and software exceptions in commodity multicore CPUs to achieve highspeed packet processing. Multiple isolated packet streams and virtualization techniques ensure isolation among virtual router instances.
16 December 2022 in Territory, Politics, Governance
In the second half of the 2010s, the Arabian Peninsula experienced major foreign policy changes that suggested a reshuffling of the region as a security complex. This paper offers an analysis of the geography of Internet data routing in the Middle East in order to assess whether foreign policy shifts apply to cyberspace and the potential for meaningful cybersecurity cooperation. We specifically focus on the Qatar blockade and the Abraham agreements. Our main hypothesis is that the architecture of connectivity can reveal the level of existing cooperation between data-routing operators of different countries and can therefore serve as one among many indicators for the level of trust (or lack thereof) between these countries and, as a result, for the potential success of cyber cooperation. We argue that the architecture of connectivity only partially reflects foreign policy shifts in the Gulf Region and despite the political announcements, digital borders and rivalries in the region remain deep and could potentially create obstacles for meaningful cybersecurity cooperation.
22 June 2022 in IEEE Transactions on Dependable and Secure Computing
Cloud computing provides a new paradigm to offer flexible IT infrastructures. In IaaS clouds, tenants deploy software-defined networking (SDN) policies to simplify network management and customize network behaviors. However, programming SDN networks is error-prone no matter using low-level APIs or high-level programming languages. Specifically, SDN policies may contain misconfigurations that do not break the pre-defined network invariants (e.g., black holes), but either degrade the deployment efficiency or mistakenly translate tenants intents. Prior studies for checking either traditional access control policies or network-wide invariants, are thus fail to detect these misconfigurations. To address this gap, this paper presents PMM, a misconfiguration checking tool for compositional SDN that works at the data plane of cloud networks. We first propose a new data structure, minimal interval set, to represent the match patterns of rulesets. This representation serves the basis for composition algebra construction and misconfiguration checking. We then propose the principles, algorithms and also optimisations for fast and accurate checking. We finally implement PMM in Covisor. Experiments with both real-world rulesets and synthetic rulesets show that PMM can detect misconfigurations of SDN policies in cloud networks within hundreds of milliseconds.