Abstract: An active EMI shield for protecting medical instruments from mobile RF emitters uses RFID tags and tag readers to facilitate identification of an RF emitter entering the EMI shield. Clinicians and mobile RF emitters are tagged with RFIDs that indicate their identity, and possibly RF power level. Medical instruments are either tagged with RFIDs that indicate their identity and susceptibility to EMI, or equipped with RFID readers/EMI sensors. The proximity of the RF emitter relative to the medical instrument in terms of power density can then be determined by either position-sensitive RFID readers or the EMI sensors affixed to the medical instruments. The shield is executed by signaling to the tagged RF emitter when it reaches a predetermined proximity relative to the medical instrument.

Abstract: Methods and devices for reducing traffic over a wireless link through the compression or suppression of high layer packets carrying predictable background data prior to transportation over a wireless link. The methods include intercepting application layer protocol packets carrying the predictable background data. In embodiments where the background data is periodic in nature, the high layer packets may be compressed into low-layer signaling indicators for communication over a low-layer control channel (e.g., an on off keying (OOK) channel). Alternatively, the high layer packets may be suppressed entirely (not transported over the wireless link) when a receiver side daemon is configured to autonomously replicate the periodic background nature according to a projected interval. In other embodiments, compression techniques may be used to reduce overhead attributable to non-periodic background data that is predictable in context.

Abstract: Routes may be installed across multiple link state protocol controlled Ethernet network areas by causing ABBs to leak I-SID information advertised by BEBs in a L1 network area into an L2 network area. ABBs will only leak I-SIDs for BEBs where it is the closest ABB for that BEB. Where another ABB on the L2 network also leaks the same I-SID into the L2 network area from another L1 network area, the I-SID is of multi-area interest. ABBs will advertise I-SIDs that are common to the L1 and L2 networks back into their respective L1 network. Within each L1 and L2 network area, forwarding state will be installed between network elements advertising common interest in an ISID, so that multi-area paths may be created to span the L1/L2/L1 network areas. The L1/L2/L1 network structure may recurse an arbitrary number of times.

Abstract: An apparatus for performing network function virtualization (NFV), comprising: a memory, a processor coupled to the memory, wherein the memory includes instructions that when executed by the processor cause the apparatus to perform the following: receive an instruction to virtualize a network device within a network, divide, according to the instruction, the network device into a plurality of network functions (NFs) used to form a virtualized network node that corresponds to the network device, launch the NFs within one or more virtual containers, and group the virtual containers together using a group identifier (ID) that corresponds to the virtualized network node, wherein each of the NFs correspond to a network function performed by the network device prior to virtualization.

Abstract: An apparatus comprising a node that uses a set of determined virtual local area network (VLAN) identifier (VIDs) to provide a hop limit for a packet forwarded by the node in a network. Also disclosed is a network component comprising a receiver that receives a packet comprising a VID that belongs to a determined set of ordered VIDs, a processor that substitutes the VID in the packet from the set of ordered VIDs and maps the VID to a next hop or instead drops the VID if the VID is a last ordered VID of the ordered VIDs, and a transmitter that forwards the packet comprising the substituted VID to the mapped next hop.

Abstract: A system for interfacing a client system in a first network domain with a Provider Link State Bridging (PLSB) domain includes at least two Backbone Edge Bridges (BEBs) of the PLSB domain. Each BEB is an end-point of a connection in the first network domain to the client system and an end-point of at least a unicast path in the PLSB domain. An inter-node trunk is provided in the PLSB domain for interconnecting the BEBs. A phantom node is defined in the PLSB domain and is notionally located on the inter-node trunk. Each of the BEBs is configured such that: an ingress packet received from the client system via the connection in the first network domain is forwarded through a path notionally rooted at the phantom node; and an egress packet destined for the client system is forwarded to the client system through the connection in the first network domain.

Abstract: A link state network comprising a plurality of interconnected nodes, and a multiprotocol label switching (MPLS) tree established amongst at least some of the interconnected nodes, wherein the MPLS tree is associated with an MPLS label, and wherein the interconnected nodes are configured to deterministically forward a plurality of link state update (LSU) packets comprising the MPLS label over the MPLS tree.

Abstract: In one embodiment, a method for multi-wavelength encoding includes receiving an input optical packet stream having an address and data and encoding the address of the input optical packet stream producing an encoded address including a first group of symbols including a first selected symbol, where the first group of symbols has more than two symbols. The method also includes generating a first wavelength in accordance with the first selected symbol and generating an output optical packet stream having the data of the input optical packet and the first wavelength, where the first wavelength corresponds to the first selected symbol. Additionally, the method includes modulating the first wavelength with the input optical packet stream.

Abstract: In one embodiment, a system for accelerating a packet stream includes a first accelerator configured to re-clock the packet stream from a first clock rate to a second clock rate to produce an accelerated packet stream, where the first clock rate is less than the second clock rate, where the packet stream has a first inter-packet gap, where the accelerated packet stream has a second inter-packet gap, and where the second inter-packet gap is greater than the first inter-packet gap. The system also includes a switch coupled to the first accelerator, where the switch is configured to switch the accelerated packet stream at the second clock rate to produce a switched packet stream.

Abstract: Connection constraints are flooded using an extension to a routing protocol being used to control forwarding on network. Nodes maintain topology and connection database and calculate routes for connections based on the constraints. If a node is on a calculated route for a connection it will install forwarding state for the connection. Since each node has a consistent view of the network topology and has been provided with the constraints associated with the connection, each node on the network will calculate the same route for the connection. When a failure occurs, the nodes will calculate restoration paths for the connections on a network-wide priority basis to enable restoration paths to be created for the affected connections without requiring the restoration paths to be signaled. Time-stamps are used to allow events to be applied by nodes in a consistent order regardless of the order in which they arrive.

Abstract: A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network. The DHT may be implemented to store MAC addresses, IP addresses, MPLS labels, or other information.

Abstract: A ring control protocol is used to establish a separate control plane for a plurality of physically dual homed devices to enable collections of dual homed devices to be represented by a single pair of addresses into the attached routed Ethernet network. The gateway devices analyze the passing ring control packets to create direct mappings for data packets to the routed Ethernet network. Thus, although the dual homed devices are treated as a ring from a control perspective, the data path is implemented to be direct so that data packets continue to flow directly from the dual homed devices to each of the attached gateway devices. In one embodiment, each of the gateway devices implements a virtual switch and advertises the MAC address of the virtual switch into the routed Ethernet network rather than the MAC addresses of each of the attached Ethernet Switch Units.

Abstract: A method and apparatus in provided which enables fast layer 2 reconfiguration in a network that includes Routing Bridges. Each Routing Bridge stores, for each forwarding target, identifiers of a primary next Rbridge and an alternate next Rbridge. The forwarding target may be a network end node, or an Egress Rbridge associated with the network end node. In response to a trigger condition, layer 2 communications are selectively switched from a path that includes the primary next Rbridge device to a path that includes the alternate next Rbridge device.

Abstract: A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.

Abstract: Link identifiers such as VIDs, selected from a defined range of values, are locally assigned by each node on a link state protocol controlled Ethernet network to each of its links or adjacencies. The link identifiers are assigned by the nodes such that each link or adjacency at the node is uniquely identified by a different link identifier. A link state protocol adjacency notification mechanism or other flooding mechanism is used to disseminate the locally assigned link identifiers to other nodes on the link state protocol controlled Ethernet network. The link identifiers are added by the nodes to their topology databases to enable detour routes to be locally calculated by the nodes on the network in a distributed manner. Upon occurrence of a failure, the link identifiers are used to source route traffic around the failure so that traffic may continue to traverse the link state protocol controlled Ethernet network.

Abstract: A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.

Abstract: A method of peer interfacing a Link-State controlled network domain with an Ethernet Bridging controlled network domain. A pair of peer attachment points are provided between the Link-State controlled network domain and the Ethernet Bridging domain. The peer attachment points are respective endpoints of a set of one or more LAN segments defined within the Ethernet Bridging domain. The set of LAN segments are represented as a virtual node in the Link-State controlled network domain. The virtual node is represented in the Link-State controlled network domain as connected to each of the peer attachment points via a respective virtual link. The virtual links are configured such that frames to or from an address in the Link-State controlled network domain are forwarded over a tree passing through only one of the peer attachments points.

Abstract: A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network.

Abstract: A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified.

Abstract: A ring control protocol is used to establish a separate control plane for a plurality of physically dual homed devices to enable collections of dual homed devices to be represented by a single pair of addresses into the attached routed Ethernet network. The gateway devices analyze the passing ring control packets to create direct mappings for data packets to the routed Ethernet network. Thus, although the dual homed devices are treated as a ring from a control perspective, the data path is implemented to be direct so that data packets continue to flow directly from the dual homed devices to each of the attached gateway devices. In one embodiment, each of the gateway devices implements a virtual switch and advertises the MAC address of the virtual switch into the routed Ethernet network rather than the MAC addresses of each of the attached Ethernet Switch Units.