Abstract: Embodiments of the present invention provide a method and system for establishing a network communication path between a source node and a destination node. A destination geographic area of the destination node is determined. An intermediate node located in an intermediate geographic area that is adjacent to a source geographic area of the source node and is in a direction that is toward the destination geographic area is determined based at least in part on the destination geographic area. Connectivity with the intermediate node is requested or established. A determination is made as to whether the adjacent intermediate geographic area is the destination geographic area. If the determined adjacent intermediate geographic area is not the destination geographic area, a next intermediate node in another intermediate geographic area that is adjacent to the intermediate geographic area and is in a direction that is toward the destination geographic area is determined.

Abstract: A cloud network includes a plurality of geographically distributed data centers each having processing, bandwidth and storage resources for hosting and executing applications, a processing node and a database. The processing node determines an optimal placement of a plurality of VMs across the data centers based on a plurality of objectives including at least two of energy consumption by the VMs, cost associated with placing the VMs, performance required by the VMs and VM redundancy. The processing node also allocates at least some of the processing, bandwidth and storage resources of the data centers to the VMs based on the determined optimal placement so that the VMs are placed within a cloud network based on at least two different objectives. The database is configured to store the objectives and information pertaining to the allocation of the processing, bandwidth and storage resources of the data centers.

Abstract: Methods and devices used for a dynamic QoS management taking into consideration a global throughput and individual bearer throughputs are provided. The global throughput and individual bearer throughputs may be predicted upon receiving each packet from a public domain network. Individually, for each bearer is determined if a current QoS service is adequate by comparing the global throughput with threshold values associated to the bearer and on evaluating whether the bearer is overloaded. If the current QoS level associated with the bearer is not adequate, the QoS level associated with the bearer is set to another QoS level.

Abstract: A network resource module communicatively interfaces a resource manager with one or more network nodes in a communications network. Each network node provides one or more network resources that may be used to create a virtual infrastructure for a virtual network. The network resource module detects the network nodes, abstracts the resources associated with the network nodes at a desired granularity (e.g., node level or flow level) into Virtual Resource Objects (VROs), and then publishes the VROs in a registry. Thereafter, Virtual Network Operators (VROs) select desired VROs from the registry to build the virtual infrastructure for the virtual network.

Abstract: Methods and devices used for a dynamic QoS management taking into consideration a global throughput and individual bearer throughputs are provided. The global throughput and individual bearer throughputs may be predicted upon receiving each packet from a public domain network. Individually, for each bearer is determined if a current QoS service is adequate by comparing the global throughput with threshold values associated to the bearer and on evaluating whether the bearer is overloaded. If the current QoS level associated with the bearer is not adequate, the QoS level associated with the bearer is set to another QoS level.

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: A method and a policy enforcement point are provided for applying policies to a session. An eventual state of the session is predicted in a prediction engine of a policy enforcement point. The predicted state is sent to a policy controller, which returns a policy for the predicted state. If the predicted state, or a similar state, is detected, the policy enforcement point applies the policy for the predicted state to the session.

Abstract: Systems and methods for the creation and deployment of services on a converged network are described herein. These services can be initially created from visual constructs and have their life cycle performed and monitored by a multimedia service composition factory. Functions for design, implementation, installation, verification and coordination can be provided to compose services after pre-compiled code segments are received from a user interface.

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: A method and Resource Allocation Manager Entity for obtaining an improved resource allocation plan for the network. Traffic requests currently exist in a network, each of which having a source, a destination and at least one Quality of Service (QoS) requirement being represented by a QoS value. For each traffic request, at least one potential path consisting of a plurality of links is computed. An iteration matrix is generated having the potential path on first axis, the links on second axis and the QoS requirement on third axis. The iteration matrix is filled by, for each of potential path, distributing the QoS value of the QoS requirement over the links for enabling a gradient space calculation method on the iteration matrix. The gradient space calculation method is applied to the iteration matrix until an iteration marker thereof indicates that the iteration matrix contains the improved resource allocation plan.

Abstract: Methods and router for receiving a request message addressed from a first router to setup an inter-domain QoS reservation toward a second router in a further domain, forwarding the request message to setup the inter-domain QoS reservation, receiving an acknowledgment message to confirm that the inter-domain QoS reservation is setup, reserving resources in accordance with the inter-domain QoS reservation, forwarding the acknowledgment message toward the first router, receiving a packet related to the inter-domain QoS reservation and encapsulating, toward the second router, the packet in accordance with the inter-domain QoS reservation by adding a first label to the packet, the first label indicating that the packet is not for delivery in the current domain. Optionally, the methods and the router could encapsulate the first label and the packet by adding a second label thereto, wherein the second label enables proper routing of the thereby encapsulated packet within the current domain.

Abstract: A method and Resource Allocation Manager Entity for obtaining an improved resource allocation plan for the network. Traffic requests currently exist in a network, each of which having a source, a destination and at least one Quality of Service (QoS) requirement being represented by a QoS value. For each traffic request, at least one potential path consisting of a plurality of links is computed. An iteration matrix is generated having the potential path on first axis, the links on second axis and the QoS requirement on third axis. The iteration matrix is filled by, for each of potential path, distributing the QoS value of the QoS requirement over the links for enabling a gradient space calculation method on the iteration matrix. The gradient space calculation method is applied to the iteration matrix until an iteration marker thereof indicates that the iteration matrix contains the improved resource allocation plan.

Abstract: A Next Generation Network (NGN) resource management system and method includes a network topology discovery mechanism at the scale of an administrative domain. Information about nodes and links, such as bandwidth, delay, jitter, name and description of devices is collected and stored in a database by way of a protocol. The protocol is notifications-based, which involves each node device (e.g., a switch, router etc.) notifying its presence to its neighboring node.

Abstract: Device, nodes and methods according to the present invention address this need and others by improving the quality of service of roaming cellular communications, particularly for the area of data transmissions. A service identifier number is transmitted by a mobile device, and received by a telecommunication system. The service identifier number is used to identify a telecommunication node which is assigned to provide the requested data service.

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 method and packet switched cellular telecommunication system wherein data flows from a terminal are aggregated into one or more Multi Protocol Label Switching (MPLS) Label Switched Path (LSP) based on at least one criterion. In a first embodiment, the data flows are aggregated into LSP(s) based on a Quality of Service (QoS) class of each such data flows, by a Network Node, such as a Radio network Controller (RNC) or a Serving GPRS Support Node (SGSN). In a second embodiment, the data flows or LSPs are aggregated into another LSP(s) based on the destination routing area. The LSP aggregation is performed by an Edge Node of the routing area, such as a Gateway GPRS Support Node (GGSN). In a first variant of the 2nd embodiment, the aggregation is used for macro-mobility, while in yet another variant the same aggregation is used for defining a virtual private network.

Abstract: A Resource Manager node and methods for establishing and modifying an inter-domain QoS reservation between a first node in a first domain and a further node in a further domain. After detection that the QoS reservation with at least one QoS characteristic is needed or needs to be refreshed, obtaining, at the first node, network state information associated to at least one possible choice of path between the first domain and the further domain. Thereafter, determining at least one choice of path between the first domain and the second domain in view of the at least one QoS characteristic, selecting a selected path to support the QoS reservation and sending a reservation message to trigger establishment of the inter-domain QoS reservation.

Abstract: A method and a Core Network Gateway node for performing a handoff operation for a Mobile Terminal (MT) that receives and sends encapsulated packet data in a packet data network. The Core network Gateway comprises a service logic for receiving at the Core Network Gateway node a Routing Area (RA) request message from the MT, which indicates that the MT is handing off in the packet data network. The Core network Gateway nodes further comprises a duplicator/combiner for duplicating encapsulated packet data sent from a Corresponding node to the MT and for combining Label Switched Path (LSPs) in the packet data network. The Core Network Gateway node also comprises a switching element for switching the encapsulated packet data from a LSP to another LSP when the MT hands off in the packet data network.

Abstract: A method for establishing a packet data session for a Mobile Terminal (MT) in packet data network. The method uses a Bandwidth Broker (BB) node for receiving from an aggregation node Quality-of-Service (QoS) measurements for a path assigned to the MT for transmission of packet data for the MT. The BB node stores policies for admission control for admitting packet data session for the MT. Based on the received QoS and the stored policies, the BB node admits the assigned path for providing packet data for the MT.