| 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 |
| 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 |
| 20100150024 | Network Router and Method of Configuring a Network Router - Disclosed is a method of configuring routing information in a network router linked into a network. The network router has a forwarding table. The method comprises removing the forwarding table entries which are not used. A network router configured in accordance with the method has a forwarding table comprising only forwarding table entries that are used. | 06-17-2010 |
| 20100157807 | Re-Routing Traffic Flow in a Packet Switched Communications Transport Network - In a packet switched communications transport network a method for re-routing traffic flow is provided. The invention based on the recognition of actual utilization of transport resources. In accordance with the implementation, Fast Re-Route detour paths are recalculated each time after new bandwidth information is received. The detours are re-established on new computed paths if needed, i.e., if an optimized path has been found. A node and a system are also disclosed, referring to MPLS network. Also a node is described acting as a Point of Local Repair for link failures. The node comprises a Routing engine, a Link state database, a Detour path calculator and a Detour path establisher in order to capture bandwidth information of the network links and to calculate detour path information for the nodes. | 06-24-2010 |
| 20100172293 | Lightweight Mobility Architecture - Mobility between access domains in an Internet Protocol (IP) network can be supported by introducing a so-called Mobility Manager (MM) that maintains a database of currently attached devices and their current access domain location. The mobility manager may then detect, for a device registered in the database, a change of access domain from a first access domain to a second access domain by monitoring connection maintenance signaling related to the considered device. The mobility manager should at least obtain an indication of such a change of access domain. In response to a detected change of access domain, the mobility manager arranges for a reconfiguration of the network to forward traffic destined to an IP address of the device in the first access domain to a new location in the second access domain. In this way, the mobility manager allows the device to keep its IP address when moving between access domains. | 07-08-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 |
| 20100188986 | Network Node and Method for Fast Traffic Measurement and Monitoring - A network node (e.g., edge node, muter, network management node) is described herein that implements a method for providing fast and exact traffic information during normal traffic fluctuations in a network and also during a sudden and big change in the traffic conditions of the network. In one embodiment, the method monitors a parameter of traffic flowing within a network by: (1) measuring a traffic parameter (m | 07-29-2010 |
| 20100189113 | LINK FAILURE RECOVERY METHOD AND APPARATUS - A method of routing packets across a packet switched network domain, comprising a multiplicity of nodes. Each node comprises an ingress interface and an egress interface. For each destination node a default and a detour branching are defined, each specifying a route to the destination node. For each two-edge connected node the default and detour branchings do not share a common ingress interface. Each node operates as an intermediate node receiving a packet at an ingress interface, identifying an egress interface based upon the ingress interface upon which the packet is received and the packet destination, forwarding the packet via that egress interface if the connected link is available and, if the connected link is not available, forwarding the packet via an alternative egress interface associated with said detour branching if the packet was received at an ingress interface associated with said default branching or dropping the packet if the packet was received at an ingress interface associated with said detour branching. | 07-29-2010 |
| 20100250930 | METHOD AND APPARATUS FOR PROTECTING THE ROUTING OF DATA PACKETS - A method and apparatus for protecting the routing of data packets in a packet data network. When a first end-host sends an address query to a DNS server system regarding a second end-host, the DNS server system responds by providing a destination parameter containing an encrypted destination address associated with the second end-host. Thereby, the first end-host is able to get across data packets to the second end-host by attaching the destination parameter to each transmitted data packet. A router in the packet data network admits a received packet if a destination parameter is attached to the pocket including a valid destination address encrypted by a key dependent on a distributed master encryption key. Otherwise, the router discards the packet if no such valid destination address can be derived from the packet by applying decryption to the destination parameter. | 09-30-2010 |
| 20100272107 | TECHNIQUE FOR ADDRESS RESOLUTION IN A DATA TRANSMISSION NETWORK - A technique for address resolution in data transmission networks, for example ARP-based address resolution in IPv4 networks. An embodiment of the technique comprises the following steps performed in a host of the data transmission network: Maintaining an association of at least one physical address with at least one network address range comprising multiple network addresses; obtaining a target network address; comparing the target network address with the network address range to determine an associated target physical address; and providing the determined target physical address, e.g. for initiating a data transmission. | 10-28-2010 |
| 20100284305 | SETTING UP A VIRTUAL PRIVATE NETWORK - A method for setting up a VPN is described. The VPN is set up in a backbone network having a plurality of PE routers for controlling the transfer of IP traffic to and from CE routers in satellite networks. In a PE router, a VRF is configured for the VPN and populated with local routes for the VPN. A VRF IP loopback address is assigned for the VRF, and a PE IP loopback address is assigned for the ingress PE router. A local route with the VRF and PE IP loopback addresses is then advertised to other PE routers in the backbone network. | 11-11-2010 |
| 20100309784 | Selection of an Edge Node in a Fixed Access Communication Network - A method and apparatus for selecting an edge node from a plurality of edge nodes in a fixed access communications network. A selection node receives from a host entity a request for a network service. The selection node then obtains, from at least one further network node, data relating to a plurality of edge nodes. On thebasis of the retrieved data, the selection node selects an edge node from the plurality of edge nodes, wherein the selected edge node provides a path between the host entity and the requested network service. The selection node then sends a response to the host entity, the response including information identifying the selected edge node. | 12-09-2010 |
| 20100309894 | Method and Apparatuses for Allowing a Nomadic Terminal to Access a Home Network on Layer 2 Level - A method of allowing a nomadic terminal to access a home network on the Layer 2 level. The method comprises connecting said terminal to a remote access network via an access point, the remote access network being connected to an operator's backbone network via a remote access router. Signalling is exchanged between the access point and an authentication server within the backbone network in order to authenticate the terminal to the authentication server and, following successful authentication, a Layer 2 tunnel extending across the backbone network is established for the purpose of connecting said nomadic terminal to the home network. | 12-09-2010 |
| 20110019654 | Method and Apparatus for Use in a Communications Network - A method is provided of enabling access for a terminal ( | 01-27-2011 |
| 20110022728 | LINK STATE ROUTING PROTOCOLS FOR DATABASE SYNCHRONIZATION IN GMPLS NETWORKS - The present invention relates to a method and apparatus for synchronizing local databases maintained control plane (CP) nodes in a GMPLS network. CP nodes that are not involved in path computation do not need to store the TE information contained in opaque link state advertisements (LSAs). These CP nodes only store that part of an opaque LS which is used during the flooding procedure to verify if the LS is new or updated. This verification is based on a few fields of the LSA that contain link state (LS) identifying information. A CP node that is not involved in path computation stores only the LS identifying information and discards the remainder after the LSA is relayed to it neighbor CP nodes. | 01-27-2011 |
| 20110032843 | SETTING UP A VIRTUAL PRIVATE NETWORK USING VIRTUAL LAN IDENTIFIERS - A method for setting up a VPN is described. The VPN is set up in a backbone network having a plurality of PE routers for controlling the transfer of IP traffic to and from CE routers in satellite networks. In a PE router, a VRF is configured for the VPN and populated with local routes for the VPN. A VLAN identifier is assigned for the VPN, and advertised to other PE routers in the backbone network. Alternatively, the VLAN identifier may be determined by a predetermined mapping algorithm so it will be unique to the VPN in all PE routers, in which case the advertisement to other PE routers may contain an implicit NULL label. | 02-10-2011 |
| 20110044171 | CONGESTION HANDLING IN MULTICAST NETWORKS - The invention relates to techniques for traffic handling in congestion situations in a point-to-multipoint (‘PTM’) enabled network. A method embodiment of the inventive technique is performed in an egress node of the network and comprises the steps of detecting marked packets, the marking being indicative of a congestion situation in a core node of the PTM-enabled network; selecting, based on the detected markings, a particular PTM flow from one or more PTM flows passing the egress node for termination; and indicating the selected PTM flow in an upstream direction of the selected flow. | 02-24-2011 |
| 20110064085 | Method and Apparatus for Controlling the Routing of Data Packets - Method and apparatus for controlling the routing of data packets in an IP network ( | 03-17-2011 |
| 20110142044 | METHOD AND APPARATUS FOR AVOIDING UNWANTED DATA PACKETS - Method and apparatus for controlling transmission of data packets in a packet-switched network. When a first end-host (A) sends an address query to a DNS system ( | 06-16-2011 |
