WO1999022575A2 - Resource optimization function in a data and telecommunications system - Google Patents

Resource optimization function in a data and telecommunications system Download PDF

Info

Publication number
WO1999022575A2
WO1999022575A2 PCT/SE1998/001975 SE9801975W WO9922575A2 WO 1999022575 A2 WO1999022575 A2 WO 1999022575A2 SE 9801975 W SE9801975 W SE 9801975W WO 9922575 A2 WO9922575 A2 WO 9922575A2
Authority
WO
WIPO (PCT)
Prior art keywords
data stream
node
specific data
resource
data
Prior art date
Application number
PCT/SE1998/001975
Other languages
French (fr)
Other versions
WO1999022575A3 (en
Inventor
Jonas Malmkvist
Stefan Sandell
Original Assignee
Telia Ab (Publ)
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Telia Ab (Publ) filed Critical Telia Ab (Publ)
Priority to EP98954882A priority Critical patent/EP1027804B1/en
Priority to US11/325,695 priority patent/USRE40333E1/en
Priority to DE69835829T priority patent/DE69835829T2/en
Priority to US09/530,579 priority patent/US6678736B1/en
Priority to EEP200000185A priority patent/EE03644B1/en
Publication of WO1999022575A2 publication Critical patent/WO1999022575A2/en
Publication of WO1999022575A3 publication Critical patent/WO1999022575A3/en
Priority to NO20002141A priority patent/NO330167B1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/824—Applicable to portable or mobile terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/806—Broadcast or multicast traffic

Definitions

  • 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 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.
  • a computer transmits data over a network to a receiving computer.
  • 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.
  • 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.
  • the node throws data streams according to a predefined priority if the transmission capacity of the node has decreased. Since the data streams have real time demands, data will not be buffered.
  • 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.
  • the receiver wants to keep its reservations in the network also during the time when some data streams are stopped, because the reservation may not be possible to retrieve if it is deleted.
  • 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.
  • This aim is achieved by 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 number of nodes and another network consisting of links with large variation in bandwidth and quality, where a resource reservation protocol reserves resources in said fixed network for said data streams, at which said protocol attends to that if the transmission capacity of a node decreases and falls below the quality requirements of a specific data stream, said specific data stream is thrown, whereupon said node transmits a message which is executed in all nodes in said fixed network where resource reservations are provided towards said transmitting terminal, which message includes the steps of: updating said resource reservation for said specific data stream;
  • the invention shows a plurality of advantages in comparison with known technology.
  • the fixed network will, with this resource optimization function, have a considerable capacity improvement, i. e. the network will not be loaded by data which in any case is thrown at the node of 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.
  • Figure 1 is a diagrammatical presentation of the tele and data communications system according to the invention
  • Figure 2 is a diagrammatical presentation of a graph related to hierarchical coding according to the present invention .
  • Figure 1 shows a mobile computer, 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 bold 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.
  • the nodes deal with the resource reservations of the data streams separately.
  • the nodes deal with the resource reservations in common when the data streams are in common for all receivers 101 and 103.
  • the node 104 closest to the receiver 105, deals with the resource reservations in common.
  • the invention is primarily intended for the functionality in the node 106 at the interface towards 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.
  • 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 Figure 1, decreases, and the quality requirement of a data stream is no longer maintained, then the data stream in question will be thrown. After that the node transmits a message to the nodes (where the resource reservations are) towards the transmitter 105 (the computer in Figure 1) with the following content:
  • Update the resource reservation for the data stream i.e. keep the resourse reservations that are required to transmit the data stream.
  • the node transmits a message to the nodes (where the resource reservations are) towards the transmitter 105 with the following content:
  • Update the resource reservation for the data stream i.e. keep the resourse reservations that are required for transmission of the data stream.
  • Figure 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 functions.
  • Data streams 3 are strongly limited in time by the bandwidth function.
  • the data streams consequently are hierarchically coded, where data stream 1 is highest in the hierarchy.
  • Mobile computer 101 receives data with real time demands (controlled delay) from a transmitting computer 105 ( Figure 1) .
  • the mobile computer 101 selects to receive the data stream in a plurality of data streams with different priorities (Figure 2) .
  • each node resources are reserved separately for each data stream.
  • the node 106 closest to the radio channel receives momentarily information about which transmission capacity that is available over the radio channel .

Abstract

The invention relates to a method at a telecommunications system and a data communications system which adapts resource reservation protocol for fixed networks (102) to radio networks with large variation in bandwidth and quality. At hierarchical coding, a data stream is divided into separate data streams with different priorities. By the resource reservation protocol, then resources in the fixed network (102) for the data streams are reserved. A node in the fixed network throws the data streams according to a predecided priority if the transmission capacity of the node decreases. If the transmission capacity at this node decreases, and the quality requirement of a data stream fails to be kept up, the data stream in question is thrown. After that, the node transmits a message to the nodes where the resource reservations are, towards the transmitter (105) with the following content: update the resource reservations for the data stream, i.e. keep the resource reservations which are required to transmit the data stream; use the reserved resource temporarily for other traffic; throw the data stream until different is stated.

Description

TITLE OF THE INVENTION: RESOURCE OPTIMIZATION FUNCTION IN A
DATA AND TELECOMMUNICATIONS SYSTEM
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 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.
PRIOR 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 throws data streams according to a predefined priority if 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 also during the time when some data streams are stopped, because the reservation may not be possible to retrieve if it is deleted. At 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. At multicast traffic, i.e. a plurality of receivers of the same data streams, resources are reserved in common in nodes with data streams in common. For that reason the transmitter cannot stop the transmission of a 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.
SUMMARY OF THE INVENTION This aim is achieved by 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 number of nodes and another network consisting of links with large variation in bandwidth and quality, where a resource reservation protocol reserves resources in said fixed network for said data streams, at which said protocol attends to that if the transmission capacity of a node decreases and falls below the quality requirements of a specific data stream, said specific data stream is thrown, whereupon said node transmits a message which is executed in all nodes in said fixed network where resource reservations are provided towards said transmitting terminal, which message includes the steps of: updating said resource reservation for said specific data stream;
utilizing said resource reservation temporarily for other traffic;
throwing said specific data stream until different is stated.
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, i. e. the network will not be loaded by data which in any case is thrown at the node of 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.
At multicast traffic, data will be thrown 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.
BRIEF DESCRIPTION OF THE DRAWINGS In the following a detailed description of an embodiment of the invention is given, with reference to the enclosed drawings, of which:
Figure 1 is a diagrammatical presentation of the tele and data communications system according to the invention; Figure 2 is a diagrammatical presentation of a graph related to hierarchical coding according to the present invention .
DETAILED DESCRIPTION OF AN EMBODIMENT OF THE INVENTION
Figure 1 shows a mobile computer, 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 bold 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 Figure 1, the node 104, closest to the receiver 105, deals with the resource reservations in common. The invention is primarily intended for the functionality in the node 106 at the interface towards 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 Figure 1, decreases, and the quality requirement of a data stream is no longer maintained, then the data stream in question will be thrown. After that the node transmits a message to the nodes (where the resource reservations are) towards the transmitter 105 (the computer in Figure 1) with the following content:
Update the resource reservation for the data stream, i.e. keep the resourse reservations that are required to transmit the data stream.
Use the reserved resource temporarily for other traffic .
Throw the data stream until different is stated.
If the transmission capacity in the node increases, and the quality requirement for a data stream is fulfilled, the data stream shall be transmitted again. The node transmits a message to the nodes (where the resource reservations are) towards the transmitter 105 with the following content:
Update the resource reservation for the data stream, i.e. keep the resourse reservations that are required for transmission of the data stream. - Use the reserved resource for the intended data stream.
Both unicast and multicast traffic here are dealt with, with the same signalling message. At multicast traffic, resource reservations which are in common for a plurality of receivers 101 and 103 will not be affected.
Figure 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 functions. Data streams 3 are strongly limited in time by the bandwidth function. 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 data with real time demands (controlled delay) from a transmitting computer 105 (Figure 1) .
The mobile computer 101 selects to receive the data stream in a plurality of data streams with different priorities (Figure 2) .
In each node resources are reserved separately for each data stream.
The node 106 closest to the radio channel receives momentarily information about which transmission capacity that is available over the radio channel .
The bandwidth decreases, and the node 106 closest to the radio channel is forced to throw the lowest prioritized data stream (Figure 2) . In order not to overload the network 102 with data which in any case shall be thrown at the node 106, at the radio channel, a message is transmitted to the transmitter 105 (the computer) that it shall stop the transmission of the data stream of the lowest priority. The message which is transmitted to the transmitter 105 also contains the following information which is executed in all nodes 107 and 104 on the path to the transmitter 105:
- Update the resource reservation for the data stream, i.e. keep the resourse reservations that are required to transmit the data stream. Use the reserved resource temporarily for other traffic . - Throw the data stream until different is stated. Both unicast and multicast traffic here are dealt with, with the same signalling message. In the cases when the resources reservation is in common, all subjacent nodes must require that certain data streams be stopped for this request being forwarded in the common reservation. Consequently the data streams will not always be thrown in the nodes 104 where the resource reservation is in common. The bandwidth will increase and the node 106 closest to the radio channel decides that the data stream of the lowest priority again can be received. A message is transmitted to the transmitter 105 that the data stream of the lowest priority shall be transmitted. The 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.
- Update the resource reservation for the data stream, i.e. keep the resourse reservations which are required to transmit the data stream.
Use the reserved resource for the intended data stream.
The above mentioned is only to be regarded as an advantageous embodiment of the present invention, and the extent of protection is only defined by what is indicated in the following patent claims.

Claims

PATENT CLAIMS
1. Method at a data and telecoomuncations system for transmission of data streams between a receiving terminal (101) and a transmitting terminal (105) via at least one fixed network (102) including just any number of nodes and another netv/ork consisting of links with large variation in bandwidth and quality, at which a resource reservation protocol reserves resources in said fixed network (102) for said data streams, c h a r a c t e r i z e d in that said protocol attends to that, if the transmission capacity of a node, preferably the node (106) closest to said other network, decreases, and the quality requirement of a specific data stream fails to be kept up, said specific data stream is thrown, whereupon said node by means of said protocol transmits a message which is executed in other nodes where said resource reservations are, to said transmitting terminal (105) , which message includes the steps of : - updating said resource reservation for said specific data stream;
utilizing said resource reservation temporarily for other traffic;
throwing said specific data stream until different is stated.
2. Method according to patent claim 1, c h a r a c t e r i z e d in that if the transmission capacity in said node increases and the quality requirement for said specific data stream is fulfilled, said specific data stream shall be transmitted again, at which said node by means of said protocol transmits a message to said second nodes, where said resource reservations are, towards said transmitting terminal (105) , which message includes the steps of:
updating the resource reservation for said specific data stream;
using said resource reservation for said specific data stream.
3. Method according to patent claim 1 or 2 , c h a r a c t e r i z e d in that said other network is a radio network including at least one radio channel .
4. Method according to patent claim 3, c h a r a c t e r i z e d in that said node constitutes an interface towards said radio channel, at which said radio channel sets the limit regarding how many data streams that can be transmitted from said transmitting terminal (105) to said receiving terminal (101) .
5. Method according to some of the previous patent claims, c h a r a c t e r i z e d in that it is utilized at hierarchical coding of said data streams.
6. Method according to patent claim 1, c h a r a c t e r i z e d in that, at multicast traffic, said specific data stream in said other node as close to said transmitting terminal (105) as possible, is thrown without other receiving terminals (103) of the multicast traffic being affected, whereby said fixed network (102) is not loaded by said specific data stream, which in any case is thrown at said node lacking capacity.
7. Method according to some of the previous patent claims, c h a r a c t e r i z e d in that said node in said fixed network (102) which constitutes radio interface towards said radio channel receives momentary information about which transmission capacity that is available on said radio channel, at which said node by means of said protocol reserves resources in said fixed network regarding the transmission capacity of said radio channel.
PCT/SE1998/001975 1997-11-04 1998-10-30 Resource optimization function in a data and telecommunications system WO1999022575A2 (en)

Priority Applications (6)

Application Number Priority Date Filing Date Title
EP98954882A EP1027804B1 (en) 1997-11-04 1998-10-30 Resource optimization function in a data and telecommunications system
US11/325,695 USRE40333E1 (en) 1997-11-04 1998-10-30 Resource optimization function in a data and telecommunication system
DE69835829T DE69835829T2 (en) 1997-11-04 1998-10-30 RESOURCE OPTIMIZATION FUNCTION IN A DATA AND TELECOMMUNICATIONS SYSTEM
US09/530,579 US6678736B1 (en) 1997-11-04 1998-10-30 Resource optimization function in a data and telecommunications system
EEP200000185A EE03644B1 (en) 1997-11-04 1998-10-30 A resource optimization function in a data and communication system
NO20002141A NO330167B1 (en) 1997-11-04 2000-04-27 Resource optimization function in a data and telecommunication system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
SE9704020-8 1997-11-04
SE9704020A SE9704020L (en) 1997-11-04 1997-11-04 Method for resource optimization in a data and telecommunication system

Publications (2)

Publication Number Publication Date
WO1999022575A2 true WO1999022575A2 (en) 1999-05-14
WO1999022575A3 WO1999022575A3 (en) 1999-08-05

Family

ID=20408848

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE1998/001975 WO1999022575A2 (en) 1997-11-04 1998-10-30 Resource optimization function in a data and telecommunications system

Country Status (9)

Country Link
US (2) US6678736B1 (en)
EP (1) EP1027804B1 (en)
DE (1) DE69835829T2 (en)
DK (1) DK1027804T3 (en)
EE (1) EE03644B1 (en)
ES (1) ES2276479T3 (en)
NO (1) NO330167B1 (en)
SE (1) SE9704020L (en)
WO (1) WO1999022575A2 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1176766A1 (en) * 2000-07-24 2002-01-30 Lucent Technologies Inc. Telecommunications network having prioritised quality of service arrangements
WO2002091708A1 (en) * 2001-05-08 2002-11-14 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for controlling the transmission of media streams
WO2003017685A2 (en) * 2001-08-14 2003-02-27 Cellglide Technologies Corp. Estimation of resource capacity in cellular networks
CN100385869C (en) * 2003-02-03 2008-04-30 株式会社Ntt都科摩 An apparatus and a method for optimizing network resources in data communication

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003060638A (en) * 2001-08-15 2003-02-28 Sony Corp Content providing device and method therefor
US8380864B2 (en) * 2006-12-27 2013-02-19 Microsoft Corporation Media stream slicing and processing load allocation for multi-user media systems
CN103188725B (en) * 2011-12-29 2018-01-30 中兴通讯股份有限公司 A kind of adaptation of cooperation service, shunting transmission and stream switching method and system
CN104080121B (en) * 2013-03-26 2019-04-26 中兴通讯股份有限公司 A kind of method and system for transmitting data

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0478190A2 (en) * 1990-09-24 1992-04-01 AT&T Corp. Fair access of multi-priority traffic to distributed-queue dual-bus networks
EP0535860A2 (en) * 1991-10-04 1993-04-07 AT&T Corp. Congestion control for high speed packet networks
US5481537A (en) * 1994-03-31 1996-01-02 Crisler; Kenneth J. Transmission signalling technique for a reservation request

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6067383A (en) * 1995-09-12 2000-05-23 Matsushita Electric Industrial Co., Ltd. Coding method, coding apparatus, wavelet transform apparatus, and wavelet reverse transform apparatus
JPH09231143A (en) * 1996-02-23 1997-09-05 Sony Corp Communication control method
FI104142B (en) * 1996-10-25 1999-11-15 Nokia Mobile Phones Ltd Method for controlling the use of radio resources
US6058113A (en) * 1997-09-30 2000-05-02 Lucent Technologies, Inc. Method for enhancing resource reservation communication
US6353616B1 (en) * 1998-05-21 2002-03-05 Lucent Technologies Inc. Adaptive processor schedulor and method for reservation protocol message processing

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0478190A2 (en) * 1990-09-24 1992-04-01 AT&T Corp. Fair access of multi-priority traffic to distributed-queue dual-bus networks
EP0535860A2 (en) * 1991-10-04 1993-04-07 AT&T Corp. Congestion control for high speed packet networks
US5481537A (en) * 1994-03-31 1996-01-02 Crisler; Kenneth J. Transmission signalling technique for a reservation request

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1176766A1 (en) * 2000-07-24 2002-01-30 Lucent Technologies Inc. Telecommunications network having prioritised quality of service arrangements
WO2002091708A1 (en) * 2001-05-08 2002-11-14 Telefonaktiebolaget Lm Ericsson (Publ) Method and system for controlling the transmission of media streams
WO2003017685A2 (en) * 2001-08-14 2003-02-27 Cellglide Technologies Corp. Estimation of resource capacity in cellular networks
WO2003017685A3 (en) * 2001-08-14 2003-05-30 Cellglide Technologies Corp Estimation of resource capacity in cellular networks
CN100385869C (en) * 2003-02-03 2008-04-30 株式会社Ntt都科摩 An apparatus and a method for optimizing network resources in data communication

Also Published As

Publication number Publication date
NO20002141D0 (en) 2000-04-27
NO20002141L (en) 2000-06-20
DK1027804T3 (en) 2007-01-08
SE510147C2 (en) 1999-04-26
WO1999022575A3 (en) 1999-08-05
US6678736B1 (en) 2004-01-13
USRE40333E1 (en) 2008-05-20
DE69835829D1 (en) 2006-10-19
EP1027804B1 (en) 2006-09-06
SE9704020L (en) 1999-04-26
EE03644B1 (en) 2002-02-15
EP1027804A2 (en) 2000-08-16
NO330167B1 (en) 2011-02-28
EE200000185A (en) 2001-04-16
SE9704020D0 (en) 1997-11-04
DE69835829T2 (en) 2007-04-12
ES2276479T3 (en) 2007-06-16

Similar Documents

Publication Publication Date Title
US7110752B2 (en) Radio communication method and a radio station with software reconfiguration features
US6359901B1 (en) Method and apparatus for asynchronous adaptive protocol layer tuning
CN102791037B (en) Buffer status reporting
US7177268B2 (en) Packet distributing device
US7151747B2 (en) Controlling method of priority class setup of communication packet and system of the same
US20070025304A1 (en) System and method for prioritizing transmission legs for precaching data
US7039415B2 (en) Flexible scheme for configuring “Traffic volume measurement reporting criteria”
US7936696B2 (en) Efficient transmission of data to multiple network nodes
JP2000152321A (en) Method and system for channel assignment
CA2347018A1 (en) Computer communication
CN101006688A (en) Qos differentiation for WCDMA services mapped onto an E-DCH channel
CN104660507A (en) Control method and device for data flow forwarding route
EP1027804A2 (en) Resource optimization function in a data and telecommunications system
CA2124249C (en) Burst server stored switching system and its method
US7248598B2 (en) Method of and a system for lightening the signaling load of a multicast protocol applied to a network of terminals using a transmission medium that does not support mutual listening between terminals
CN101459615A (en) Method, terminal port and system for packet transmission
US20030235185A1 (en) Access mechanism assignment
JP2002247063A (en) Packet multiplexing system
WO2022264403A1 (en) Control system, control method, controller, and program
WO2022195651A1 (en) Control system, control method, controller, and program
US20240129791A1 (en) Data transmission method, apparatus, device, and storage medium
WO1999009685A2 (en) Wireless telecommunications system
KR100765329B1 (en) Station for tranceiving data in wavelength division multiple access network, wavelength division multiple access network including the same, and method of media access controlling for wavelength division multiple access network

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): EE JP LT LV NO US

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

AK Designated states

Kind code of ref document: A3

Designated state(s): EE JP LT LV NO US

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 1998954882

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1998954882

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 09530579

Country of ref document: US

WWG Wipo information: grant in national office

Ref document number: 1998954882

Country of ref document: EP