Apparatus and methods employing wormhole structures supporting ultra-high density optical routing systems. Microstructures comprising wormhole tunnels are formed in optical looms with wormhole openings arranged in patterns, such as a high-density XY grid. Optical fibers are inserted into respective wormhole tunnels, and sleeves are used to precisely align fiber ends. A rack loom comprising a wormhole backplane is fabricated in a similar manner, with wormhole openings arrayed in the same patterns. The sleeves comprise plug-receptacle sleeve pairs, where when an optical loom (or connector bar of the optical loom) face urged toward the front face of the rack loom, the plug and receptacle sleeves are mated, resulting in precise alignment of the optical fiber ends in the pairs of sleeves. Palpebral structures may also be fabricated to provide a self-cleaning function with optional lubrication. The solutions provide more than an order of magnitude improvement over current fiber connector densities, while substantially reducing costs.

In one embodiment, a method comprises identifying, by a path computation element, essential parent devices from a nonstoring destination oriented directed acyclic graph (DODAG) topology as dominating set members belonging to a dominating set; receiving, by the path computation element, an advertisement message specifying a first dominating set member having reachability to a second dominating set member, the reachability distinct from the nonstoring DODAG topology; and generating, by the path computation element based on the advertisement message, an optimized path for reaching a destination network device in the nonstoring DODAG topology via a selected sequence of dominating set members, the optimized path providing cut-through optimization across the nonstoring DODAG topology.

A communication system in which a plurality of communication apparatuses in time synchronization with one another are connected over a network is provided. Each of the communication apparatuses includes management means for allowing transmission in accordance with a predetermined communication schedule, of cyclically transmitted first data to be used for control of a manufacturing apparatus or a production facility, second data which should be delivered to a destination within a designated time period, and third data different from the first and second data, selection means for selecting a data transfer scheme for each piece of data to be transmitted from among an on-the-fly scheme, a cut-through scheme, and a store-and-forward scheme based on the communication schedule, and a transmission and reception circuit which transfers each piece of data received from another communication apparatus to yet another communication apparatus in accordance with the data transfer scheme determined for that data.

This disclosure describes enhancements to Ethernet for use in higher performance applications like Storage, HPC, and Ethernet based fabric interconnects. This disclosure provides various mechanisms for lossless fabric enhancements with error-detection and retransmissions to improve link reliability, frame pre-emption to allow higher priority traffic over lower priority traffic, virtual channel support for deadlock avoidance by enhancing Class of service functionality defined in IEEE 802.1Q, a new header format for efficient forwarding/routing in the fabric interconnect and header CRC for reliable cut-through forwarding in the fabric interconnect. The enhancements described herein, when added to standard and/or proprietary Ethernet protocols, broadens the applicability of Ethernet to newer usage models and fabric interconnects that are currently served by alternate fabric technologies like Infiniband, Fibre Channel and/or other proprietary technologies, etc.

A method and a data bus subscriber are described for processing process data in a local bus, in particular a ring bus, the method including receiving a first symbol during a first number of working cycles, with the first symbol comprising first process data; loading at least one first instruction from an instruction list during the first number of working cycles, receiving a second symbol during a second number of working cycles, with the second symbol comprising second process data, processing the first process data contained in the first symbol with the at least one loaded first instruction during the second number of working cycles, and loading at least one second instruction for processing the second process data of the second symbol during the second number of working cycles.

A broker system dynamically adjusts data processing techniques used by a network gateway for forwarding data over a network from a client system to an exchange system based on a switch mode parameter. The broker system dynamically adjusts the network gateway from using an error-propagating data processing technique (e.g. cut-through switching) to a non-error-propagating data processing technique (e.g. store and forward switching) based on the switch mode parameter. In particular, the broker system may adjust the network gateway when a count of unsuccessfully validated protocol data units meets a threshold specified by the switch mode parameter. While using the error-propagating technique, the broker system may modify a portion of the data protocol unit corresponding to a transport layer of a network protocol used by the network when a protocol data unit is unsuccessfully validated.

Responsive to receiving the BGP UPDATE message, a route reflector may (1) update a CLUSTER_LIST value and, if needed, an ORIGINATOR_ID value, in a path attribute section in the BGP UPDATE message to generate a revised BGP UPDATE message, and (2) send the revised BGP UPDATE message to a client of the route reflector, regardless of whether or not one of (A) field validity checking of the BGP UPDATE message, (B) Adj-RIBS-In update using the BGP UPDATE message, (C) decision processing for route selection using information in the BGP UPDATE message, or (D) Adj-RIBS-Out update using the BGP UPDATE message, is completed (or perhaps even started). This provides faster route propagation and avoids delays associated with processing BGP UPDATE messages (NLRI with advertisements and withdrawals) at each hop the NLRIs using conventional BGP such as next-hop validation, best path selection, etc.

A system includes a cut-through bridge including a plurality of stages within a controller for communication packet transmission to transfer data and one or more control signals successively between the stages. The system also includes a control signal interceptor within the controller operable to intercept control signals between a first stage and a second stage of the cut-through bridge. The control signal interceptor is further operable to generate a forced valid control signal for each of the control signals regardless of an error condition of the control signals. The control signal interceptor outputs the forced valid control signal for each of the control signals to the second stage of the cut-through bridge. The forced valid control signal for each of the control signals is propagated through one or more successive stages of the cut-through bridge to an end stage to prevent an invalid state at the end stage.

Methods and network interface modules for processing packet headers are provided. The method comprises: receiving a packet comprising a header and a payload; generating, using the header, an initial packet header vector (PHV); providing the initial PHV to a pipeline comprising a plurality of processing stages; and processing the initial PHV in the pipeline, wherein the processing comprises, for a current processing stage in the plurality of processing stages: receiving, by the current processing stage, an input PHV, wherein the input PHV (i) is the initial PHV or a modified version of the initial PHV and (ii) comprises one or more flits, and applying a feature to the input PHV to generate an output PHV, including increasing an initial length of the input PHV if the initial length is not sufficient to apply the feature.

Responsive to receiving the BGP UPDATE message, a route reflector may (1) update a CLUSTER_LIST value and, if needed, an ORIGINATOR_ID value, in a path attribute section in the BGP UPDATE message to generate a revised BGP UPDATE message, and (2) send the revised BGP UPDATE message to a client of the route reflector, regardless of whether or not one of (A) field validity checking of the BGP UPDATE message, (B) Adj-RIBS-In update using the BGP UPDATE message, (C) decision processing for route selection using information in the BGP UPDATE message, or (D) Adj-RIBS-Out update using the BGP UPDATE message, is completed (or perhaps even started). This provides faster route propagation and avoids delays associated with processing BGP UPDATE messages (NLRI with advertisements and withdrawals) at each hop the NLRIs using conventional BGP such as next-hop validation, best path selection, etc.