Telefonaktiebolaget Lm Ericsson (publ)

Gábor Tóth

János Farkas

Attila Mihály

András Császár

Balázs Peter Gerö

Zoltán Richárd Turányi

Tamas Borsos

Szabolcs Malomsoky

Csaba Antal

Bengt Henriques

Gergely Molnar

Attila Rajmund Nohl

Zoltán TURÁNYI

A technique for traffic monitoring in a network comprising monitoring components and a management center (MC) is described. A method implementation comprises the steps of selecting a first set of local identifiers from a larger second set of local identifiers, wherein the local identifiers are capable of providing a unique identification of a network connection at the first monitoring component, filtering network connections, allocating a local identifier of the first set of local identifiers to a network connection in case a filter condition applies during the filtering, checking associations of network traffic with local identifiers, and selectively monitoring network traffic associated with a local identifier from the first set of local identifiers.

Method and monitoring component for network traffic monitoring

A method for generating spanning trees (ST,ST,ST) in a network (NW). The network has nodes (A-K) interconnected by links (L) and the trees are used for handling link and node failures. For handling link failures there is for each link (L) at least one tree (ST,ST) that does not include that link. For node failures there is for each node (A-K) at least one spanning tree (ST-ST) to which the particular node is connected by a single link (L). The first spanning tree (ST) connects all nodes (A-K) and from each node one link is left unconnected. The second tree (ST) includes all nodes and all the unconnected links. None of the links is included in both the trees (ST,ST). If node B is broken, node A cannot communicate with nodes C and D so the third tree (ST) is needed. The method has the advantage of giving a low number of trees also for big networks of any topology and can be implemented off-line.

Method of generating spanning trees to handle link and node failures in a network

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.

Lightweight mobility architecture

A method of configuring link-scope-type managed objects in IP-based networks from a centralized management node. An IP-based network includes at least one management station, a set of network nodes, and communication links between the network nodes and between the management station and the network nodes. Preferably, an Open Shortest Path First (OSPF) topology graph of the network is prepared, and a set of target links to be configured is identified. The target links are then classified into N disjoint subsets, T-T. The links in each subset are then configured in parallel, starting with subset Tand sequentially handling each subset one-by-one. The target links may be classified by removing non-target links that are not to be configured from the OSPF topology graph, building a LinkGraph to determine the dependencies between the links remaining in the OSPF topology graph, and building a LinkTree from the LinkGraph to classify the target links into the subsets based upon the dependencies between the links.

Centralized link-scope configuration of an internet protocol (IP) network

The efficiency of transmitting lower priority data traffic along with higher priority traffic is improved by segmenting a data packet in such a way so as to reduce transmission delay of the higher priority traffic. The data packet is segmented so that all its segments, including the last segment, are approximately the same size. The segment size is set smaller than a maximum permitted segment size. Indeed, it is desirable (though not necessary) to set the segment size as small as design parameters, (e.g., minimize segment header overhead), allow in order to reduce transmission delay of the higher priority traffic. Because the last segment is set at the same size or a larger size than the other segments, delay in transmitting the data packet is also reduced. The last segment may be sized as large as practical to minimize the transmission delay of the data packet. Once segmented, the data packet segments are transmitted along with the higher priority traffic.

Growing community of inventors

Szigetszentmiklós, Hungary

Gábor Tóth