WO2008004053A2 - APPAREIL, PROCÉDÉ ET PROGICIEL PERMETTANT UN TRANSFERT AVEC DIFFUSION BIDIRECTIONNELLE SÉLECTIVE PAR UN NœUD DE RÉSEAU - Google Patents

APPAREIL, PROCÉDÉ ET PROGICIEL PERMETTANT UN TRANSFERT AVEC DIFFUSION BIDIRECTIONNELLE SÉLECTIVE PAR UN NœUD DE RÉSEAU Download PDF

Info

Publication number
WO2008004053A2
WO2008004053A2 PCT/IB2007/001739 IB2007001739W WO2008004053A2 WO 2008004053 A2 WO2008004053 A2 WO 2008004053A2 IB 2007001739 W IB2007001739 W IB 2007001739W WO 2008004053 A2 WO2008004053 A2 WO 2008004053A2
Authority
WO
WIPO (PCT)
Prior art keywords
property
packet flow
packets
downlink
casting
Prior art date
Application number
PCT/IB2007/001739
Other languages
English (en)
Other versions
WO2008004053A3 (fr
Inventor
Otso Auterinen
Original Assignee
Nokia Corporation
Nokia, Inc.
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 Nokia Corporation, Nokia, Inc. filed Critical Nokia Corporation
Publication of WO2008004053A2 publication Critical patent/WO2008004053A2/fr
Publication of WO2008004053A3 publication Critical patent/WO2008004053A3/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/24—Reselection being triggered by specific parameters
    • H04W36/26—Reselection being triggered by specific parameters by agreed or negotiated communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0011—Control or signalling for completing the hand-off for data sessions of end-to-end connection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/02—Buffering or recovering information during reselection ; Modification of the traffic flow during hand-off

Definitions

  • the exemplary and non-limiting embodiments of this invention relate generally to wireless communications systems, methods, computer program products and devices and, more specifically, relate to hand over or hand off (HO) procedures executed when a user equipment (UE) changes cells
  • HO hand over or hand off
  • BS Base Station may also be referred to as a Node-B
  • IP VoIP Voice over Internet Protocol
  • the LTE and SAE of 3GPP and other cellular networks are particularly amenable to the use of a flat, two layer system architecture.
  • a flat architecture an inter-BS HO (from a first, source BS to a second, target BS) of a UE takes place by switching a tunnel in an anchor point in an anchor node that is typically located in a network GW.
  • non-tunneling methods with the same effect as tunnel switching for packet forwarding, e.g. DNAT-based switching of the packet route to the new BS could be used in place of tunnel switching.
  • an inter-BS forwarding of control and user plane information may be used.
  • the delay requirements and cost related to providing sufficient connectivity between BSs makes the use of inter-BS communication less than desirable. This is true at least for the reason that a need exists to quickly begin the delivery of DL data to the target BS to ensure minimal probability of a packet loss occurring for the UE during HO.
  • HO is defined as a transfer of a user's connection from one radio channel to another (can be the same or a different cell), and is also defined as a process in which the RAN changes the radio transmitters or radio access mode or radio system used to provide bearer services, while maintaining a defined bearer service QoS.
  • a method that includes, during a handover of a user equipment (UE) from a first base station (B S 1 ) to a second base station (BS2), determining at an anchor node at least one property of a downlink packet flow, and bi-casting downlink packets in the downlink packet flow to BS 1 and BS2 only when the at least one property of the downlink packet flow is determined to comprise at least one predetermined property.
  • UE user equipment
  • a network node that comprises: means, responsive during a handover of a user equipment (UE) from a first base station (BSl) to a second base station (BS2), for determining at least one property of a downlink packet flow; and means, responsive to the determination, for bi-casting downlink packets in the downlink packet flow to BSl and BS2 only when the at least one property of the downlink packet flow is determined to comprise at least one predetermined property.
  • UE user equipment
  • BSl base station
  • BS2 second base station
  • a computer program product embodied in at least one computer readable storage media.
  • the computer program product includes instructions, the execution of which by at least one data processor of a network node results in operations that include: during a handover of a user equipment (UE) from a first base station (BS 1) to a second base station (BS2), determining at an anchor node a property of a downlink packet flow; and bi-casting downlink packets in the downlink packet flow to BS 1 and BS2 only when the at least one property of the downlink packet flow is determined to comprise at least one predetermined property as the property.
  • UE user equipment
  • an apparatus in accordance with exemplary embodiments of the disclosed invention, includes one or more memories including program code.
  • the apparatus also includes one or more processors coupled to the one or more memories.
  • the one or more data processors is configured when executing the program code to perform the following operations: during a handover of a user equipment (UE) from a first base station (BSl) to a second base station (BS2), determining at least one property of a downlink packet flow; and bi-casting downlink packets in the downlink packet flow to BSl and BS2 only when the at least one property of the downlink packet flow is determined to comprise at least one predetermined property.
  • UE user equipment
  • BSl base station
  • BS2 second base station
  • Figure 1 shows a simplified block diagram of various electronic devices that are suitable for use in practicing the exemplary embodiments of this invention.
  • Figure 2 is a message flow diagram that is illustrative of the exemplary embodiments of this invention, and which shows message flow for HO with selective bi-casting by an anchor GW, with buffering for predictive bi-casting.
  • FIGS 3, 4, and 5 are each a logic flow diagram illustrative of exemplary embodiments of this invention.
  • Figure 6 is a block diagram of another exemplary anchor GW.
  • a wireless network 1 is adapted for communication with a UE 10 via a first BS (BSl), referred to in the drawing as BS 12.
  • the network 1 may include a GW, referred to herein as the aGW 14, or other controller function.
  • the UE 10 includes a data processor (DP) 1 OA, a memory (MEM) 1 OB that stores a program (PROG) 1 OC, and a suitable radio frequency (RF) transceiver 1 OD for bidirectional wireless communications with the Node B 12, which also includes a DP 12A, a MEM 12B that stores a PROG 12C, and a suitable RF transceiver 12D.
  • the BS 12 is coupled via a data path 13 to the aGW 14 that also includes a DP 14A and a MEM 14B storing an associated PROG 14C.
  • the aGW 14 is typically coupled to other network 1 components (not shown) by the same or another data path 15.
  • packets that are to be sent on the DL to the UE 10 will typically be received from some source of packets via data path 15.
  • the functionality of these other network nodes is not germane to an understanding of this invention, and they are not discussed further.
  • At least one of the PROGs 1OC, 12C and 14C is assumed to include program instructions that, when executed by the associated DP, enable the electronic device to operate in accordance with the exemplary embodiments of this invention, as will be discussed below in greater detail.
  • Shown in Figure 1 is also a second BS (BS2), also referred to in the drawing as BS 12', it being assumed that the first BS (BSl) establishes a first cell (Cell 1) and the second BS (BS2) establishes a second cell (Cell 2), and that the UE 10 is capable of a HO from one cell to another.
  • the Cell 1 may be assumed to be a currently serving cell and the BSl as the source BS, while Cell 2 maybe a neighbor or target cell to which HO may occur, and the BS2 is thus the target BS. Note that while shown spatially separated, Cell 1 and Cell 2 will typically be adjacent and/or overlapping, and other cells will typically be present as well.
  • the exemplary embodiments of this invention may be implemented by computer software executable by the DP 1 OA of the UE 10, the DPs 12A of the BSl and BS2, and the DP 14A of the aGW 14, or by hardware, or by a combination of software and/or firmware and hardware.
  • the various embodiments of the UE 10 can include, but are not limited to, cellular telephones, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, image capture devices such as digital cameras having wireless communication capabilities, gaming devices having wireless communication capabilities, music storage and playback appliances having wireless communication capabilities, Internet appliances permitting wireless Internet access and browsing, as well as portable units or terminals that incorporate combinations of such functions.
  • PDAs personal digital assistants
  • portable computers having wireless communication capabilities
  • image capture devices such as digital cameras having wireless communication capabilities
  • gaming devices having wireless communication capabilities
  • music storage and playback appliances having wireless communication capabilities
  • Internet appliances permitting wireless Internet access and browsing, as well as portable units or terminals that incorporate combinations of such functions.
  • the MEMs 1 OB, 12B and 14B may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor-based memory devices, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory.
  • the DPs 1OA, 12A and 14A maybe of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on a multi-core processor architecture, as non-limiting examples.
  • an anchor point in the core NW such as the aGW 14, is used for bi-casting of downlink user data to the source and target BSs (BSl, BS2), where bi-casting is used selectively as a function of flow QoS. More specifically, for time-critical packet flows the bi-casting to BSl and BS2 is activated immediately when HO preparation is initiated. Thus, data packets that arrive for the flow once bi-casting is initiated will be communicated to both BSl and BS2. Being time-critical is one property of a flow. As described in more detail below in reference to FIG.
  • the bi-casting is started by sending packets that were already previously sent to the source BS (BSl).
  • the anchor node stores packets for some period of time after they have been delivered to the serving BS (BSl) so that they can be subsequently sent to the target BS (BS2).
  • the bi-casting is selectively not activated, and downlink packet delivery by the anchor node is paused in response to the initiation of HO. Packet delivery to the target BS (BS2) is then resumed after the HO of the UE 10 is completed.
  • a non-limiting example of a DL packet flow having a property of being time-critical may be packets associated with a real-time or approximately real-time event, such as a VoIP call, or a streaming video or audio download (e.g., events associated with the above-mentioned Conversational and Streaming QoS classes).
  • the classes discussed above are also properties of a DL packet flow.
  • a non-time-critical packet flow another property of a DL packet flow, may be a download to the UE 10 of a web page from an Internet server, or email delivery, or typical interactive operation (e.g., events associated with the above- mentioned Interactive and Background QoS classes).
  • a DL packet flow that is considered to be (e.g., marked as) critical.
  • Critical DL packet flows are those flows that require secure delivery, i.e., low drop probability, with potentially slow delivery (e.g., on transport data path 13 of Figure 1 or over the wireless link of Figure 1).
  • Packet flow for streaming video is one example of a critical DL packet flow.
  • a packet flow that has a property of being critical may also have the property of being time-critical.
  • the Streaming QoS class e.g., maybe considered in different embodiments to have a property of critical but not time-critical, to have properties of critical and time-critical, or to have a property of time-critical but not critical.
  • Packet sequence numbering is used to control the DL packet delivery from the BS to the UE 10. Sequence number-based delivery from the anchor node is preferably used for the paused DL flows. Sequence numbering is also used for timing of title HO command by informing the source BS (BS 1) of the initiation of bi-casting by reporting Hie related sequence numbers per flow from the anchor point.
  • BS 1 source BS
  • packet delivery to the UE 10 is assured since 'recent historical' packets are sent as well (bi-cast) to the target BS (BS2).
  • transport usage is optimized since delay-tolerant packets are not bi- cast, thereby conserving communication bandwidth.
  • low capacity BSs do not require additional link capacity because of bi-casting, and BS-BS forwarding problems are avoided.
  • each messag ⁇ n may be composed of one message or a plurality of messages, possible both in the UL and DL directions.
  • the message(s) labeled as 0 refer to the conventional measurement reporting from the UE 10 to the source BS (BSl) at the start of HO. It may be assumed that at this point at least one DL packet flow is in process prior to the HO, and that the UE 10 QoS requirements for on-going packet flow(s) are known to the aGW 14.
  • This message is sent from the source BS (BSl) to the aGW 14, and includes information to prepare for the HO (e.g., information pertaining to BS2 and the RAN Context).
  • the sequence number of the last packet in each (QoS) flow assumed to be successfully transmitted to the UE 10 before the HO are also sent by the BSl.
  • the aGW 14 is in one embodiment constantly saving (e.g., buffering) DL packets that are sent to BS 1 , and that after the receipt of Message 1 the aGW 14 has paused and started to buffer selected (including non-time-critical) DL flows (at operation B).
  • Data packets that are constantly saved include time-critical packets (e.g., need to be delivered within a time period) and critical packets (e.g., are to be securely delivered but might not be time-critical), where critical, non-critical, and time critical are properties associated with the packets and their corresponding DL packet flow.
  • the aGW 14 informs the source BS (BSl) of the prepared RLID, and also of the preparation to begin bi-casting by indicating on a per flow basis the sequence number of first packet to be bi-cast. Additionally, the packet flow or flows where DL forwarding by the aGW 14 has been paused are indicated to the BSl.
  • the aGW 14 makes the decision to pause a flow according to the QoS class of the flow (e.g., does the flow have the property of being time critical, or being non-time critical, e.g., is best effort delivery specified?).
  • the aGW 14 may have previously chosen to buffer packets sent to the BS 1 as a preparatory action for the coming HO (operation A).
  • the aGW 14 informs BS2 of which packet flow(s) will (probably) be bi-cast before HO completion.
  • the BSl commands the UE 10 to perform HO to BS2.
  • the identifications e.g. sequence numbers
  • the identifications e.g. sequence numbers
  • a sequence number may have been already delivered with each packet to UE, and sequence numbers need not be separately communicated. Ih this case the UE assumes that the packet with next sequence number is available from BS2.
  • the BSJ2 informs the aGW 14 about those flows for which it is ready to receive packets for DL forwarding, and in response the aGW initiates forwarding of packets (bi-castirig of the packets previously determined to be time critical). These bi-cast data packets are temporarily buffered in the memory 12B of the BS2 12', as the HO to the UE 10 is not yet fully completed. Note that this bi-casting operation assumes that the same packets are being sent to BSl and to BS2.
  • the UE 10 performs the HO and attaches to BS2.
  • the UE 10 informs the BS2 on a per flow basis the sequence number of last received packet (from BSl prior to the HO).
  • BS2 also activates the UE 10 context, and starts forwarding UL packets and the DL packets already available in BS2.
  • the BS2 informs the aGW 14 of the HO completion, and also informs the aGW 14 of the sequence numbers of those flows not previously activated in the message exchange 5.
  • the aGW 14 initiates forwarding of packets for those flow(s) from the indicated sequence number, and these packets, as well as the packets previously bi-cast at 5 (if needed), are forwarded to the UE 10.
  • the BS2 will likely have already received the "missing" packet as part of the previously bi-cast packets from the aGW 14, and may then begin the forwarding of packets from one of the earlier, bi-cast packets previously received and stored in the memory 12B. Note that in this case latency is reduced for time-critical packets, as the BS2 already has the "missing" packet and can begin the forwarding immediately, without having to contact the aGW 14 (or the BSl), to obtain the missing packet.
  • data packets and corresponding flows that have been delayed instead of being bi- cast are sent to the BS2 after message 7 to BS2.
  • the BS 1 could initiate HO preparation to several targets (e.g., several BS2s), and all or all but one of the preparations may be cancelled. If all preparations are cancelled, flows are restarted for DL delivery via BS 1.
  • the aGW 14 signals the BSl to release the previous context for the UE 10, which is then removed by the BSl. At this time the UE 10 is already connected to the BS2 and is receiving both the time critical and the previously paused and buffered non-time critical packets -from BS2. In an exemplary embodiment, this message is optional, and the resources may be cleared by BS 1 after message 4. Use of this message (message 8) enables a state of UE context in BS 1 , which is same as state of UE context in BS2 after message 5 (e.g., Ready-for-HO).
  • message 5 e.g., Ready-for-HO
  • more than two base stations may have the UE in Ready-for-HO state.
  • Each message 1 brings the UE to this state, and message 7 causes UE context to be released from a BS.
  • message 3 contains a list of base stations which will - after the message 6 - have the context in Ready-for-HO and message 7 contains a list of base stations in which the context should be released.
  • the exemplary embodiments of this invention provide a method that includes, during a handover of the UE 10 from BSl to BS2, determining at an anchoT node (e.g., the aGW 14) if a downlink packet flow is a time-critical flow (Block 3A) (e.g., if the packet flow has a property of being time-critical); and if it is, selectively bi-casting downlinkpackets to BSl andBS2 only for apacketflow determined to be time-critical (B).
  • an anchoT node e.g., the aGW 14
  • a time-critical flow may be one associated with a real-time or substantially realtime event (DL voice, video or audio packet flows, as non-limiting examples). If a certain packet flow is determined to have a property of not being time-critical, the method further includes pausing sending of the certain packet flow (Block 3C) and restarting the sending of the packet flow after the UE 10 has connected to BS2 (Block 3D). It is noted that incoming packets are typically dropped in Block 3C.
  • the exemplary embodiments of this invention further provide a method that includes detecting a HO of the UE 10 from BSl to BS2, where a downlink packet flow is in process from BSl to the UE (Block 4A); and selectively one of initiating bi-casting of data packets to BS 1 and BS2, or pausing the sending of data packets to BS 1 , and restarting the sending of data packets to BS2, based on at least one QoS requirement of the flow (Block 4B).
  • the at least one QoS requirement is a property of the flow.
  • Block 5A a DL packet flow is critical
  • Critical DL packet flows are those flows that require secure delivery, i.e., low drop probability, with slow delivery (e.g., on transport data path 13 of Figure 1 or over the wireless link of Figure 1).
  • Packet flow for streaming video is one example of a critical DL packet flow.
  • Blocks 5B-5E are similar to the blocks of the method shown in Figure 3.
  • data packets 502 that have been communicated to the BSl are stored in memory 501 , which is accessible (e.g., as memory 14B) by the aGW 14 of Figure 1.
  • the data packets 502 are stored for some predetermined time period, e.g., after the data packets 502 are transmitted to BS 1 by the aGW 14. New packets that arrive will then take the place of data packets 502 already in memory 501.
  • the aGW 14 may store N data packets 502-1 through 502-N, with one packet being the oldest packet (i.e., been stored the longest) and another packet being the newest packet (i.e. , being stored the least amount of time).
  • the number N in an embodiment is based on time after the first packet 502-1 arrived.
  • the N+l packet arrives the first packet is dropped, the next-to-oldest packet will be the oldest packet, and the N+l packet will be the newest packet, such that at any time typically there will be N packets, 502-1 through 502-N.
  • This is a first-in, first-out (FIFO) type of arrangement.
  • Block 5A Y
  • Block 5F time-critical
  • Block 5G will not need more than the N data packets 502, as the stored packets 502-1 through 502-N can be communicated from the aGW 14 to the BS2 very quickly, before a new packet arrives.
  • a new packet N+l arrives, at least one of the packets 502-1 through 502-N will have been communicated to BS2, and the new packet N+l will take the place of the oldest packet of packets 502- 1 through 502-N.
  • no more memory other than memory for packets 502- 1 through 502- N is generally needed for Block 5G.
  • memory 301 may also be used for time-critical but non-critical DL packet flows.
  • Block 5C might also store packets in memory 301 or packets might be stored in memory 301 at Operation B of Figure 2. Operation B of Figure 2 would typically take place prior to Block 5A of Figure 5.
  • blocks 5F, 5G, 5H, and 51 can be considered in broad terms to communicate to BS2 stored downlink packets previously sent to BSl and communicate to at least BS2 downlink packets that have not been previously sent to BS 1 and that arrive at the anchor node as part of the downlink packet flow.
  • the methods shown in Figures 3-5 could perform packet classification based on properties of the packets for the DL packet flow in a multi-phase analysis or in single phase analysis.
  • a single phase analysis is an analysis where all properties (typically a plurality of properties) are determined.
  • a multi-phase analysis is an analysis where not all properties are determined in any single phase of the analysis, and more than one phase is used to determine the properties, which are needed to choose the forwarding method (e.g., methods as show in FIGS. 3-5 and particularly shown in blocks 5C, 5D, 5E, 5G, 5H, and 51 of Figure 5).
  • One implementation of aGW 14 could use single phase analysis to determine all properties needed by forwarding decisions in blocks 5A, 5B, and 5F.
  • aGW 114 comprises an initial flow analyzer component 120, an immediate forwarding component 130, and a storing and forwarding component 140.
  • the initial flow analyzer component 120 comprises one or more data processors 121 and one or more memories 123 including a program 125 and packets 127.
  • the immediate forwarding component 130 comprises one or more data processors 131 and one or more memories 133 including a program 135 and an egress queue 136 containing packets 137.
  • the storing and forwarding component 140 comprises one or more data processors 141 and one or more memories 143 including a program 145, new packets 147 (e.g., packets that have not been previously delivered to BSl) and old packets 148 (e.g., packets previously delivered to BSl).
  • Each of the initial flow analyzer component 120, immediate forwarding component 130, storing and forwarding component 140 operate under direction (at least in part) of a corresponding program 125, 135, and 145, respectively.
  • Each of the components 120, 130, and 140 could be considered a separate apparatus and could be, e.g. , separate physical elements such as separate packages coupled through buses or separate areas of an integrated circuit interconnected through buses.
  • one or more of the components could be implemented as a special-purpose integrated circuit.
  • the aGW 114 could use several phases so that, e.g., a decision in block 5A of Figure 5 is made based on the firstphase in the initial flow analyzer component 120. Based on the decision made by the initial flow analyzer component 120, the packets 127 are communicated along either path 150 or path 151. Analysis for a decision in block 5B could be implemented in immediate forwarding component 130, i.e., packets 127 would be analyzed and dropped (block 5D) before putting into the egress queue 136 or put into the egress queue 136 as packets 137 andbi-castto BSl and BS2 (block 5C).
  • immediate forwarding component 130 i.e., packets 127 would be analyzed and dropped (block 5D) before putting into the egress queue 136 or put into the egress queue 136 as packets 137 andbi-castto BSl and BS2 (block 5C).
  • Analysis for a decision of block 5F could be implemented in storing and forwarding component 140, which examines packets 127 and places the packets in the memory 143 as new packets 147 for storage in block 5H or for bi-casting the packets 127 directly to BSl and BS2 (block 5G) with or without some temporary storage as new packets 147.
  • the storing and forwarding component 140 also will typically send old packets 148 to BS2 (blocks 51 and 5G).
  • the various embodiments maybe implemented in hardware or special purpose circuits, software, logic or any combination thereof.
  • some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the exemplary embodiments of the invention are not limited thereto .
  • While various aspects of the invention may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.
  • the individual blocks of the logic flow diagrams of Figures 3, 4, and 5 may be viewed as method steps, or as program modules of a computer program product, or as a collection of interconnected hardware/firmware logic units.
  • Embodiments of the inventions may be practiced in various components such as integrated circuit modules.
  • the design of integrated circuits is by and large a highly automated process.
  • Complex and powerful software tools are available for converting a logic level design into a semiconductor circuit design ready to be etched and formed on a semiconductor substrate.
  • Programs such as those provided by Synopsys, Inc. of Mountain View, California and Cadence Design, of San Jose, California automatically route conductors and locate components on a semiconductor chip using well established rules of design as well as libraries of pre-stored design modules.
  • the resultant design in a standardized electronic format (e.g., Opus, GDSII, or the like) may be transmitted to a semiconductor fabrication facility or "fab" for fabrication.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Lors d'un transfert d'un équipement utilisateur (UE) d'une première station de base (BS1) à une seconde station de base (BS2), un procédé est mis en oeuvre qui consiste à déterminer, au niveau d'un nœud d'ancrage, au moins une propriété d'un flux de paquets transmis sens descendant, et à effectuer une diffusion bidirectionnelle de paquets du flux transmis sens descendant vers la BS1 et la BS2 uniquement lorsqu'il est déterminé que la ou les propriétés des flux de paquets transmis sens descendant comprennent au moins une propriété prédéterminée. Un nœud de réseau comprend: un moyen qui permet de déterminer au moins une propriété d'un flux de paquets transmis sens descendant, consécutivement à un transfert d'un équipement utilisateur (UE) d'une première station de base (BS1) à une seconde station de base (BS2); et un moyen qui permet d'effectuer, à la suite de cette détermination, une diffusion bidirectionnelle de paquets du flux transmis sens descendant vers la BS1 et la BS2 uniquement lorsqu'il est déterminé que la ou les propriétés des flux de paquets transmis sens descendant comprennent au moins une propriété prédéterminée.
PCT/IB2007/001739 2006-06-30 2007-06-26 APPAREIL, PROCÉDÉ ET PROGICIEL PERMETTANT UN TRANSFERT AVEC DIFFUSION BIDIRECTIONNELLE SÉLECTIVE PAR UN NœUD DE RÉSEAU WO2008004053A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11/479,845 2006-06-30
US11/479,845 US20080002622A1 (en) 2006-06-30 2006-06-30 Apparatus, method and computer program product providing handover with selective bi-casting by network node

Publications (2)

Publication Number Publication Date
WO2008004053A2 true WO2008004053A2 (fr) 2008-01-10
WO2008004053A3 WO2008004053A3 (fr) 2008-04-24

Family

ID=38876551

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2007/001739 WO2008004053A2 (fr) 2006-06-30 2007-06-26 APPAREIL, PROCÉDÉ ET PROGICIEL PERMETTANT UN TRANSFERT AVEC DIFFUSION BIDIRECTIONNELLE SÉLECTIVE PAR UN NœUD DE RÉSEAU

Country Status (3)

Country Link
US (1) US20080002622A1 (fr)
TW (1) TW200816833A (fr)
WO (1) WO2008004053A2 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008114449A1 (fr) * 2007-03-20 2008-09-25 Fujitsu Limited Station de base et procédé capables de réduire un retard de transfert causé par un processus de transfert automatique intercellulaire
WO2008115125A2 (fr) * 2007-03-21 2008-09-25 Telefonaktiebolaget Lm Ericsson (Publ) Réacheminement sélectif des paquets pour mobilité lte
KR102293998B1 (ko) * 2017-03-30 2021-08-27 삼성전자 주식회사 Tcp/ip를 고려한 데이터 처리 방법
TWI648217B (zh) * 2017-08-25 2019-01-21 國立清華大學 鹵素摻雜磷奈米粒子及其製造方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001030107A2 (fr) * 1999-10-18 2001-04-26 Telefonaktiebolaget Lm Ericsson (Publ) Transfert rapide d'une station mobile entre des controleurs de reseaux radio permettant l'acces a un reseau de type egprs
US20020045450A1 (en) * 2000-10-18 2002-04-18 Mitsubishi Denki Kabushiki Kaisha Handoff method and agent apparatus
US6466556B1 (en) * 1999-07-23 2002-10-15 Nortel Networks Limited Method of accomplishing handover of packet data flows in a wireless telecommunications system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6947399B1 (en) * 1999-07-19 2005-09-20 Nortel Networks Limited Handoff mechanisms to support real-time delay-critical services in a next generation network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6466556B1 (en) * 1999-07-23 2002-10-15 Nortel Networks Limited Method of accomplishing handover of packet data flows in a wireless telecommunications system
WO2001030107A2 (fr) * 1999-10-18 2001-04-26 Telefonaktiebolaget Lm Ericsson (Publ) Transfert rapide d'une station mobile entre des controleurs de reseaux radio permettant l'acces a un reseau de type egprs
US20020045450A1 (en) * 2000-10-18 2002-04-18 Mitsubishi Denki Kabushiki Kaisha Handoff method and agent apparatus

Also Published As

Publication number Publication date
US20080002622A1 (en) 2008-01-03
WO2008004053A3 (fr) 2008-04-24
TW200816833A (en) 2008-04-01

Similar Documents

Publication Publication Date Title
RU2475979C2 (ru) Базовая станция, мобильная станция, система связи и способ переупорядочивания
JP3869829B2 (ja) 移動通信システムにおけるハンドオフ実行方法
EP2876932B1 (fr) Procédé de traitement de transfert intercellulaire et enb
JP4905061B2 (ja) 移動通信システム、基地局装置およびそのハンドオーバ方法ならびにプログラム
JP4821471B2 (ja) 移動通信システム、基地局及び移動局並びにプログラム
US20100091734A1 (en) Packet forwarding method in the case of the handover between base stations
US20080188223A1 (en) Method, a system and a network element for performing a handover of a mobile equipment
US11570665B2 (en) Communication method and communications apparatus
RU2486685C2 (ru) Базовая станция, мобильная станция, система связи и способ переупорядочивания
US20090185539A1 (en) Handover Method and Base Station
EP1850534A1 (fr) Procédé pour le transfert d'appels
CN102124777A (zh) 切换方法和无线接入网络装置
US20080002622A1 (en) Apparatus, method and computer program product providing handover with selective bi-casting by network node
EP3435705B1 (fr) Relais de communication et procédé de redirection de paquets de données
US11159997B2 (en) Communication method and apparatus
US20100284372A1 (en) Apparatus, method and computer program product providing avoidance of data duplication during packet switched handover
US8406764B1 (en) Bicasting traffic data during a handover
RU2427092C2 (ru) Базовая станция, мобильная станция, система связи и способ переупорядочивания
WO2023245346A1 (fr) Procédés et appareil pour définir une configuration mrb pour un ue pour recevoir une multidiffusion mbs dans un état inactif rrc
WO2023236140A1 (fr) Procédés et appareil de prise en charge de gestion de faisceaux entre cellules de couche l1/l2 avec mobilité
WO2023231001A1 (fr) Procédés et appareils pour améliorer l'expérience de l'ue pendant une gestion de faisceaux inter-du inter-cellules
EP2023673A1 (fr) Procédé pour garantir la continuité des données dans un système de radiocommunication et noeud d'accès correspondant
WO2022083865A1 (fr) Procédé, appareil et programme d'ordinateur
Cai et al. Data forwarding mechanism for supporting real-time services during relocations in UMTS systems

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07789448

Country of ref document: EP

Kind code of ref document: A2

WWE Wipo information: entry into national phase

Ref document number: 10780/DELNP/2008

Country of ref document: IN

NENP Non-entry into the national phase

Ref country code: DE

NENP Non-entry into the national phase

Ref country code: RU

122 Ep: pct application non-entry in european phase

Ref document number: 07789448

Country of ref document: EP

Kind code of ref document: A2