コンピュータ・サイエンス : ACM computing surveys

Packet classification is an enabling function for a variety of Internet applications including quality of service, security, monitoring, and multimedia communications. In order to classify a packet as belonging to a particular flow or set of flows, network nodes must perform a search over a set of filters using multiple fields of the packet as the search key. In general, there have been two major threads of research addressing packet classification, algorithmic and architectural. A few pioneering groups of researchers posed the problem, provided complexity bounds, and offered a collection of algorithmic solutions. Subsequently, the design space has been vigorously explored by many offering new algorithms and improvements on existing algorithms. Given the inability of early algorithms to meet performance constraints imposed by high speed links, researchers in industry and academia devised architectural solutions to the problem. This thread of research produced the most widely-used packet classification device technology, Ternary Content Addressable Memory (TCAM). New architectural research combines intelligent algorithms and novel architectures to eliminate many of the unfavorable characteristics of current TCAMs. We observe that the community appears to be converging on a combined algorithmic and architectural approach to the problem. Using a taxonomy based on the high-level approach to the problem and a minimal set of running examples, we provide a survey of the seminal and recent solutions to the problem. It is our hope to foster a deeper understanding of the various packet classification techniques while providing a useful framework for discerning relationships and distinctions.

/pdf/survey-and-taxonomy-of-packet-classification-techniques-545k9nk529.pdf

Survey and taxonomy of packet classification techniques

Many network solutions and overlay networks utilize probabilistic techniques to reduce information processing and networking costs. This survey article presents a number of frequently used and useful probabilistic techniques. Bloom filters and their variants are of prime importance, and they are heavily used in various distributed systems. This has been reflected in recent research and many new algorithms have been proposed for distributed systems that are either directly or indirectly based on Bloom filters. In this survey, we give an overview of the basic and advanced techniques, reviewing over 20 variants and discussing their application in distributed systems, in particular for caching, peer-to-peer systems, routing and forwarding, and measurement data summarization.

/pdf/theory-and-practice-of-bloom-filters-for-distributed-systems-5a641nvijc.pdf

Theory and Practice of Bloom Filters for Distributed Systems

The growth in the popularity of interactive network games has increased the importance of a better understanding of the effects of packet loss and latency on user performance. While previous work on network games has studied user tolerance for high latencies and has studied the effects of latency on user performance in real-time strategy games, to the best of our knowledge, there has been no systematic study of the effects of loss and latency on user performance. In this paper we study user performance for Unreal Tournament 2003 (UT2003), a popular first person shooter game, under varying amounts of packet loss and latency. First, we deduced typical real world values of packet loss and latency experienced on the Internet by monitoring numerous operational UT2003 game servers. We then used these deduced values of loss and latency in a controlled networked environment that emulated various conditions of loss and latency, allowing us to monitor UT2003 at the network, application and user levels. We designed maps that isolated the fundamental first person shooter interaction components of movement and shooting, and conducted numerous user studies under controlled network conditions. We find that typical ranges of packet loss have no impact on user performance or on the quality of game play. The levels of latency typical for most UT2003 Internet servers, while sometimes unpleasant, do not significantly affect the outcome of the game. Since most first person shooter games typically consist of generic player actions similar to those that we tested, we believe that these results have broader implications.

The effects of loss and latency on user performance in unreal tournament 2003

Since the popularisation of the Internet in the 1990s, the cyberspace has kept evolving. We have created various computer-mediated virtual environments including social networks, video conferencing, virtual 3D worlds (e.g., VR Chat), augmented reality applications (e.g., Pokemon Go), and Non-Fungible Token Games (e.g., Upland). Such virtual environments, albeit non-perpetual and unconnected, have bought us various degrees of digital transformation. The term `metaverse' has been coined to further facilitate the digital transformation in every aspect of our physical lives. At the core of the metaverse stands the vision of an immersive Internet as a gigantic, unified, persistent, and shared realm. While the metaverse may seem futuristic, catalysed by emerging technologies such as Extended Reality, 5G, and Artificial Intelligence, the digital `big bang' of our cyberspace is not far away. This survey paper presents the first effort to offer a comprehensive framework that examines the latest metaverse development under the dimensions of state-of-the-art technologies and metaverse ecosystems, and illustrates the possibility of the digital `big bang'. First, technologies are the enablers that drive the transition from the current Internet to the metaverse. We thus examine eight enabling technologies rigorously - Extended Reality, User Interactivity (Human-Computer Interaction), Artificial Intelligence, Blockchain, Computer Vision, IoT and Robotics, Edge and Cloud computing, and Future Mobile Networks. In terms of applications, the metaverse ecosystem allows human users to live and play within a self-sustaining, persistent, and shared realm. Therefore, we discuss six user-centric factors -- Avatar, Content Creation, Virtual Economy, Social Acceptability, Security and Privacy, and Trust and Accountability. Finally, we propose a concrete research agenda for the development of the metaverse.

All One Needs to Know about Metaverse: A Complete Survey on Technological Singularity, Virtual Ecosystem, and Research Agenda

This paper describes the results of the first comprehensive analysis of a range of popular on-line, multiplayer, game servers. The results show that the traffic behavior of these servers is highly predictable and can be attributed to the fact that current game designs target the saturation of the narrowest, last-mile link. Specifically, in order to maximize the interactivity of the game itself and to provide relatively uniform experiences between players playing over different network speeds, on-line games typically fix their usage requirements in such a way as to saturate the network link of their lowest speed players. While the traffic observed is highly predictable, the traces also indicate that these on-line games provide significant challenges to current network infrastructure. As a result of synchronous game logic requiring an extreme amount of interactivity, a close look at the trace reveals the presence of large, highly periodic, bursts of small packets. With such stringent demands on interactivity, routers must be designed with enough capacity to quickly route such bursts without delay.

/pdf/a-traffic-characterization-of-popular-on-line-games-49w7egg6jk.pdf

A traffic characterization of popular on-line games

Many network devices such as routers and firewalls employ caches to take advantage of temporal locality of packet headers in order to speed up packet processing decisions Traditionally, cache designs trade off time and space with the goal of balancing the overall cost and performance of the device We examine another axis of the design space that has not been previously considered: accuracy In particular, we quantify the benefits of relaxing the accuracy of the cache on the cost and performance of packet classification caches Our cache design is based on the popular Bloom filter data structure This paper provides a model for optimizing Bloom filters for this purpose, as well as extensions to the data structure to support graceful aging, bounded misclassification rates, and multiple binary predicates Given this, we show that such caches can provide nearly an order of magnitude cost savings at the expense of misclassifying one billionth of packets for IPv6-based caches

/pdf/approximate-caches-for-packet-classification-o88uz84fhx.pdf

Approximate caches for packet classification

This poster describes the results of a 500 million packet trace of a popular on-line, multiplayer, game server. The results show that the traffic behavior of this heavily loaded game server is highly predictable and can be attributed to the fact that current game designs target the saturation of the narrowest, last-mile link (i.e. 56k modems). Specifically, in order to maximize the interactivity of the game itself and to provide relatively uniform experiences between players playing over different network speeds, on-line games typically fix their usage requirements in such a way as to saturate the network link of their lowest speed players. While the traffic observed is highly predictable, the trace also indicates that these on-line games provide significant challenges to current network infrastructure. As a result of synchronous game logic requiring an extreme amount of interactivity, a close look at the trace reveals the presence of large, highly periodic, bursts of small packets. With such stringent demands on interactivity, routers must be designed with enough capacity to quickly route such bursts without delay. As current routers are designed for bulk data transfers with larger packets, a significant, concentrated deployment of on-line game servers will have the potential for overwhelming current networking equipment.

/pdf/provisioning-on-line-games-a-traffic-analysis-of-a-busy-dq2uylw0rv.pdf

Provisioning on-line games: a traffic analysis of a busy counter-strike server

The fundamental goal of virtual worlds is to provide users with the illusion that they are all seeing and interacting with each other in a consistent world. State melding is the core of creating this illusion of a shared reality. It includes two major parts: consistency maintenance and state update dissemination. Well-designed state melding technologies are also critical for developing a virtual world that can scale to a large number of concurrent users and provide satisfying user experiences. In this article, we present a taxonomy of consistency models and categorization of state update dissemination technologies for virtual worlds. To connect theories and practices, we then apply the taxonomy to case study several state-of-the-art virtual worlds. We also discuss challenges and promising solutions of state melding in large-scale virtual worlds. This survey aims to provide a thorough understanding of existing approaches and their strength and limitations and to assist in developing solutions to improve scalability and performance of virtual worlds.

/pdf/survey-of-state-melding-in-virtual-worlds-3pumf1n8t3.pdf

Survey of state melding in virtual worlds

One of the most important aspects in determining the global traffic characteristics of on-line games is to model the traffic behavior of the client. While modeling the client ON-OFF times in web traffic has allowed researchers to generate accurate fractal models of aggregate web traffic, similar work has not yet been done for the domain of games. Previous work in client traffic behavior has shown that clients consume a nearly constant amount of resources when they are on. However, the distribution of the length of ON times for clients has not yet been established [1]. In this paper, we study the player session time distribution over a one-week trace of a popular on-line game server. Our results indicate that the session ON times of game clients steeply decays over time, with a knee at about 15--30 minutes. In addition, we show that the session time PDF can be fitted accurately with a Weibull distribution with parameters (β = 0.5, η = 20, and γ = 0), a result that diverges from previous studies of player session times [2].

/pdf/modeling-player-session-times-of-on-line-games-4ysey0uy1y.pdf

Francis Chang

Papers

A traffic characterization of popular on-line games

Approximate caches for packet classification

Provisioning on-line games: a traffic analysis of a busy counter-strike server

Survey of state melding in virtual worlds

Modeling player session times of on-line games