Abstract: There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.

Abstract: A method and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge node.

Abstract: There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.

Abstract: A method and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge node.

Abstract: A mobile communications network has separation between a user plane (UP) and a control plane (CP). The network includes plural entities, including plural user plane entities (UPEs), which form the user plane and plural mobility management entities (MMEs), which form the control plane. At least one of the entities is configured to transmit advertisement information. The advertisement information includes status information and configuration information of the at least one entity. The network also includes a node or unit configured to use both the advertisement information and transport information transported on the user plane to select a user plane entity for attachment to a wireless station serviced by the network.

Abstract: Reducing congestion in an IP domain wherein congested data flows arriving at an egress edge node of the network are identified. Total congestion represented by the congested flows is determined, and a congestion extent notification is sent from the egress edge node to its ingress edge node peer. The congestion extent notification includes information regarding the total congestion and is sent on a per-class basis. Congested core routers in the network insert DSCPs into data packets passing through them to enable the egress edge nodes to identify the affected flows. The core routers may also send congestion metric messages, designed to follow the same path as the marked packets, to inform the egress edge nodes of the extent of congestion. In an alternative method, the egress edge nodes inform their ingress peers that congestion is present, without initially identifying the extent. The ingress edge node sends a query downstream with a congestion metric.

Abstract: A method to facilitate the broadcast of frames between a set of Edge Nodes of a transport network, where nodes of the transport network forward frames using labels added to the frames at ingress Edge Nodes. The method comprises, at each of said Edge nodes and at intermediate nodes in the paths between said Edge Nodes, installing an entry or entries into a forwarding table mapping frame labels to output forwarding ports such that said entries together form a single forwarding construct such that frames labelled by any of the Edge Nodes of said set are transmitted to all other Edge Nodes of the same set. Upon receipt of a frame at one of said Edge Nodes or intermediate nodes, the provided forwarding table is used to map the frame label of the frame to one or more forwarding ports. Frames are then sent via the identified forwarding port(s).

Abstract: A method and apparatus that operates two bridging protocols in a hybrid bridging node is described. The operation of the two bridging protocols in the hybrid node allows for an incremental transition of a provider bridging network from operating a legacy bridging protocol that shares MAC addresses to a bridging network that operates VPLS and/or PBB bridging protocols. The hybrid bridging node selectively broadcasts unicast packets with unknown MAC addresses from the nodes operating VPLS and/or PBB to nodes operating a legacy bridging protocol.

Abstract: A bridge and method are described herein that translate at least a portion of a port VID (VLAN identifier) for an incoming tagged frame to form a relay VID for a corresponding relay tagged frame by using a VID mask table, a VID filter table, and a VID rule table. In an additional embodiment, the bridge and method also implement a port VLAN membership technique to ensure that an ingress port associated with the port VID is a member of the current VLAN.

Abstract: A method and apparatus that operates two bridging protocols in a hybrid bridging node is described. The operation of the two bridging protocols in the hybrid node allows for an incremental transition of a provider bridging network from operating a legacy bridging protocol that shares MAC addresses to a bridging network that operates VPLS and/or PBB bridging protocols. The hybrid bridging node selectively broadcasts address resolution packets and unicast packets with unknown MAC addresses from the nodes operating VPLS and/or PBB to nodes operating a legacy bridging protocol.

Abstract: A registration protocol for setting up and updating a tree that defines the active topology in an Ethernet network includes a plurality of application components and a plurality of attribute declaration components corresponding to the application components, wherein the application components declare and register attribute values and the corresponding attribute declaration components make and withdraw registration of the attributes.

Abstract: There is disclosed a method and apparatus for facilitating a network, such as an Ethernet LAN, for efficient forwarding of data traffic by collecting neighbor information, generating and distributing link state advertisements, populating a topology database for the network, and calculating trees for each bridge serving as a root bridge. In a preferred embodiment the method and system also prepare one or more backup topologies, and store them for use if they are needed due to a failure condition detected in the network. In a particularly preferred embodiment, probabilities are assigned to various potential failure conditions, and the probability values are used to decide which backup topologies to calculate, store, or use.

Abstract: A method is provided for use at a first node of a network. The first node (B) has an input path for receiving Ethernet frames destined for a second node of the network. The first node (B) also has a first output (working) path for forwarding the received Ethernet frames towards the second node. A failure along the first output (working) path is detected at the first node. Following such failure detection, the received Ethernet frames are caused, at the first node, to be re-routed along a second output (backup) path, different to the first output (working) path, towards the second node. The re-routing is performed by using (e.g. referring to and/or changing) respective indications (VLAN1) applied to the Ethernet frames to distinguish those Ethernet frames to be forwarded along the first output (working) path from those Ethernet frames to be forwarded along the second output (backup) path.

Abstract: A system and method of automatically configuring a Service Instance Identifier (I-SID) in a Generalized Multiprotocol Label Switching (GMPLS) controlled network. The method begins by identifying a specific I-SID for a specific service in the GMPLS controlled network. Next, the identified I-SID is automatically configured within a Backbone Edge Bridge (BEB) with a Resource Reservation Protocol-Traffic Engineering (RSVP-TE) extension. The automatic configuration may be implemented by several different embodiments. In one embodiment, the I-SID may be carried in a SESSION_ATTRIBUTE object. In another embodiment, the I-SID may be mapped to a Short Call ID field in a Session object. Alternatively, the I-SID may be carried in an Endpoint ID Type-Length-Value (TLV). The I-SID may also be carried in a new TLV in a LSP_ATTRIBUTES or CALL— ATTRIBUTES object.

Abstract: A bridge and method are described herein that translate at least a portion of a port VID (VLAN identifier) for an incoming tagged frame to form a relay VID for a corresponding relay tagged frame by using a VID mask table, a VID filter table, and a VID rule table. In an additional embodiment, the bridge and method also implement a port VLAN membership technique to ensure that an ingress port associated with the port VID is a member of the current VLAN.

Abstract: A system and method of demultiplexing Provider Backbone Bridging Traffic Engineering (PBB-TE) service instances. The method is used when monitoring service instances between a first bridge port and a second bridge port by exchanging CFM frames over each service instance. The CFM frame is received by the second bridge port where the complete ESP-3-tuple is demultiplexed. The CCM frames may be demultiplexed by a Full Traffic Engineering Service Instance Multiplex Entity which demultiplexes both the source address value and destination address value of the CCM frames.

Abstract: Methods, edge routers and an edge-router-refresh network signalling message used to update state information in edge routers. A data session is established on a path from a source towards a destination connected from the source via a plurality of Autonomous Systems (AS). The edge-router-refresh network signalling message is created by an edge router acting an an ingress edge router. The edge-router-refresh network signalling message comprises an identifier of the data session, an identifier of the edge router, which issued the edge-router-refresh message and an indication that the edge-router-refresh message is meant to be used by the edge routers present on the modified path. Optionally, the edge-router-refresh network signalling message further comprises a list of the plurality of AS traversed by the path before the modification.

Abstract: A method of routing packets between nodes of a packet switched network, the method comprising receiving a packet at a first node, the packet comprising routing information and payload data, sending said routing information to a second node in the routing path via a first transmission medium having a relatively high transmission speed, and sending said payload data to said second node via a second transmission medium having a relatively low transmission speed. Upon receipt of said routing information, said second node is able to prepare or begin preparation for onward routing of the packet in advance of receipt of said payload.

Abstract: A method and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge node.

Abstract: A system, method, and Ethernet bridge utilizing forced MAC learning to set up a path from an originating node, PON (23) to one or more terminating nodes, PTN (12) through intermediate bridge nodes (14, 21). In the point-to-point case, a Previous Hop Bridge (PHB) list defines the links in the path. Each link includes a destination address, source address, port number, and VID. A path learning frame (13, 19, 22) containing the list is sent in reverse order from the PTN through the intermediate bridge nodes to the PON. Each node in the path saves the received frame's header information as learned path information using standard MAC learning functionality, removes the node's own information from the list, and forwards the frame with the remainder of the list to the next node using the port specified by the port number for that link. When the frame arrives at the PON, all nodes have saved the learned path information.