Method and device for performance optimisation of a data distribution network

• US 20090086701A1
• Filed: 11/03/2004
• Published: 04/02/2009
• Est. Priority Date: 11/03/2004
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Korn, Uwe, Lohmar, Thorsten
• Granted Patent: US 7,885,642 B2
• Time in Patent Office: Days
• US Class Current: 370/345
• CPC Class Codes: H04L 12/18 for broadcast or conference , e.g. multicast
• CPC Class Codes: H04L 12/1881 with schedule organisation, e.g. priority, sequence management
• CPC Class Codes: H04L 12/189 in combination with wireless systems selective distribution or broadcast in wireless communication networks H04W4/06
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/32 by discarding or delaying data units, e.g. packets or frames
• CPC Class Codes: H04W 28/10 Flow control between communication endpoints
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]

Abstract

A method for scheduling the delivery of a plurality of data portions to respective recipients in a data distribution network, wherein the recipients are commonly utilizing a bottleneck element limiting the performance of the data distribution network. A proportion of recipients automatically requesting a respective data portion is determined upon receiving a respective notification message. A preferred time span for delivering the data portions is determined according to a capacity of the bottleneck element, the amount of data that is to be delivered and the proportion of recipients automatically requesting the respective data portion. The delivery of a data portion is delayed according to the preferred time span for delivering.

Claims

19. A method for scheduling the delivery of a plurality of data portions to respective recipients in a data distribution network, wherein the recipients are commonly utilizing a bottleneck element limiting the performance of the data distribution network and wherein a notification message indicating that a data portion is available for a recipient is sent to each of the recipients, the method comprising the steps of:

determining a proportion of the recipients automatically requesting a respective data portion upon receiving a respective notification message,

determining a preferred time span for delivering the plurality of data portions according to a capacity of the bottleneck element, to an amount of data to be delivered, and to a proportion of recipients automatically requesting the respective data portion, and

delaying the delivery of a data portion for a delay that is determined according to the preferred time span for delivering.

20. The method according to claim 1, wherein the notification message is delayed.

21. The method according to claim 1, wherein the notification message comprises a desired value of the delay for a data portion.

22. The method according to claim 1, wherein the notification message comprises a maximum value of the delay for a data portion.

23. The method according to claim 1 wherein the delay for a particular recipient is determined such that it is below the preferred time span for delivering the data.

24. The method according to claim 1, wherein delays for the plurality of data portions are distributed between a minimum value and the preferred time span for delivering the plurality of data portions.

25. The method according to claim 6, wherein the delays are distributed largely uniformly between the minimum value and the preferred time span.

26. A network node for scheduling the delivery of a plurality of data portions to respective recipients in a data distribution network, the network node comprising an interface (I1) for sending a notification message to a recipient indicating that a data portion is available for the recipient, the network node comprising:

a determining unit for determining a proportion of recipients automatically requesting a respective data portion upon receiving a respective notification message,

a processing unit for determining a preferred time span for delivering the plurality of data portions according to a capacity of a bottleneck element commonly utilized by a plurality of recipients, according to an amount of data to be delivered and according to the proportion of recipients automatically requesting the respective data portion, and

a delaying means for delaying the delivery of a data portion for a definite delay that is determined according to the preferred time span for delivering.

27. The network node according to claim 8, wherein the delaying means is adapted to delay sending the notification message.

28. The network node according to claim 8, wherein the notification message comprises a desired value of the delay for the data portion.

29. The network node according to claim 8, wherein the notification message comprises a maximum value of the delay for the data portion.

30. The network node according to claim 8 comprising a processing device for determining the delay for a particular recipient such that it is below the preferred time span optimum for delivering the data portion.

31. The network node according to claim 8 comprising a processing device for determining delays that are distributed between a minimum value and the preferred time span for delivering the plurality of data portions.

32. The network node according to claim 13, wherein the processing device is adapted to determine delays that are distributed largely uniformly between the minimum value and the preferred time span.