EP1246411B1 - Verfahren zum Multiplexen zweier Datenflüsse auf einen Funkkommunikationskanal und dazugehörender Sender - Google Patents
Verfahren zum Multiplexen zweier Datenflüsse auf einen Funkkommunikationskanal und dazugehörender Sender Download PDFInfo
- Publication number
- EP1246411B1 EP1246411B1 EP01440091A EP01440091A EP1246411B1 EP 1246411 B1 EP1246411 B1 EP 1246411B1 EP 01440091 A EP01440091 A EP 01440091A EP 01440091 A EP01440091 A EP 01440091A EP 1246411 B1 EP1246411 B1 EP 1246411B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- data
- data flow
- data packets
- priority data
- radio communication
- Prior art date
- Legal status (The legal status 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 status listed.)
- Expired - Lifetime
Links
Images
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/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/04—Registration at HLR or HSS [Home Subscriber Server]
Definitions
- the present invention relates to radio communication networks and more precisely to a method for multiplexing two data flows on one radio communication channel.
- Transmitters of a radio communication networks usually have to transmit several data flows simultaneously. These data flows may consist in several types of traffic data having several priorities or in signaling messages. Schematically, the transmitter may be represented as supporting as many queues as data flows to transmit simultaneously.
- the data flows can be transmitted in parallel on independent communication channels.
- the different data flows have to share the same radio communication channel or at least be processed sequentially at the transmitter so that a completely parallel processing of the different data flow is impossible.
- a policy determining how the different data flows have to be multiplexed on the single radio communication channel has to be defined at the transmitter.
- policies can be envisaged.
- each data flow is divided in a succession of data packets, the multiplexing policy being applied at the level of data packets.
- round robin One very simple policy named round robin consists in checking each data flow one after the other, in a predefined order. If data packets are available for transmission, one data packet is transmitted on the radio communication channel in the corresponding time slot, if not the next data flow is checked.
- Another policy consists in attributing different priorities to the different data flows, a data flow with a higher priority being allowed to transmit data packets with a higher priority than a data flow with a lower priority.
- the data flows with highest priority correspond to the traffic data requiring real time constraints as voice traffic or video.
- the data flows with lower priority corresponding to non real time traffic data.
- Signaling messages especially signaling messages required for the maintenance of the radio link (e.g. handover messages) occurring during the traffic data transmission phase should be granted the highest priority on the radio communication channel. For example, a handover procedure should be granted a higher priority than the traffic data (even real time traffic data) since the latter will no more be correctly received so long as the handover has not been performed.
- This problem is automatically solved in GERAN A/Gb mode using LAPDm as its layer 2 communication protocol for the signaling plane.
- this communication protocol enables only the transmission of a further data packet when an acknowledgement for the preceding packet has been received at the transmitter. This is due to the fact that the transmit window size is limited to one.
- the delay between the transmission of two high priority data packets is at least equal to one round trip delay, which is the minimum time required for the transmitter to send a data packet and receive its acknowledgement from the receiving entity.
- data packets belonging to traffic data flows with lower priority can be transmitted, reducing to the minimum either the delay in real-time data packets transmission or the pre-emption duration.
- the total time required for transmitting a signaling message segmented in several data packets is very long.
- US patent US 5,539,729 discloses a method for controlling overload in a system comprising high priority and low priority data packets. Each time a high priority packet is processed a counter is decremented. When the counter value reaches zero only low priority packets are temporarily transmitted.
- This method presents the inconvenient not to take into account dynamic modifications of the low priority data flow characteristics especially in radio communication system as GPRS or EDGE using adaptive modulation and coding schemes for transmission.
- a particular object of the present invention is to provide a method for multiplexing two data flows guarantying that the data flow having the highest priority is transmitted as fast as possible while not delaying or muting too much the transmission of data flow with a lower priority having however real-time constraints.
- Another object of the invention is to provide a transmitter of a radio communication network satisfying the two conditions listed above.
- the two data flows are multiplexed in such a way that the number of consecutive data packets belonging to the high priority data flow is limited to a predefined number of data packets depending on the codec used for coding the low priority data flow before transmission on the radio communication channel.
- the present invention has the advantage to accelerate the transmission of data packets belonging to the high priority data flow while guarantying enough transmission opportunities for data packets belonging to the low priority data flow in order not to interrupt the transmission of data packets belonging to the low priority data flow during a too long time that would cause irrecoverable delay or long muting for real time applications.
- a minimum time interval is provided for data packets belonging to the low priority data flow to be transmitted before a further data packet belonging to the high priority data flow is transmitted.
- FIG. 1 represents a simplified radio communication system where the method according to the present invention can be used.
- the radio communication system comprises a transmitter 11, a radio communication channel 12 and a receiver 13.
- Transmitter 11 is either a base station of the radio communication network or a radio terminal and receiver 13 vice-versa.
- the invention can also be used in a transmitter being a radio terminal.
- the simplified radio communication network is preferably a GERAN (GSM/EDGE Radio Access Network) functioning in a circuit switched mode (i.e. connected over an A or lu-cs interface to a mobile switching center) supporting voice services with real-time constraints.
- GSM/EDGE Radio Access Network GSM/EDGE Radio Access Network
- the simplified radio communication network can be a GERAN functioning in a packet switched mode (i.e. connected over an lu-ps interface to a Serving GPRS Support Node) supporting real time services as voice or video services.
- Transmitter 11 comprises two independent data flows 111, 112 containing data packets.
- the two data flows are multiplexed at multiplexer 113 according to the method of the present invention before being transmitted over radio communication channel 12.
- Both data flows 111, 112 are each treated as data queues processed with a first-in first out mechanism by multiplexer 113.
- Data flow 111 is herein called high priority data flow while data flow 112 is herein called low priority data flow.
- high priority data flow 111 comprises signaling messages generated by a layer-3 protocol, segmented in several data packets and queued in high priority data flow 111.
- signaling messages are for example "handover command” or "handover complete” messages occurring during the traffic data transmission phase.
- low priority data flow 112 comprises traffic data packets with real-time constraints i.e. short transmission delay and extremely low jitter as voice or video data packets.
- Multiplexer 113 has the role to select the data flow 111 or 112 from which one data packet will be transmitted on radio communication channel 12 in the next frame. This algorithm is part of the present invention and will be precisely described in the following.
- Figure 2 illustrates an implementation of the method according to the present invention.
- a variable "Count” is defined. It stores the number of consecutive data packets belonging to high priority data flow 111 transmitted on radio communication channel 12.
- a parameter "Count_max" representing the maximum number of consecutive packets belonging to high priority data flow 111 which are allowed to be transmitted on radio communication channel 12 is also defined.
- This parameter is either a system parameter broadcast on a control channel of the radio communication network or can be negotiated by the transmitter 11 at link establishment or is predetermined depending on the characteristics (e.g. codec type and mode for a voice flow) of the low priority data flow 112 or is predetermined irrespective of the characteristics of the low priority data flow 112.
- a timer "t" having a predefined duration T between its setting and expiry is also defined as a system parameter broadcast on a control channel of the radio communication network or negotiated by the transmitter 11 at link establishment or predetermined depending or not on the characteristics of the low priority data flow 112.
- This timer guaranties a minimum time duration T for data packets belonging to low priority data flow 112 to be transmitted before a further data packet belonging to the high priority data flow is transmitted on radio communication channel 12.
- This parameter is optional in the framework of the present invention but is used in a preferred embodiment of the invention.
- Figure 3 represents a succession of frames FN1, ..., FN8 on a time axis and illustrates an example for the contents of radio communication channel 12 obtained when using the method according to the present invention.
- high priority data flow 111 contains 3 data packets (e.g. representing a segmented signaling message) and low priority data flow 112 contains enough data packet to transmit so that data flow 112 is never empty.
- These data packets are preferably voice packets.
- the maximal number of consecutive data packets belonging to high priority data flow (Count_max) is equal to 2
- minimum time interval for the transmission of data packets belonging to low priority data flow T is chosen equal to the duration of two frames (40ms in this example).
- the first two data packets belonging to high priority data packet are transmitted in frame FN1 and FN2. Then during at least 2 frames (40ms) data packets belonging to low priority data flow are transmitted i.e. in frames FN3 and FN4. Then, high priority data flow is checked once more and the third data packet is transmitted in frame FN5. Since no more data packet remain for transmission in high priority data flow, data packets from low priority data flow can be transmitted in frames FN6 to FN8 and the followings.
- any new data packet entering the high priority data flow 111 interrupts the transmission of data packets belonging to low priority data flow 112 unless the last interruption happened less than T seconds ago. This is referred in the art as preemptive or stealing mode.
- Count_max and the timer duration T are preferably set depending on the results of simulations which will determine the acceptable quality degradation of the real-time low priority flow 112 when the latter is interrupted by the transmission of data packets belonging to high priority data flow (i.e. when the logical channel carrying the real-time flow is pre-empted by the logical channel carrying signaling or, in the case of GERAN, when a fast access channel (FACCH) pre-empts a traffic Channel(TCH)).
- FACCH fast access channel
- the speech quality degradation depends among other things on the codec type, the codec mode, the codec rate (full-rate, half-rate, quarter-rate), as a consequence the value of Count_max and T should preferably be chosen dependent on the codec used for coding speech before transmission on the radio communication channel.
- the method according the present invention allows mitigating the real-time data flow quality degradation without increasing unnecessarily the time delivery of layer-3 signaling messages segmented in several data packets. Indeed, messages shorter than Count_max data packets after segmentation will be sent in one round, provided there are no more outstanding unacknowledged data packets in the sending window.
- the transfer time is therefore limited to maximum Count_max *20 msec + one single-trip delay for such messages (compared to Count_max *(40 msec + round trip delay) with a LAPDm approach as described in prior art) in the case of a full-rate high priority data flow. For messages longer than Count_max data packets after segmentation, the transfer time is also reduced since T can be chosen shorter than a round-trip delay.
- the application of the method according to the present invention would consist in modifying the currently used RLC (Radio Link Control) protocol as defined in the specification 3GPP TS 44.060.
- the RLC protocol is preferably modified with the introduction of two new parameters: Count_max and T.
- Count_max is set equal to the window size used in the RLC protocol
- T is set equal to a round trip delay.
- this invention can be generalized to any layer 2 protocol and not only to RLC.
- FIG 4 shows an embodiment of a transmitter according to the present invention.
- a transmitter according to the present invention comprises a high priority data flow 1 1 1 , a low priority data flow 112, a multiplexer 113 and an antenna 114 for transmitting data packets on radio communication channel 12.
- Multiplexer 113 comprises a switch 41 having two possible positions.
- the switch 41 enables either the high priority data flow or the low priority data flow to transmit data packets on radio communication channel 12.
- Switch 41 is controlled by a control module comprising means 42 for counting the number of consecutive data packets belonging to the high priority data flow transmitted since the transmission of the latest data packet belonging to said low priority data flow.
- the control module further comprises a timer 43 for guarantying a minimum time interval for the transmission of available data packets belonging to the low priority data flow before transmission of further data packets belonging to the high priority data flow.
Claims (11)
- Verfahren zum Multiplexen von mindestens zwei Datenflüssen (111, 112) auf einem Funkkommunikationskanal (12) eines Funkkommunikationsnetzes, wobei jeder der Datenflüsse (111, 112) Datenpakete umfasst, die auf dem Funkkommunikationskanal (12) zu senden sind, wobei Datenpakete, die zu einem ersten der Datenflüsse gehören, hier als Datenfluss hoher Priorität (111) bezeichnet, eine höhere Sende-Priorität haben als Datenpakete, die zu einem zweiten der Datenflüsse gehören, hier als Datenfluss geringer Priorität (112) bezeichnet, wobei das Verfahren die folgenden Schritte umfasst:Senden mindestens eines Datenpaketes, falls verfügbar, das zum Datenfluss geringer Priorität (112) gehört, wenn die Anzahl aufeinander folgender Datenpakete, die zu dem Datenfluss hoher Priorität (111) gehören, die seit der Übertragung des letzten Datenpaketes, das zu dem Datenfluss geringer Priorität (112) gehört, übertragen wurden, eine vorher festgelegte Anzahl von Datenpaketen erreicht hat, wobei das Verfahren dadurch gekennzeichnet ist, dass:die vorher festgelegte Anzahl von Datenpaketen von dem Codec abhängt, der zur Codierung des Datenflusses geringer Priorität vor der Übertragung auf dem Funkkommunikationskanal (12) verwendet wird.
- Verfahren gemäß Anspruch 1, dadurch gekennzeichnet, dass es weiterhin den folgenden Schritt umfasst:Garantieren eines Mindest-Zeitintervalls für das Senden verfügbarer Datenpakete, die zu dem Datenfluss geringer Priorität (112) gehören, wenn die Anzahl aufeinander folgender Datenpakete, die zu dem Datenfluss hoher Priorität (111) gehören, eine vorher festgelegte Anzahl von Datenpaketen erreicht hat.
- Verfahren gemäß Anspruch 1, bzw. Anspruch 2, dadurch gekennzeichnet, dass das Mindest-Zeitintervall vom Codec abhängt, das zur Codierung des Datenflusses geringer Priorität vor der Übertragung auf dem Funkkommunikationskanal (12) verwendet wird.
- Verfahren gemäß Anspruch 1, dadurch gekennzeichnet, dass der Datenfluss hoher Priorität ein Protokoll mit erneuter Übertragung zum Senden der Datenpakete verwendet.
- Verfahren gemäß Anspruch 4, dadurch gekennzeichnet, dass das Protokoll mit erneuter Übertragung das Radio Link Control Protocol ist, wie in TS 3GPP 44.060 spezifiziert.
- Verfahren gemäß Anspruch 4, dadurch gekennzeichnet, dass das Mindest-Zeitintervall mindestens gleich der Antwortzeit ist, die für ein oder mehrere Datenpakete benötigt wird, die zu dem Datenfluss hoher Priorität (111) gehören und die beim Sender (11) durch das Protokoll mit erneuter Übertragung zu quittieren sind.
- Verfahren gemäß Anspruch 1, dadurch gekennzeichnet, dass das Mindest-Zeitintervall und die vorher festgelegte Anzahl von Datenpaketen vom Sender (11) beim Verbindungsaufbau ausgehandelt werden.
- Verfahren gemäß Anspruch 1, dadurch gekennzeichnet, dass der Datenfluss hoher Priorität (111) aus Signalisierungsnachrichten besteht und der Datenfluss geringer Priorität (112) aus Echtzeit-Verkehrsdaten besteht.
- Verfahren gemäß Anspruch 1, dadurch gekennzeichnet, dass es in einem GPRS- oder EDGE-Funk-Teilnehmeranschlussnetz verwendet wird, in dem ein Protokoll der Ebene 2 verwendet wird, das eine Fenstergröße von größer als 1 haben kann.
- Sender (11) eines Funkkommunikationsnetzes, das Mittel (113) zum Multiplexen von mindestens zwei Datenflüssen (111, 112) auf einem Funkkommunikationskanal (12) enthält, wobei jeder der Datenflüsse (111, 112) Datenpakete umfasst, die auf dem Funkkommunikationskanal (12) zu senden sind, wobei Datenpakete, die zu einem ersten der Datenflüsse gehören, hier als Datenfluss hoher Priorität (111) bezeichnet, eine höhere Priorität haben als Datenpakete, die zu einem zweiten der Datenflüsse gehören, hier als Datenfluss geringer Priorität (112) bezeichnet, wobei der Sender (11) dadurch gekennzeichnet ist, dass das Mittel (113) zum Multiplexen von zwei Datenflüssen folgendes umfasst:Mittel (42) zum Zählen der Anzahl aufeinander folgender Datenpakete, die zu dem Datenfluss hoher Priorität (111) gehören, die seit der Übertragung des letzten Datenpaketes, das zu dem Datenfluss geringer Priorität (112) gehört, übertragen wurden;Mittel (41) zum Ermöglichen des Sendens von mindestens einem Datenpaket, falls verfügbar, das zum Datenfluss geringer Priorität (112) gehört, wenn die Anzahl aufeinander folgender Datenpakete, die zu dem Datenfluss hoher Priorität (111) gehören, eine vorher festgelegte Anzahl von Datenpaketen erreicht hat, die von dem Codec abhängt, der zur Codierung des Datenflusses geringer Priorität vor der Übertragung auf dem Funkkommunikationskanal (12) verwendet wird.
- Sender gemäß Anspruch 10, dadurch gekennzeichnet, dass er weiterhin folgendes umfasst:Einen Zeitgeber (43) zum Garantieren eines Mindest-Zeitintervalls für das Senden verfügbarer Datenpakete, die zu dem Datenfluss geringer Priorität (112) gehören, wenn die Anzahl aufeinander folgender Datenpakete, die zu dem Datenfluss hoher Priorität (111) gehören, eine vorher festgelegte Anzahl von Datenpaketen erreicht hat.Mittel (41) zum Sperren des Sendens von Datenpaketen, die dem Datenfluss hoher Priorität (111) gehören, wenn der Zeitgeber (43) gestartet wird; undMittel (41) zum erneuten Freigeben des Sendens von Datenpaketen, die zu dem Datenfluss hoher Priorität (111) gehören, bei Ablauf des Zeitgebers (43), wenn Datenpakete, die zu dem Datenfluss hoher Priorität (111) gehören, zur Übertragung verfügbar sind.
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP01440091A EP1246411B1 (de) | 2001-03-30 | 2001-03-30 | Verfahren zum Multiplexen zweier Datenflüsse auf einen Funkkommunikationskanal und dazugehörender Sender |
DE60102071T DE60102071T2 (de) | 2001-03-30 | 2001-03-30 | Verfahren zum Multiplexen zweier Datenflüsse auf einen Funkkommunikationskanal und dazugehörender Sender |
AT01440091T ATE260007T1 (de) | 2001-03-30 | 2001-03-30 | Verfahren zum multiplexen zweier datenflüsse auf einen funkkommunikationskanal und dazugehörender sender |
US10/105,422 US7095717B2 (en) | 2001-03-30 | 2002-03-26 | Method for multiplexing two data flows on a radio communication channel and corresponding transmitter |
CNB021076820A CN1182737C (zh) | 2001-03-30 | 2002-03-29 | 用于把两个数据流复用在无线通信信道上的方法和相应的发射机 |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP01440091A EP1246411B1 (de) | 2001-03-30 | 2001-03-30 | Verfahren zum Multiplexen zweier Datenflüsse auf einen Funkkommunikationskanal und dazugehörender Sender |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1246411A1 EP1246411A1 (de) | 2002-10-02 |
EP1246411B1 true EP1246411B1 (de) | 2004-02-18 |
Family
ID=8183206
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP01440091A Expired - Lifetime EP1246411B1 (de) | 2001-03-30 | 2001-03-30 | Verfahren zum Multiplexen zweier Datenflüsse auf einen Funkkommunikationskanal und dazugehörender Sender |
Country Status (5)
Country | Link |
---|---|
US (1) | US7095717B2 (de) |
EP (1) | EP1246411B1 (de) |
CN (1) | CN1182737C (de) |
AT (1) | ATE260007T1 (de) |
DE (1) | DE60102071T2 (de) |
Families Citing this family (36)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE10228861B4 (de) * | 2002-06-27 | 2005-05-04 | Nec Europe Ltd. | Verfahren zur Übertragung von zeitsynchronen Daten |
US6999759B2 (en) * | 2003-03-14 | 2006-02-14 | Motorola, Inc. | Method and apparatus for providing deferrable data services in a cellular communication system |
DE10338746A1 (de) * | 2003-08-22 | 2005-03-17 | Siemens Ag | Verfahren zur Adaption der Datenbearbeitungs-Priorität von mehreren logischen Übertragungskanälen, zugehöriges Kommunikationsendgerät sowie Funknetzwerk |
US20050141495A1 (en) * | 2003-12-30 | 2005-06-30 | Lin Xintian E. | Filling the space-time channels in SDMA |
JP4371859B2 (ja) * | 2004-03-09 | 2009-11-25 | 日本電気株式会社 | 動画情報伝送方法および装置 |
GB0405875D0 (en) * | 2004-03-16 | 2004-04-21 | Nokia Corp | Transmission of messages between network entities in a wireless communications network |
KR100629501B1 (ko) * | 2005-01-11 | 2006-09-28 | 삼성전자주식회사 | 광 버스트 스위칭 네트워크에서 채널 할당 방법 |
US7606234B2 (en) * | 2005-06-14 | 2009-10-20 | Microsoft Corporation | Multi-stream acknowledgement scheduling |
US8483616B1 (en) | 2005-11-01 | 2013-07-09 | At&T Intellectual Property Ii, L.P. | Non-interference technique for spatially aware mobile ad hoc networking |
US8355410B2 (en) | 2007-08-17 | 2013-01-15 | At&T Intellectual Property I, L.P. | Location-based mobile gaming application and method for implementing the same using a scalable tiered geocast protocol |
US8149801B2 (en) * | 2007-08-17 | 2012-04-03 | At&T Intellectual Property Ii, L.P. | System and method for geocasting in a mobile ad hoc network |
US7525933B1 (en) * | 2005-11-30 | 2009-04-28 | At&T Intellectual Property Ii, L.P. | System and method for mobile ad hoc network |
US8777752B2 (en) | 2005-11-30 | 2014-07-15 | At&T Intellectual Property I, L.P. | Geogame for mobile device |
US8702506B2 (en) * | 2005-11-30 | 2014-04-22 | At&T Intellectual Property I, L.P. | Geogame for mobile device |
CN105357145B (zh) * | 2006-02-03 | 2019-12-27 | 诺基亚公司 | 从用户设备向无线网络提供基于阈值的缓冲器状态报告 |
US20080056192A1 (en) * | 2006-08-31 | 2008-03-06 | Piping Hot Networks Limited | Latency reduction by adaptive packet fragmentation |
US8126475B2 (en) * | 2006-10-09 | 2012-02-28 | Motorola Mobility, Inc. | Apparatus and method for uplink scheduling on shared channels |
GB2452913B (en) * | 2007-09-18 | 2011-06-15 | Virtensys Ltd | Queuing method |
JP4893581B2 (ja) * | 2007-10-23 | 2012-03-07 | 日本電気株式会社 | 多重化通信システム、送信処理装置、受信処理装置、多重化通信方法、送信処理方法、および受信処理方法 |
US9544922B2 (en) * | 2008-09-16 | 2017-01-10 | At&T Intellectual Property I, L.P. | Quality of service scheme for collision-based wireless networks |
US9118428B2 (en) * | 2009-11-04 | 2015-08-25 | At&T Intellectual Property I, L.P. | Geographic advertising using a scalable wireless geocast protocol |
US8712056B2 (en) | 2010-06-03 | 2014-04-29 | At&T Intellectual Property I, L.P. | Secure mobile ad hoc network |
US10016684B2 (en) | 2010-10-28 | 2018-07-10 | At&T Intellectual Property I, L.P. | Secure geographic based gaming |
US9007978B2 (en) * | 2010-12-07 | 2015-04-14 | Alcatel Lucent | Method and apparatus for improved multicast service |
US9319842B2 (en) | 2011-06-27 | 2016-04-19 | At&T Intellectual Property I, L.P. | Mobile device configured point and shoot type weapon |
US9161158B2 (en) | 2011-06-27 | 2015-10-13 | At&T Intellectual Property I, L.P. | Information acquisition using a scalable wireless geocast protocol |
US9495870B2 (en) | 2011-10-20 | 2016-11-15 | At&T Intellectual Property I, L.P. | Vehicular communications using a scalable ad hoc geographic routing protocol |
US8744419B2 (en) | 2011-12-15 | 2014-06-03 | At&T Intellectual Property, I, L.P. | Media distribution via a scalable ad hoc geographic protocol |
US9071451B2 (en) | 2012-07-31 | 2015-06-30 | At&T Intellectual Property I, L.P. | Geocast-based situation awareness |
US9210589B2 (en) | 2012-10-09 | 2015-12-08 | At&T Intellectual Property I, L.P. | Geocast protocol for wireless sensor network |
US9660745B2 (en) | 2012-12-12 | 2017-05-23 | At&T Intellectual Property I, L.P. | Geocast-based file transfer |
US9992021B1 (en) | 2013-03-14 | 2018-06-05 | GoTenna, Inc. | System and method for private and point-to-point communication between computing devices |
WO2015162734A1 (ja) | 2014-04-23 | 2015-10-29 | 三菱電機株式会社 | 中継装置およびデータ転送方法 |
JP6599131B2 (ja) * | 2014-05-20 | 2019-10-30 | ジーエヌ ヒアリング エー/エス | デジタル・オーディオのワイヤレス送信の新規な方法 |
CN107645647A (zh) * | 2017-09-21 | 2018-01-30 | 京信通信系统(中国)有限公司 | 一种多路音视频传输方法及装置 |
JP7040209B2 (ja) * | 2018-03-27 | 2022-03-23 | 富士通株式会社 | パケット処理装置及びパケット処理方法 |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5539729A (en) * | 1994-12-09 | 1996-07-23 | At&T Corp. | Method for overload control in a packet switch that processes packet streams having different priority levels |
DE19907085C1 (de) * | 1999-02-19 | 2000-04-13 | Siemens Ag | Verfahren zum Übertragen paketvermittelter Daten in einem Funk-Kommunikationssystem |
US6400699B1 (en) * | 2000-09-12 | 2002-06-04 | Iospan Wireless, Inc. | Transmission scheduler for a multiple antenna wireless cellular network |
-
2001
- 2001-03-30 AT AT01440091T patent/ATE260007T1/de not_active IP Right Cessation
- 2001-03-30 EP EP01440091A patent/EP1246411B1/de not_active Expired - Lifetime
- 2001-03-30 DE DE60102071T patent/DE60102071T2/de not_active Expired - Lifetime
-
2002
- 2002-03-26 US US10/105,422 patent/US7095717B2/en active Active
- 2002-03-29 CN CNB021076820A patent/CN1182737C/zh not_active Expired - Lifetime
Also Published As
Publication number | Publication date |
---|---|
DE60102071D1 (de) | 2004-03-25 |
EP1246411A1 (de) | 2002-10-02 |
CN1379602A (zh) | 2002-11-13 |
DE60102071T2 (de) | 2004-07-22 |
US20020141454A1 (en) | 2002-10-03 |
US7095717B2 (en) | 2006-08-22 |
CN1182737C (zh) | 2004-12-29 |
ATE260007T1 (de) | 2004-03-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1246411B1 (de) | Verfahren zum Multiplexen zweier Datenflüsse auf einen Funkkommunikationskanal und dazugehörender Sender | |
EP1615394B1 (de) | Verfahren und Vorrichtung zur Steuerung des Verlustes von Paketdaten in einem drahtlosen Netz | |
EP1411690B1 (de) | Verfahren zum Übertragen von GPRS Datenpaketen aus unterschiedlichen PDP Kontexten gemäss ihrer relativen Priorität | |
RU2474968C2 (ru) | Планирование с учетом приоритетов и управление доступом в сети связи | |
EP2103054B1 (de) | Signatursequenzen und verfahren für einen zeit-frequenz-selektiven kanal | |
US9699790B2 (en) | Intelligent uplink resource release control in a mobile station | |
ZA200205714B (en) | Method and arrangement for transferring information in a packet radio service with application-based choice of release mode. | |
US7860992B2 (en) | Method of and apparatus for adaptive control of data buffering in a data transmitter | |
US20080176576A1 (en) | Fast Indication of Uplink Voice Activity | |
CN106465349B (zh) | 用于检测用户设备中的静默时段状态的方法、系统和设备 | |
US8369273B2 (en) | Method and apparatus for discriminating between control messages and speech payload | |
US20040090936A1 (en) | Method and system for reducting traffic flow to a mobile node during handoff situations | |
US20050052997A1 (en) | Packet scheduling of real time packet data | |
CN100466616C (zh) | 一种abis接口反向拥塞控制方法和收发基站 | |
EP1275225B1 (de) | Verfahren und vorrichtung zum effizienten weiterreichen in datenpaketkommunikationssystemen | |
US20030139145A1 (en) | Data transmitting method and apparatus for guaranteeing quality of service in a data communication system | |
US8023490B2 (en) | Method for the transmission of data packets in a radio communication system based on high and low priority | |
US20040202129A1 (en) | Method, network nodes and system for sending data in a mobile communication network | |
WO2023130453A1 (en) | Methods and apparatus of packet classification for xr traffic | |
EP1481518B1 (de) | Vorrichtung und verfahren zur änderung der priorität von bypass-paketen in einem paket-basierten kommunikationssystem | |
US8023449B2 (en) | Method of data preservation and minimizing reduction in data throughput in the event of a cell change | |
CN112235833B (zh) | 数据流参数动态配置方法、会话管理功能实体 | |
EP2051429B1 (de) | Vorrichtung und Verfahren zum Einstellen einer Zeituhr und eines Zählers in einem mobilen Kommunikationssystem | |
KR100938096B1 (ko) | 통신시스템에서 버퍼를 관리하는 방법 및 장치 | |
JPH11261632A (ja) | 帯域割当制御方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
AX | Request for extension of the european patent |
Free format text: AL;LT;LV;MK;RO;SI |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: MUNIERE, VINCENT |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: MUNIERE, VINCENT |
|
17P | Request for examination filed |
Effective date: 20021018 |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: MUNIERE, VINCENT |
|
17Q | First examination report despatched |
Effective date: 20021211 |
|
AKX | Designation fees paid |
Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 Ref country code: CH Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 Ref country code: BE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040218 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REF | Corresponds to: |
Ref document number: 60102071 Country of ref document: DE Date of ref document: 20040325 Kind code of ref document: P |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040330 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040330 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040331 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040518 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040518 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20040518 |
|
NLV1 | Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act | ||
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
ET | Fr: translation filed | ||
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: MM4A |
|
26N | No opposition filed |
Effective date: 20041119 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040718 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20110328 Year of fee payment: 11 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20120330 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: GC Effective date: 20140717 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: RG Effective date: 20141016 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 15 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 16 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 17 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 18 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20200317 Year of fee payment: 20 Ref country code: GB Payment date: 20200318 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20200214 Year of fee payment: 20 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R071 Ref document number: 60102071 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: PE20 Expiry date: 20210329 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION Effective date: 20210329 |