| Patent application number | Description | Published |
|---|
| 20090049194 | Updating state in edge routers - 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 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. | 02-19-2009 |
| 20090274165 | Aggregated Resource Reservation for Data Flows - A network node for reserving resources for data flows in a communication network. The node detects a request for resource reservation for a new data flow and computes an admission test count based on descriptors of the new data flow and reservation counts, which represent reservation functions of descriptors of previously admitted data flows and which specify resources of the admitted data flows. The new data flow is admitted if the admission test count is smaller than a maximum allowable count. The reservation counts are then updated based on the descriptors of the new data flow. A plurality of admission formulas may thus be used to maintain aggregated reservation counts for data flows, the number of counts being independent from the number of flows. | 11-05-2009 |
| 20100017529 | Multimedia transport optimisation - To achieve sophisticated adaptation mechanisms in a packet switched communication environment for service delivery according to the present invention, there is generated descriptor information (LID) on an application level. The descriptor information (LID; | 01-21-2010 |
| 20100034090 | Edge Node for a network domain - An egress node is proposed for a network domain that comprises at least one ingress node for receiving and routing data units belonging to a plurality of flows into said network domain, a plurality of interior routers for routing said data units through said network domain, and said egress node(s). One or more of the interior routers is arranged to detect whether it is subject to a congestion condition and to congestion mark routed data units if it is subject to said congestion condition. The egress node comprises a control element arranged for performing a congestion handling function that comprises a part for detecting the presence of congestion marked data units arriving at said edge node, and a part for reacting to the detection of the presence of congestion marked data units by invoking a congestion control process. The congestion control comprises sending to said ingress node an instruction for terminating one or more flows to thereby reduce a traffic load, waiting a predetermined period of time and then determining whether congestion marked data units are still arriving at said edge node, and if congestion marked data units are still arriving, repeating the sending and waiting steps. | 02-11-2010 |
| 20100054157 | Method And Apparatus For Network Tree Management - 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. | 03-04-2010 |
| 20100061301 | Automatic Distribution of Server and Gateway Information for Pool Configuration - A mobile communications network ( | 03-11-2010 |
| 20100103942 | LABEL SWITCHED PATH NETWORKING - A network arranged to implement label switched paths, comprising: an ingress label edge router (LER), atleast one label switching router (LSR), and an egress LER, in which the ingress LER is connected to the egress LER via one or more of the LSRs. In said network the ingress LER is arranged to transmit, in use, a path message for setting up a bidirectional label switched path (LSP) from the ingress LER to the egress LER via at least one LSR in response for a request for such an LSP. The path message is transmitted over the path of the LSP to be created, in which the path message comprises a first parameter indicative of the bandwidth to be assigned to data traversing the LSP in a first, downstream, direction from ingress LER to egress LER and a second parameter indicative of the bandwidth to be assigned to data traversing the LSP in an opposite, upstream, direction, in which the upstream and downstream bandwidths are different. | 04-29-2010 |
| 20100111086 | MULTICAST AND BIDIRECTIONAL UNICAST SIGNALING IN SINGLE ROOT MULTIPOINT SERVICES USING RSVP-TE - A method for establishing a downstream multicast and a upstream and downstream unicast connections between a root and at least one leaf, the root and the at least one leaf being in a tree-type configuration, comprises: creating a downstream unicast label; and distributing the created downstream unicast label in a same signaling message as downstream multicast and upstream unicast labels from the root to the at least one leaf. A network node comprising such a downstream unicast label is used to carry out the method. | 05-06-2010 |
| 20100118740 | SYSTEM AND METHOD FOR IDENTIFYING NON-MULTIPLE SPANNING TREE PROTOCOL CONTROL PLANES - A system, method, and node for identifying non-Multiple Spanning Tree Protocol control planes. The method includes the steps of identifying a specific non-Multiple Spanning Tree Protocol control plane instance, associating a General Control Plane Identification, GCPID, with the specific control plane instance, wherein the GCPID binds a Virtual Local Area Identifier, VID, with the specific control plane, and advertising the GCPID to identify the specific control plane instance. | 05-13-2010 |
| 20100165884 | Ethernet Spanning Tree Provision - A method and apparatus for providing a Spanning Tree to nodes on an Ethernet network. A Spanning Tree topology is calculated, and a Resource Reservation Protocol Traffic Extension path message is generated. The path message contains at least a part of the Spanning Tree topology. The path message is sent to bridges on the Ethernet network. The bridge nodes that receive the path message configure their port states depending on the information contained in the path message, and may also configure port Virtual Local Area Network membership. | 07-01-2010 |
| 20100182907 | Congestion Control in Stateless Domains - 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. | 07-22-2010 |
| 20100232316 | FORCED MEDIUM ACCESS CONTROL (MAC) LEARNING IN BRIDGED ETHERNET NETWORKS - A system, method, and Ethernet bridge utilizing forced MAC learning to set up a path from an originating node, PON ( | 09-16-2010 |
| 20100290345 | GMPLS BASED OAM PROVISIONING - 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. | 11-18-2010 |
| 20100303076 | OPTIMISING PACKET SWITCHED NETWORKS - 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. | 12-02-2010 |
| 20100316058 | SYSTEM AND METHOD OF DEMULTIPLEXING PROVIDER BACKBONE BRIDGING TRAFFIC ENGINEERING INSTANCES - 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. | 12-16-2010 |
| 20100322254 | Extended VLAN Classification - 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. | 12-23-2010 |
| 20110007667 | SYSTEM AND METHOD OF AUTOMATICALLY CONFIGURING I-SIDS IN GMPLS CONTROLLED ETERNET PROVIDER BACKBONE BRIDGED NETWORKS - 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 | 01-13-2011 |
| 20110013640 | METHOD AD APPARATUS FOR ETHERNET PROTECTION WITH LOCAL RE-ROUTING - 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 (VLAN | 01-20-2011 |
| 20110080854 | Method And System For Controlled Tree Management - 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. | 04-07-2011 |
