Telefonaktiebolaget Lm Ericsson (publ)

Shahryar Khan

Balázs Varga

Balázs Peter Gerö

Giovanni Fiaschi

Shuo Yang

Jonas Emanuel Rosenberg

Panagiotis Saltsidis

János Farkas

Tomas Thyni

Sriganesh Kini

Mats Forsman

David Sinicrope

Hans-Åke Lund

Géza Gaál

Junhui Liu

Lars Peter Pehrson

Peter Balázs Gerö

Daniel Kang

Hans-ÅKe Lund

Balázs A Varga

Yang Y Shuo

A method of determining an optimal route for communication between nodes in a communications network. The method comprises assigning a plurality of link potential values (P) to a respective plurality of direct links (l) between respective first and second nodes a and b in the network, wherein a link potential value (P) represents a likelihood that the corresponding direct link will be used for future communication requests. The method comprises determining an optimal route between nodes based on the plurality of link potential values (P).

Optimal routing in a communications network

A network node () samples data packets of network traffic. For each sampled data packet, the network node () compares a packet header of the sampled data packet to a set of one or more packet header patterns. Depending on the comparison, the network node () determines a length of a packet header portion to be extracted from the sampled data packet. Then the network node () extracts the packet header portion of the determined length from the sampled data packet and generates a datagram comprising the extracted packet header portions of the sampled data packets.

Length control for packet header sampling

A method (), performed by a first network node in a communication network, is disclosed. The first network node is connected to a second network node of the communication network via an interface implementing a GPRS Tunnelling Protocol (GTP). The method comprises selecting a user data packet for transmission to the second network node () and identifying information about the user data packet which impacts how the user data packet should be routed over the interface (). The method further comprises encoding the identified information into a User Datagram Protocol (UDP) header of the user data packet () and forwarding the user data packet to the interface for transmission to the second network node (). Another method () is disclosed, performed by a node in a Mobile Transport Network, the Mobile Transport Network providing a GTP based interface between a first network node of a communication network and a second network node of the communication network. The method comprises receiving a user data packet from the first network node for transmission over the interface to the second network node (), extracting, from a UDP header of the user data packet, information about the user data packet which impacts how the user data packet should be routed over the interface () and using the extracted information in a routing decision to forward the user data packet to the second network node (). Also disclosed are a communication network node (), a Mobile Transport Network node () and a computer program configured to carry out methods in a communication network node and a Mobile Transport Network node.

Methods and apparatus for network communication over an interface

The present invention relates to a method and embodiments thereof in a Radio Node, a node, computer program and computer program products for adapting of Radio Coordination schemes to transport network characteristics. The method comprises detecting new neighbours, retrieving transport characteristics values between radio neighbours, validity checking of the active Radio Coordination scheme(s), and updating of Radio Coordination scheme, if necessary, based on the measured transport characteristics values.

Method, a node, computer program and computer program product for adapting radio coordination schemes

A router receives, from a BGP peer, a BGP update message including NLRI (VPN-NLRI) specific to a virtual private network, as well as path information including an address of a next hop for the VPN-NLRI. The router determines that there is no route to the next hop, modifies the filtering information to permit propagation of NLRI including the address of the next hop, and sends the modified filtering information to BGP neighbors. Alternatively, a router determines that such a BGP update message is due to be sent to a BGP peer. The router determines that the filtering information does not allow propagation, to the peer, of NLRI including the address of the next-hop, modifies the filtering information so as to permit propagation, to the BGP peer, of NLRI including the address of the next hop, and sends the BGP update message to the peer.

Methods and routers for connectivity setup between provider edge routers

A pseudowire redundancy network comprises a plurality of pseudowires (PW, PW) attached to a provider edge node (). For selecting an active pseudowire (PW) to be used for forwarding user traffic, the provider edge node () determines a local preferential forwarding status for each of the pseudowires (PW, PW). The determined preferential forwarding status is active for no more than one of the pseudowires (PW, PW). The provider edge node () indicates the determined local preferential forwarding status of the pseudowires (PW, PW) to remote provider edge nodes (). Further, the provider edge node () receives indications of a remote preferential forwarding status for each of the pseudowires (PW, PW) from the remote provider edge nodes (). The provider edge node () then selects that one of the pseudowires (PW, PW) as active for which both the local preferential forwarding status and the remote preferential forwarding status is active.

Pseudowire selection in a pseudowire redundancy network

A method and apparatus for using entropy labels in segment routed networks is disclosed. A single ELI and a single EL are provided for a label stack. The ELI and EL are inserted directly below a top-most label in the label stack. A method and apparatus for using entropy labels in segment routed networks. A top-most label of a label stack of a packet is examined. A NHLFE for the packet is determined. A determination is made as to whether or not an ELI is below the top-most label. An EL is re-used when the ELI is determined to be present . The ELI and the re-used EL are inserted directly below a label associated with the NHLFE in a new label stack.

Method and apparatus for using entropy labels in segment routed networks

Methods and apparatus are disclosed for applying multiple Link Aggregation Group (LAG) entities on the same set of physical links, thus making bundling of individual services or conversations possible by the different LAG entities within Link Aggregation. Each LAG entity is configured such that a single physical link is Active and all the other links are Standby. Each LAG entity may be regarded as a 'bundle.' Thus the services/conversations are bundled into a LAG entity and are handed-off on the Active link during normal operation. If service hand-off is not possible on the Active link (e.g., due to a failure), then the LAG entity switches over to a Standby link thus the service/conversation is handed-off on that formerly Standby link. Bundling may simplify operations of control and signaling.

Growing community of inventors

Rönninge, Sweden

Shahryar Khan