The Transmission Control Protocol.

A method for programming a MAC address table by a first leaf node in a network comprising a plurality of leaf nodes is provided. Each leaf node comprises one or more Virtual Tunnel End Points (“VTEPs”) and instantiates a plurality of Virtual Routing and Forwarding elements (“VRFs”), with a corresponding Bridge Domain (“BD”) assigned to each VRF. The method includes obtaining information indicating one or more VTEP Affinity Groups (VAGs), each VAG comprising an identification of one VTEP per leaf node, obtaining information indicating assignment of each VRF to one of the VAGs, assigning each VAG to a unique Filtering Identifier (“FID”), thereby generating one or more FIDs, and programming the MAC address table, using FIDs instead of BDs, by populating the MAC address table with a plurality of entries, each entry comprising a unique combination of a FID and a MAC address of a leaf node.

Scalable handling of bgp route information in vxlan with evpn control plane

An example method for diagnosis and throughput measurement of FC ports in a SAN environment is provided and includes generating, by a control processor at a generator in the SAN, a control packet requesting a link test to be performed with a reflector in the SAN, sending the control packet to the reflector through a media access controller (MAC) of the generator, receiving, at the MAC of the generator, an acknowledgement from the reflector indicating ability to perform the requested link test, generating, at the MAC of the generator, a test data packet for the link test, performing the link test with the reflector, and analyzing, at the generator, network parameters based on results of the link test.

Diagnosis and throughput measurement of fibre channel ports in a storage area network environment

Embodiments include receiving an indication of a data storage module to be associated with a tenant of a distributed storage system, allocating a partition of a disk for data of the tenant, creating a first association between the data storage module and the disk partition, creating a second association between the data storage module and the tenant, and creating rules for the data storage module based on one or more policies configured for the tenant. Embodiments further include receiving an indication of a type of subscription model selected for the tenant, and selecting the disk partition to be allocated based, at least in part, on the subscription model selected for the tenant. More specific embodiments include generating a storage map indicating the first association between the data storage module and the disk partition and indicating the second association between the data storage module and the tenant.

Tenant-level sharding of disks with tenant-specific storage modules to enable policies per tenant in a distributed storage system

New emerging network applications such as Industry 4.0, haptic applications, and holographic-type communications will require support for stringent end-to-end latency objectives with precisely specified lower and upper bounds. These requirements will push current best-effort Internet technology and QoS mechanisms to their limit. This paper presents a new approach to achieve high-precision latency objectives, carrying latency objectives as part of packet metadata and taking differentiated actions at network nodes depending on a packet’s remaining latency budget, its destination, and the latency encountered so far. A Proof-of-Concept has been developed using BPP, a novel programmable networking framework.

High-Precision Latency Forwarding over Packet-Programmable Networks

A method is provided in one example embodiment and includes, for each of a plurality of individual storage units collectively comprising a virtual storage unit, mapping an internal address of the storage unit to a unique IP address, wherein each of the storage units comprises a block of storage on one of a plurality of physical storage devices and wherein the IP address includes a virtual storage unit number identifying the virtual storage unit; receiving from a client a request to perform an operation on at least one of the data storage units, wherein the request identifies the internal address of the at least one of the data storage units; translating the internal address of the at least one of the data storage unit to the unique IP address of the at least one of the data storage units; and performing the requested operation on the at least one of the data storage units.

Techniques for implementing ipv6-based distributed storage space

Beyond the transport of uncompressed video over IP networks, defined in standards such as ST2022–6, the ability to build software-based Video Processing Functions (VPF) on commodity hardware and using general purpose Operating Systems is the next logical step in the evolution of the media industry towards an “all-IP” world. In that context, understanding the jitter induced on an ST2022–6 stream by a commodity platform is essential. This paper describes a general methodology to enumerate jitter sources on commodity platforms and to quantity their relative contribution to the overall system jitter. The methodology is applied to the Linux kernel, producing a classification of the different sources of jitter, and a quantification of their impact.

Chasing Linux Jitter Sources for Uncompressed Video

Because it is very bursty, the microsecond-scale temporal behaviour of network traffic in data-centres is challenging to measure and understand To bring observability into data-centre networks, this paper introduces the Open Platform for Programmable Precise Packet Timestamping (OP4T), a hardware architecture, targeting Field-Programmable Gateway Arrays (FPGAs), integrated into data-centre servers as a Smart Network Interface Card (SmartNIC), and flexible enough to enable advanced latency diagnosisIn this paper, OP4T is specified, and an open-source implementation of that architecture is proposed, targeting the NetFPGA SUME prototyping board By leveraging the P4 programming language, and partial reconfiguration, that opensource implementation is experimentally shown to enable in-band, precise packet timestamping, without sacrificing the achievable throughput As an illustration, OP4T is shown to be usable to measure fine-grained properties of a software packet forwarder, eg, packet batching

OP4T: Bringing Advanced Network Packet Timestamping into the Field

This paper addresses the problem of high-quality packet pacing for constant-rate packet consumption systems, with strict buffering limitations. A mostly-software pacing architecture is developed, which has minimal hardware requirements, satisfied by commodity servers – rendering the proposed solution easily deployable in existing (data-centre) infrastructures. Two algorithms ( free-running and frequency-controlled pacing, for explicitly and implicitly indicated target rates, respectively) are specified, and formally analysed. The proposed solution, including both algorithms, is implemented, and is tested on real hardware and under real conditions. The performance of these implementations is experimentally evaluated and compared to existing mechanisms, available in general-purpose hardware. Results of both exhaustive experiments, and of an analytical modeling, indicate that the proposed approach is able to perform low-jitter packet pacing on commodity hardware, being thus suitable for constant rate transmission and consumption in media production scenarios.

/pdf/high-accuracy-packet-pacing-on-commodity-servers-for-1egz01ngqw.pdf

High-Accuracy Packet Pacing on Commodity Servers for Constant-Rate Flows

Techniques are provided for storing data in a distributed storage system. A server stores an object according to a first storage policy in the distributed storage system that includes a plurality of storage nodes. Storing the object according to the first storage policy results in a first storage overhead for the object. The server receives a triggering event associated with the object, and the triggering event changes an attribute of the object. In response to the triggering event, the server identifies a second storage policy for the object. Storing the object according to the second storage policy results in a second storage overhead for the object different from the first storage overhead.

Mohammed Hawari

Papers

Techniques for implementing ipv6-based distributed storage space

Chasing Linux Jitter Sources for Uncompressed Video

OP4T: Bringing Advanced Network Packet Timestamping into the Field

High-Accuracy Packet Pacing on Commodity Servers for Constant-Rate Flows

Hybrid distributed storage system to dynamically modify storage overhead and improve access performance