Patent Grant
9155008
1. Field
The following description relates generally to wireless communications, and more particularly to apparatus and method of performing a session handoff between network entities.
2. Background
Over the last several years, wireless communications technologies have evolved from analog-driven systems to digital systems. Typically in conventional analog systems, the analog signals are relayed on a forward link and a reverse link and require a significant amount of bandwidth to enable signals to be transmitted and received while being associated with suitable quality. As the analog signals are continuous in time and space, no status messages (e.g., messages indicating receipt or non-receipt of data) are generated. In contrast, packet-switched systems allow analog signals to be converted to data packets and transmitted by way of a physical channel between an access terminal and a base station, router, and the like. In addition, digital data can be relayed in its natural form (e.g., text, Internet data, and the like) via employing a packet switched network. As such, digital wireless communication systems are widely deployed to provide various communication services such as telephony, video, data, messaging, broadcasts, and the like.
Due to the increasing usage of wireless communication devices to perform services with increasing data requirements, wireless network bandwidth and data rates are also increasing. As such, wireless access points may accumulate queues of data destined for a wireless device served by the access point. In prior art systems, when a handover of a wireless device communication session was required from one access point to another access point, these data queues were small enough that they could easily be handled without affecting the quality of the connection. In current high data rate networks, however, the queues of data can become quite large if a handoff is not performed quickly. Such large data queues negatively affect latency experienced in an on-going service, and in services such as Voice over IP (VoIP), latency is an important quality of service (QoS) consideration. Additionally, such large queues may require increased usage of the backhaul network to successfully transfer the data, which negatively impacts network costs, as backhaul network usage is expensive.
Thus, in such high data rate systems, an efficient handoff between various entities becomes important when performing a session handoff.
The following presents a simplified summary in order to provide a basic understanding of the described aspects. This summary is not an extensive overview and is intended to neither identify key or critical elements nor delineate the scope of such aspects. Its purpose is to present some concepts of the described aspects in a simplified form as a prelude to the more detailed description that is presented later.
In an aspect, a method of performing a session handoff in a wireless communication system, comprises: receiving an ordered sequence of data packets from an anchor network function module after establishing a communication session with an access terminal, wherein the communication session is controlled by the anchor network function module, wherein the anchor network function module comprises a shadow buffer operable to store the ordered sequence of data packets; receiving a handoff request from a target transceiver module during a transmission of a segment of the ordered sequence of data packets to the access terminal via the session; identifying a sequence marker corresponding to an end of the segment as being a completion point of the transmission; continuing to complete the transmission through the end of the segment; and transmitting, in parallel with continuing to complete the transmission, a handoff data state of the session to the anchor network function module, wherein the handoff data state comprises an identifier of the target transceiver module and the sequence marker, wherein the handoff data state is operable to trigger the anchor network function module to transmit a portion of the ordered sequence of data packets to the identified target transceiver module from the shadow buffer, wherein the portion begins after the end of the segment identified by the sequence marker.
In another aspect, at least one processor operable to perform a session handoff in a wireless communication system, comprises: a first module for receiving an ordered sequence of data packets from an anchor network function module after establishing a communication session with an access terminal, wherein the communication session is controlled by the anchor network function module, wherein the anchor network function module comprises a shadow buffer operable to store the ordered sequence of data packets; a second module for receiving a handoff request from a target transceiver module during a transmission of a segment of the ordered sequence of data packets to the access terminal via the session; a third module for identifying a sequence marker corresponding to an end of the segment as being a completion point of the transmission; a fourth module for continuing to complete the transmission through the end of the segment; and a fifth module for transmitting, in parallel with continuing to complete the transmission, a handoff data state of the session to the anchor network function module, wherein the handoff data state comprises an identifier of the target transceiver module and the sequence marker, wherein the handoff data state is operable to trigger the anchor network function module to transmit a portion of the ordered sequence of data packets to the identified target transceiver module from the shadow buffer, wherein the portion begins after the end of the segment identified by the sequence marker.
In an further aspect, a computer program product for performing a session handoff in a wireless communication system, comprises: a computer readable medium, comprising: at least one instruction for causing a computer to receive an ordered sequence of data packets from an anchor network function module after establishing a communication session with an access terminal, wherein the communication session is controlled by the anchor network function module, wherein the anchor network function module comprises a shadow buffer operable to store the ordered sequence of data packets; at least one instruction for causing the computer to receive a handoff request from a target transceiver module during a transmission of a segment of the ordered sequence of data packets to the access terminal via the session; at least one instruction for causing the computer to identify a sequence marker corresponding to an end of the segment as being a completion point of the transmission; at least one instruction for causing the computer to continue to complete the transmission through the end of the segment; and at least one instruction for causing the computer to transmit, in parallel with continuing to complete the transmission, a handoff data state of the session to the anchor network function module, wherein the handoff data state comprises an identifier of the target transceiver module and the sequence marker, wherein the handoff data state is operable to trigger the anchor network function module to transmit a portion of the ordered sequence of data packets to the identified target transceiver module from the shadow buffer, wherein the portion begins after the end of the segment identified by the sequence marker.
In yet another aspect, an access point comprises: means for receiving an ordered sequence of data packets from an anchor network function module after establishing a communication session with an access terminal, wherein the communication session is controlled by the anchor network function module, wherein the anchor network function module comprises a shadow buffer operable to store the ordered sequence of data packets; means for receiving a handoff request from a target transceiver module during a transmission of a segment of the ordered sequence of data packets to the access terminal via the session; means for identifying a sequence marker corresponding to an end of the segment as being a completion point of the transmission; means for continuing to complete the transmission through the end of the segment; and means for transmitting, in parallel with continuing to complete the transmission, a handoff data state of the session to the anchor network function module, wherein the handoff data state comprises an identifier of the target transceiver module and the sequence marker, wherein the handoff data state is operable to trigger the anchor network function module to transmit a portion of the ordered sequence of data packets to the identified target transceiver module from the shadow buffer, wherein the portion begins after the end of the segment identified by the sequence marker.
In a further aspect, an access point comprises: a memory comprising a handoff manager module having sequence determination logic; a processor in communication with the memory and operable to execute the handoff manager module; a source transceiver module operable to receive an ordered sequence of data packets from an anchor network function module after establishing a communication session with an access terminal, wherein the communication session is controlled by the anchor network function module, wherein the anchor network function module comprises a shadow buffer operable to store the ordered sequence of data packets; wherein the source transceiver module operable is operable to receive a handoff request from a target transceiver module during a transmission of a segment of the ordered sequence of data packets to the access terminal via the session; wherein the sequence determination logic is operable to identify a sequence marker corresponding to an end of the segment as being a completion point of the transmission; wherein the source transceiver module is operable to continue to complete the transmission through the end of the segment; and wherein the source transceiver module is operable to continue to transmit, in parallel with continuing to complete the transmission, a handoff data state of the session to the anchor network function module, wherein the handoff data state comprises an identifier of the target transceiver module and the sequence marker, wherein the handoff data state is operable to trigger the anchor network function module to transmit a portion of the ordered sequence of data packets to the identified target transceiver module from the shadow buffer, wherein the portion begins after the end of the segment identified by the sequence marker.
In still another aspect, a method of performing a session handoff in a wireless communication system, comprises: determining that conditions exist for requesting a handoff of an established communication session from the source transceiver module to a target transceiver module, wherein the determining occurs during a receiving of a segment of an ordered sequence of data packets from a source transceiver module; transmitting a handoff request to the target transceiver module based on the determining, wherein the handoff request is operable to trigger the target transceiver module to receive and queue a portion of the ordered sequence of data packets from a shadow buffer of an anchor network function module during the receiving of the segment, wherein the portion corresponds to a part of the ordered sequence following the segment; receiving a last transmission corresponding to the segment from the source transceiver module; establishing the communication session with the target transceiver function after receiving the last transmission from the source transceiver module; and receiving the portion of the ordered sequence of data packets from the target transceiver function, under a control of the anchor network function module, from the queue without substantial latency after establishing the communication session with the target transceiver function.
In a further aspect, at least one processor for performing a session handoff in a wireless communication system, comprises: a first module for determining that conditions exist for requesting a handoff of an established communication session from the source transceiver module to a target transceiver module, wherein the determining occurs during a receiving of a segment of an ordered sequence of data packets from a source transceiver module; a second module for transmitting a handoff request to the target transceiver module based on the determining, wherein the handoff request is operable to trigger the target transceiver module to receive and queue a portion of the ordered sequence of data packets from a shadow buffer of an anchor network function module during the receiving of the segment, wherein the portion corresponds to a part of the ordered sequence following the segment; a third module for receiving a last transmission corresponding to the segment from the source transceiver module; a fourth module for establishing the communication session with the target transceiver function after receiving the last transmission from the source transceiver module; and wherein the third module further receives the portion of the ordered sequence of data packets from the target transceiver function, under a control of the anchor network function module, from the queue without substantial latency after establishing the communication session with the target transceiver function.
In another aspect, a computer program product for performing a session handoff in a wireless communication system comprises: a computer readable medium, comprising: at least one instruction for causing a computer to determine that conditions exist for requesting a handoff of an established communication session from the source transceiver module to a target transceiver module, wherein the determining occurs during a receiving of a segment of an ordered sequence of data packets from a source transceiver module; at least one instruction for causing the computer to transmit a handoff request to the target transceiver module based on the determining, wherein the handoff request is operable to trigger the target transceiver module to receive and queue a portion of the ordered sequence of data packets from a shadow buffer of an anchor network function module during the receiving of the segment, wherein the portion corresponds to a part of the ordered sequence following the segment; at least one instruction for causing the computer to receive a last transmission corresponding to the segment from the source transceiver module; at least one instruction for causing the computer to establish the communication session with the target transceiver function after receiving the last transmission from the source transceiver module; and at least one instruction for causing the computer to receive the portion of the ordered sequence of data packets from the target transceiver function, under a control of the anchor network function module, from the queue without substantial latency after establishing the communication session with the target transceiver function.
In a further aspect, an access terminal comprises: means for determining that conditions exist for requesting a handoff of an established communication session from the source transceiver module to a target transceiver module, wherein the determining occurs during a receiving of a segment of an ordered sequence of data packets from a source transceiver module; means for transmitting a handoff request to the target transceiver module based on the determining, wherein the handoff request is operable to trigger the target transceiver module to receive and queue a portion of the ordered sequence of data packets from a shadow buffer of an anchor network function module during the receiving of the segment, wherein the portion corresponds to a part of the ordered sequence following the segment; means for receiving a last transmission corresponding to the segment from the source transceiver module; means for establishing the communication session with the target transceiver function after receiving the last transmission from the source transceiver module; and means for receiving the portion of the ordered sequence of data packets from the target transceiver function, under a control of the anchor network function module, from the queue without substantial latency after establishing the communication session with the target transceiver function.
In still another aspect, an access terminal comprises: a memory comprising a handoff manager module having handoff determination logic and handoff requester logic; a processor in communication with the memory and operable to execute the handoff manager module; wherein the handoff determination logic is operable to determine that conditions exist for requesting a handoff of an established communication session from the source transceiver module to a target transceiver module, wherein the determining occurs during a receiving of a segment of an ordered sequence of data packets from a source transceiver module; wherein the handoff requester logic is operable to transmit a handoff request to the target transceiver module based on the determining, wherein the handoff request is operable to trigger the target transceiver module to receive and queue a portion of the ordered sequence of data packets from a shadow buffer of an anchor network function module during the receiving of the segment, wherein the portion corresponds to a part of the ordered sequence following the segment; a communications module in communication with memory and the processor and operable to receive a last transmission corresponding to the segment from the source transceiver module; wherein the handoff manager module is operable to establish the communication session with the target transceiver function after receiving the last transmission from the source transceiver module; and wherein the communications module is further operable to receive the portion of the ordered sequence of data packets from the target transceiver function, under a control of the anchor network function module, from the queue without substantial latency after establishing the communication session with the target transceiver function.
An additional aspect includes a method of performing a session handoff by a network-side system of a wireless communication system, comprising: controlling a communication session of an access terminal with a source transceiver module; transmitting to the source transceiver module an ordered sequence of data packets destined for the access terminal; copying the ordered sequence of data packets into a shadow buffer operable to store the ordered sequence of data packets; receiving, by the source transceiver module, a handoff request from a target transceiver module during a transmission of a segment of the ordered sequence of data packets to the access terminal via the session; identifying, by the source transceiver module, a sequence marker corresponding to an end of the segment as being a completion point of the transmission; continuing to complete the transmission, by the source transceiver module, through the end of the segment; transmitting, in parallel with continuing to complete the transmission, by the source transceiver module, a handoff data state of the session to the anchor network function module, wherein the handoff data state comprises an identifier of the target transceiver module and the sequence marker; transmitting, by the anchor network function module and in response to receiving the handoff data state, a portion of the ordered sequence of data packets to the identified target transceiver module from the shadow buffer, wherein the portion begins after the end of the segment identified by the sequence marker; and receiving, by the anchor network function module from the source transceiver module, packet data originating from the access terminal during the transmitting of the portion of the ordered sequence of data packets.
A further aspect includes a system for performing a session handoff of a wireless communication system, comprising: an anchor network function module having a corresponding shadow buffer, wherein the anchor network function module is operable to control a communication session of an access terminal with a source transceiver module, wherein the anchor network function module is operable to transmitting to the source transceiver module an ordered sequence of data packets destined for the access terminal, wherein the anchor network function module is further operable to copy the ordered sequence of data packets into the shadow buffer, which is operable to store the ordered sequence of data packets; wherein the source transceiver module is operable to receive a handoff request from a target transceiver module during a transmission of a segment of the ordered sequence of data packets to the access terminal via the session, wherein the source transceiver module is operable to identify a sequence marker corresponding to an end of the segment as being a completion point of the transmission, wherein the source transceiver module is operable to continue to complete the transmission, by the source transceiver module, through the end of the segment; wherein the source transceiver module is operable to transmit, in parallel with continuing to complete the transmission, a handoff data state of the session to the anchor network function module, wherein the handoff data state comprises an identifier of the target transceiver module and the sequence marker; wherein the anchor network function module, in response to receiving the handoff data state, is operable to transmit a portion of the ordered sequence of data packets to the identified target transceiver module from the shadow buffer, wherein the portion begins after the end of the segment identified by the sequence marker; and wherein the anchor network function module is operable to receive, from the source transceiver module, packet data originating from the access terminal during the transmitting of the portion of the ordered sequence of data packets.
To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings. These aspects are indicative, however, of but a few of the various ways in which the principles of the disclosed subject matter may be employed and the claimed matter is intended to include all such aspects and their equivalents. Other advantages and novel features may become apparent from the following detailed description when considered in conjunction with the drawings
Various aspects are now described with reference to the drawings. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. It may be evident, however, that such aspect(s) may be practiced without these specific details.
As used in this application, the terms “component,” “module,” “system” and the like are intended to include a computer-related entity, such as but not limited to hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets, such as data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems by way of the signal.
Furthermore, various aspects are described herein in connection with a terminal, which can be a wired terminal or a wireless terminal. A terminal can also be called a system, device, subscriber unit, subscriber station, mobile station, mobile, mobile device, remote station, remote terminal, access terminal, user terminal, terminal, communication device, user agent, user device, or user equipment (UE). A wireless terminal may be a cellular telephone, a satellite phone, a cordless telephone, a Session Initiation Protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device having wireless connection capability, a computing device, or other processing devices connected to a wireless modem. Moreover, various aspects are described herein in connection with a base station. A base station may be utilized for communicating with wireless terminal(s) and may also be referred to as an access point, a Node B, enhanced Base Station (eBS), or some other terminology.
Moreover, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or.” That is, unless specified otherwise, or clear from the context, the phrase “X employs A or B” is intended to mean any of the natural inclusive permutations. That is, the phrase “X employs A or B” is satisfied by any of the following instances: X employs A; X employs B; or X employs both A and B. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from the context to be directed to a singular form.
The techniques described herein may be used for various wireless communication systems such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA and other systems. The terms “system” and “network” are often used interchangeably. A CDMA system may implement a radio technology such as Universal Terrestrial Radio Access (UTRA), cdma2000, etc. UTRA includes Wideband-CDMA (W-CDMA) and other variants of CDMA. Further, cdma2000 covers IS-2000, IS-95 and IS-856 standards. A TDMA system may implement a radio technology such as Global System for Mobile Communications (GSM). An OFDMA system may implement a radio technology such as Evolved UTRA (E-UTRA), Ultra Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM□, etc. UTRA and E-UTRA are part of Universal Mobile Telecommunication System (UMTS). 3GPP Long Term Evolution (LTE) is a release of UMTS that uses E-UTRA, which employs OFDMA on the downlink and SC-FDMA on the uplink. UTRA, E-UTRA, UMTS, LTE and GSM are described in documents from an organization named “3rd Generation Partnership Project” (3GPP). Additionally, cdma2000 and UMB are described in documents from an organization named “3rd Generation Partnership Project 2” (3GPP2).
Various aspects or features will be presented in terms of systems that may include a number of devices, components, modules, and the like. It is to be understood and appreciated that the various systems may include additional devices, components, modules, etc. and/or may not include all of the devices, components, modules etc. discussed in connection with the figures. A combination of these approaches may also be used.
Referring to
Since access terminal 20 is mobile within system 10, access terminal 20 may move to a position where access terminal 20 experiences conditions that trigger a handoff of communication session 24 to another access point. For example, access terminal 20 is continually monitoring pilot signal strength of nearby access points, and may choose to switch access points based on a comparison of pilot signal strengths. For example, access terminal 20 moving in direction 31 toward access point 18 may eventually reach such a position, thereby triggering target transceiver module 32 of access point 18 to transmit a handoff request 34 to source transceiver module 22 of access point 16.
When source transceiver module 22 receives handoff request 34 during a transmission of a segment of the sequence of ordered data packets 28, system 10 provides for a number of actions to occur to insure a relatively quick and efficient handoff that minimizes latency experienced in the on-going transmission. In particular, system 10 allows source transceiver module 22 to complete the on-going transmission of the segment of the sequence of ordered data packets 28 while simultaneously, or in-parallel, informing target transceiver module 32 of the end of the on-going transmission to be completed by source transceiver module 22 and, in some aspects, further arranging simultaneously, or in-parallel, for new ordered data packets following the sequence of ordered data packets 28 to be directed to target transceiver module 32 for delivery to access terminal 20 after the handoff.
In particular, upon receiving handoff request 34, source transceiver module 22 performs the following actions substantially simultaneously or substantially in parallel: identifies a sequence marker 36 corresponding to an end of the segment currently being transmitted as being a completion point of the transmission; continues to complete the on-going transmission through the end of the segment; generates a handoff state data message 38 that defines a state of the session, including sequence marker 36 and a target transceiver module identity 40; and transmits, in parallel with continuing to complete the transmission of the segment, handoff data state message 38 to anchor network function module 26.
Upon receiving handoff data state message 38, anchor network function module 26 immediately switches transmissions of any new data packets 42 following the sequence of ordered data packets 28 to be sent to the identified target transceiver module 32. Further, based on data sequence marker 36, anchor network function module 26 is able to identify the end of the last segment transmitted by source transceiver module 22 in the copy of the sequence of data packets 28 stored in shadow buffer 30, and then sends the remaining data packet portion 44 to the identified target transceiver module 32. Thus, target transceiver module 32 is pre-loaded with data packets for communication session 24 prior to the actual handoff of communication session 24.
Further, upon completing the transmission of the segment, thereby having transmitted the sequence of ordered data packets 28 up to sequence marker 36, source transceiver module 22 transmits a handoff response 46 to target transceiver module 32 to formally complete the handoff of communication session 24, thereby saving half the round trip time on the backhaul network 3. For example, handoff response 46 may include session state information, such as but not limited to one or more link states, a retransmission buffer state, and a control buffer state. At this time, anchor network function module 26 confirms to both transceiver modules that target transceiver module 32 is now serving access terminal 20, and anchor network function module 26 continues to control communications even though handoff has occurred.
Additionally, in another aspect, if target transceiver module 32 is notified by access terminal 20 or discovers based on a retransmission buffer in handoff response 46 that a packet or segment sent by source transceiver function module 32 has not been received, then target transceiver function module 32 does not have to contact source transceiver module 22 and obtain it from a transmit buffer therein. Instead, target transceiver module 32 can save backhaul network usage by obtaining the missing data packet or segment from shadow buffer 30 based on the corresponding sequence marker of the missing data packet or segment.
As such, the described architecture contemplates multiple possible layer 2 handoffs from one transceiver module to another transceiver module, corresponding to transceivers at different locations, without having to implement a layer 3 handoff from one network function module to another network function module until access terminal 20 has moved a relatively large distance or has entered a mobile/dormant state during which a layer 3 handoff can be implemented during a period where data communication is not occurring.
There are various advantages to this approach. For example, one advantage is that it is not necessary to remember which transceiver module or modules were serving previously. Instead, this approach allows for retrieval of unsent and retransmission data packets from the network function module. Further, since the network function module includes shadow buffer for buffering ordered data packets sent to the serving transceiver module, this approach allows network function module to be instructed to send any new data to the new transceiver module immediately upon the initiation of a handoff and before its completion, all while the old transceiver module is finishing transmissions with the access terminal. For example, the on-going transmission of the segment of the sequence of ordered data packets may be a progressive transmission that accounts for error correction by allowing for retransmissions. By preparing in advance for the handoff, when the handoff actually occurs, the new transceiver module already has data to transmit over the forward link to the access terminal.
Additionally, in some aspects, sequence marker 36 may be a byte-based sequence marker as opposed to a packet-based sequence marker. Advantageously, a byte-based sequence marker 36 enables tracking of partial data packets, thereby minimizing or eliminating even partial packet loss.
Further, it has been found that the present apparatus and methods provide for handoffs to occur in a time period of about 20 milliseconds to about 60 milliseconds in some aspects, in a time period of about 40 milliseconds to about 80 milliseconds in another aspect, and less than 100 milliseconds in yet another aspect.
Referring to
Additionally, computer device 50 includes user interface 56 operable to receive inputs from a user of access terminal 20, and to generate outputs for presentation to the user. User interface 56 may include one or more input devices, including but not limited to a keyboard, a number pad, a mouse, a touch-sensitive display, a navigation key, a function key, a microphone, a voice recognition component, any other mechanism capable of receiving an input from a user, or any combination thereof. Further, user interface 56 may include one or more output devices, including but not limited to a display, a speaker, a haptic feedback mechanism, a printer, any other mechanism capable of presenting an output to a user, or any combination thereof.
Further, computer device 50 includes a communications component 58 that provides for establishing and maintaining communications with one or more other components utilizing hardware, software, and services. Communications component 58 may carry communications between components on computer device 50, as well as between computer device 50 and external devices, such as access points 14, 1618 (
Additionally, computer device 50 may further include database 60, which can be any suitable combination of hardware and/or software, that provides for mass storage of data/information, data relationships, and software programs/applications employed in connection with aspects described herein when not in use in active memory 52. Additionally, database 60 may store one or more functional modules/programs/applications 62 when the respective applications are not in active memory 50.
Referring to
Referring to
Referring to
Referring to
Referring to
At this point it should be noted that in some aspects, such as in an Ultra Mobile Broadband (UMB) implementation, an access point may be divided into distinct entities, namely: a network control function (NCF); a network data function (NDF); and a transceiver function (TF). In general, the NCF can initiate session and connection layer signaling protocols, for example, to transfer control of a session from one TF to another TF. For example, such activities can include: managing system access from the access terminal (AT); providing session discovery/creation/termination functions, allocating/reclaiming dedicated resources for a connection, and the like. As noted above, the transceiver function (TF) can further represent a sector that performs functionality related to the Medium Access Control (MAC) layer (e.g., to provide an air interface attachment point for access terminals in its sector). Further, the network data function (NDF) can implement data processing function to relay data between the network and the transceiver function that serves an access terminal. Furthermore, an ability of NDF to route data packets can be controlled by the NCF, which designates a relation between terminals and the transceiver functions in conjunction with associated handoffs. Accordingly, for forward link traffic from the network to the access terminal, the NDF can manage the shadow buffer and apply a Virtual Radio Link Protocol (VRLP) sequencing, etc., and perform corresponding functionality on reverse link traffic from the access terminal to the network.
Returning to the call flow, after receiving the handoff data state message at act 131, anchor NCF 27 is operable to generate and transmit a handoff switch command to NDF 29, at act 133. The handoff switch command identifies the AT, the target TF, a corresponding MAC identifier, and the sequence marker from the handoff data state message. At act 135, anchor NCF 27 maintains the reverse link connection from AT 20 through source TF 22 and to anchor NDF 29 until completion of the handoff, while at acts 137 and 139, anchor NCF 27 immediately directs any forward link data packets after the sequence marker to be sent to target TF 32, where they will be queued for delivery to AT 20 after the handoff. At act 141, source TF 22 completes the transmission. In one aspect, for example, the completion includes performing the last error correction retransmission, such as a last hybrid Automatic Repeat-reQuest (HARQ) transmission corresponding to the last data segment source TF 22 indicated that it would send. Correspondingly, at act 145, source TF 22 sends a handoff response message to target TF 32 to confirm the handoff. The handoff response message may include the final state information, including one or more of final information on which sequences were transmitted, information relating to retransmission buffers, information relating to control buffers, and information relating to reverse link buffer levels.
Additionally, exemplary states for transfer can include: a data state, a connection state, a session state, and the like. The data state can refer to the state in an access network in the data path between the access terminal and the network data function during a connection and/or handoff transfer. Such data state can further include items such as header compressor state or radio link protocol buffer states, which are typically dynamic in nature. Likewise, the connection state can designate a state in the access network on the control path between the access terminal and the NCF that is not preserved when a connection closes and the access terminal remains idle. The connection state can further include such information as the set of air interface resources reserved for the access terminal, power control loop values, active set information, and the like.
As such, target TF 32 now has all the information it needs to pick up where source TF 22 left off with respect to the communication session. Also, after sending the handoff response, at act 145, source TF 22 confirms the handoff with anchor NCF 27 by sending a handoff transfer message that includes target TF 32 and the target TF active set index. In the meantime, at act 147, target TF 32 sends one or more resource messages to establish communications with AT 20 and take control of the session. After receiving the handoff transfer message from source TF 22, at acts 151, 153 and 155, NCF 27 sends a handoff complete message to all TFs in the active set, where the handoff complete message identifies the serving TF, i.e. target TF 32. Thus, call flow 111 defines a level 2 handoff detection and switch that operates efficiently to reduce latency for a high data rate network. For example, in one aspect, call flow 11 may reduce latency in networks, such as a high speed data system (HSDS) network, having a data rate of greater than about 1 Mbits/second, or in another aspect greater than about 5 Mbits/second, while in other aspects in the range of about 10 Mbits/second to about 150 Mbits/second. Further, the architecture of call flow 111 places the RLP functionality close to AT 20, in order to further reduce latency, as opposed to having the RLP functionality deep within the network.
Methods of operation of system are discussed below. While an exemplary method is illustrated and described herein as a series of blocks representative of various events and/or acts, the subject aspect is not limited by the illustrated ordering of such blocks. For instance, some acts or events may occur in different orders and/or concurrently with other acts or events, apart from the ordering illustrated herein, in accordance with the described aspects. In addition, not all illustrated blocks, events or acts, may be required to implement a methodology in accordance with the subject aspects. Moreover, it will be appreciated that the exemplary method and other methods according to the described aspects may be implemented in association with the method illustrated and described herein, as well as in association with other systems and apparatus not illustrated or described.
In operation, referring to
Further, the method includes receiving a handoff request from a target transceiver module during a transmission of a segment of the ordered sequence of data packets to the access terminal via the session (Block 164). For example, the target transceiver module may have received a request from an access terminal to initiate the handoff.
Also, the method includes identifying a sequence marker corresponding to an end of the segment as being a completion point of the transmission (Block 166). For example, the source transceiver module is operable to identify an end of a segment it is currently transmitting, which may be a progressive transmission such as may be found in error correction transmission that allow for repeating of a transmission.
Moreover, the method includes continuing to complete the transmission through the end of the segment (Block 168). As noted, the transmission may be an error correction type transmission, such as a hybrid ARQ transmission.
Additionally, the method includes transmitting, in parallel with continuing to complete the transmission, a handoff data state of the session to the anchor network function module. In this case, the handoff data state comprises an identifier of the target transceiver module and the sequence marker. Further, the handoff data state is operable to trigger the anchor network function module to transmit a portion of the ordered sequence of data packets to the identified target transceiver module from the shadow buffer, wherein the portion begins after the end of the segment identified by the sequence marker (Block 170). For example, the source transceiver module may be operable to forward the handoff data state to a network control function module that operates to switch control over to the target transceiver module such that shadow buffered portions of the transmission subsequent to the end of the segment can be queued up at target transceiver module prior to the handoff. Such preloading of the target transceiver module while allowing the source transceiver module to complete its transmission may be highly efficient, and provide a low latency handoff, especially in a high data rate network.
Referring to
The method further includes transmitting a handoff request to the target transceiver module based on the determining, wherein the handoff request is operable to trigger the target transceiver module to receive and queue a portion of the ordered sequence of data packets from a shadow buffer of an anchor network function module during the receiving of the segment, wherein the portion corresponds to a part of the ordered sequence following the segment (Block 184). For example, the sending of the handoff request by the access terminal causes a series of actions whereby the source transceiver module is notified of the handover request and provides state information prior to the handoff to allow target transceiver module to build up a queue of data packets beyond the end of the segment currently being transmitted by the source transceiver function.
Also, the method includes receiving a last transmission corresponding to the segment from the source transceiver module (Block 186). For example, the transmission may be an error correction transmission that includes a give number of retransmissions. Rather than waste the time spent in performing error correcting functions, as would occur if the handoff were immediately effected, the present aspects take advantage of the time to complete the transmission by priming the target transceiver with data so that the handoff has reduced latency.
Further, the method includes establishing the communication session with the target transceiver function after receiving the last transmission from the source transceiver module (Block 188). For example, the communication session of the access terminal is handed off to the target transceiver module once the last transmission is completed.
Additionally, the method includes receiving the portion of the ordered sequence of data packets from the target transceiver function, under a control of the anchor network function module, from the queue without substantial latency after establishing the communication session with the target transceiver function (Block 190). As noted above, the anchor network function has previously started to load the target transceiver module with any ordered data after the end of the identified segment. As such, the target transceiver module achieves a highly efficient, low-latency handoff, especially in high data rate system where large queues could otherwise build up and require expensive usage of backhaul networks.
As used in herein, the terms “component,” “system” and the like are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software or software in execution and/or electromechanical units. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an instance, an executable, a thread of execution, a program and/or a computer. By way of illustration, both an application running on a computer and the computer can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers.
The word “exemplary” is used herein to mean serving as an example, instance or illustration. Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs. Similarly, examples are provided herein solely for purposes of clarity and understanding and are not meant to limit the described aspects or portion thereof in any manner. It is to be appreciated that a myriad of additional or alternate examples could have been presented, but have been omitted for purposes of brevity.
Furthermore, all or portions of the described aspects may be implemented as a system, method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware or any combination thereof to control a computer to implement the disclosed aspects. For example, computer readable media can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips . . . ), optical disks (e.g., compact disk (CD), digital versatile disk (DVD) . . . ), smart cards, and flash memory devices (e.g., card, stick, key drive . . . ). Additionally it should be appreciated that a carrier wave can be employed to carry computer-readable electronic data such as those used in transmitting and receiving electronic mail or in accessing a network such as the Internet or a local area network (LAN). Of course, those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope or spirit of the claimed subject matter.
When the systems and/or methods described herein are implemented in software, firmware, middleware or microcode, program code or code segments, they may be stored in a machine-readable medium, such as a storage component. A code segment may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted using any suitable means including memory sharing, message passing, token passing, network transmission, etc.
For a software implementation, the techniques described herein may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in memory units and executed by processors. A memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor through various means.
What has been described above includes examples of the disclosed subject matter. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing such subject matter, but one of ordinary skill in the art may recognize that many further combinations and permutations are possible. Accordingly, the subject matter is intended to embrace all such alterations, modifications, and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the term “includes” is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.
The present Application for Patent claims priority to: Provisional Application No. 60/908,055 entitled “NETWORK CONTROL FUNCTION LAYER 2 HANDOFF LOW LEVEL DESIGN” filed on Mar. 26, 2007, Provisional Application No. 60/908,120 entitled “NETWORK FUNCTION HIGH LEVEL DESIGN” filed on Mar. 26, 2007, and Provisional Application No. 60/908,047 entitled “TRANSCEIVER FUNCTION SOFTWARE HIGH LEVEL DESIGN” filed on Mar. 26, 2007, all of which are assigned to the assignee hereof and hereby expressly incorporated by reference herein.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4833701 | Comroe et al. | May 1989 | A |
| 5117502 | Onoda et al. | May 1992 | A |
| 5128938 | Borras | Jul 1992 | A |
| 5200952 | Bernstein et al. | Apr 1993 | A |
| 5208837 | Richey | May 1993 | A |
| 5229992 | Jurkevich et al. | Jul 1993 | A |
| 5247516 | Bernstein et al. | Sep 1993 | A |
| 5251209 | Jurkevich et al. | Oct 1993 | A |
| 5267261 | Blakeney, II et al. | Nov 1993 | A |
| 5268933 | Averbuch | Dec 1993 | A |
| 5388102 | Griffith et al. | Feb 1995 | A |
| 5490139 | Baker et al. | Feb 1996 | A |
| 5491835 | Sasuta et al. | Feb 1996 | A |
| 5509027 | Vook et al. | Apr 1996 | A |
| 5539925 | Yli-Kotila et al. | Jul 1996 | A |
| 5561841 | Markus | Oct 1996 | A |
| 5572528 | Shuen | Nov 1996 | A |
| 5574720 | Lee | Nov 1996 | A |
| 5594943 | Balachandran | Jan 1997 | A |
| 5694548 | Baugher et al. | Dec 1997 | A |
| 5722044 | Padovani et al. | Feb 1998 | A |
| 5737328 | Norman et al. | Apr 1998 | A |
| 5794137 | Harte | Aug 1998 | A |
| 5854785 | Willey | Dec 1998 | A |
| 5870427 | Tiedemann, Jr. et al. | Feb 1999 | A |
| 5974036 | Acharya et al. | Oct 1999 | A |
| 5978366 | Massingill et al. | Nov 1999 | A |
| 6016316 | Moura et al. | Jan 2000 | A |
| 6018521 | Timbs et al. | Jan 2000 | A |
| 6031863 | Jusa et al. | Feb 2000 | A |
| 6034950 | Sauer et al. | Mar 2000 | A |
| 6049543 | Sauer et al. | Apr 2000 | A |
| 6055428 | Soliman | Apr 2000 | A |
| 6073021 | Kumar et al. | Jun 2000 | A |
| 6084969 | Wright et al. | Jul 2000 | A |
| 6094427 | Yi | Jul 2000 | A |
| 6097952 | Kawabata | Aug 2000 | A |
| 6101394 | Illidge | Aug 2000 | A |
| 6137787 | Chawla et al. | Oct 2000 | A |
| 6144671 | Perinpanathan et al. | Nov 2000 | A |
| 6151502 | Padovani et al. | Nov 2000 | A |
| 6157668 | Gilhousen et al. | Dec 2000 | A |
| 6157833 | Lawson-Jenkins et al. | Dec 2000 | A |
| 6157978 | Ng et al. | Dec 2000 | A |
| 6161008 | Lee et al. | Dec 2000 | A |
| 6163692 | Chakrabarti et al. | Dec 2000 | A |
| 6195552 | Jeong et al. | Feb 2001 | B1 |
| 6195705 | Leung | Feb 2001 | B1 |
| 6201971 | Purnadi et al. | Mar 2001 | B1 |
| 6256300 | Ahmed et al. | Jul 2001 | B1 |
| 6272129 | Dynarski et al. | Aug 2001 | B1 |
| 6285665 | Chuah | Sep 2001 | B1 |
| 6300887 | Le | Oct 2001 | B1 |
| 6308267 | Gremmelmaier | Oct 2001 | B1 |
| 6345043 | Hsu | Feb 2002 | B1 |
| 6347091 | Wallentin et al. | Feb 2002 | B1 |
| 6360100 | Grob et al. | Mar 2002 | B1 |
| 6366561 | Bender | Apr 2002 | B1 |
| 6370380 | Norefors et al. | Apr 2002 | B1 |
| 6397065 | Huusko et al. | May 2002 | B1 |
| 6400722 | Chuah et al. | Jun 2002 | B1 |
| 6445922 | Hiller et al. | Sep 2002 | B1 |
| 6446127 | Schuster et al. | Sep 2002 | B1 |
| 6449481 | Kwon et al. | Sep 2002 | B1 |
| 6456604 | Lee et al. | Sep 2002 | B1 |
| 6466964 | Leung et al. | Oct 2002 | B1 |
| 6473418 | Laroia et al. | Oct 2002 | B1 |
| 6493725 | Iwai et al. | Dec 2002 | B1 |
| 6496704 | Yuan | Dec 2002 | B2 |
| 6510153 | Inoue et al. | Jan 2003 | B1 |
| 6516352 | Booth et al. | Feb 2003 | B1 |
| 6519457 | Jiang et al. | Feb 2003 | B1 |
| 6529732 | Vainiomaki et al. | Mar 2003 | B1 |
| 6535493 | Lee et al. | Mar 2003 | B1 |
| 6553227 | Ho et al. | Apr 2003 | B1 |
| 6587680 | Ala-Laurila et al. | Jul 2003 | B1 |
| 6611547 | Rauhala | Aug 2003 | B1 |
| 6640248 | Jorgensen | Oct 2003 | B1 |
| 6654363 | Li et al. | Nov 2003 | B1 |
| 6671512 | Laakso | Dec 2003 | B2 |
| 6701155 | Sarkkinen et al. | Mar 2004 | B2 |
| 6708031 | Purnadi et al. | Mar 2004 | B2 |
| 6714524 | Kim et al. | Mar 2004 | B1 |
| 6714777 | Naqvi et al. | Mar 2004 | B1 |
| 6714788 | Voyer | Mar 2004 | B2 |
| 6728365 | Li et al. | Apr 2004 | B1 |
| 6754492 | Stammers et al. | Jun 2004 | B1 |
| 6763007 | La Porta et al. | Jul 2004 | B1 |
| 6768908 | Jalloul et al. | Jul 2004 | B1 |
| 6771962 | Saifullah et al. | Aug 2004 | B2 |
| 6785256 | O'neill | Aug 2004 | B2 |
| 6807421 | Ahmavaara | Oct 2004 | B1 |
| 6842621 | Labun et al. | Jan 2005 | B2 |
| 6842630 | Periyalwar | Jan 2005 | B2 |
| 6862446 | Oneill et al. | Mar 2005 | B2 |
| 6901063 | Vayanos et al. | May 2005 | B2 |
| 6917605 | Kakemizu et al. | Jul 2005 | B2 |
| 6937566 | Forslow | Aug 2005 | B1 |
| 6947401 | El-Malki et al. | Sep 2005 | B2 |
| 6950650 | Roeder | Sep 2005 | B2 |
| 6954442 | Tsirtsis et al. | Oct 2005 | B2 |
| 6961579 | Inukai et al. | Nov 2005 | B2 |
| 6965585 | Grilli et al. | Nov 2005 | B2 |
| 6970445 | Oneill et al. | Nov 2005 | B2 |
| 6990088 | Madour | Jan 2006 | B2 |
| 6990337 | Oneill et al. | Jan 2006 | B2 |
| 6990339 | Turanyi et al. | Jan 2006 | B2 |
| 6990343 | Lefkowitz | Jan 2006 | B2 |
| 6992994 | Das et al. | Jan 2006 | B2 |
| 6993332 | Pedersen et al. | Jan 2006 | B2 |
| 7003311 | Ebata et al. | Feb 2006 | B2 |
| 7006826 | Cao et al. | Feb 2006 | B2 |
| 7016317 | Pathak et al. | Mar 2006 | B1 |
| 7027400 | O'neill | Apr 2006 | B2 |
| 7027449 | Garcia-Luna-Aceves et al. | Apr 2006 | B2 |
| 7047009 | Laroia et al. | May 2006 | B2 |
| 7068640 | Kakemizu et al. | Jun 2006 | B2 |
| 7068654 | Joseph et al. | Jun 2006 | B1 |
| 7069040 | Iwanaga et al. | Jun 2006 | B2 |
| 7089008 | Back et al. | Aug 2006 | B1 |
| 7116654 | Kim | Oct 2006 | B2 |
| 7123599 | Yano et al. | Oct 2006 | B2 |
| 7130291 | Kim et al. | Oct 2006 | B1 |
| 7161913 | Jung | Jan 2007 | B2 |
| 7177641 | Miernik et al. | Feb 2007 | B1 |
| 7184771 | Mouly et al. | Feb 2007 | B1 |
| 7197318 | Schwarz et al. | Mar 2007 | B2 |
| 7233583 | Asthana et al. | Jun 2007 | B2 |
| 7233794 | Grob et al. | Jun 2007 | B2 |
| 7263357 | Lee et al. | Aug 2007 | B2 |
| 7266100 | Le et al. | Sep 2007 | B2 |
| 7272122 | Trossen et al. | Sep 2007 | B2 |
| 7283495 | Lee et al. | Oct 2007 | B2 |
| 7283511 | Hans et al. | Oct 2007 | B2 |
| 7290063 | Kalliokulju et al. | Oct 2007 | B2 |
| 7315554 | Baum et al. | Jan 2008 | B2 |
| 7330542 | Kauhanen et al. | Feb 2008 | B2 |
| 7336953 | Kim et al. | Feb 2008 | B2 |
| 7369855 | Oneill et al. | May 2008 | B2 |
| 7369859 | Gallagher | May 2008 | B2 |
| 7376101 | Shim et al. | May 2008 | B2 |
| 7389110 | Lee | Jun 2008 | B2 |
| 7391741 | Kang | Jun 2008 | B2 |
| 7403789 | Takano et al. | Jul 2008 | B2 |
| 7408917 | Kyung et al. | Aug 2008 | B1 |
| 7408950 | Okuyama | Aug 2008 | B2 |
| 7409428 | Brabec et al. | Aug 2008 | B1 |
| 7418264 | Kim | Aug 2008 | B2 |
| 7420957 | Kim et al. | Sep 2008 | B2 |
| 7460504 | Tsirtsis et al. | Dec 2008 | B2 |
| 7492762 | Chowdhury | Feb 2009 | B2 |
| 7499401 | Buddhikot et al. | Mar 2009 | B2 |
| 7505765 | Frangione et al. | Mar 2009 | B2 |
| 7515561 | Koodli et al. | Apr 2009 | B2 |
| 7529239 | Seppanen | May 2009 | B2 |
| 7567639 | Huh et al. | Jul 2009 | B2 |
| 7583592 | Park et al. | Sep 2009 | B2 |
| 7593364 | Asthana | Sep 2009 | B2 |
| 7623493 | Baba et al. | Nov 2009 | B2 |
| 7653415 | Van Rooyen | Jan 2010 | B2 |
| 7668541 | Oneill et al. | Feb 2010 | B2 |
| 7672254 | Kim et al. | Mar 2010 | B2 |
| 7702309 | Faccin et al. | Apr 2010 | B2 |
| 7706739 | Kjellberg | Apr 2010 | B2 |
| 7729350 | Singh et al. | Jun 2010 | B2 |
| 7742781 | Chen et al. | Jun 2010 | B2 |
| 7773947 | Gerlach | Aug 2010 | B2 |
| 7962142 | Oneill et al. | Jun 2011 | B2 |
| 8112102 | Fischer | Feb 2012 | B2 |
| 8144664 | Pani et al. | Mar 2012 | B2 |
| 8165587 | Dahlen et al. | Apr 2012 | B2 |
| 8184615 | Tsirtsis et al. | May 2012 | B2 |
| 8229120 | Iwamura et al. | Jul 2012 | B2 |
| 8583044 | Dua | Nov 2013 | B2 |
| 20010019545 | Okubo et al. | Sep 2001 | A1 |
| 20020061009 | Sorensen | May 2002 | A1 |
| 20020064144 | Einola et al. | May 2002 | A1 |
| 20020065785 | Tsuda | May 2002 | A1 |
| 20020067706 | Bautz et al. | Jun 2002 | A1 |
| 20020075859 | Mizell et al. | Jun 2002 | A1 |
| 20020082038 | Mochizuki | Jun 2002 | A1 |
| 20020085518 | Lim | Jul 2002 | A1 |
| 20020107908 | Dharanikota | Aug 2002 | A1 |
| 20020114308 | Takano et al. | Aug 2002 | A1 |
| 20020126701 | Requena | Sep 2002 | A1 |
| 20020136226 | Christoffel et al. | Sep 2002 | A1 |
| 20020161927 | Inoue et al. | Oct 2002 | A1 |
| 20020168982 | Sorokine et al. | Nov 2002 | A1 |
| 20020199012 | Cable et al. | Dec 2002 | A1 |
| 20030009580 | Chen et al. | Jan 2003 | A1 |
| 20030009582 | Qiao et al. | Jan 2003 | A1 |
| 20030018774 | Flinck et al. | Jan 2003 | A1 |
| 20030026220 | Uhlik et al. | Feb 2003 | A1 |
| 20030027572 | Karlsson et al. | Feb 2003 | A1 |
| 20030032430 | Lee | Feb 2003 | A1 |
| 20030036392 | Yukie | Feb 2003 | A1 |
| 20030078047 | Lee et al. | Apr 2003 | A1 |
| 20030092444 | Sengodan et al. | May 2003 | A1 |
| 20030101307 | Gemelli et al. | May 2003 | A1 |
| 20030103496 | Lakshmi | Jun 2003 | A1 |
| 20030104814 | Gwon et al. | Jun 2003 | A1 |
| 20030112766 | Riedel et al. | Jun 2003 | A1 |
| 20030119516 | Tomishima et al. | Jun 2003 | A1 |
| 20030204599 | Trossen et al. | Oct 2003 | A1 |
| 20030210669 | Vayanos et al. | Nov 2003 | A1 |
| 20030212764 | Trossen et al. | Nov 2003 | A1 |
| 20030214922 | Shahrier | Nov 2003 | A1 |
| 20030216140 | Chambert | Nov 2003 | A1 |
| 20030217096 | McKelvie et al. | Nov 2003 | A1 |
| 20030227871 | Hsu et al. | Dec 2003 | A1 |
| 20030236103 | Tamaki et al. | Dec 2003 | A1 |
| 20040002362 | Chuah et al. | Jan 2004 | A1 |
| 20040004736 | Ogura et al. | Jan 2004 | A1 |
| 20040004967 | Nakatsugawa et al. | Jan 2004 | A1 |
| 20040008632 | Hsu et al. | Jan 2004 | A1 |
| 20040015607 | Bender et al. | Jan 2004 | A1 |
| 20040016551 | Bennett | Jan 2004 | A1 |
| 20040017792 | Khaleghi et al. | Jan 2004 | A1 |
| 20040017798 | Hurtta et al. | Jan 2004 | A1 |
| 20040018841 | Trossen | Jan 2004 | A1 |
| 20040076186 | Chen et al. | Apr 2004 | A1 |
| 20040087319 | Bos et al. | May 2004 | A1 |
| 20040090913 | Scudder et al. | May 2004 | A1 |
| 20040090937 | Chaskar et al. | May 2004 | A1 |
| 20040104544 | Fan et al. | Jun 2004 | A1 |
| 20040116153 | Kaminski et al. | Jun 2004 | A1 |
| 20040120317 | Forssell | Jun 2004 | A1 |
| 20040139201 | Chaudhary et al. | Jul 2004 | A1 |
| 20040151148 | Yahagi | Aug 2004 | A1 |
| 20040151193 | Rune et al. | Aug 2004 | A1 |
| 20040165551 | Krishnamurthi et al. | Aug 2004 | A1 |
| 20040166898 | Tajima | Aug 2004 | A1 |
| 20040179544 | Wilson et al. | Sep 2004 | A1 |
| 20040192307 | Watanabe et al. | Sep 2004 | A1 |
| 20040192390 | Tajima | Sep 2004 | A1 |
| 20040218607 | Hurtta et al. | Nov 2004 | A1 |
| 20040228301 | Rudolf et al. | Nov 2004 | A1 |
| 20040228304 | Riedel et al. | Nov 2004 | A1 |
| 20040242222 | An et al. | Dec 2004 | A1 |
| 20040253954 | Lee et al. | Dec 2004 | A1 |
| 20050020262 | Kim | Jan 2005 | A1 |
| 20050020265 | Funabiki et al. | Jan 2005 | A1 |
| 20050053043 | Rudolf et al. | Mar 2005 | A1 |
| 20050058151 | Yeh | Mar 2005 | A1 |
| 20050059417 | Zhang et al. | Mar 2005 | A1 |
| 20050063338 | Tsui | Mar 2005 | A1 |
| 20050063389 | Elliott et al. | Mar 2005 | A1 |
| 20050079823 | Kurek et al. | Apr 2005 | A1 |
| 20050089043 | Seckin et al. | Apr 2005 | A1 |
| 20050090260 | Semper et al. | Apr 2005 | A1 |
| 20050128949 | Ku et al. | Jun 2005 | A1 |
| 20050128990 | Eom et al. | Jun 2005 | A1 |
| 20050141468 | Kim et al. | Jun 2005 | A1 |
| 20050143072 | Yoon et al. | Jun 2005 | A1 |
| 20050201324 | Zheng | Sep 2005 | A1 |
| 20050265303 | Edwards et al. | Dec 2005 | A1 |
| 20050268153 | Armstrong et al. | Dec 2005 | A1 |
| 20060002344 | Ono et al. | Jan 2006 | A1 |
| 20060003768 | Chiou | Jan 2006 | A1 |
| 20060007936 | Shrum et al. | Jan 2006 | A1 |
| 20060029028 | Kim et al. | Feb 2006 | A1 |
| 20060056348 | Marinier et al. | Mar 2006 | A1 |
| 20060067526 | Faccin et al. | Mar 2006 | A1 |
| 20060069809 | Serlet | Mar 2006 | A1 |
| 20060089141 | Ho et al. | Apr 2006 | A1 |
| 20060099948 | Hoghooghi et al. | May 2006 | A1 |
| 20060099950 | Klein et al. | May 2006 | A1 |
| 20060104232 | Gidwani | May 2006 | A1 |
| 20060121883 | Faccin | Jun 2006 | A1 |
| 20060149845 | Malin et al. | Jul 2006 | A1 |
| 20060183479 | Liu et al. | Aug 2006 | A1 |
| 20060217119 | Bosch et al. | Sep 2006 | A1 |
| 20060230019 | Hill et al. | Oct 2006 | A1 |
| 20060268924 | Marinier et al. | Nov 2006 | A1 |
| 20060285520 | Venkitaraman | Dec 2006 | A1 |
| 20070016637 | Brawn et al. | Jan 2007 | A1 |
| 20070019584 | Qi et al. | Jan 2007 | A1 |
| 20070064948 | Tsirtsis et al. | Mar 2007 | A1 |
| 20070066918 | Dewald et al. | Mar 2007 | A1 |
| 20070076653 | Park et al. | Apr 2007 | A1 |
| 20070076658 | Park et al. | Apr 2007 | A1 |
| 20070078999 | Corson et al. | Apr 2007 | A1 |
| 20070083669 | Tsirtsis et al. | Apr 2007 | A1 |
| 20070086389 | Park et al. | Apr 2007 | A1 |
| 20070091810 | Kim et al. | Apr 2007 | A1 |
| 20070099618 | Kim | May 2007 | A1 |
| 20070105555 | Miernik et al. | May 2007 | A1 |
| 20070105584 | Grob et al. | May 2007 | A1 |
| 20070121542 | Lohr et al. | May 2007 | A1 |
| 20070147283 | Laroia et al. | Jun 2007 | A1 |
| 20070147286 | Laroia et al. | Jun 2007 | A1 |
| 20070147377 | Laroia et al. | Jun 2007 | A1 |
| 20070171875 | Suda | Jul 2007 | A1 |
| 20070189282 | Lohr et al. | Aug 2007 | A1 |
| 20070191054 | Das et al. | Aug 2007 | A1 |
| 20070191065 | Lee et al. | Aug 2007 | A1 |
| 20070195788 | Vasamsetti et al. | Aug 2007 | A1 |
| 20080019293 | Chang et al. | Jan 2008 | A1 |
| 20080031198 | Hwang et al. | Feb 2008 | A1 |
| 20080051091 | Phan et al. | Feb 2008 | A1 |
| 20080074994 | Jen | Mar 2008 | A1 |
| 20080076424 | Barber et al. | Mar 2008 | A1 |
| 20080089287 | Sagfors et al. | Apr 2008 | A1 |
| 20080146231 | Huang et al. | Jun 2008 | A1 |
| 20080160999 | Eklund | Jul 2008 | A1 |
| 20080242292 | Koskela et al. | Oct 2008 | A1 |
| 20080253332 | Ore et al. | Oct 2008 | A1 |
| 20080259855 | Yoon et al. | Oct 2008 | A1 |
| 20080261600 | Somasundaram et al. | Oct 2008 | A1 |
| 20090029706 | Prakash et al. | Jan 2009 | A1 |
| 20090046573 | Damnjanovic | Feb 2009 | A1 |
| 20090175448 | Watanabe et al. | Jul 2009 | A1 |
| 20090181673 | Barrett | Jul 2009 | A1 |
| 20090190556 | Venkitaraman | Jul 2009 | A1 |
| 20090191878 | Hedqvist et al. | Jul 2009 | A1 |
| 20090274086 | Petrovic et al. | Nov 2009 | A1 |
| 20090285218 | Adamczyk et al. | Nov 2009 | A1 |
| 20100080126 | Higashida | Apr 2010 | A1 |
| 20110019614 | Oneill et al. | Jan 2011 | A1 |
| 20110039546 | Narasimha et al. | Feb 2011 | A1 |
| 20110039552 | Narasimha et al. | Feb 2011 | A1 |
| 20110051660 | Arora et al. | Mar 2011 | A1 |
| 20110103347 | Dimou | May 2011 | A1 |
| 20110250892 | Gupta et al. | Oct 2011 | A1 |
| 20110268085 | Barany et al. | Nov 2011 | A1 |
| 20120087312 | Laroia et al. | Apr 2012 | A1 |
| 20120327908 | Gupta et al. | Dec 2012 | A1 |
| 20130208709 | Corson et al. | Aug 2013 | A1 |
| 20130294324 | Corson et al. | Nov 2013 | A1 |
| 20150030003 | O'Neill et al. | Jan 2015 | A1 |
| Number | Date | Country |
|---|---|---|
| 2002353616 | May 2003 | AU |
| 36022006 | Jun 2007 | CL |
| 36052006 | Jun 2007 | CL |
| 36032006 | Jul 2007 | CL |
| 36042006 | Jul 2007 | CL |
| 1043052 | Jun 1990 | CN |
| 1133669 | Oct 1996 | CN |
| 1344477 | Apr 2002 | CN |
| 1345518 | Apr 2002 | CN |
| 1416284 | May 2003 | CN |
| 1481119 | Mar 2004 | CN |
| 1514607 | Jul 2004 | CN |
| 1650178 | Aug 2005 | CN |
| 1859529 | Nov 2006 | CN |
| 0740440 | Oct 1996 | EP |
| 0813346 | Dec 1997 | EP |
| 0974895 | Jan 2000 | EP |
| 1088463 | Apr 2001 | EP |
| 1128704 | Aug 2001 | EP |
| 1345370 | Sep 2003 | EP |
| 0926608 | Mar 2004 | EP |
| 1458209 | Sep 2004 | EP |
| 1473872 | Nov 2004 | EP |
| 1489808 | Dec 2004 | EP |
| 1507421 | Feb 2005 | EP |
| 1565024 | Aug 2005 | EP |
| 1720267 | Nov 2006 | EP |
| 1764942 | Mar 2007 | EP |
| 2322046 | Aug 1998 | GB |
| 2395629 | May 2004 | GB |
| 2084807 | Mar 1990 | JP |
| 08116329 | May 1996 | JP |
| 11308273 | Nov 1999 | JP |
| H11341541 | Dec 1999 | JP |
| 2000125343 | Apr 2000 | JP |
| 2001217830 | Aug 2001 | JP |
| 2001237878 | Aug 2001 | JP |
| 2001245355 | Sep 2001 | JP |
| 2002111732 | Apr 2002 | JP |
| 2002513527 | May 2002 | JP |
| 2002165249 | Jun 2002 | JP |
| 2002281069 | Sep 2002 | JP |
| 2002281539 | Sep 2002 | JP |
| 2002534923 | Oct 2002 | JP |
| 2002537739 | Nov 2002 | JP |
| 2003060685 | Feb 2003 | JP |
| 2003111134 | Apr 2003 | JP |
| 2003348007 | May 2003 | JP |
| 2003304571 | Oct 2003 | JP |
| 2003338833 | Nov 2003 | JP |
| 2004007578 | Jan 2004 | JP |
| 2004104544 | Apr 2004 | JP |
| 2004147228 | May 2004 | JP |
| 2004187256 | Jul 2004 | JP |
| 2004201289 | Jul 2004 | JP |
| 2004297130 | Oct 2004 | JP |
| 2004328637 | Nov 2004 | JP |
| 2005531173 | Oct 2005 | JP |
| 2007513569 | May 2007 | JP |
| 2007521759 | Aug 2007 | JP |
| 2007527177 | Sep 2007 | JP |
| 2008053889 | Mar 2008 | JP |
| 4827994 | Nov 2011 | JP |
| 20040004918 | Jan 2004 | KR |
| 20040105069 | Dec 2004 | KR |
| 20050023194 | Mar 2005 | KR |
| 20050065123 | Jun 2005 | KR |
| 20050066287 | Jun 2005 | KR |
| 20070031810 | Mar 2007 | KR |
| 2117396 | Aug 1998 | RU |
| 2003120063 | Feb 2005 | RU |
| 2256299 | Jul 2005 | RU |
| 2005115564 | Nov 2005 | RU |
| 2267864 | Jan 2006 | RU |
| 2005129079 | Feb 2006 | RU |
| 2292669 | Jan 2007 | RU |
| 2294596 | Feb 2007 | RU |
| 200527930 | Aug 2005 | TW |
| 200708018 | Feb 2007 | TW |
| 9501706 | Jan 1995 | WO |
| WO9512297 | May 1995 | WO |
| 9804094 | Jan 1998 | WO |
| WO9833288 | Jul 1998 | WO |
| WO9847302 | Oct 1998 | WO |
| WO9856140 | Dec 1998 | WO |
| WO9905828 | Feb 1999 | WO |
| WO9927718 | Jun 1999 | WO |
| WO9966748 | Dec 1999 | WO |
| WO0018173 | Mar 2000 | WO |
| WO0041401 | Jul 2000 | WO |
| WO0041426 | Jul 2000 | WO |
| WO0128160 | Apr 2001 | WO |
| WO0158196 | Aug 2001 | WO |
| WO0163947 | Aug 2001 | WO |
| WO0178440 | Oct 2001 | WO |
| 0219746 | Mar 2002 | WO |
| WO0243409 | May 2002 | WO |
| 0247407 | Jun 2002 | WO |
| WO02056551 | Jul 2002 | WO |
| WO03007484 | Jan 2003 | WO |
| WO030017582 | Feb 2003 | WO |
| WO03092316 | Nov 2003 | WO |
| WO03098816 | Nov 2003 | WO |
| WO03105516 | Dec 2003 | WO |
| 2004039022 | May 2004 | WO |
| WO2004068739 | Aug 2004 | WO |
| WO2004070989 | Aug 2004 | WO |
| 2004075468 | Sep 2004 | WO |
| WO2004079949 | Sep 2004 | WO |
| WO2004105272 | Dec 2004 | WO |
| WO2004107638 | Dec 2004 | WO |
| WO-2004114695 | Dec 2004 | WO |
| WO2005029790 | Mar 2005 | WO |
| 2005048629 | May 2005 | WO |
| WO2005062633 | Jul 2005 | WO |
| WO-2005078966 | Aug 2005 | WO |
| WO2005084146 | Sep 2005 | WO |
| WO2005120183 | Dec 2005 | WO |
| WO2006002676 | Jan 2006 | WO |
| 2006083131 | Aug 2006 | WO |
| WO2008113373 | Sep 2008 | WO |
| WO-2008131401 | Oct 2008 | WO |
| Entry |
|---|
| International Search Report—PCT/US2008/058328, International Searching Authority—European Patent Office—Oct. 15, 2008. |
| Written Opinion—PCT/US2008/058328, International Searching Authority—European Patent Office—Oct. 15, 2008. |
| 3GPP, “3rd Generation Partnership Project, Technical Specification Group Radio Access Network, E-UTRAN Mobility Evaluation and Enhancement,(Release 9)”, 3GPP Draft, R1-090856 TP for TR for Mobility Studies, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre, 650, Route Des Lucioles, F-06921 Sophia-Antipolis Cedex, France, No. Athens, Greece, Feb. 3, 2009, XP050318707. |
| “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) Radio Resource Control (RRC); Protocol specification (Release 8)” 3GPP Standard; 3GPP TS 36.331, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex; France, No. V8.2.0, May 1, 2008, pp. 1-151, XP050377645. |
| Baker, F., IETF, “RSVP Management Information Base Using SMlv2,” Network Working Group, Request for Comments: 2206, pp. 1-64 (Sep. 1997). |
| Berger, L., et al., “RSVP Extensions for IPSEC Data Flows,” IETF, Network Working Group, Request for Comments: 2207, pp. 1-14 (Sep. 1997). |
| Berger, L., “RSVP Refresh Overhead Reduction Extensions,” IETF Network Working Group, Request for Comments: 2961, pp. 1-32 (Apr. 2001). |
| Bos et al., “A Framework for End-to-End Perceived Quality of Service Negotiation”, IETF Internal Draft, draft-bos-mmusic-sdpqos-framework-00.txt, Nov. 2001, pp. 1-22. |
| Braden, R., “Resource ReSerVation Protocol (RSVP)—Ver. 1, Message Processing Rules,” IETF, Network Working Group, Request for Comments: 2209, pp. 1-24 (Sep. 1997). |
| Braden, R., “Resource ReSerVation Protocol (RSVP)-Ver. 1 Functional Specification”. IETF, Network Working Group, Request for Comments: 2205, pp. 1-105 (Sep. 1997). |
| Camarillo, G., et al., “Integration of Resource Management and SIP,” IETF Internet Draft, draft-ietf-sip-manyfolks-resource-04.ps, Feb. 25, 2002, pp. 1-18. |
| Campbell, Andrew T. et al., “IP Micro-Mobility Protocols”, Mobile Computing and Communications Review (MC2R), vol. 4, No. 4, pp. 45-53, (Oct. 2001). |
| Dorot, V., et al., “An Explanatory Dictionary of Modern Computer Terms,” 2nd Edition, BHV-Petersburg Publishers, Saint Petersburg, 2001, 'Program Product on p. 339. |
| Etri, “Source Specific Multicast (SSM) Explicit Multicast (Xcast)” pp. 1-27 (Jun. 28, 2001). |
| Ho, Michael. “Integration AAA with Mobile IPv4”, Internet Draft, pp. 1-59, Apr. 2002. |
| Johnson, D., et al., IETF Mobile IP Working Group, “Mobility Support in IPv6,”; Feb. 26, 2003 Downloaded from http://www.join.uni-muenster.de on Dec. 29, 2004, p. 1-169. |
| Karagiannis, Georgios. “Mobile IP: State of the Art Report,” Ericsson, No. 3/0362-FCP NB 102 88 UEN, pp. 1-63, (Jul. 13, 1999). |
| Koodli, R. et al.: “Fast Handovers and Context Transfers in Mobile Networks” Computer Communication Review, ACM, New York, NY, US, vol. 31, No. 5, Oct. 1, 2001, pp. 37-47, XP001115324 ISSN: 0146-4833 abstract p. 2, right-hand column, last paragraph—p. 3, left-hand column, paragraph 3 p. 5, right-hand column, last paragraph—p. 7, right-hand column, last paragraph. |
| Leon-Garcia, Alberto; “Communication Networks: Fundamental Concepts and Key Architectures” McGraw-Hill; 2nd Edition; Copyright 2004, pp. 44-52, 429-431. |
| Li, Yalun et al. “Protocol Architecture for Universal Personal Computing,” IEEE Journal on Selected Areas in Communications, IEEE Inc. New York, US, vol. 15, No. 8, Oct. 1, 1997, pp. 1467-1476, XP000721278 ISSN: 0733-8716. |
| Loughney, J. et al. “Context Transfer Protocol (CXTP)” IETF Standard, Request for Comments: 4067, Internet Engineering Task Force, IETF, CH, Jul. 2005, XP015041932 ISSN: 0000-0003 pp. 1 to 33. |
| Mankin, A., et al., “Resource ReSerVation Protocol (RSVP) Version 1, Applicability Statement: Some Guidelines on Deployment”, IETF, Network Working Group, Request for Comments: 2208, pp. 1-6 (Sep. 1997). |
| Marshall, W. et al. “Integration of Resource Management and SIP: SIP Extensions for Resource Management,” IETF Internet Draft, draft-ietf-sip-manyfolks-resource-02.txt, Aug. 2001, pp. 1-28. |
| Miorandi D. et al.: “Analysis of master-slave protocols for real-time industrial communications over IEEE 802.11 WLANs” Industrial Informatics, 2004. INDIN '04, 2nd IEEE International Conference on Berlin, Germany Jun. 24-26, 2004. Piscataway, NJ, USA IEEE, Jun. 24, 2004, pp. 143-148, XP010782619, ISBN 0789385136, Para 3, point B. |
| Moy, J., “OSPF Version 2”, Network Working Group, Request for Comments: 2328, pp. 1-244 (Apr. 1998). |
| Nortel: “Forward Hand-Off options”, R2-071980, 3GPP TSG-RAN WG2 Meeting #58, Kobe, Japan, May 7-11, 2007, sections 2-3. |
| Pallini, G P. et al., “Trends in Handover Design” IEEE 34(3), pp. 82-90, Mar. 1, 1996, XP00557380. |
| Panasonic, “Necessity of forward handover”, 3GPP Draft, R2-062146, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre, 650, Route Des Lucioles, F-06921 Sophia-Antipolis Cedex, France, vol. Ran WG2, No. Tallinn, Aug. 23, 2006, XP050131764. |
| Papalilo, D. et al. “Extending SIP for QoS Support”, www.coritel.it/publications/IP—download/papalilo-salsano-veltri.pdf, Dec. 8, 2001, pp. 1-6. |
| Perkins, C., “IP Mobility Support for IPv4”, Nokia Research Center, Network Working Group, Request for Comments: 3220, Jan. 2002, downloaded from http://www.ietf.org on Dec. 29, 2004, pp. 1-92. |
| Perkins, C., “IP Mobility Support”, IBM, Network Working Group, Request for Comments: 2002, pp. 1-79 (Oct. 1996). |
| Rosenberg J et al:RFAC 3261: “SIP: Session Initiation Protocol” Jun. 1, 2002; Jun. 2002, Jun. 1, 2002, pp. 1-269, XP015009039. |
| Schulzrinne et al., “Application-Layer Mobility Using SIP”, 0-7803-7133 IEEE, pp. 29-36, Jan. 2000. |
| Taiwan Search Report—TW097110828—TIPO—Sep. 21, 2011. |
| Takako Mita, et al., A Proposal for Seamless QoS Support in Mobile Networks, Research Report of Information Processing Society 2004-MBL-29, Japan, Information Processing Society of Japan, May 13, 2004, vol. 2004, No. 44, pp. 129 to 134. |
| Thulasi, A., et al., “IPv6 Prefix Delegation Using ICMPv6”, Network Working Group, Hewlett-Packard, pp. 1-33, Apr. 2004. |
| TIA/EIA/IS-707A.8 “Data Service Options for Spread Spectrum Systems: Radio Link Protocol Type 2” pp. 1-1:4:12 (Mar. 1999). |
| Trossen, D. et al., “A Dynamic Protocol for Candidate Access-Router Discovery”, pp. 1-36 Mar. 14, 2003. |
| Valko, A.G. et al.: “Cellular IP: A New Approach to Internet Host Mobility” Computer Communication Review, Association for Computing Machinery. New York, US vol. 29, No. 1, Jan. 1999, pp. 50-65, XP000823873 ISSN: 0146-4833, p. 56, Line 7-Line13. |
| Wedlund et al: “Mobility Support Using SIP”, Proc. Of ACM/IEEE International Conference on Wireless and Mobile Multimedia (WoWMoM '99), Seattle, Washington, Aug. 1999. |
| Wroclawski, J., “The Use of RSVP with IETF Integrated Services,” IETF, Network Working Group, Request for Comments: 2210, pp. 1-31 (Sep. 1997). |
| Zhou, S., et al., “A Location Management Scheme for Mobility Support in Wireless IP Networks Using Session Initiation Protocol (SIP)”, 1531-2216/01 IEEE, pp. 486-491, Oct. 2001. |
| 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal Terrestrial Radio Access Network (E-UTRAN); Overall description; Stage 2 (Release 9) , 3GPP Standard; 3GPP TS 36.300, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, No. V9.2.0, Jan. 7, 2010, pp. 1-178, XP050401821, [retrieved on Jan. 7, 2010]. |
| 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA) Radio Resource Control (RRC); Protocol specification (Release 9), 3GPP Standard; 3GPP TS 36.331, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, No. V9.1.0, Jan. 7, 2010, pp. 1-221, XP050401822, [retrieved on Jan. 7, 2010]. |
| Droms, R.: “Dynamic Host Configuration Protocol,” IETF Standard, RFC 2131, Internet Engineering Task Force, IETF, CH, pp. 1-45, (Mar. 1997) XP015007915. |
| Huawei, et al.,“Clarification of definitions of HO failure cases”, RAN3, 3GPP Draft; 36300—CR0202—(REL-9)—R2-101906—R3-100635, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, vol. Ran WG2, No. San Francisco, USA; Feb. 22, 2010, Mar. 4, 2010, XP050422194, 3 pgs. [retrieved on Mar. 4, 2010]. |
| Ian F.A., et al., “Mobility Management in Next-Generation Wireless Systems”, Proceedings of the IEEE, IEEE. New York, US, vol. 87, No. 8, Aug. 1, 1999, XP011044241, ISSN: 0018-9219, pp. 1347-1384. |
| “Network Layer Protocol,” Jul. 13, 2002, chap. 6, URL: http://www2.yamanashi-ken.ac.jp/˜itoyo/lecture/network/network06/index06.htm., pp. 1-35. |
| “Terms for Use in Textbooks and Lectures on Distributed Computing,” Feb. 13, 2005, URL: http://web.archive.org/web/20050213090736/http://www.nuis.ac.jp/˜nagal/lecture/dce.html. |
| Zte, et al., “Handover Cause Report for Mobility Robustness Optimization”, 3GPP Draft; R3-092982, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, No. Jeju; Nov. 9, 2009, XP050392455, 4 pgs. [retrieved on Nov. 19, 2009]. |
| Basic Knowledge of Communications Term of Switching HUB, URL, http://www.wdic.org/w/WDIC/%E3%82%B9%E3%82%A4%E3%83%83%E3%83%81%E3%83%B3%E3%82%B0HUB. |
| Mockapetris P., “Domain Names—Implentation and Specification”, IETF RFC 1035, Nov. 1987. |
| 3GPP TS 36.423, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E UTRA) and Evolved Universal Terrestrial Radio Access Network (EUTRAN); X2 Application Protocol (X2AP),” version 0.0.1, Release 8, year 2007, pp. 9. |
| International Preliminary Report on Patentability—PCT/US2011/031841, The International Bureau of WIPO—Geneva, Switzerland—Oct. 9, 2012. |
| Qualcomm Europe, T-Mobile, “Network based solutions to inbound mobility in the presence of PCI confusion”, 3GPP TSG-RAN WG3 #64, R3-091027, May, 2008, pp. 1-4, Retrieved from the internet: URL: http://www.3gpp.org/ftp/tsg—ran/WG3—lu/TSGR3—64/Docs/R3-091027.zip. |
| Qualcomm Incorporated, “UE context fetch procedure stage 2”, 3GPP TSG-RAN WG3 Meeting #67, R3-100893, Feb. 2010, pp. 1-4, Retrieved from the internet URL: http://www.3gpp.org/ftp/tsg—ran/WG3—lu/TSGR3—67/Docs/R3-100893.zip. |
| Number | Date | Country | |
|---|---|---|---|
| 20080240039 A1 | Oct 2008 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60908055 | Mar 2007 | US | |
| 60908120 | Mar 2007 | US | |
| 60908047 | Mar 2007 | US |
