Method for optimising the distribution of a service from a source to a plurality of clients in a network

• US 20040199613A1
• Filed: 12/02/2003
• Published: 10/07/2004
• Est. Priority Date: 12/09/2002
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Hundscheidt, Frank, Hlibiciuc, Alexandru
• Granted Patent: US 8,510,365 B2
• Time in Patent Office: Days
• US Class Current: 709/220
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast
• CPC Class Codes: H04L 67/60 Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources admission control or resource allocation H04L47/70
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

This method for determining locations of service instances for optimising distribution of a service in a network, from a source to a plurality of clients each having predetermined requirements, wherein the network can be modelled by means of a graph, comprises steps of: placing a service instance in each leaf in the graph; and, starting from the leaves, for each service instance: checking whether the service instance when placed in a vertex on the next higher level can fulfil the requirements of all clients to be served by said service instance; and moving or not the service instance one level higher, depending on the result of the checking step.

Application to Point-To-Multipoint (PTM) service distribution in telecommunications networks of the WAN (Wide Area Network) type.

Claims

1. A method for determining locations of service instances for optimising distribution of a service in a network, from a source to a plurality of clients each having predetermined requirements, wherein said network can be modelled by means of a graph, said method comprises steps of:

placing a service instance in each leaf in said graph; and

starting from the leaves, for each service instance;

checking whether the service instance when placed in a vertex on the next higher level can fulfil the requirements of all clients to be served by said service instance; and

moving said service instance one level higher, depending on the result of the checking step.

2. A method according to claim 1, further comprises the steps of determining that at least two service instances meet in said vertex and combining said service instances into one service instance.

3. A method according to claim 1 further comprises a step, prior to said placing step, of determining levels in said graph.

4. A method according to claim 1, wherein said checking step comprises a table-based analysis step.

5. A method according to claim 1, wherein said checking step comprises a Petri net analysis step.

6-7. -7. (Cancelled)

8. A device for determining locations of service instances for optimising distribution of a service in a network, from a source to a plurality of clients each having predetermined requirements, wherein said network can be modelled by means of a graph, comprising:

lodging means, for hosting a service instance;

checking means, for checking whether the service instance when placed in a vertex on the next higher level can fulfil the requirements of all clients to be served by said service instance;

processing means, for coordinating said lodging means and said checking means and for controlling said vertex; and

input/output means, for sending and receiving messages and service instances.

9. A device according to claim 8, further comprises combining means, for determining that at least two service instances meet in said vertex and for combining said service instances into one service instance.

10. (Cancelled)

11. A system for determining locations of service instances for optimising distribution of a service in a communication network, from a source to a plurality of clients each having predetermined requirements, wherein said communication network can be modelled by means of a graph, comprising:

means for placing a service instance in each leaf in said graph;

means for starting with each leave and determining whether said service instance, when place in a vertex on the next higher level, can fulfill the requirements of all clients to be served by said services instances;

means for moving said service instance one level higher in response to an affirmative determination.

12. The system of claim 11 further comprises the means for determining that at least two service instances meet in said vertex and further combing said two service instances into one service instance.

13. The system of claim 11 further comprises the means for determining levels in said graph prior to placing said service instance in said each leaf in said graph.

14. The system of claim 11 wherein said means for determining further comprises a table-based analysis means.

15. The system of claim 11 wherein said means for determining further comprises a Petri net analysis means.