A method at a telecommunications system and a data communications system configured to adapt a resource reservation protocol for fixed networks to radio networks with a large variation in bandwidth and quality. Using a method of hierarchical coding, a data stream is divided into separate data streams with different priorities. Using the resource reservation protocol, resources in the fixed network for the data streams are reserved. A node in the fixed network shunts the data streams according to a pre-decided priority as the transmission capacity of the node decreases. Thus, if the transmission capacity at the node decreases and the quality requirement of a data stream cannot be maintained, the data stream in question is shunted. Upon shunting, the node transmits a message instructing upstream nodes to update their resource reservations; use the reserved resource temporarily for other traffic; and shunt the data stream until otherwise instructed.

Patent
   RE40333
Priority
Nov 04 1997
Filed
Oct 30 1998
Issued
May 20 2008
Expiry
Oct 30 2018
Assg.orig
Entity
Large
1
8
all paid
0. 12. A method, comprising:
updating a specific resource reservation corresponding to a specific data stream at an upstream node in a fixed network if a downstream node of another network is unable to maintain a predetermined transmission quality for the specific data stream;
shunting temporarily the specific data stream at the upstream node; and
utilizing temporarily the specific resource reservation at the upstream node for other traffic while still maintaining the correspondence of the specific resource reservation and the specific data stream for future reactivation.
0. 28. A system, comprising:
means for updating a specific resource reservation corresponding to a specific data stream at an upstream node in the fixed network if a downstream node of the another network is unable to maintain a predetermined transmission quality for the specific data stream;
means for shunting temporarily the specific data stream at the upstream node; and
means for utilizing temporarily the specific resource reservation at the upstream node for other traffic while still maintaining the correspondence of the specific resource reservation and the specific data stream for future reactivation.
0. 21. A machine readable medium having one or more executable instructions stored thereon that, when executed by a digital processing system, cause the processing system to perform operations comprising:
updating a specific resource reservation corresponding to a specific data stream at an upstream node in the fixed network if a downstream node of the another network is unable to maintain a predetermined transmission quality for the specific data stream;
shunting temporarily the specific data stream at the upstream node; and
utilizing temporarily the specific resource reservation at the upstream node for other traffic while still maintaining the correspondence of the specific resource reservation and the specific data stream for future reactivation.
1. A data and telecommunications transmission method configured to transmit a plurality of data streams between a receiving terminal and a transmitting terminal via at least one fixed network and another network, the another network comprising links with variable bandwidth and quality, and the fixed network being controlled by a resource reservation protocol, the method comprising:
updating a specific resource reservation corresponding to a specific data stream at an upstream node in the fixed network when a downstream node of the another network is unable to maintain a predetermined transmission quality for the specific data stream;
shunting temporarily the specific data stream at the upstream node; and
utilizing temporarily the specific resource reservation at the upstream node for other traffic while still maintaining the correspondence of the specific resource reservation and the specific data stream for future reactivation.
0. 8. A system, comprising:
a transmitting terminal capable of transmitting one or more data streams to a receiving terminal;
a fixed network comprising an upstream node, the fixed network capable of linking the transmitting terminal and receiving terminal; and
a second network comprising a down stream node, the second network capable of linking the transmitting terminal and the receiving terminal;
wherein the transmitting terminal is capable of updating a specific resource reservation corresponding to a specific data stream at the upstream node if the downstream node of the second network is unable to maintain a predetermined transmission quality for the specific data stream, and further wherein the transmitting terminal is capable of shunting temporarily the specific data stream at the upstream node, and further wherein the transmitting terminal is capable of utilizing temporarily the specific resource reservation at the upstream node for other traffic while still maintaining the correspondence of the specific resource reservation and the specific data stream for future reactivation.
2. The method according to claim 1, further comprising:
updating the specific resource reservation corresponding to the specific data stream at the upstream node in the fixed network when the downstream node of the another network is once again able to maintain the predetermined transmission quality for the specific data stream;
canceling the shunting of the specific data stream at the upstream node; and
utilizing the specific resource reservation at the upstream node for the specific data stream.
3. The method according to claim 1, said another network comprising:
a radio network including a radio channel.
4. The method according to claim 3, further comprising:
using an interface between the downstream node and the radio channel to set a limit regarding a total number of data streams that can be transmitted from the transmitting terminal to the receiving terminal.
5. The method according to claim 1, further comprising:
using hierarchical coding to prioritize the plurality of data streams.
6. The method according to claim 1, further comprising
controlling the temporary reallocation of resources in the fixed network so that, when multicast traffic is being transmitted, the specific data stream in the upstream node is shunted without affecting other receiving terminals of the multicast traffic.
7. The method according to claim 4, wherein said using an interface comprises:
receiving and processing momentary information about a transmission capacity of the radio channel.
0. 9. The system of claim 8, wherein the fixed network is further capable of updating the specific resource reservation corresponding to the specific data stream at the upstream node in the fixed network if the downstream node of the another network is able to maintain the predetermined transmission quality for the specific data stream, and further wherein the fixed network is capable of canceling the shunting of the specific data stream at the upstream node, and further wherein the fixed network is capable of utilizing the specific resource reservation at the upstream node for the specific data stream.
0. 10. The system of claim 8, wherein the fixed network is further capable of using hierarchical coding to prioritize the one or more data streams.
0. 11. The system of claim 8, wherein the fixed network is further capable of controlling the temporary reallocation of resources in the fixed network so that, if multicast traffic is being transmitted, the specific data stream in the upstream node is shunted without affecting other receiving terminals of the multicast traffic.
0. 13. The method of claim 12, further comprising:
updating the specific resource reservation corresponding to the specific data stream at the upstream node in the fixed network if the downstream node of the another network is able to maintain the predetermined transmission quality for the specific data stream;
canceling the shunting of the specific data stream at the upstream node; and
utilizing the specific resource reservation at the upstream node for the specific data stream.
0. 14. The method of claim 12, the another network comprising:
a radio network including a radio channel.
0. 15. The method of claim 14, further comprising:
using an interface between the downstream node and the radio channel to set a limit regarding a total number of data streams that can be transmitted from the transmitting terminal to the receiving terminal.
0. 16. The method of claim 15, wherein said using an interface comprises:
receiving and processing momentary information about a transmission capacity of the radio channel.
0. 17. The method of claim 12, the another network comprising:
a wireless network including a wireless channel.
0. 18. The method of claim 17, further comprising:
using an interface between the downstream node and the wireless channel to set a limit regarding a total number of data streams that can be transmitted from the transmitting terminal to the receiving terminal.
0. 19. The method of claim 12, further comprising using hierarchical coding to prioritize the plurality of data streams.
0. 20. The method of claim 12, further comprising controlling the temporary reallocation of resources in the fixed network so that, if multicast traffic is being transmitted, the specific data stream in the upstream node is shunted without affecting other receiving terminals of the multicast traffic.
0. 22. The machine readable medium of claim 21, wherein execution of the instructions causes further operations to be performed, said operations comprising:
updating the specific resource reservation corresponding to the specific data stream at the upstream node in the fixed network if the downstream node of the another network is able to maintain the predetermined transmission quality for the specific data stream;
canceling the shunting of the specific data stream at the upstream node; and
utilizing the specific resource reservation at the upstream node for the specific data stream.
0. 23. The machine readable medium of claim 21, wherein said another network comprises a radio network including a radio channel.
0. 24. The machine readable medium of claim 23, wherein an interface is employed between the downstream node and the radio channel to set a limit regarding a total number of data streams that can be transmitted from the transmitting terminal to the receiving terminal.
0. 25. The machine readable medium of claim 24, wherein, via use of said interface, execution of the instructions causes further operations to be performed, said operations comprising receiving and processing momentary information about a transmission capacity of the radio channel.
0. 26. The machine readable medium of claim 21, wherein execution of the instructions causes a further operation to be performed, said operation comprising using hierarchical coding to prioritize the plurality of data streams.
0. 27. The machine readable medium of claim 21, wherein execution of the instructions causes a further operation to be performed, said operation comprising controlling the temporary reallocation of resources in the fixed network so that, if multicast traffic is being transmitted, the specific data stream in the upstream node is shunted without affecting other receiving terminals of the multicast traffic.
0. 29. The system of claim 28, further comprising:
means for updating the specific resource reservation corresponding to the specific data stream at the upstream node in the fixed network if the downstream node of the another network is able to maintain the predetermined transmission quality for the specific data stream;
means for canceling the shunting of the specific data stream at the upstream node; and
means for utilizing the specific resource reservation at the upstream node for the specific data stream.
0. 30. The system of claim 28, further comprising means for using an interface between the downstream node and a radio channel of the another network to set a limit regarding a total number of data streams that can be transmitted from the transmitting terminal to the receiving terminal.
0. 31. The system of claim 28, further comprising a means for using hierarchical coding to prioritize the plurality of data streams.
0. 32. The method of claim 28, further comprising a means for controlling the temporary reallocation of resources in the fixed network so that, if multicast traffic is transmitted, the specific data stream in the upstream node is shunted without affecting other receiving terminals of the multicast traffic.

1. Field of the Invention

The present invention relates to a method at a data and telecommunications system for transmission of data streams between a receiving terminal and a transmitting terminal via at least one fixed network including just any to number of nodes and another network consisting of links with large variation in bandwidth and quality, at which a resource reservation protocol reserves resources in said fixed network for said data streams.

2. Background Art

A computer transmits data over a network to a receiving computer. At hierarchical coding, a data stream (with real time requirements, i.e. demands on controlled delay) is divided into separate data streams with different priorities. The data streams have different demands on quality. By a resource reservation protocol, resources then are reserved in the network for the data streams. Separate reservations are made for each data stream in all nodes from the receiver to the transmitter. At hierarchical coding, the node shunts data streams according to a predefined priority as the transmission capacity of the node, has decreased. Since the data streams have real time demands, data will not be buffered.

When hierarchical coding is used over a radio channel with large variation in bandwidth and quality, the number of data streams which can be transmitted over the radio channel will vary rapidly. The radio channel is the transmission link which in most cases will set a limit to the number of data streams that can be transmitted to the receiver. The data streams that are stopped at the node closest to the radio channel are still transmitted in the fixed network and therefore load the fixed network without due cause. At the same time, the receiver wants to keep its reservations in the network during the time when some data streams are stopped, because the reservation may not be possible to be retrieved if it is deleted. For unicast traffic, i.e. one receiver of data streams and separate resource reservations for each receiver, it is possible to signal to the transmitter to stop the transmission of a data stream. For multicast traffic, i.e. a plurality of receivers of the same data streams, resources are reserved in nodes with data streams in common. Thus, the transmitter cannot stop the transmission of any particular data stream since all other receivers then should be affected.

The aim of the present invention consequently is to solve this problem and provide multicast traffic without loading the fixed network without due cause.

This aim is achieved by a method of transmitting data streams between a receiving terminal and a transmitting terminal via at least one fixed network including any number of nodes and via another network consisting of links with a large variation in bandwidth and quality. The invention includes a resource reservation protocol that reserves resources in said fixed network for said data stream. The protocol includes monitoring if the transmission capacity of a node decreases and falls below the quality requirements of a specific data stream. If so, the specific data stream is shunted, whereupon said node transmits a message which is executed in all nodes in said fixed network so that resource reservations are then provided to said transmitting terminal for other subscribers. The message results in the networks:

The invention shows a plurality of advantages in comparison with known technology. For instance, the fixed network will, with this resource optimization function, have a considerable capacity improvement since the network will not be loaded by data which in any case is shunted at the downstream node lacking capacity.

The receiver will not lose its resource reservations during the time a data stream is stopped, which can happen if the receiver has to make new resource reservations each time the number of data streams is changed.

Resources which in other cases would not be utilized during the time a data stream is momentarily stopped, now can be utilized.

With multicast traffic, data will be shunted in a node as close to the transmitter as possible, without other receivers of the multicast traffic being affected. Further characteristics of the present invention are given in the sub-claims.

In the following a detailed description of an embodiment of the invention is given, with reference to the enclosed drawings, of which:

FIG. 1 is a diagrammatical presentation of the tele and data communications system according to the invention;

FIG. 2 is a diagrammatical presentation of a graph related to hierarchical coding according to the present invention.

FIG. 1 shows a mobile component, 101, connected to a fixed network, 102, consisting of nodes (N) via a radio channel with varying quality. The dashed arrow shows data streams which are transmitted to the mobile node 101. The hold arrow shows data streams which are in common for all receivers 101 and 103.

The mobile computer 101 can receive unicast traffic and multicast traffic. At unicast traffic, the nodes deal with the resource reservations of the data streams separately. At multicast traffic, the nodes deal with the resource reservations in common when the data streams are in common for all receivers 101 and 103. In FIG. 1, the node 104, closest to the transmitter 105, deals with the resource reservations in common.

The invention is primarily intended for the functionality in the node 106 at the entrance of the radio network, and in the nodes 104 and 107 which the data streams pass on the path from the transmitter 105, i.e. the computer, to the receiver 101, i.e. the mobile computer.

The functionality adapts resource reservation protocols created for fixed networks 102 to networks consisting of links with larger variations in bandwidth and quality, preferably radio networks. Previously known technology does not deal with resource optimization at resource reservations and hierarchical coding over links with varying quality.

Theoretically, the resource optimization function solves the network utilization problem at hierarchical coding, both for unicast traffic and multicast traffic.

If the transmission capacity at a node (in most cases the node 106 at the radio channel), see FIG. 1, decreases, and the quality requirement of a data stream is no longer maintained, then the data stream in question will be shunted. After that the node transmits a message to the nodes (where the resource reservations are) in the direction of the transmitter 105 (the computer in FIG. 1) with the following content:

If the transmission capacity in the node increases, and the quality requirement for a data stream is fulfilled, the data stream may be transmitted again. The node then transmits a message to the nodes (where the resource reservations are) in the direction of the transmitter 105 with the following content:

Both unicast and multicast traffic may be controlled with the same signalling message. With multicast traffic, resource reservations which are in common for a plurality of receivers 101 and 103 will not be affected.

FIG. 2 shows the internal priority of the data streams, where the data stream 1 has the highest priority and is not limited in time by bandwidth fluctuations.

Data streams 3 are strongly affected in time by the bandwidth fluctuation. The data streams consequently are hierarchically coded, where data stream 1 is highest in the hierarchy.

In the following an example is given of a conceived scenario:

Mobile computer 101 receives the data with real time demands (controlled delay) from a transmitting computer 105 (FIG. 1).

The mobile computer 101 selects to receive the data stream in a plurality of data streams with different priorities (FIG. 2).

At each node resources are reserved separately for each data stream.

The node 106 closest to the radio channel receives real-time information about the transmission capacity that is available over the downstream radio channel. If bandwidth decreases, the node 106 closest to the radio channel is forced to shunt the lowest prioritized data stream (FIG. 2).

In order not to overload the network 102 with data which in any case shall be shunted at the node 106, a message is transmitted to the transmitter 105 (the computer) that it shall stop transmitting the data stream with the lowest priority. The message also contains the following instructions which are executed in all nodes (e.g., nodes 107 and 104) on the path to the transmitter 105:

Both unicast and multicast traffic may be controlled with the same signalling message. In the cases when the resources reservation is in common, all upstream nodes must shunt the lowest priority data streams as this request is forwarded in the common reservation. Consequently the data streams will not always be shunted in the nodes 104 where the resource reservation is in common.

Eventually, the bandwidth increases and the node 106 closest to the radio channel decides that the data stream of the lowest priority again can now be received.

Then, a second message is transmitted to the transmitter 105 that the data stream of the lowest priority may again transmitted.

The second message which is transmitted to the transmitter 105 contains the following information which is executed in all nodes 107 and 104 on the path to the transmitter 105.

Having generally described this invention, a further understanding can be obtained by reference to certain specific examples which are provided herein for purposes of illustration only and are not intended to be limiting unless otherwise specified.

Malmkvist, Jonas, Sandell, Stefan

Patent Priority Assignee Title
8380864, Dec 27 2006 Microsoft Technology Licensing, LLC Media stream slicing and processing load allocation for multi-user media systems
Patent Priority Assignee Title
5481537, Mar 31 1994 Google Technology Holdings LLC Transmission signalling technique for a reservation request
6031827, Oct 25 1996 Nokia Technologies Oy Method for radio resource control
6038214, Feb 23 1996 Sony Corporation Method and apparatus for controlling communication
6058113, Sep 30 1997 WSOU Investments, LLC Method for enhancing resource reservation communication
6067383, Sep 12 1995 MATSUSHITA ELECTRIC INDUSTRIAL CO , LTD Coding method, coding apparatus, wavelet transform apparatus, and wavelet reverse transform apparatus
6353616, May 21 1998 Lucent Technologies Inc Adaptive processor schedulor and method for reservation protocol message processing
EP478190,
EP535860,
//////////
Executed onAssignorAssigneeConveyanceFrameReelDoc
Oct 30 1998Data Advisors LLC(assignment on the face of the patent)
Jul 20 2000MALMKVIST, JONASTelia ABASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0192180106 pdf
Aug 04 2000SANDALL, STEFANTelia ABASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0192180106 pdf
Dec 09 2002Telia ABTeliasonera ABCHANGE OF NAME SEE DOCUMENT FOR DETAILS 0192200210 pdf
Apr 22 2005TeliaSonera Finland OyjData Advisors LLCASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0192180150 pdf
Apr 22 2005Teliasonera ABData Advisors LLCASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0192180150 pdf
Apr 28 2005TELIASONERA AB & TELIASONERA FINLAND OYJData Advisors LLCASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0174450466 pdf
Feb 06 2012Data Advisors LLCIntellectual Ventures I LLCMERGER SEE DOCUMENT FOR DETAILS 0276820187 pdf
Nov 26 2019Intellectual Ventures I LLCINTELLECTUAL VENTURES ASSETS 161 LLCASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0519450001 pdf
Dec 06 2019INTELLECTUAL VENTURES ASSETS 161 LLCHANGER SOLUTIONS, LLCASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS 0521590509 pdf
Date Maintenance Fee Events
Jun 22 2011M1552: Payment of Maintenance Fee, 8th Year, Large Entity.
Jun 24 2015M1553: Payment of Maintenance Fee, 12th Year, Large Entity.


Date Maintenance Schedule
May 20 20114 years fee payment window open
Nov 20 20116 months grace period start (w surcharge)
May 20 2012patent expiry (for year 4)
May 20 20142 years to revive unintentionally abandoned end. (for year 4)
May 20 20158 years fee payment window open
Nov 20 20156 months grace period start (w surcharge)
May 20 2016patent expiry (for year 8)
May 20 20182 years to revive unintentionally abandoned end. (for year 8)
May 20 201912 years fee payment window open
Nov 20 20196 months grace period start (w surcharge)
May 20 2020patent expiry (for year 12)
May 20 20222 years to revive unintentionally abandoned end. (for year 12)