Abstract: A method of address allocation in a network comprises determining, from negotiations between nodes, whether a first node shall assume a server role responsible for distribution and management of network addresses to clients. If this determination is made, the first node is provided with a pool of network addresses. The invention provides a method of dynamic re-allocation of address pools between servers of the network, in accordance with, for example, network requirements or traffic load.

Abstract: A decentralised method is disclosed of deciding a common configuration parameter in a network. The network comprises at least one node designated to perform the method. In the method, a designated node makes a local decision relating to the configuration parameter in dependence upon information relating to its local operating environment (M3). The designated node sends its local decision to other designated nodes, if any, and receives corresponding local decisions made by other designated nodes, if any (M4). Following such receipt, the designated node makes a common decision relating to the configuration parameter in dependence upon its local decision and the received local decisions (M5). The common decision is made using a decision algorithm common to the designated nodes.

Abstract: A method of address allocation in a network comprises determining, from negotiations between nodes, whether a first node shall assume a server role responsible for distribution and management of network addresses to clients. If this determination is made, the first node is provided with a pool of network addresses. The invention provides a method of dynamic re-allocation of address pools between servers of the network, in accordance with, for example, network requirements or traffic load.

Abstract: A network infrastructure and method for name-address management in an internetwork having a hierarchical address structure with a number of address areas on different levels of the address structure. For a given resource, a distributed name-to-address resolution chain is built up through the hierarchical address structure utilizing a set of interlinked resolution key codes for bridging between address areas. During routing of a message, name-to-address resolution is performed by successively backtracking the chain through the hierarchical address structure utilizing the interlinked resolution key codes to bridge between address areas on different levels.

Abstract: A decentralised method is disclosed of deciding a common configuration parameter in a network. The network comprises at least one node designated to perform the method. In the method, a designated node makes a local decision relating to the configuration parameter in dependence upon information relating to its local operating environment (M3). The designated node sends its local decision to other designated nodes, if any, and receives corresponding local decisions made by other designated nodes, if any (M4). Following such receipt, the designated node makes a common decision relating to the configuration parameter in dependence upon its local decision and the received local decisions (M5). The common decision is made using a decision algorithm common to the designated nodes.

Abstract: A network infrastructure and method for name-address management in an internetwork having a hierarchical address structure with a number of address areas on different levels of the address structure. For a given resource, a distributed name-to-address resolution chain is built up through the hierarchical address structure utilizing a set of interlinked resolution key codes for bridging between address areas. During routing of a message, name-to-address resolution is performed by successively backtracking the chain through the hierarchical address structure utilizing the interlinked resolution key codes to bridge between address areas on different levels.

Abstract: In a packet switched network, the link having the lowest cost to a certain destination is obtained. For each link to the destination, the link cost is calculated based on at least two parameters, the link having the lowest link cost is selected. The calculated link costs are stored in a routing table. The parameters used comprise the maximum cell transfer delay (CTD), the peak-to-peak Cell Delay Variation (CDV), the Available Cell Rate (AvCR), the Maximum Cell Rate (MCR) and the Cell Loss Ratio (CLR). An Administrative Weight (AW) may also be included. Each parameter may be weighted by a weighting factor (k1, k2, . . . , k6) and scaled by an exponent (&agr;, &bgr;, &ggr;, &dgr;, &egr;). The sum of link costs and certain non-additive parameters is used to calculate path costs.

Abstract: To ensure that appropriate resources are available in a network when AAL Type 2 connections are to be established, the network is divided into resource domains (RD—1, RD—2, RD—3, RD—4), and each resource domain is provided with a prediction connection admission control unit (p-CAC—1, p-CAC—2, p-CAC—3, p-CAC—4) which comprises information about available resources through its own resource domain as well as information about available resources for connections through the other resource domains of the network.

Abstract: To ensure that appropriate resources are available in a network when AAL Type 2 connections are to be established, the network is divided into resource domains (RD—1, RD—2, RD—3, RD—4), and each resource domain is provided with a prediction connection admission control unit (p-CAC—1, p-CAC—2, p-CAC—3, p-CAC—4) which comprises information about available resources through its own resource domain as well as information about available resources for connections through the other resource domains of the network.