|Publication number||USRE40333 E1|
|Application number||US 11/325,695|
|Publication date||May 20, 2008|
|Filing date||Oct 30, 1998|
|Priority date||Nov 4, 1997|
|Publication number||11325695, 325695, PCT/1998/1975, PCT/SE/1998/001975, PCT/SE/1998/01975, PCT/SE/98/001975, PCT/SE/98/01975, PCT/SE1998/001975, PCT/SE1998/01975, PCT/SE1998001975, PCT/SE199801975, PCT/SE98/001975, PCT/SE98/01975, PCT/SE98001975, PCT/SE9801975, US RE40333 E1, US RE40333E1, US-E1-RE40333, USRE40333 E1, USRE40333E1|
|Inventors||Jonas Malmkvist, Stefan Sandell|
|Original Assignee||Data Advisors Llc|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (8), Non-Patent Citations (1), Referenced by (2), Classifications (6), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
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:
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
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
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.
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.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5481537 *||Mar 31, 1994||Jan 2, 1996||Crisler; Kenneth J.||Transmission signalling technique for a reservation request|
|US6031827 *||Feb 19, 1997||Feb 29, 2000||Nokia Mobile Phones Limited||Method for radio resource control|
|US6038214 *||Feb 19, 1997||Mar 14, 2000||Sony Corporation||Method and apparatus for controlling communication|
|US6058113 *||Sep 30, 1997||May 2, 2000||Lucent Technologies, Inc.||Method for enhancing resource reservation communication|
|US6067383 *||Sep 12, 1996||May 23, 2000||Matsushita Electric Industrial Co., Ltd.||Coding method, coding apparatus, wavelet transform apparatus, and wavelet reverse transform apparatus|
|US6353616 *||Dec 28, 1998||Mar 5, 2002||Lucent Technologies Inc.||Adaptive processor schedulor and method for reservation protocol message processing|
|EP0478190A2 *||Sep 13, 1991||Apr 1, 1992||AT&T Corp.||Fair access of multi-priority traffic to distributed-queue dual-bus networks|
|EP0535860A2 *||Sep 24, 1992||Apr 7, 1993||AT&T Corp.||Congestion control for high speed packet networks|
|1||*||Jon Crowcroft, "Hierarchical Coding," Hypertext http://www.cs.ucl.ac.uk/staff/j.crowcroft/mmbook/book/node119.html, Dec. 3, 1998.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8380864 *||Feb 19, 2013||Microsoft Corporation||Media stream slicing and processing load allocation for multi-user media systems|
|US20080162713 *||Dec 27, 2006||Jul 3, 2008||Microsoft Corporation||Media stream slicing and processing load allocation for multi-user media systems|
|U.S. Classification||709/231, 709/230, 370/443, 709/234, 370/437|
|Apr 26, 2007||AS||Assignment|
Owner name: TELIA AB, SWEDEN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MALMKVIST, JONAS;SANDALL, STEFAN;REEL/FRAME:019218/0106;SIGNING DATES FROM 20000720 TO 20000804
Owner name: DATA ADVISORS LLC, NEVADA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TELIASONERA AB;TELIASONERA FINLAND OYJ;REEL/FRAME:019218/0150
Effective date: 20050422
Owner name: TELIASONERA AB, SWEDEN
Free format text: CHANGE OF NAME;ASSIGNOR:TELIA AB;REEL/FRAME:019220/0210
Effective date: 20021209
|Jun 22, 2011||FPAY||Fee payment|
Year of fee payment: 8
|Feb 10, 2012||AS||Assignment|
Owner name: INTELLECTUAL VENTURES I LLC, DELAWARE
Free format text: MERGER;ASSIGNOR:DATA ADVISORS LLC;REEL/FRAME:027682/0187
Effective date: 20120206
|Jun 24, 2015||FPAY||Fee payment|
Year of fee payment: 12