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: 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: In at least some embodiments, the disclosure includes an apparatus a root node in a packet based network that multicasts a plurality of packets. The apparatus also includes an intermediary node coupled to the root node and a plurality of leaf nodes coupled to the intermediary node. The root node, the intermediary node, and the plurality of leaf nodes are arranged in a tree topology. The packets are received at the intermediary node from the root node at a data rate equal to the data rate of the leaf node having the maximum data rate. The packets are multicast from the intermediary node to each of the plurality of leaf nodes at a plurality of different data rates such that each particular one of the plurality of leaf nodes receives the packets at a data rate corresponding to the data rate for the particular one of the plurality of leaf nodes.

Abstract: XML appliances/routers may be organized to implement one or more XML distribution rings to enable XML documents/messages to be distributed efficiently. The rings may be logical or physical. The XML distribution rings enable the XML documents/messages to be exchanged without requiring the XML appliances/routers to run a routing protocol to determine how XML documents/messages should be distributed through the network. Documents may be transmitted in one way on the ring or may be transmitted in both directions around the ring to enable the ring to tolerate failure of an XML appliance/router. Each XML appliance/router will receive all XML documents/messages and will make routing decisions for those clients that have provided the XML appliance/router with XML subscriptions. The subscriptions may be formed according to the XPath standard or in another manner.

Abstract: A set of critical nodes or links is identified on the network and alternate forwarding state is pre-computed and disseminated within a node such that, upon failure of one of the critical nodes/links, a minimal trigger will cause the alternate forwarding state to be used to forward traffic on the routed Ethernet mesh network. In one embodiment rather than storing full tables of alternate forwarding state, only the changes to the forwarding state required by an identified failure is stored by the network nodes. Upon occurrence of a failure on the network, the identified failure is used to select the alternate forwarding state.

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 method of determining whether to set up a delay-sensitive communication session over an internet protocol (IP) based network includes sharing link state information among the network nodes of the link state protocol controlled network, receiving an IP packet that conveys a request to set up a delay-sensitive communication session over the network; determining, based on the shared link state information, a shortest path through the link state protocol controlled network for the requested delay-sensitive communication session and whether the shortest path is deemed suitable for the delay-sensitive communication session, and setting up the delay-sensitive communication session over the shortest path only when the shortest path is deemed suitable for the delay-sensitive communication session.

Abstract: A method implemented by a hypervisor located in a first network device (ND), the method comprising sending to and receiving from a second ND a first type of packet, wherein each packet of the first type of packet comprises media access control (MAC) layer information of a client; and sending to and receiving from a third ND a second type of packet, wherein each packet of the second type of packet contains no client MAC layer information.

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: XML appliances/routers may be organized to implement one or more XML distribution rings to enable XML documents/messages to be distributed efficiently. The rings may be logical or physical. The XML distribution rings enable the XML documents/messages to be exchanged without requiring the XML appliances/routers to run a routing protocol to determine how XML documents/messages should be distributed through the network. Documents may be transmitted in one way on the ring or may be transmitted in both directions around the ring to enable the ring to tolerate failure of an XML appliance/router. Each XML appliance/router will receive all XML documents/messages and will make routing decisions for those clients that have provided the XML appliance/router with XML subscriptions. The subscriptions may be formed according to the XPath standard or in another manner.

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: 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: Shortest-path spanning trees are created outward from each portal on a Rbridge network with nodes on the network being assigned to the spanning trees. For those nodes equidistant to two portals, an election process is used to determine which tree the node should join. To enable routes associated with nodes on the Rbridge network to be distinguished from routes external to the Rbridge network, messages may be transmitted between the portals. The messages enable portals to identify routing updates received from the external network as containing internal routes, so that traffic that is required to pass between nodes on different trees may pass over the Rbridge network rather than over the external network.

Abstract: Described are a method and system for determining whether to establish a call over an internet protocol (IP)-based network. A network device inspects an IP packet to determine that the IP packet conveys a message to initiate a call. The network device determines a shortest path through a link-state network to be taken by traffic associated with the call if the call is admitted. The network device also determines whether each link in the shortest path through the link-state network is available for supporting the traffic associated with the call and issues a message that rejects admission of the call if at least one link in the shortest path through the link-state network is unavailable for supporting the traffic associated with the call.

Abstract: An alternate path calculation process may be terminated after considering some of a source node's neighbors and without considering each of its neighbors, to reduce the amount of processing required to perform the alternate path calculations. The neighbors may be ranked according to the number of alternate paths that the neighbor has historically been able to provide on the network. The influence of historical success or failure may degrade over time so that the rankings may be adjusted to reflect changes in network topography. A given source node, when computing alternate paths through the network, may preferentially select neighbors to perform alternate path calculations on historically higher scoring nodes before performing calculations on historically lower scoring nodes. Several different criteria may be used to stop the alternate path calculation process before considering all neighbors. The neighbors may be loop free neighbors or U-turn neighbors.

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: Three dimensional RF tag signatures may be obtained from a three dimensional RF tag or multiple two or three dimensional RF tags so that information in addition to presence information may be obtained. In one embodiment, a three dimensional RF tag having two or more power coils disposed in non-coplanar planes enables the coils to experience different levels of excitation from an electromagnetic field. This information may be transmitted along with the RF tag response to enable the orientation of the RF tag relative to an RF tag reader to be determined. In another embodiment, multiple RF tags (either standard RF tags or three dimensional RF tags) may be used on a given article and a response signature from the article as a whole may be recorded. The three dimensional response signature thus collected may be compared with previous versions of the response signature to determine if the article has been altered.

Abstract: A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.

Abstract: XML appliances/routers may be organized to implement one or more XML distribution rings to enable XML documents/messages to be distributed efficiently. The rings may be logical or physical. The XML distribution rings enable the XML documents/messages to be exchanged without requiring the XML appliances/routers to run a routing protocol to determine how XML documents/messages should be distributed through the network. Documents may be transmitted in one way on the ring or may be transmitted in both directions around the ring to enable the ring to tolerate failure of an XML appliance/router. Each XML appliance/router will receive all XML documents/messages and will make routing decisions for those clients that have provided the XML appliance/router with XML subscriptions. The subscriptions may be formed according to the XPath standard or in another manner.