Abstract: In a provider backbone—traffic engineering network, a method and a bridge node are provided for setting up path between edge bridges connected to customer premises. A first edge bridge advertises towards peer edge bridges a tuple comprising a port identity and a layer two address. When it needs to set up a path towards the first edge bridge, one of the peer edge bridges uses information in the tuple to compute a path label.

Abstract: Methods for providing feedback in messaging systems are described. A communication node can include a first counter for counting a first number of messages which received by and/or forwarded by the node. The communication node can also include a second counter which counts a second number of messages which are expected to be delivered from that node to other nodes.

Abstract: Techniques for generating a system model for use by and availability management framework (AMF) are described. Inputs are received, processed and mapped into outputs which are further processed into a configuration file in an Information Model Management (IMM) Service eXternal Markup Language (XML) format which can be used as a system model by an AMF.

Abstract: Systems, methods, devices and software for negotiating and executing registry composition are described. Signaling frameworks for both of these aspects of registry composition are provided.

Abstract: A method and an associated router in first administrative domain of a telecommunications network wherein the first administrative domain comprises a first end point associated to a reservation for a session transiting through the router between the first end point and a second end point in a second administrative domain. The router comprises a quality of service (QoS) reservation module maintaining a refresh timer associated with the reservation. The QoS reservation module is capable of, upon expiration of the refresh timer, sending a refresh reservation message toward the second end point on behalf of the first end point and, upon reception of a refresh confirmation message to the refresh reservation message, resetting the refresh timer without forwarding the refresh confirmation message toward the first end point.

Abstract: Method and nodes are provided for propagating between the nodes information about processing capacity of peer nodes. Two types of signals are sent from propagating nodes towards their peer nodes. A propagating node sends first signal type at a constant rate and a second signal type at a variable rate. A ratio of the rates calculated at a peer node represents the processing capacity available a propagating node. Sequence numbers may be added to signals of the first and second type in order to assist peer nodes in detecting capacity issues.

Abstract: Methods and node capable of establishing link-weights based on protection-factor linked to protection level of a plurality of links between a source node and a destination node and capable of establishing primary and, potentially, protection path proposals using the established link-weights. An available bandwidth value for the link is determined. If the available bandwidth value for the link is greater than the bandwidth requirement associated to the potential path, then the link-weight of the link is set by computing a protection-factor associated to the link with the available bandwidth value for the link. Otherwise, the link-weight of the link is established to a value that indicates that the link should not be part of the potential path. Shortest path algorithm using the established link-weights could be applied to obtain path proposals.

Abstract: A network, computer readable medium, and method for ranking a plurality of available access networks by a provider, the provider serving a user equipment and the user equipment being configured to connect to at least one of the plurality of available access networks.

Abstract: Systems and methods according to these exemplary embodiments provide for methods and systems for improving efficiency in communications systems by, for example, bulk release of resources upon a partial node failure. Bulk release messages including, for example, at least one identifier associated with a plurality of resources, can be transmitted from a node toward other nodes to release such resources after the node failure.

Abstract: Methods and systems are described for providing address information for nodes when multiple possibilities exist. For example, in a TISPAN environment the described techniques can be used to transmit address information to an SPDF when it needs to determine which of multiple A-RACFs associated with different IP domains that the SPDF needs to communicate with.

Abstract: The present invention relates to an arrangement, in a communications network, for allocating addresses to users or clients connecting to the network. It comprises at least one address holding means holding a plurality of addresses and allocating control means for, from said address holding means, allocating addresses to the users or clients, and for detecting when an address is released or when a user or a client allocated an address disconnects. It further comprises, for each pool of addresses, delay means for allowing control of the minimum time period to lapse before an address having been allocated to a user is reused, i.e. again allocated to a user, such that a minimum time period before reuse of each address can be guaranteed.

Abstract: Devices, systems, methods and software are described which provide identity assignment and redistribution capabilities for software components of a distributed application. Identity value ranges can be fixed or variable. Identity assignment schemes according to exemplary embodiments facilitate the continuation of traffic between the components and clients during redistribution of the identities.

Abstract: The invention relates to a method and circuit for aligning a serial bit stream with a parallel output. The method comprises latching Q bits from the serial bit stream into a register, locating a position P of a first bit of a start of frame delimiter (SFD) in the register and discarding P-1 bits from the serial bit stream, before the position of the first bit of the SFD, thereby aligning the serial bit stream with the parallel output. The circuit comprises a latch, a fault tolerant analysis logic (FTAL) for locating a position P of a first bit of a start of frame delimiter (SFD) in the register and a shift register for discarding P-1 bits from the serial bit stream, before the position of the first bit of the SFD, thereby aligning the serial bit stream with the parallel output.

Abstract: Reduction of overhead normally caused by the addition of a second IP header in case of tunneling between a home agent and a mobile node located in a foreign network is achieved by replacing an encapsulated first IP header by a tunnel identifier. The home agent and the mobile node agree on a tunnel identifier value at the time of binding update and acknowledgement. The tunnel identifier may be used independently at the home agent and at the mobile node to reconstruct the first IP header, which identifies a correspondent node. Because the encapsulated first IP header is not terminated at either of the home agent or mobile node, overhead reduction is not impacted by eventual transmission error or loss between these two nodes.

Abstract: A method, communications node, and memory for updating and respectively storing a dynamic dictionary for use in text-based protocol message compression/decompression. A message is received by the compression/decompression module from a local client module or from another's node, and the compression/decompression module determines if sequences from the received message match sequences from a dictionary, then determines if any matching sequences are successive in the message. If so, the compression module concatenates the matching successive sequences from the message and copies the resulting combined expression into a dynamic dictionary, thus creating a longer expression to be used in subsequent message compression and decompression. The compression module uses real traffic messages and creates longer string expressions.

Abstract: Methods and apparatus for distributing events among a set of traffic processor in a telecommunication network. The methods and apparatus determines a traffic processor from the set of traffic processors with the lowest traffic load, the traffic load is determined for each traffic processor of the set of traffic processors based on a weighting factor, an event queue length of a traffic processors and a current traffic load. Events are re-distributed when a change occurs in the set of traffic processors. The re-distribution is based on a determination of an allowable event queue length for each traffic processor of the set of traffic processors, which is based on the current traffic load, an optimal traffic load and a maximum event queue length.

Abstract: Methods, a data source and a router are provided to fragment packets that are to be sent in multicast mode towards a plurality of destinations comprised in a multicast group. Each router along a path leading from the data source towards some of the destinations sends its maximum transmission unit value in an uplink direction. Each router directly connected to the data source calculates a lowest maximum transmission unit based on various maximum transmission unit values received from downstream routers. The data source receives from each of the directly connected routers a maximum transmission unit value, which is certain to be acceptable to all routers and destinations of the multicast group downstream of that directly connected router. The data source selects a lowest one of the received maximum transmission unit values and fragments data contents accordingly.

Abstract: A method, a proxy and a host are provided for securing neighbor discovery (ND) signaling between hosts when the hosts are connected through the proxy. A first host sends an original ND message comprising a first signature based on an address of the first host. The proxy removes the address of the first host and substitutes its own address in a modified ND message. The proxy then places a copy of the address of the first host in a new field and builds a proxy signature based on the own address of the proxy and on the new field. The new field and the proxy signature are added to the modified ND message. A second host receives the modified ND message from the proxy and verifies the proxy signature. The second host reconstructs the original ND message content and then verifies the first signature.

Abstract: The present invention is a method for providing network access to a Mobile Terminal (MT) in a packet switched telecommunications network. An access-request is sent from a Gateway server to an Authentication, Authorization, and Accounting (AAA) server for requesting network access for the MT. The access-request includes an Access Point Name (APN) for identifying a selected APN and a MT identity parameter for identifying the MT. The AAA determines whether or not the MT is authorized on the selected APN. If the MT is not allowed on the selected APN, the Gateway server selects a subsequent APN from a list of selectable APNs based on a generic APN. However, if the MT is allowed on the selected APN, the AAA server sends an access-accept message for indicating to the Gateway server that the MT is allowed on the APN combination.

Abstract: Problems caused by Internet Protocol datagram fragmentation are solved by creating a session context for the datagram fragments without actually reassembling the datagram from its fragments. The session context enables treatment of the datagram without actually reassembling it. Processing fragments can be followed by forwarding the processed fragments to another node that can further fragment the IP datagram.