State synchronization of access routers

- QUALCOMM Incorporated

Embodiments describe synchronizing access routers with wireless terminal state information. According to an embodiment is a wireless terminal that transmits a message that includes an address for at least two access routers. State change information can optionally be included in the message. According to another embodiment is an access router that receives a state change notification from a wireless device or another access router. The state change notification is updated in the access router. An acknowledgment confirming the updated state change may be sent to the wireless terminal. Dynamic state synchronization is provided with minimal communication with wireless terminal.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
CROSS-REFERENCE

This application claims priority to U.S. Provisional Patent Application Ser. No. 60/718,363, filed Sep. 19, 2005, and entitled “METHODS AND APPARATUS FOR THE UTILIZATION OF MOBILE NODES FOR STATE TRANSFER AS PART OF A HANDOFF OPERATION”; and U.S. Provisional Patent Application 60/796,653, filed on May 1, 2006, and entitled “A METHOD AND APPARATUS FOR MOBILITY AWARE RESOURCE CONTROL” (Park). This application is also related to U.S. patent application Ser. No. 11/288,597, filed Nov. 29, 2005, and entitled “METHODS AND APPARATUS FOR THE UTILIZATION OF MOBILE NODES FOR STATE TRANSFER”; U.S. patent application Ser. No. 11/316,602, filed Dec. 22, 2005, and entitled “COMMUNICATIONS METHODS AND APPARATUS USING PHYSICAL ATTACHMENT POINT IDENTIFIERS”; U.S. patent application Ser. No. 11/316,376, filed Dec. 22, 2005, and entitled “COMMUNICATIONS METHODS AND APPARATUS USING PHYSICAL ATTACHMENT POINT IDENTIFIERS WHICH SUPPORT DUAL COMMUNICATIONS LINK”; U.S. patent application Ser. No. 11/316,603, filed Dec. 22, 2005, and entitled “METHOD AND APPARATUS FOR END NODE ASSISTED NEIGHBOR DISCOVER”; and U.S. Pat. No. 6,862,446, filed Feb. 18, 2003, and entitled “METHODS AND APPARATUS FOR THE UTILIZATION OF CORE BASED NODES FOR STATE TRANSFER.” This application is additionally related to the following co-filed patent applications: Ser. No. 11/487,446, entitled “PROVISION OF A MOVE INDICATION TO A RESOURCE REQUESTER” (Park, et al.); Ser. No. 11/846,649, entitled “PACKET ROUTING IN A WIRELESS COMMUNICATIONS ENVIRONMENT” (Park, et al.); Ser. No. 11/486,654, entitled “PROVISION OF QOS TREATMENT BASED UPON MULTIPLE REQUESTS” (Park, et al.); and Ser. No. 11/486,655, entitled “STATE SYNCHRONIZATION BETWEEN ACCESS ROUTERS” (Tsirtsis, et al.). The entireties of each of the aforementioned applications are incorporated herein by reference.

BACKGROUND

I. Field

The invention relates to communication systems and, more particularly, to synchronization between access routers in wireless communication systems.

II. Background

Communication systems frequently include a number of network nodes through which end nodes (e.g., mobile devices) communicate. End nodes communicate with network nodes directly through connections that have been established with the network nodes. Such systems usually rely on the existence of a bidirectional communications link between an end node and an access node to support two-way communications. In such systems, the end node may not know the network layer address of a target destination network node but may be aware of information that it can receive over broadcast channels.

In some systems, end nodes are capable of maintaining multiple bidirectional communications links with different network nodes at substantially the same time. However, such systems typically require the end nodes to send messages intended for a specific network node, with which the end node has a connection, over the link that is directly connected to that specific network node. This approach might not be efficient in some situations especially for wireless link that can fluctuate in terms of quality (e.g., delay and loss characteristics). As a result, the link to the target destination network node may not be the best link available to the end node at the time a message is to be sent to the network node. Typically, this limitation is overcome by resorting to network layer communications that can be routed through multiple hops due to the user of network layer addresses (e.g., IP addresses). This approach of using network layer address may not be efficient especially when the messaging relates to link layer specific functions because network layer messages can be much larger than link layer messages in some systems. In addition, inefficient signaling is not suitable for communications over resource restricted air links.

Network nodes that are serving neighboring geographical cells are typically known to each other through a manual configuration. During such configuration, various parameters are configured in a network node corresponding to several of its neighbors. Such configuration is typically labor intensive and error prone due to human error and the fact that the network layout of a wireless networks often changed relevant to a gradual phased deployment of a wireless communications system.

In addition, the network nodes might not be aware of which of the other network nodes are serving the same end node. Thus, if there is a change in the state of the end node, it is unknown which, if any, of the other network nodes should have the state change information. This information regarding the state of the end node is important to maintain a consistent and reliable user experience.

Therefore, to overcome the aforementioned as well as other deficiencies, there is a need to communicate the state change information efficiently to maintain synchronization between network nodes.

SUMMARY

The following presents a simplified summary in order to provide a basic understanding of some aspects of the disclosed embodiments. This summary is not an extensive overview and is intended to neither identify key or critical elements nor delineate the scope of such embodiments. Its sole purpose is to present some concepts of the described embodiments in a simplified form as a prelude to the more detailed description that is presented later.

In accordance with one or more embodiments and corresponding disclosure thereof, various aspects are described in connection with updating access routers with wireless terminal state information. An access router can be at least a base station, an access point, a packet data serving node (PDSN), and/or a gateway general packet radio services (GPRS) support node. A wireless terminal state can be at least a terminal identification, a quality of service configuration, authorization parameters, and/or a timer associated with system use.

According to an embodiment is a method for state change synchronization with multi-party handshake. The method includes sending a first message to a first access router. The first message includes a first indicator for the first access router and at least a second indicator for at least a second access router. The method also includes receiving an acknowledgment of the first message from the at least a second access router.

In accordance with another embodiment is an apparatus that facilitates state synchronization of access routers. The apparatus includes a processor that transmits a communication to a first access router. The communication can include a first address for a first access router and at least a second address for at least a second access router address. The apparatus also includes a receiver that receives a completion message from the second access router.

According to a further embodiment is an apparatus for state change synchronization. The apparatus includes a means for conveying a first message to a first access router. The first message includes a first address of the first router address and at least a second address of at least a second access router. The apparatus further includes a means for accepting at least a subset of the first message from the second access router.

According to another embodiment is a computer-readable medium having stored thereon computer-executable instructions for updating a multitude of access routers with state change information. The instructions include communicating a message to a first access router. The message includes a state change of a wireless terminal, an address of the first access router, and at least a second address of at least a second access router. The instructions further include receiving an acknowledgment of the message from the second access router.

Still another embodiment is a processor that executes computer-executable instructions for communicating a state change to a multitude of access routers. The computer-executable instructions include conveying a message to a first access router. The message includes a first address of the first access router, at least a second address of at least a second access router, and a return address for a wireless device. The computer-executable instructions further include acquiring at least a subset of the message from the second access router.

Another embodiment includes a method for updating a multitude of access routers with terminal state information. The method includes receiving at a first access router a message having an address for a second access router and an address for at least a third access router. The method further includes routing at least a subset of the message to one of the second and the third access router.

Still another embodiment is an apparatus that facilitates performance consistency of a wireless user device. The apparatus includes a processor that accepts a message from a wireless device. The message includes an indicator for a first access router, an indicator for a second access router, and an indicator for at least a third access router. A memory that stores information related to a state change of the wireless device is included in the apparatus. Also included is a transmitter that transmits at least a subset of the message and the state change to the second access router.

In accordance with another embodiment is an apparatus for synchronizing access routers with wireless terminal state change information. Included in the apparatus is a means for acquiring a message from a wireless terminal and a means for communicating at least a subset of the message to the second access router. The message can include an address for the first access router, an address for a second access router, an address for at least a third access router, and an address for the wireless terminal.

According to another embodiment is a computer-readable medium having stored thereon computer-executable instructions for state change synchronization between a multitude of access routers utilizing multi-party handshake. The instructions include accepting at a first access router a communication for a wireless terminal and transmitting at least a subset of the communication to a second access router. The communication can include a wireless terminal address, an indicator for the first access router, an indicator for the second access router, and an indicator for at least a third access router.

In accordance with a further embodiment is a processor that executes computer-executable instructions for state change synchronization. The instructions include receiving a message that includes a first address of a first access router, a second address of a second access router, and at least a third address of at least a third access router. The instructions also include conveying at least a subset of the message to the second access router.

According to a further embodiment is a method for uniformly updating a multitude of access routers with wireless terminal state change information. The method includes receiving a first message at a first access router, the message including a first indicator for the first access router and at least a second indicator for at least a second access router and a state of a wireless terminal. The method further includes sending at least a subset of the first message to the second access router.

Still another embodiment is an apparatus that facilitates state information synchronization between access routers. The apparatus includes a processor that receives a communication that includes a state of a wireless device, an address for a first access router, and an address for at least a second access router. Also included in the apparatus is a memory that stores information related to the state of the wireless device and a transmitter that transmits at least a portion of the communication to the second access router.

In accordance with another embodiment is an apparatus that facilitates performance consistency of a wireless device. The apparatus includes a means for accepting at a first access router a message from a second access router and a means for conveying at least a subset of the message to a third access router. The message includes a changed state of a wireless device, an address for the first access router, and an address for at least the third access router.

Still another embodiment is a computer-readable medium having stored thereon computer-executable instructions for state synchronization among access routers. The instructions include acquiring at a first access router a communication. Included in the communication is an identification of the first access router, an identification of at least a second access router, and a state of a wireless device. The instructions also include transmitting at least a subset of the communication to the second access router.

According to another embodiment is a processor that executes computer-executable instructions for synchronizing wireless terminal state changes. The instructions include receiving at a first access router a message that includes a state change for a wireless terminal and transmitting at least a subset of the message to at least a second access router. The message includes an address for the first access router and an address for at least a second access router.

In accordance with another embodiment is a method for updating an access router with wireless terminal state information. The method includes receiving a first message at a first access router. The message includes a first access router indicator and a least a state of a wireless terminal. The method further includes sending an acknowledgment of the first message to the wireless terminal.

Still another embodiment is an apparatus that synchronizes an access router with wireless device state information. The apparatus include a processor that receives a message that includes a wireless device state information. Also included in the apparatus is a memory that stores the wireless device information in a retrievable format. A transmitter that transmits at least a subset of the message to the wireless device as an acknowledgment of successful receipt of the first message is also included in the apparatus.

In accordance with another embodiment is an apparatus that facilitates synchronization of wireless state information at an access router. The apparatus include a means for accepting at a first access router a communication from a second access router. Also included is a means for transmitting an acknowledgment of the communication to the wireless device. The message can include an address of the first access router and a state of a wireless device.

Yet another embodiment is a computer-readable medium having stored thereon computer-executable instructions for providing a uniform wireless terminal user experience. The instructions include receiving a communication that includes a first access router address and a state change for a wireless device. The instructions further include conveying at least a subset of the message to the wireless device.

A further embodiment includes a processor that executes computer-executable instructions for state synchronization of an access router. The instructions include accepting at a first access router a message and outputting to a wireless device at least a subset of the message. The message can include an address of the first access router and a changed state for the wireless device.

To the accomplishment of the foregoing and related ends, one or more embodiments comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative aspects and are indicative of but a few of the various ways in which the principles of the embodiments may be employed. Other advantages and novel features will become apparent from the following detailed description when considered in conjunction with the drawings and the disclosed embodiments are intended to include all such aspects and their equivalents.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a wireless communications system for state change synchronization with multi-party handshake.

FIG. 2 illustrates an embodiment of a wireless communications system for state change synchronization with multi-party handshake at the system core.

FIG. 3 illustrates a methodology for communicating access router information for synchronization of state information.

FIG. 4 illustrates a methodology for receiving a state change notification and conveying at least a subset of the state change information.

FIG. 5 illustrates a methodology for routing terminal state information for synchronization between access routers.

FIG. 6 illustrates a methodology for synchronizing a terminal state and providing an acknowledgment upon successful receipt of the state information.

FIG. 7 illustrates a wireless communications system for synchronization of state information between multiple access routers.

FIG. 8 illustrates an embodiment of a wireless communications system for synchronization of state information between multiple access routers at the system core.

FIG. 9 illustrates a methodology for communicating state information for synchronization of access routers.

FIG. 10 illustrates a methodology for state synchronization of multiple access routers with minimal communication from a wireless terminal.

FIG. 11 illustrates a wireless device that communicates with an access router in accordance with the various embodiments.

FIG. 12 illustrates an access router that facilitates state synchronization.

FIG. 13 illustrates a block diagram of an apparatus for state change synchronization.

FIG. 14 illustrates a block diagram of an apparatus for synchronizing access routers with wireless terminal state change information.

FIG. 15 illustrates a block diagram of an apparatus that facilitates performance consistency of a wireless device.

FIG. 16 illustrates a block diagram of an apparatus that facilitates synchronization of wireless state information at an access router.

FIG. 17 illustrates a network diagram of an exemplary communications system implemented in accordance with the various embodiments.

FIG. 18 illustrates an exemplary base station implemented in accordance with the embodiments presented herein.

FIG. 19 illustrates an exemplary wireless terminal implemented in accordance with various embodiments presented herein.

 DETAILED DESCRIPTION

Various embodiments 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 embodiment(s) may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing these embodiments.

As used in this application, the terms “component,” “module,” “system,” and the like are intended to refer to a computer-related entity, either 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 (e.g., 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 embodiments are described herein in connection with a user device. A user device can also be called a system, a subscriber unit, subscriber station, mobile station, mobile device, remote station, access point, base station, remote terminal, access terminal, handset, host, user terminal, terminal, user agent, wireless terminal, wireless device, or user equipment. A user device can be a cellular telephone, 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, or other processing device(s) connected to a wireless modem.

Moreover, various aspects or features described herein may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term “article of manufacture” as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. 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 . . . ).

Various embodiments will be presented in terms of systems that may include a number of device, 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.

With reference now to the drawings, FIG. 1 illustrates a wireless communications system 100 for state change synchronization with multi-party handshake. A wireless terminal 102 can be capable of communicating with multiple access routers at substantially the same time (e.g., multiple links to different access routers) without the need for a handoff (e.g., wireless device is stable) between access routers. As illustrated, wireless terminal 102 can communicate with a first access router (Access Router1) 104, a second access router (Access Router2) 106, and at least a third access router (Access RouterN) 108, wherein N can be any integer equal to or greater than one. An access router is a device with built-in routing-protocol support and can be a base station, an access point (e.g., IEEE 802.11 access point, IEEE 802.11 (WiMAX) access point, IEEE 802.20 access point), a packet data serving node (PDSN), a gateway general packet radio services (GPRS) support node, FLASH OFDM, or some other terminology. It should be understood that while only one wireless terminal 102 is illustrated, multiple wireless terminals could be in communication with access routers 104, 106, and 108 at substantially the same time.

Generally, wireless terminal 102 is in an active state of operation (including a hold state of operation) with one or more of the access router 104, 106, or 108 at any given time. The link with each access router 104, 106, or 108 is independent. During the active state of operation communication with the access router, a state of wireless terminal 102 might change. For example, when a voice call is set up though an access router, there is a communication through the access router and a new piece of state (e.g., changes in the quality of service configuration to accommodate the voice call) is created. To maintain that voice call, each access router with which the wireless terminal communicates though should have information regarding the new piece of state. Therefore, the state should be replicated in the other access routers, such as through a dynamic synchronization.

Either or both wireless terminal 102 and access router 104, 106, 108 may be aware of the change in the state of the wireless terminal and can notify each other of such a state change. Such a change may occur based on the type of communication to be transmitted (e.g., voice, imagery, text, and the like), on the amount of system 100 traffic, or some other condition that affects the communication link between wireless terminal 102 and access routers 104, 106, and 108. The state of wireless terminal 102 might also change due to an external event (e.g., a server changing a time), even when wireless terminal 102 is in a hold or sleep state. Examples of a state of wireless terminal 102 include but are not limited to a terminal identification, security parameters (e.g., keys), a quality of service (QoS) configuration, authorization parameters, timers associated with system use, a condition of a link, etc. The terminal identification provides information as to which wireless terminal 102 the communication applies. Security parameters provide information as to what keys are used for one of authentication, encryption, and derivation of other keys between the access router and the wireless terminal. QoS configuration for wireless terminal 102 allows traffic to be handled in higher or lower priority, more or less probability of delay, and more or less probability of loss. The authorization parameters can include information regarding actions a user of a particular wireless device can or cannot perform. The timers associated with system 100 use may indicate the expiration of a time after which wireless terminal 102 is no longer authorized to use the system, or vice versa. There is a multitude of other states that access router(s) 104, 106, and 108 may hold for a wireless terminal 102, and which should be synchronized among access routers 104, 106, 108 to provide a consistent user experience.

Other exemplary states include, but are not limited to the following: HaAddress, HoAddress, MIPLifetime, HomeNAI, TempNAI, LocationUpdateInterval, PagingCycle, MSK, MSKLife. HaAddress is an IP Address of the HA used by the subscriber. HoAddress is an IP Address assigned to the subscriber. MIPLifetime is the Lifetime of the HoAddress. HomeNAI is the Home Network Access Identifier and is the permanent and globally unique identifier of the subscriber. TempNAI is a Temporary Network Access Identifier and is a locally unique identifier assigned to the subscriber. LocationUpdateInterval is the maximum interval in which the terminal must send location update messages when it is in a sleep state. PagingCycle is the frequency in which the terminal must check the paging channel for pages. MSK is a Master Session Key, which is a Key derived from the authentication phase during access. It is utilized to derive airlink keys for encryption/authentication. MSKLife is the Lifetime of the MSK.

At substantially the same time as the state of wireless terminal 102 changes, a new piece of the state (shown as dot 110) is created in access router 104 aware of the state change. It should be understood that while the following discussion relates to access router 104 being the base station that is aware of the state change, any access router can be aware of the change and the following applies equally to any access router 104, 106, and 108. Access router 104 can send an optional message 112 to wireless terminal 102 indicating a state change. In accordance with some embodiments, wireless terminal 102 may be aware of the state change and does not need a message from access router 104. In some embodiments, access router 104 may not be aware of the state change, thus, there is no message sent to wireless terminal 102, however, wireless terminal 102 should notify access router 104 of the state change and the change 110 is created in access router 104.

Wireless terminal 102 can forward a message 114 to any access router 104, 106, or 108 indicating that there is a state change. If wireless terminal 102 sends the message to access router 104 aware of the state change, the message does not have to provide the state change information. If, however, wireless terminal 102 sends a notification of a state change in message to a different access router 106 or 108, as illustrated, the message should contain the state change information in order for the other access routers in communication with wireless terminal 102 to have a new piece of the state (illustrated as dots 116 and 118).

Message 114 sent by wireless terminal 102 can include a listing of access routers 104, 106, 108 to which wireless terminal 102 can communicate without a handoff occurring. The link between wireless terminal 102 and the access routers to which message 114 is not sent does not have to be an active state of operation (e.g., hold, sleep). In accordance with some embodiments, message 114 includes an address of wireless terminal 102. Message 114 can include an indicator of the access router(s), which can be a network address or IP address, a physical layer address, a connection identification (CID), a lower layer address or link layer address, a Logical Link Control (LLC) identification, or another means of identifying or distinguishing the access routers.

Access router 108 at substantially the same time as receiving message 114, identifies itself as one of the access routers included in message 114. If state information is included in the message, and access router 108 is not aware of the state information, access router 108 can store the information 116 in a storage medium. The information should be retained in a readily accessible manner to allow for identification and retrieval of the state information when a subsequent communication is received from (or intended for) wireless terminal 102. Access router 108 can mark its address as having received the message or simply remove its address or identifier from the message in accordance with some embodiments prior to routing the remaining portion of the message to another access router. Marking the address, rather than removing the address allows other access routers to know which access routers in the list have already received and synchronized the state information, In accordance with some embodiments, the message is sent to access router 104 that notified wireless terminal 102 of the state change, and therefore, message (sent to access router 104) does not include the state information. In such embodiments, access router 104 can append the state information to the message prior to forwarding to another access router identified in message.

The next access router 106 stores the state change information 118 in a retrievable format. An identification of access router 106 can be marked as synchronized or removed from the message and the subset of the message forwarded 122 to the next access router 104. Each access router performs a similar function until the last access router in the list receives the information. This last access router, after recording the state change information, forwards the message or an acknowledgment (ACK) 120 to wireless terminal 102. ACK 120 can be message 114, a subset of message 114, or another communication notifying wireless device 102 that the access routers identified in message 114 have been updated with the state information. In such a manner, information is exchanged between access routers 104, 106, and 108, and an acknowledgment 120 sent to wireless terminal 102 without the need for wireless terminal 102 to communicate individually with each access router 104, 106, and 108.

FIG. 2 illustrates an embodiment of a wireless communication system 200 for state change synchronization with multi-party handshake at the system core. It should be understood that while the various embodiments shown and described herein refer to a state change, the disclosed techniques can work equally well in other situations. An example of such a situation includes when a wireless device is new to a communications system and, thus, access router(s) need to be synchronized to communicate with wireless device. Another situation occurs when a new access router entering the communications system and should be synchronized with the wireless terminal state information.

A wireless terminal 202 can communicate with a first access router (Access Router1) 204, a second access router (Access Router2) 206, and at least a third access router (Access RouterN) 208, wherein N can be any integer equal to or greater than one. Each access router 204, 206, 208 can operate in a respective geographic area or cell, depicted as dotted lines and labeled “Cell A” 210, “Cell B” 212, and “Cell Z” 214, wherein Z is an integer greater than or equal to one. Each cell 210, 212, 214 can have one or more base stations. For example, Cell A 210 includes Base Station1A 216 and Base StationMA 218, Cell B 212 includes Base Station1B 220 and Base StationMB 222, and Cell Z 204 includes Base Station1Z 224 and Base StationMZ 226, wherein M is an integer greater than or equal to zero. Each base station 216-226 communicates with a respective access router 204, 206, or 208, through a network 228, 230, 232.

The access routers 204, 206, 208 contain the terminal state information and no state information is maintained at the base station 216-226 level. Since wireless terminal 202 can communicate with devices in any cell 210, 212, and 214, synchronization of terminal state information should be synchronized among access routers 204, 206, 208 to maintain a consistent user experience. The transfer of terminal state information is similar to that shown and described with reference to the above figure.

Wireless terminal 202 at substantially the same time as receiving notification of a state change (either from an access router (shown as optional communication 234, or based on its own knowledge), notifies 236 an access router 208 of the state change and includes an indicator for the access routers to which the wireless terminal 202 is connected. Although the communication to access router 208 is illustrated as traversing through base station 224, the communication can be through either base station 224 or 226. Access router 208, maintains the state change 238 in a retrievable format. In accordance with some embodiments, access router 208 can mark or otherwise identify its address as being synchronized with the information or remove its own address from the message, and forward the remaining subset of the message 240 to the next access router 206 identified in message 236. The terminal state 242 is recorded in access router 206 and a message 244 forwards to the next identified access router 204. Message 244 can be a subset of message 240 or 236 with the address of access router 206 marked or removed. This process continues until the state change information is received at the last access router 204 identified in message 236. The last access router 204 records the state change 246 and forwards an ACK 248 to wireless terminal 202, which can be the last address included in the message 236. It should be understood that while communication with wireless terminal 202 has been illustrated as flowing through a particular base station, the communication can be transferred through any base station.

FIG. 3 illustrates a methodology 300 for communicating access router information for synchronization of state information. While, for purposes of simplicity of explanation, the methodologies are shown and described as a series of blocks, it is to be understood that the disclosed embodiments are not limited by the number or order of blocks, as some blocks may occur in different orders and/or concurrently with other blocks than what is depicted and described herein. Moreover, not all illustrated blocks may be required to implement the described methodologies. A methodology could alternatively be represented as a series of interrelated states or events, such as in a state diagram. It is to be appreciated that the functionality associated with the blocks may be implemented by software, hardware, a combination thereof or any other suitable means (e.g. device, system, process, component). Additionally, it should be appreciated that the methodologies disclosed throughout this specification are capable of being stored on an article of manufacture to facilitate transporting and transferring such methodologies to various devices.

Methodology 300 begins at 302 where a state change notification is received at, for example, a wireless terminal. The state change can relate to how the network performs with respect to the wireless terminal, a condition of a link, a quality of service configuration, an authorization parameter, a terminal identification, timers associated with system use, or other information. The state change notification can be received from an access router that has an active link with the wireless terminal. In some embodiments, the wireless terminal can receive the state change notification from a processor or other device internal to the wireless terminal that detects or processes the state change. Thus, receiving the notification from a source external to the wireless device is optional.

At 304, a message is sent to an access router. The message can be sent over an Internet protocol, in an application that is currently running, or though other communication means. The message can include a listing of at least two access routers to which wireless terminal is linked and to which wireless terminal can communicate without the need for a handoff. The listing of access routers can include a specific route that the message should take through the access routers (e.g., source-based routing). In some embodiment, the listing includes the access routers but not routing information (e.g., the routing among access routers can take any path). The listing of access routers can include an indicator, such as an address or other means of identifying the access routers. If the message is sent to an access router that sent a notification, at 302, the message may not include the state change information. However, if the notification received, at 302, was not from an access router, or if the message, sent at 304, is to a different access router than the one that sent a notification, at 302, the message should include the state change information. It is to be understood that the wireless terminal may not necessarily understand or process the state change, but should know that there is a state change in order to convey the appropriate message at 304. Included in the message can be a resource reservation protocol. In some embodiments, the message can include an encryption key and/or timers associated with an encryption key.

A determination is made, at 306, whether an acknowledgment (ACK) has been received from an access router different from the access router to which the message was sent, at 304, such as the list access router in the message. If an ACK has been received (“YES”), it indicates that the relevant access routers have been updated with the state change information. If an ACK has not been received (“NO”) a determination is made, at 308, whether a pre-determined period has elapsed. The period can be measured utilizing any means (e.g., time, algorithm). If the period has not elapsed (“NO”), the method continues, at 306, for a determination whether an ACK has been received. The ACK may be an actual acknowledgment of the message or it may be a subset of the message sent, at 304. If the period has elapsed (“YES”) (e.g., timer has timed out), it indicates that there has been a communication failure and the method continues at 304, where another message is sent to an access router. The message may include a routing different from the original routing, if a routing was provided. In some embodiments, the message may include a request for an ACK from each access router, rather than one ACK from the last access router that receives the message. An ACK from each access router would provide an indication of which access router has experienced a communication failure. The communication failure can be the result of a multitude of conditions including an incorrect address, a failure at one or more access router, or another condition. It should be understood the method can proceed from 308 to 304 or 306 any number of times, until an ACK is received.

FIG. 4 illustrates a methodology 400 for receiving a state change notification and conveying at least a subset of the state change information. At 402, an optional notification of a state change is sent to a wireless device. The notification can be sent if the wireless device is not aware that there has been a state change (e.g., no message has been received from the wireless device). It should be understood that in accordance with some embodiments, there is no notification sent at 402 and the method begins at 404, where a message is received from the wireless device. This can occur if the wireless device is aware of the state change.

The message received, at 404, can include information regarding the state change. In accordance with some embodiments, the information regarding the state change can be added to the message, such as by an access router that sent the initial notification, at 402. Thus, in some embodiments, the wireless terminal is not aware of the state that changed, only that there was a change. The message received, at 404, should include an indicator for at least two more access routers. The indicator can be, for example an IP address, a CID or physical layer address, a LLC identifier or link layer address, a network address, or the like.

The state change information in the received message is stored in the access router receiving the message. The indicator for the access router can be marked as having received and synchronized with the information or the indicator for the access router can be removed from the message and, at 406, the marked or remaining portion of the message can be routed to one of the other access routers. The marked or remaining portion of the message should include the identifier for the other access routers and the state change information. In accordance with some embodiments, an ACK is sent to the wireless terminal at substantially the same time as the message is forwarded to one of the other access routers identified in the message.

FIG. 5 illustrates a methodology 500 for routing terminal state information for synchronization between access routers. At 502, a message that includes a state of a wireless terminal is received. This message can be received from an access router that directly received a message from the wireless terminal. In some embodiments, the message is received from an access router that received the information from another access router, rather than directly from the wireless terminal. The message can include an indicator for the access router that received the message, at 502, and at least one other access router to which the information should be communicated. The state of the wireless terminal can be stored in a storage medium or memory and should be in a readily retrievable format.

At 504, an access router is identified through the indicator included in the message and can be any access router included in the message or it can be the next access router included in the message (e.g. designated routing of the message). The indicator of the access router can be marked as synchronized with the message information or removed from the message prior to the message being sent to the identified next access router. In such a manner, the next access router receives the state change information as well as the remaining access routers that should receive the state change information and, in some embodiments, can receive information regarding access routers that have already been updated with the information. Thus, the message sent, at 506, includes only a portion or subset of the originally received message. In some embodiments, the next access router contains a message that includes the access routers that have already received the information.

FIG. 6 illustrates a methodology 600 for synchronizing a terminal state and providing an acknowledgment upon successful receipt of the state information. The method 600 starts, at 602, when a message is received at an access router from another access router. The message can include an indicator of the access router receiving the message and a state of a wireless terminal. The state of the wireless terminal is retained by the access router and, at 604, a determination is made whether there is at least another access router indicator (e.g., address) included in the message.

If there is another access router indicator in the message (“YES”), it indicates that other access routers still need to be synchronized with the wireless terminal state information. The message is forwarded to the next access router, at 606, wherein the indicator of the current access router can be marked as having been synchronized or simply removed prior to forwarding the message. If there is no other access router indicated in the message (“NO”), an acknowledgment (ACK) is sent to the wireless terminal, at 608. In accordance with some embodiments, the ACK is the state of the wireless terminal. For example, the message can include indicators for the access routers and an indicator for the wireless terminal. The routing of the message would traverse the access routers and then be routed to the wireless terminal. The wireless terminal, upon receiving the state information confirms that this state information was already sent to its access routers, and thus, infers that there is state synchronization between its access routers. Thus, the ACK does not necessarily have to indicate that the message has been successfully received by each access router.

FIG. 7 illustrates a wireless communications system 700 for synchronization of state information between multiple access routers. System 700 includes a wireless terminal 702 capable of communicating with multiple access routes at substantially the same time without the need for a handoff between access routers. As illustrated, wireless terminal 702 can communicate with a first access router (Access Router1) 704, a second access router (Access Router2) 706, and at least a third access router (Access RouterN) 708, wherein N is an integer equal to or greater than one.

If an access router 704, 706, or 708 detects a state change of wireless terminal 702, the access router can send a notification to wireless terminal 702, at 710. However, in some embodiments, wireless terminal 702 is aware of the state change and does not need notification 710 from access router 704. It should be understood that while access router 704 is illustrated as notifying wireless terminal 702 and/or receiving a message from wireless terminal 702, such notification and/or receipt can be performed by the other access routers 706 and/or 708.

Wireless terminal 702 can send a message, at 712, to access router 704. The message can include the changed state information and a listing of other access routers to which wireless terminal 702 communicates. If the message does not include the state change information, the message 712 should be sent to the access router 704 aware of the change (e.g., the access router that notified wireless terminal that there was a state change). Wireless terminal 702 does not need to know what state changed, only that there was a state change. In some embodiments, the message can include an encryption key and/or timers associated with an encryption key. Included in the message can be a resource reservation protocol.

At substantially the same time as receiving the message 712, access router 704 retains information 714 regarding the state. Access router also identifies the access routers that should receive the state information and sends an individual communication 716 and 718 to each identified access router 706 and 708. Information 720 and 722 regarding the state is retained by each access router 706 and 708. For example, access router 704 can receive a message from wireless terminal 702 indicating a state change and a listing of three access routers (704, 706, and 708). If access router 704 received the message from wireless terminal, access router 704 identifies access routers 706 and 708 as those access routers that should receive the state information. Thus, access router 704 would send a message that includes the state change information to access router 706 and a second message that includes the state change information to access router 708. The message sent to routers 706 and 708 does not have to include specific access router information.

In some embodiments, access router 704 receives a confirmation or acknowledgment 724, 726 from access router 706 and access router 708. Access router 704 can utilize acknowledgments 724, 726 to define when to send an acknowledgment (ACK) 716 to wireless terminal 702 after all access routers receive and synchronize the terminal state information. If an ACK is not received at wireless terminal 702 before expiration of a pre-determined interval, a subsequent message may be sent to the same or different access router 704. The expiration of the pre-determined interval indicates a communication failure at one or more access router, and therefore, the access routers may not have been synchronized with the terminal state information. However, in accordance with other embodiments, an ACK 716 is not sent to wireless terminal 702.

FIG. 8 illustrates another embodiment of a wireless communications system 800 for synchronization of state information between multiple access routers at the system core. System 800 includes a wireless terminal 802 that can communicate within one or more geographic cells, labeled Cell A 804, Cell B 806, and Cell C 808. Each cell 804, 806, 808 can have one or more base stations. For example, Cell A 804 includes Base Station1A 810 and Base StationVA 12, Cell B 806 includes Base Station1B 814 and Base StationVB 816, and Cell C 808 includes Base Station1Z 818 and Base StationVZ 820, wherein V is an integer greater than or equal to zero.

The base stations 810-820 communicate through respective wireless networks 822, 824, and 826 to respective access routers 828, 830, and 832 that are located at the system 800 core. In order to provide a consistent user experience, each access router 828, 830, and 832 should include a replicate of a state of the wireless terminal (e.g., synchronized with respect to the state). When a state changes, wireless terminal 802 may be aware of the change and automatically send a message 834 an access router, such as access router 830 through one of its base stations, such as base station 814. It should be understood that the message can be sent to any access router 828, 830, or 832 through one of its respective base stations 810-820.

In some embodiments, wireless terminal 802 is not aware of the state change and, therefore, receives a notification 836 that a state has changed from an access router through a base station, illustrated as base station 818. If wireless terminal 802 sends message 834 to an access router (through its respective base station) that sent notification 836, message 834 does not need to include the state change. If however, as illustrated, message 834 is sent to access router that did not send notification 836, the message 834 should include the state change information. Message 834 should contain a listing of access routers to which wireless terminal 802 can be in communication without a handoff (e.g., access routers 828, 830, and 832).

Message 834 is relayed to access router 830 and the state change 838 is retained by access router 830 in a retrievable format. Access router 830 can identify those access routers 828 and 832 that should receive the state change information, base on the information contained in message 834 and can forward at least a portion of the message 834 containing the state change information to these identified access routers 828 and 832, as illustrated at 840 and 842. At substantially the same time as receiving the messages 840 and 842, each access router 828 and 832 stores a portion of the state change information 844 and 846.

In some embodiments, each access router 828 and 832 sends an acknowledgment 848, 850 to access terminal 830 upon successful receipt of the state change information sent in messages 840 and 842. Access router 830 can send an acknowledgment 852 to wireless terminal 802 through base station 814 (or a different base station) upon receipt of the acknowledgment 848, 850 from each access router 828 and 832 or at substantially the same time as sending each access router 828 and 832 a portion of the message. In accordance with some embodiments, wireless terminal 802 does not receive an acknowledgment 852.

With reference now to FIG. 9, illustrated is a methodology 900 for communicating state information for synchronization of access routers. The method 900 starts at 902 where a notification is received indicating a state change. This notification can be received from an access router having an active link with a wireless terminal. In accordance with some embodiments, the wireless terminal is aware of a state change a notification is not sent from an access router. In such embodiments, method 900 starts, at 904, where a message is sent to an access router, the message includes an indicator for at least two other access routers that communicate with wireless terminal. If wireless terminal received a notification of the state change and the message is sent to the access router that notified wireless terminal, the message does not need to include the state change. If, however, the wireless terminal did not receive a notification or if the message is sent to an access router different from the access router that sent the notification, the message should include information regarding the state that changed.

The method 900 continues, at 906, where a determination is made whether an acknowledgment is received. If the acknowledgment is received (“YES”), the method ends. If an acknowledgment is not received (“NO”), a determination is made, at 908, whether a pre-determined interval has expired. Such a pre-determined interval can take into account the amount of time needed to communicate with the various access routers to which wireless terminal has a link. The pre-determined interval can take into account the number of access routers as well as the number of wireless terminals serviced by such access routers. The pre-determined interval can also consider various other parameters including a communication speed, historical information regarding the response time for an acknowledgment, as well as other factors. It should be understood that in accordance with some embodiments, an acknowledgment is not received, thus, the method does not track an expiration of a pre-determined interval.

If the pre-determined interval has not expired (“NO”), the method continues at 906 with a determination whether an acknowledgment is received. If the pre-determined interval has expired (“YES”) a subsequent message can be sent to the same or a different access router, at 904. Expiration of the pre-defined interval can indicate a communication failure or other failure in the network, including defective access routers, overloaded access routers, access routers removed from the network, or other network scenarios. It should be understood that returning to 904 and/or 906 can be continuous, such that any number of waiting periods can be entered or subsequent messages can be sent until an acknowledgment is received, in accordance with those embodiments that utilize an acknowledgment.

Turning now to FIG. 10, illustrated is a methodology 1000 for state synchronization of multiple access routers with minimal communication from a wireless terminal. At 1002, an optional notification of a state change is sent to a wireless terminal. Such a notification can include information regarding the state change or a generic state change notification (e.g., a notification that a state changed but not the specifics of the state change). For those embodiments in which a state change notification is not sent to a wireless terminal, the method 1000 begins at 1004, where a message is received from a wireless terminal.

The message received at 1004 should include an address for at least two other access routers with which wireless terminal has a communication link. The message received can also include the state change information if the access router receiving the message did not send the wireless terminal a state change notification. The access router that received the message identifies the other terminals that should receive the state information for synchronization in order to provide the user of the wireless device with a consistent user experience. At least a portion of the message that includes the state change information is sent to the other access routers identified in the received message, at 1006. The same message or individual messages can be sent to the other access routers.

At 1008, an acknowledgment is received from the other access routers in response to the message sent, at 1006. Upon receipt of the acknowledgment(s), the method 1000 continues, at 1010, with an optional acknowledgment sent to wireless terminal. Such an acknowledgment can notify wireless terminal that the access routers are synchronized with respect to the wireless terminal state. In some embodiments, an acknowledgment is not sent to the wireless terminal.

FIG. 11 illustrates a wireless device 1100 that communicates with an access router in accordance with the various embodiments. Wireless device 1100 includes a transmitter 1102 that can be configured to send a message to various devices including an access router. For example, the information conveyed can include a listing of access routers that wireless device 1100 communicates or it can be a multi-hop message that indicates a particular routing that the sent information could traverse. An optional formatter 1104 can be configured to include state change information in the message or an address of the wireless device 1100, or other information that should be retained by an access router.

Wireless device 1000 also includes a receiver 1104 that can be configured to acquire various messages or subsets of messages, such as a return message. Receiver 1104, in accordance with some embodiments, can receive an acknowledgment that indicates state synchronization among access routers that were indicated in a message sent by transmitter 1102. Receiver 1104 can also be configured to acquire a state change notification from an access router or other network device.

An optional monitor 1108 can be included in wireless device 1100 that can track a predetermined interval that begins when a message is sent to an access router and ends when an acknowledgment is received in response to the message. If the acknowledgment is not received before expiration of the predetermined interval, a communication failure can be inferred. A subsequent message can be sent if a communication failure results.

FIG. 12 illustrates an access router 1200 that facilitates state synchronization. Access router 1200 can include a receiver 1202, a configurer 1204, and a transmitter 1206 that can convey information to various devices (e.g., wireless terminals, access routers). Receiver 1202 can be configured to receive from a wireless device a message that includes access router information. The message from the wireless device can also include state change information, an acknowledgment request, or other information. Receiver 1202 can also be configured to accept information from other access routers, wherein such information can be state information, a reply to a previously sent message and/or an acknowledgment.

Configurer 1204 can modify a message received from a wireless device and/or an access router. For example, if the message does not include state information, configurer may append the message with the information. Thus, when the message is sent to one or more other access routers, through transmitter 1206, the other access routers can automatically be updated with the state information. Configurer 1204 can also update or remove various information from the message prior to the message being transmitted to an access router and/or wireless device. Configurer 1204 can further reformat a message depending on the intended recipient.

FIG. 13 illustrates a block diagram of an apparatus 1300 for state change synchronization. Apparatus 1300 is represented as functional blocks, which can be functional blocks that represent functions implemented by a processor, software or combination thereof (e.g., firmware).

Apparatus 1300 includes a logical module 1302 for conveying a message to a first access router. The message can include an address of the first access router and an address for at least a second access router. Also included is a logical module 1304 for accepting at least a subset of the message from the second access router. The subset of the message can be an acknowledgment.

In some embodiments, apparatus 1300 can include a logical module 1306 for receiving a state change notification. Such a notification can be a state change of a wireless terminal. In some embodiments, apparatus 1300 includes a logical module 1308 for transmitting a state of the wireless terminal with the first message sent by logical module 1302. Apparatus 1300 can include, in some embodiments, a logical module 1310 for including in the first message an address for the apparatus 1300.

FIG. 14 illustrates a block diagram of an apparatus 1400 for synchronizing access routers with wireless terminal state change information. It should be noted that apparatus 1400 is represented as functional blocks, which can be functional blocks that represent functions implemented by a processor, software or combination thereof (e.g., firmware).

Included in apparatus 1400 is a logical module 1402 for acquiring a message from a wireless terminal. The message can include an address for a first access router, an address for a second access router, and an address for at least a third access router. Also included in the message can be a destination address for the wireless terminal. A logical module 1404 for communicating at least a subset of the message to the second access router is included in apparatus 1400.

In some embodiments, apparatus 1400 can include a logical module 1406 for removing the address for the first access router from the message and a logical module 1408 for appending a state change of the wireless terminal to the message. In accordance with some embodiments, apparatus 1400 includes a logical module 1410 for notifying the wireless terminal of a state change (e.g., a terminal identification, a quality of service configuration, an authorization parameter, a timer associated with system use, a condition of a link) and a logical module 1412 for maintaining the state change for a subsequent communication with the wireless terminal.

FIG. 15 illustrates a block diagram of an apparatus 1500 that facilitates performance consistency of a wireless device. Apparatus 1500 is represented as functional blocks, which can be functional blocks that represent functions implemented by a processor, software or combination thereof (e.g., firmware).

Apparatus 1500 can include various logical modules to facilitate performance consistency. A logical module 1502 for accepting at a first access router a message from a second access router is included. The message can include a changed state of a wireless device, an address for the first access router, and an address for at least a third access router. In some embodiments, the message can include an identifier or address of the wireless device. Apparatus 1500 can also include a logical module 1504 for conveying at least a subset of the message to the third access router.

In some embodiments, apparatus 1500 can include a logical module 1506 for capturing or storing the changed state of the wireless device. Also included can be a logical module 1508 for applying the changed state to a subsequent communication with the wireless device.

FIG. 16 illustrates a block diagram of an apparatus 1600 that facilitates synchronization of wireless state information at an access router. Apparatus 1600 is represented as functional blocks, which can be functional blocks that represent functions implemented by a processor, software or combination thereof (e.g., firmware).

Apparatus 1600 can include a logical module 1602 for accepting at a first access router a communication from a second access router. The message can include an address of the first access router and a state of the wireless device. Also included can be a logical module 1604 for transmitting an acknowledgment of the communication to the wireless device.

In some embodiments, apparatus 1600 can include a logical module 1606 for maintaining the state of the wireless terminal at the first access router and a logical module 1608 for applying the state of the wireless device during a subsequent communication with the wireless device. In some embodiments, apparatus 1600 includes a logical module 1610 for removing the address of the first access router from the message prior to transmitting the acknowledgment to the wireless device.

Apparatus 1600 includes, in accordance with some embodiments, a logical module 1612 for determining if the message includes a second address for a third access router. Also included can be a logical module 1614 for communicating at least a subset of the message to the third access router.

FIG. 17 illustrates an exemplary communications system 1700 implemented in accordance with the various embodiments. Communications system 1700 includes multiple cells, labeled Cell A 1702 and Cell G 1704, wherein G is an integer greater to or equal to one. Neighboring cells 1702, 1704 can overlap slightly, as indicated by cell boundary region 1768, thereby providing the potential for signal interference between signals being transmitted by base stations in neighboring cells. Each cell 1702, 1704 of exemplary system 1700 includes three sectors. Cells which have not be subdivided into multiple sectors (N=1), cells with two sectors (N=2) and cells with more than three sectors (N>3) are also possible in communications system 1700. Cell 1702 includes a first sector, sector 1 1710, a second sector, sector 2 1712, and a third sector, sector 3 1714. Each sector 1710, 1712, 1714 has two sector boundary regions; each boundary region is shared between two adjacent sectors. Sector boundary regions provide the potential for signal interference between signals being transmitted by base stations in neighboring sectors. Line 1716 represents a sector boundary region between sector 1 1710 and sector 2 1712; line 1718 represents a sector boundary region between sector 2 1712 and sector 3 1714; line 1720 represents a sector boundary region between sector 3 1714 and sector 1 1710. Similarly, cell G 104 includes a first sector, sector 1 1722, a second sector, sector 2 1724, and a third sector, sector 3 1726. Line 1728 represents a sector boundary region between sector 1 1722 and sector 2 1724; line 1730 represents a sector boundary region between sector 2 1724 and sector 3 1726; line 1732 represents a boundary region between sector 3 1726 and sector 1 1722.

Cell 1 1702 includes a base station (BS), base station 1 1706, and a plurality of end nodes (ENs) in each sector 1710, 1712, 1714. Sector 1 1710 includes EN(1) 1736 and EN(X) 1738 coupled to BS 1706 through wireless links 1740, 1742, respectively; sector 2 1712 includes EN(1′) 1744 and EN(X′) 1746 coupled to BS 1706 through wireless links 1748, 1750, respectively; sector 3 1726 includes EN(1″) 1752 and EN(X″) 1754 coupled to BS 1706 through wireless links 1756, 1758, respectively. Similarly, cell M 1704 includes base station M 1708, and a plurality of end nodes (ENs) in each sector 1722, 1724, 1726. Sector 1 1722 includes EN(1) 1736′ and EN(X) 1738′ coupled to BS M 1708 through wireless links 1740′, 1742′, respectively; sector 2 1724 includes EN(1′) 1744′ and EN(X′) 1746′ coupled to BS M 1708 through wireless links 1748′, 1750′, respectively; sector 3 1726 includes EN(1″) 1752′ and EN(X″) 1754′ coupled to BS 1708 through wireless links 1756′, 1758′, respectively.

System 1700 also includes a network node 1760 which is coupled to BS1 1706 and BS G 1708 through network links 1762, 1764, respectively. Network node 1760 is also coupled to other network nodes, (e.g., other base stations, AAA server nodes, intermediate nodes, routers, and the like) and the Internet through network link 1766. Network links 1762, 1764, 1766 may be, for example, fiber optic cables. Each end node (e.g. EN 1 1736) may be a wireless terminal including a transmitter as well as a receiver. The wireless terminals (e.g., EN(1) 1736) may move through system 1700 and may communicate through wireless links with he base station in the cell in which the EN is currently located. The wireless terminals, (WTs) (e.g. EN(1) 1736) may communicate with peer nodes (e.g., other WTs in system 1700 or outside system 1700) through a base station (e.g., BS 1706) and/or network node 1760. WTs (e.g., EN(1) 1736) may be mobile communications devices such as cell phones, personal data assistants with wireless modems, etc.

Each base station performs tone subset allocation using a different method for the strip-symbol periods, from a method employed for allocating tones and determining tone hopping in the rest symbol periods (e.g., non strip-symbol periods). The wireless terminals can use a tone subset allocation method along with information received from the base station, (e.g., base station slope ID, sector ID information) to determine the tones that they can use to receive data and information at specific strip-symbol periods. The tone subset allocation sequence is constructed, to spread the inter-sector and inter-cell interference across each of the tones.

FIG. 18 illustrates an exemplary base station implemented in accordance with the embodiments presented herein. Exemplary base station 1800 can implement a tone subset allocation sequence, with different tone subset allocation sequences generated for each different sector type of the cell. Base station 1800 may be used as any one of the base stations 1706, 1708 of the system 1700 of FIG. 17. The base station 1800 includes a receiver 1802, a transmitter 1804, a processor 1806, (e.g., CPU), an input/output interface 1807, a state management module 1808, a state management data 1809, and memory 1810 which are coupled by a bus 1809 over which the various elements 1802, 1804, 1806, 1807, and 1810 may interchange data and information.

Sectorized antenna 1803 coupled to receiver 1802 is used for receiving data and other signals (e.g., state information, access router listing) from wireless terminals transmissions from each sector within the base station's cell. Sectorized antenna 1805 coupled to transmitter 1804 is used for transmitting data and other signals, (e.g., control signals, pilot signal, beacon signals, etc.) to wireless terminals 1700 (see FIG. 17) within each sector of the base station's cell. In various embodiments, base station 1800 may employ multiple receivers 1802 and multiple transmitters 1804, (e.g., an individual receiver 1802 for each sector and an individual transmitter 1804 for each sector). The processor 1806, may be, for example, a general purpose central processing unit (CPU). Processor 1806 controls operation of the base station 1800 under direction of one or more routines 1818 stored in memory 1810 and implements the disclosed methodologies. Input/Output (I/O) interface 1807 provides a connection to other network nodes, coupling the base station 1800 to other base stations, access routers, AAA server nodes, etc., other networks, and the Internet. State management module 1808 can send and/or receive messages for state synchronization. State management data 1809 can include information regarding the state data, keys, QoS, wireless terminal identifier, and the like.

Memory 1810 includes routines 1818 and data/information 1820. Data/information 1820 includes data 1836, tone subset allocation sequence information 1838 including downlink strip-symbol time information 1840 and downlink tone information 1842, and wireless terminal (WT) data/info 1844 including a plurality of sets of WT information: WT 1 info 1846 and WT N info 1860. Each set of WT info, (e.g., WT 1 info 1846) includes data 1848, terminal ID 1850, sector ID 1852, uplink channel information 1854, downlink channel information 1856, and mode information 1858.

Routines 1818 include communications routines 1822 and base station control routines 1824. Base station control routines 1824 includes a scheduler module 1826 and signaling routines 1828 including a tone subset allocation routine 1830 for the strip-symbol periods, other downlink tone allocation hopping routine 1832 for the rest of symbol periods, (e.g., non strip-symbol periods), and a beacon routine 1834.

Data 1836 includes data to be transmitted that will be sent to encoder 1814 of transmitter 1804 for encoding prior to transmission to WTs, and received data from WTs that has been processed through decoder 1812 of receiver 1802 following reception. Downlink strip-symbol time information 1840 includes the frame synchronization structure information, such as the superslot, beaconslot, and ultraslot structure information and information specifying whether a given symbol period is a strip-symbol period, and if so, the index of the strip-symbol period and whether the strip-symbol is a resetting point to truncate the tone subset allocation sequence used by the base station. Downlink tone information 1842 includes information including a carrier frequency assigned to the base station 1800, the number and frequency of tones, and the set of tone subsets to be allocated to the strip-symbol periods, and other cell and sector specific values such as slope, slope index and sector type.

Data 1848 may include data that WT1 1700 has received from a peer node, data that WT 1 1700 desires to be transmitted to a peer node, and downlink channel quality report feedback information. Terminal ID 1850 is a base station 1800 assigned ID that identifies WT 1 1700. Sector ID 1852 includes information identifying the sector in which WT1 1700 is operating. Sector ID 1852 can be used, for example, to determine the sector type. Uplink channel information 1854 includes information identifying channel segments that have been allocated by scheduler 1826 for WT1 1700 to use (e.g., uplink traffic channel segments for data, dedicated uplink control channels for requests, power control, timing control, etc.).

Each uplink channel assigned to WT1 1700 includes one or more logical tones, each logical tone following an uplink hopping sequence. Downlink channel information 1856 includes information identifying channel segments that have been allocated by scheduler 1826 to carry data and/or information to WT1 1700 (e.g., downlink traffic channel segments for user data). Each downlink channel assigned to WT1 1700 includes one or more logical tones, each following a downlink hopping sequence. Mode information 1758 includes information identifying the state of operation of WT1 1700, (e.g. sleep, hold, on).

Communications routines 1822 control the base station 1800 to perform various communications operations and implement various communications protocols. Base station control routines 1824 are used to control the base station 1800 to perform basic base station functional tasks (e.g., signal generation and reception, scheduling, and to implement the steps of the various methodologies including transmitting signals to wireless terminals using tone subset allocation sequences during the strip-symbol periods.

Signaling routine 1828 controls the operation of receiver 1802 with its decoder 1812 and transmitter 1804 with its encoder 1814. The signaling routine 1828 is responsible controlling the generation of transmitted data 1836 and control information. Tone subset allocation routine 1830 constructs the tone subset to be used in a strip-symbol period using the disclosed methodologies and data/info 1820 including downlink strip-symbol time info 1840 and sector ID 1852. The downlink tone subset allocation sequences will be different for each sector type in a cell and different for adjacent cells.

The WTs 1700 receive the signals in the strip-symbol periods in accordance with the downlink tone subset allocation sequences; the base station 1800 uses the same downlink tone subset allocation sequences in order to generate the transmitted signals. Other downlink tone allocation hopping routine 1832 constructs downlink tone hopping sequences, using information including downlink tone information 1842, and downlink channel information 1856, for the symbol periods other than the strip-symbol periods. The downlink data tone hopping sequences are synchronized across the sectors of a cell. Beacon routine 1834 controls the transmission of a beacon signal (e.g., a signal of relatively high power signal concentrated on one or a few tones), which may be used for synchronization purposes (e.g., to synchronize the frame timing structure of the downlink signal and therefore the tone subset allocation sequence with respect to an ultra-slot boundary).

FIG. 19 illustrates an exemplary wireless terminal (end node) 1900 which can be used as any one of the wireless terminals (end nodes) (e.g., EN(1) 1936, of the system 1900 shown in FIG. 19. Wireless terminal 1900 implements tone subset allocation sequences. The wireless terminal 1900 includes a receiver 1902 includes a decoder 1912, a transmitter 1903 including an encoder 1914, a state management module 1904 that can send/receive messages for state synchronization. Wireless terminal 1900 also includes a state management data 1905 that can include information regarding the state data, keys, QoS, wireless terminal identifier, and the like, and a processor 1906, and memory 1908 which are coupled by a bus 1910 over which the various elements 1902, 1903, 1904, 1905, 1906, 1908 can interchange data and information. An antenna 1903 used for receiving signals from a base station 1800 is coupled to receiver 1902. An antenna 1905 used for transmitting signals (e.g., to base station 1800) is coupled to transmitter 1903.

The processor 1906, (e.g., a CPU) controls the operation of the wireless terminal 1900 and implements methods by executing routines 1920 and using data/information 1922 in memory 1908. Data/information 1922 includes user data 1934, user information 1936, and tone subset allocation sequence information 1950. User data 1934 may include data, intended for a peer node, which will be routed to encoder 1914 for encoding prior to transmission by transmitter 1903 to base station 1800, and data received from the base station 1800 which has been processed by the decoder 1912 in receiver 1902. User information 1936 includes uplink channel information 1938, downlink channel information 1940, terminal ID information 1942, base station ID information 1944, sector ID information 1946, and mode information 1948.

Uplink channel information 1938 includes information identifying uplink channels segments that have been assigned by base station 1800 for wireless terminal 1900 to use when transmitting to the base station 1900. Uplink channels may include uplink traffic channels, dedicated uplink control channels (e.g., request channels, power control channels and timing control channels). Each uplink channel includes one or more logic tones, each logical tone following an uplink tone hopping sequence. The uplink hopping sequences are different between each sector type of a cell and between adjacent cells. Downlink channel information 1940 includes information identifying downlink channel segments that have been assigned by base station 1800 to WT 1900 for use when BS 1800 is transmitting data/information to WT 1900. Downlink channels may include downlink traffic channels and assignment channels, each downlink channel including one or more logical tone, each logical tone following a downlink hopping sequence, which is synchronized between each sector of the cell.

User info 1936 also includes terminal ID information 1942, which is a base station 1800 assigned identification, base station ID information 1944 that identifies the specific base station 1800 that WT has established communications with, and sector ID info 1946, which identifies the specific sector of the cell where WT 1800 is presently located. Base station ID 1944 provides a cell slope value and sector ID info 1946 provides a sector index type; the cell slope value and sector index type may be used to derive the uplink tone hopping sequences. Mode information 1948 also included in user info 1936 identifies whether the WT 1900 is in sleep mode, hold mode, or on mode.

Tone subset allocation sequence information 1950 includes downlink strip-symbol time information 1952 and downlink tone information 1954. Downlink strip-symbol time information 1952 include the frame synchronization structure information, such as the superslot, beaconslot, and ultraslot structure information and information specifying whether a given symbol period is a strip-symbol period, and if so, the index of the strip-symbol period and whether the strip-symbol is a resetting point to truncate the tone subset allocation sequence used by the base station. Downlink tone info 1954 includes information including a carrier frequency assigned to the base station 1800, the number and frequency of tones, and the set of tone subsets to be allocated to the strip-symbol periods, and other cell and sector specific values such as slope, slope index and sector type.

Routines 1920 include communications routines 1924 and wireless terminal control routines 1926. Communications routines 1924 control the various communications protocols used by WT 1900. Wireless terminal control routines 1926 controls basic wireless terminal 1900 functionality including the control of the receiver 1902 and transmitter 1903. Wireless terminal control routines 1926 include the signaling routine 1928. The signaling routine 1928 includes a tone subset allocation routine 1930 for the strip-symbol periods and an other downlink tone allocation hopping routine 1932 for the rest of symbol periods (e.g., non strip-symbol periods). Tone subset allocation routine 1930 uses user data/info 1922 including downlink channel information 1940, base station ID info 1944 (e.g., slope index and sector type), and downlink tone information 1954 in order to generate the downlink tone subset allocation sequences and process received data transmitted from base station 1800. Other downlink tone allocation hopping routine 1930 constructs downlink tone hopping sequences, using information including downlink tone information 1954, and downlink channel information 1940, for the symbol periods other than the strip-symbol periods. Tone subset allocation routine 1930, when executed by processor 1906, is used to determine when and on which tones the wireless terminal 1900 is to receive one or more strip-symbol signals from the base station 1800. The uplink tone allocation hopping routine 1930 uses a tone subset allocation function along with information received from the base station 1800, to determine the tones in which it should transmit on.

It is to be understood that the embodiments described herein may be implemented by hardware, software, firmware, middleware, microcode, or any combination thereof. When the systems and/or methods 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. The 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 as is known in the art.

What has been described above includes examples of one or more embodiments. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the aforementioned embodiments, but one of ordinary skill in the art may recognize that many further combinations and permutations of various embodiments are possible. Accordingly, the described embodiments are 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.

Claims

1. An apparatus comprising a first access router, wherein the first access router comprises:

a processor configured to receive a message, wherein the message is received from a wireless device via at least one of a plurality of wireless communication nodes coupled to the processor, and the message comprises information identifying a second access router to which the wireless device is coupled;
a memory coupled to the processor and configured to store state information describing a state of the wireless device, wherein the first processor is further configured to identify the state information as synchronized at the first access router; and
a transmitter coupled to the memory and configured to transmit the state information to the second access router,
wherein, prior to transmitting the state information, the processor is further configured to mark an address of the first access router in the message as having received the message.

2. The apparatus of claim 1, wherein the transmitter is further configured to transmit to the wireless device a notifier that notifies the wireless device that a state change has occurred.

3. The apparatus of claim 1, wherein the first processor is further configured to receive an identifier that identifies the state of the wireless device.

4. The apparatus of claim 1, wherein the first access router is at least one of a base station, an access point, a packet data serving node (PDSN), and a gateway general packet radio services (GPRS) support node.

5. An apparatus for synchronizing state change information in a wireless communication system, comprising:

means for receiving a message at a first access router, wherein the message is received from a wireless terminal via at least one of a plurality of wireless communication nodes, and the message comprises information identifying at least a second access router to which the wireless device is coupled;
means for storing state information describing a state of the wireless terminal;
means for identifying the state information as synchronized at the first access router; and
means for transmitting that is coupled to the receiving means and configured to transmit the state information to the second access router
means for marking, prior to transmitting the state information, the first access router's address in the message as having received the message.

6. The apparatus of claim 5, further comprising:

means for notifying the wireless terminal of a state change.

7. The apparatus of claim 5, wherein the state information is one of a terminal identification, a quality of service configuration, an authorization parameter, a timer associated with system use, and a condition of a link.

8. A method for synchronizing state information in a wireless communication system, comprising:

receiving a message at a first access router, wherein the message identities at least a second access router, and the message is received from a wireless terminal via at least one of a plurality of communication nodes;
storing state information describing a status of the wireless terminal;
identifying the state information as synchronized at the first access router;
transmitting the state information to the second access router; and
marking, prior to transmitting the state information, the first access router's address in the message as having received the message.

9. The method of claim 8, further comprising receiving an address of the wireless terminal.

10. The method of claim 8, wherein the state information is at least one of a quality of service configuration, an authorization parameter, a terminal identification, a condition of a link, and a timer associated with system use.

11. The method of claim 8, wherein the first access router is one of a base station; an access point, a packet data serving node (PDSN), and a gateway general packet radio services (GPRS) support node.

12. A communication apparatus, comprising:

means for accepting, at a first access router, a message from a second access router, wherein the message is received from a wireless device via at least one of a first plurality of wireless communication nodes, the second access router is configured to accept data from the wireless device via at least one of a second plurality of wireless communication nodes, and the message comprises state information describing a state of the wireless device, a first address identifying the first access router, and at least a second address identifying at least a third access router; and
means for conveying that is coupled to the accepting means and configured to convey the state information to the third access router, wherein the third access router is configured to maintain a data connection with the wireless device based in part on the state information
wherein, prior to conveying the state information, the first access router is further configured to mark an address of the first access router in the message as having received the message.

13. The apparatus of claim 12, further comprising:

means for capturing the state of the wireless device; and
means for applying the state to a subsequent communication with the wireless device.

14. The apparatus of claim 12, wherein the message further comprises an identifier of the wireless device.

15. A processor configured to perform a method, the method comprising:

receiving a message at a first access router, wherein the message identifies at least a second access router, and is received via at least one of a first plurality of wireless communication nodes;
storing state information describing a status of a wireless terminal in a retrievable format;
identifying the state information as synchronized at the first access router;
transmitting the state information to the second access router, wherein, prior to transmitting the state information, the processor is further configured to mark an address of the first access router in the message as having received the message; and
marking, prior to the transmitting the state information, an address of the first access router in the message as having received the message.

16. The method of claim 8, further comprising:

sending an acknowledgment of the message to the wireless terminal.

17. The method of claim 16, further comprising storing the state information in a storage media of the first access router.

18. The method of claim 16, wherein the message is received from a third access router.

19. The method of claim 16, wherein the state information is at least one of a terminal identification, a quality of service configuration, an authorization parameter, and a timer indicating system use.

20. The method of claim 16, wherein the first access router is one of a base station, an access point, a packet data serving node (PDSN), and a gateway general packet radio services (GPRS) support node.

21. The apparatus of claim 12, further comprising:

means for transmitting coupled with the accepting means, wherein the transmitting means is configured to transmit an acknowledgment of the message to the wireless device.

22. The apparatus of claim 21, further comprising:

means for maintaining the state information at the first access router; and
means for applying the state of the wireless device during a subsequent communication with the wireless device.

23. The apparatus of claim 21, further comprising means for removing an address of the first access router from the message prior to transmitting the acknowledgment.

24. The apparatus of claim 21, further comprising:

means for determining if the message includes a second address for a third access router; and
means for communicating at least a subset of the message to the third access router.

25. A non-transitory computer-readable medium having stored thereon computer-executable instructions that when executed on a processor cause the processor to perform a method, the method comprising:

receiving a message at a first access router, wherein the message is received from a wireless device via at least one of a first plurality of wireless communication nodes, and the message comprises information identifying a second access router to which the wireless terminal is coupled and state information describing a state of the wireless terminal;
sending the state information to the second access router;
conveying at least a subset of the message to the wireless device; and
marking, prior to the sending the state information, an address of the first access router in the message as having received the message.

26. The non-transitory computer-readable medium of claim 25, wherein the method further comprises maintaining a record of the state information in a retrievable format at the first access router.

27. The non-transitory computer-readable medium of claim 26, wherein the method further comprises:

receiving a subsequent communication for the wireless device;
retrieving the maintained state information record; and
applying the retrieved state information record to the subsequent communication.

28. The non-transitory computer-readable medium of claim 25, wherein the method further comprises appending a subset of the message with an acknowledgment of a received communication.

29. The apparatus of claim 1, wherein the processor is configured to use the state information stored in the memory to synchronize state information of the access router.

30. The apparatus of claim 1, wherein the state information is based. on at least one of the following: a type of communication, an amount of data traffic, and a condition that affects communication of the wireless device.

31. The apparatus of claim 5, further including means for using the state information stored in the storing means to synchronize state information of the first access router.

32. The apparatus of claim 5, wherein the state information is based on at least one of the following: a type of communication, an amount of data traffic, and a condition that affects communication of the wireless terminal.

33. The method of claim 8, further comprising using the state information to synchronize state information of the second access router.

34. The method of claim 8, wherein the state information is based on at least one of the following: a type of communication, an amount of data traffic, and a condition that affects communication of the wireless terminal.

35. The apparatus of claim 12, further comprising means for using state information of the second access router to synchronize state information of the third access router.

36. The apparatus of claim 12, wherein the state information is based on at least one of the following: a type of communication, an amount of data traffic, and a condition that affects communication of the wireless device.

37. The processor of claim 15, wherein the method further comprises using the state information to synchronize state information of the second access router.

38. The processor of claim 15, wherein the state information is based on at least one of the following: a type of communication, an amount of data traffic, and a condition that affects communication of the wireless terminal.

39. The apparatus of claim 21, further comprising means for using the state information to synchronize state information of the second access router.

40. The apparatus of claim 21, wherein the state information is based on at least one of the following: a type of communication, an amount of data traffic, and a condition that affects communication of the wireless device.

41. The non-transitory computer-readable medium of claim 25, wherein the method further comprises using the state information to synchronize state information of the second access router.

42. The non-transitory computer-readable medium of claim 25, wherein the state information is based on at least one of the following: a type of communication, an amount of data traffic, and a condition that affects communication of the wireless device.

Referenced Cited
U.S. Patent Documents
4833701 May 23, 1989 Comroe et al.
5117502 May 26, 1992 Onoda et al.
5128938 July 7, 1992 Borras
5200952 April 6, 1993 Bernstein et al.
5208837 May 4, 1993 Richey
5229992 July 20, 1993 Jurkevich et al.
5247516 September 21, 1993 Bernstein et al.
5251209 October 5, 1993 Jurkevich et al.
5267261 November 30, 1993 Blakeney, II et al.
5268933 December 7, 1993 Averbuch
5388102 February 7, 1995 Griffith et al.
5490139 February 6, 1996 Baker et al.
5491835 February 13, 1996 Sasuta et al.
5509027 April 16, 1996 Vook et al.
5539925 July 1996 Yli-Kotila et al.
5561841 October 1, 1996 Markus
5572528 November 5, 1996 Shuen
5574720 November 12, 1996 Lee
5594943 January 14, 1997 Balachandran
5694548 December 2, 1997 Baugher et al.
5722044 February 24, 1998 Padovani et al.
5737328 April 7, 1998 Norman et al.
5794137 August 11, 1998 Harte
5854785 December 29, 1998 Willey
5870427 February 9, 1999 Tiedemann, Jr. et al.
5974036 October 26, 1999 Acharya et al.
5978366 November 2, 1999 Massingill et al.
6016316 January 18, 2000 Moura et al.
6018521 January 25, 2000 Timbs et al.
6031863 February 29, 2000 Jusa et al.
6034950 March 7, 2000 Sauer et al.
6049543 April 11, 2000 Sauer et al.
6055428 April 25, 2000 Soliman
6073021 June 6, 2000 Kumar et al.
6084969 July 4, 2000 Wright et al.
6094427 July 25, 2000 Yi
6097952 August 1, 2000 Kawabata
6101394 August 8, 2000 Illidge
6137787 October 24, 2000 Chawla et al.
6144671 November 7, 2000 Perinpanathan et al.
6151502 November 21, 2000 Padovani et al.
6157668 December 5, 2000 Gilhousen et al.
6157833 December 5, 2000 Lawson-Jenkins et al.
6157978 December 5, 2000 Ng et al.
6161008 December 12, 2000 Lee et al.
6163692 December 19, 2000 Chakrabarti et al.
6195552 February 27, 2001 Jeong et al.
6195705 February 27, 2001 Leung
6201971 March 13, 2001 Purnadi et al.
6256300 July 3, 2001 Ahmed et al.
6272129 August 7, 2001 Dynarski et al.
6285665 September 4, 2001 Chuah
6300887 October 9, 2001 Le
6308267 October 23, 2001 Gremmelmaier
6345043 February 5, 2002 Hsu
6347091 February 12, 2002 Wallentin et al.
6360100 March 19, 2002 Grob et al.
6366561 April 2, 2002 Bender
6370380 April 9, 2002 Norefors et al.
6397065 May 28, 2002 Huusko et al.
6400722 June 4, 2002 Chuah et al.
6445922 September 3, 2002 Hiller et al.
6446127 September 3, 2002 Schuster et al.
6449481 September 10, 2002 Kwon et al.
6456604 September 24, 2002 Lee et al.
6466964 October 15, 2002 Leung et al.
6473418 October 29, 2002 Laroia et al.
6493725 December 10, 2002 Iwai et al.
6496704 December 17, 2002 Yuan
6510153 January 21, 2003 Inoue et al.
6516352 February 4, 2003 Booth et al.
6519457 February 11, 2003 Jiang et al.
6529732 March 4, 2003 Vainiomaki et al.
6535493 March 18, 2003 Lee et al.
6553227 April 22, 2003 Ho et al.
6587680 July 1, 2003 Ala-Laurila et al.
6611547 August 26, 2003 Rauhala
6640248 October 28, 2003 Jorgensen
6654363 November 25, 2003 Li et al.
6671512 December 30, 2003 Laakso
6701155 March 2, 2004 Sarkkinen et al.
6708031 March 16, 2004 Purnadi et al.
6714524 March 30, 2004 Kim et al.
6714777 March 30, 2004 Naqvi et al.
6714788 March 30, 2004 Voyer
6728365 April 27, 2004 Li et al.
6754492 June 22, 2004 Stammers et al.
6763007 July 13, 2004 La Porta et al.
6768908 July 27, 2004 Jalloul et al.
6771962 August 3, 2004 Saifullah et al.
6785256 August 31, 2004 O'neill
6807421 October 19, 2004 Ahmavaara
6842621 January 11, 2005 Labun et al.
6842630 January 11, 2005 Periyalwar
6862446 March 1, 2005 Oneill et al.
6901063 May 31, 2005 Vayanos et al.
6917605 July 12, 2005 Kakemizu et al.
6937566 August 30, 2005 Forslow
6947401 September 20, 2005 El-Malki et al.
6950650 September 27, 2005 Roeder
6954442 October 11, 2005 Tsirtsis et al.
6961579 November 1, 2005 Inukai et al.
6965585 November 15, 2005 Grilli et al.
6970445 November 29, 2005 Oneill et al.
6990088 January 24, 2006 Madour
6990337 January 24, 2006 Oneill et al.
6990339 January 24, 2006 Turanyi et al.
6990343 January 24, 2006 Lefkowitz
6992994 January 31, 2006 Das et al.
6993332 January 31, 2006 Pedersen et al.
7003311 February 21, 2006 Ebata et al.
7006826 February 28, 2006 Cao et al.
7016317 March 21, 2006 Pathak et al.
7027400 April 11, 2006 O'Neill
7027449 April 11, 2006 Garcia-Luna-Aceves et al.
7047009 May 16, 2006 Laroia et al.
7068640 June 27, 2006 Kakemizu et al.
7068654 June 27, 2006 Joseph et al.
7069040 June 27, 2006 Iwanaga et al.
7089008 August 8, 2006 Back et al.
7116654 October 3, 2006 Kim
7123599 October 17, 2006 Yano et al.
7130291 October 31, 2006 Kim et al.
7161913 January 9, 2007 Jung
7177641 February 13, 2007 Miernik et al.
7184771 February 27, 2007 Mouly et al.
7197318 March 27, 2007 Schwarz et al.
7233583 June 19, 2007 Asthana et al.
7233794 June 19, 2007 Grob et al.
7263357 August 28, 2007 Lee et al.
7266100 September 4, 2007 Le et al.
7272122 September 18, 2007 Trossen et al.
7283495 October 16, 2007 Lee et al.
7283511 October 16, 2007 Hans et al.
7290063 October 30, 2007 Kalliokulju et al.
7315554 January 1, 2008 Baum et al.
7330542 February 12, 2008 Kauhanen et al.
7369855 May 6, 2008 Oneill et al.
7369859 May 6, 2008 Gallagher
7376101 May 20, 2008 Shim et al.
7389110 June 17, 2008 Lee
7391741 June 24, 2008 Kang
7403789 July 22, 2008 Takano et al.
7408917 August 5, 2008 Kyung et al.
7408950 August 5, 2008 Okuyama
7409428 August 5, 2008 Brabec et al.
7418264 August 26, 2008 Kim
7420957 September 2, 2008 Kim et al.
7460504 December 2, 2008 Tsirtsis et al.
7492762 February 17, 2009 Chowdhury
7499401 March 3, 2009 Buddhikot et al.
7505765 March 17, 2009 Frangione et al.
7515561 April 7, 2009 Koodli et al.
7529239 May 5, 2009 Seppanen
7567639 July 28, 2009 Huh et al.
7583592 September 1, 2009 Park et al.
7593364 September 22, 2009 Asthana
7623493 November 24, 2009 Baba et al.
7653415 January 26, 2010 Van Rooyen
7668541 February 23, 2010 Oneill et al.
7672254 March 2, 2010 Kim et al.
7702309 April 20, 2010 Faccin et al.
7706739 April 27, 2010 Kjellberg
7729350 June 1, 2010 Singh et al.
7742781 June 22, 2010 Chen et al.
7773947 August 10, 2010 Gerlach
7962142 June 14, 2011 Oneill et al.
8112102 February 7, 2012 Fischer
8144664 March 27, 2012 Pani et al.
8165587 April 24, 2012 Dahlen et al.
8184615 May 22, 2012 Tsirtsis et al.
8229120 July 24, 2012 Iwamura et al.
8583044 November 12, 2013 Dua
8830818 September 9, 2014 Damnjanovic
20010019545 September 6, 2001 Okubo et al.
20020061009 May 23, 2002 Sorensen
20020064144 May 30, 2002 Einola et al.
20020065785 May 30, 2002 Tsuda
20020067706 June 6, 2002 Bautz et al.
20020075859 June 20, 2002 Mizell et al.
20020082038 June 27, 2002 Mochizuki
20020085518 July 4, 2002 Lim
20020107908 August 8, 2002 Dharanikota
20020114308 August 22, 2002 Takano et al.
20020126701 September 12, 2002 Requena
20020136226 September 26, 2002 Christoffel et al.
20020161927 October 31, 2002 Inoue et al.
20020168982 November 14, 2002 Sorokine et al.
20020199012 December 26, 2002 Cable et al.
20030009580 January 9, 2003 Chen et al.
20030009582 January 9, 2003 Qiao et al.
20030018774 January 23, 2003 Flinck et al.
20030026220 February 6, 2003 Uhlik et al.
20030027572 February 6, 2003 Karlsson et al.
20030032430 February 13, 2003 Lee
20030036392 February 20, 2003 Yukie
20030078047 April 24, 2003 Lee et al.
20030092444 May 15, 2003 Sengodan et al.
20030101307 May 29, 2003 Gemelli et al.
20030103496 June 5, 2003 Lakshmi Narayanan et al.
20030104814 June 5, 2003 Gwon et al.
20030112766 June 19, 2003 Riedel et al.
20030119516 June 26, 2003 Tomishima et al.
20030204599 October 30, 2003 Trossen et al.
20030212764 November 13, 2003 Trossen et al.
20030214922 November 20, 2003 Shahrier
20030216140 November 20, 2003 Chambert
20030217096 November 20, 2003 McKelvie et al.
20030227871 December 11, 2003 Hsu et al.
20030236103 December 25, 2003 Tamaki et al.
20040002362 January 1, 2004 Chuah et al.
20040004736 January 8, 2004 Ogura et al.
20040004967 January 8, 2004 Nakatsugawa et al.
20040008632 January 15, 2004 Hsu et al.
20040015607 January 22, 2004 Bender et al.
20040016551 January 29, 2004 Bennett
20040017792 January 29, 2004 Khaleghi et al.
20040017798 January 29, 2004 Hurtta et al.
20040018841 January 29, 2004 Trossen
20040076186 April 22, 2004 Chen et al.
20040087319 May 6, 2004 Bos et al.
20040090913 May 13, 2004 Scudder et al.
20040090937 May 13, 2004 Chaskar et al.
20040104544 June 3, 2004 Fan et al.
20040116153 June 17, 2004 Kaminski et al.
20040120317 June 24, 2004 Forssell
20040139201 July 15, 2004 Chaudhary et al.
20040151148 August 5, 2004 Yahagi
20040151193 August 5, 2004 Rune et al.
20040165551 August 26, 2004 Krishnamurthi et al.
20040166898 August 26, 2004 Tajima
20040176094 September 9, 2004 Kim et al.
20040179544 September 16, 2004 Wilson et al.
20040192307 September 30, 2004 Watanabe et al.
20040192390 September 30, 2004 Tajima
20040218607 November 4, 2004 Hurtta et al.
20040228301 November 18, 2004 Rudolf et al.
20040228304 November 18, 2004 Riedel et al.
20040242222 December 2, 2004 An et al.
20040242228 December 2, 2004 Lee et al.
20040253954 December 16, 2004 Lee et al.
20050020262 January 27, 2005 Kim
20050020265 January 27, 2005 Funabiki et al.
20050053043 March 10, 2005 Rudolf et al.
20050058151 March 17, 2005 Yeh
20050059417 March 17, 2005 Zhang et al.
20050063338 March 24, 2005 Tsui
20050063389 March 24, 2005 Elliott et al.
20050079823 April 14, 2005 Kurek et al.
20050089043 April 28, 2005 Seckin et al.
20050090260 April 28, 2005 Semper et al.
20050128949 June 16, 2005 Ku et al.
20050128990 June 16, 2005 Eom et al.
20050141468 June 30, 2005 Kim et al.
20050143072 June 30, 2005 Yoon et al.
20050201324 September 15, 2005 Zheng
20050265303 December 1, 2005 Edwards et al.
20050268153 December 1, 2005 Armstrong et al.
20060002344 January 5, 2006 Ono et al.
20060003768 January 5, 2006 Chiou
20060007936 January 12, 2006 Shrum, Jr. et al.
20060029028 February 9, 2006 Kim et al.
20060056348 March 16, 2006 Marinier et al.
20060067526 March 30, 2006 Faccin et al.
20060069809 March 30, 2006 Serlet
20060089141 April 27, 2006 Ho et al.
20060099948 May 11, 2006 Hoghooghi et al.
20060099950 May 11, 2006 Klein et al.
20060104232 May 18, 2006 Gidwani
20060121883 June 8, 2006 Faccin
20060149845 July 6, 2006 Malin et al.
20060183479 August 17, 2006 Liu et al.
20060217119 September 28, 2006 Bosch et al.
20060230019 October 12, 2006 Hill et al.
20060268924 November 30, 2006 Marinier et al.
20060285520 December 21, 2006 Venkitaraman
20070016637 January 18, 2007 Brawn et al.
20070019584 January 25, 2007 Qi et al.
20070064948 March 22, 2007 Tsirtsis et al.
20070066918 March 22, 2007 Dewald et al.
20070076653 April 5, 2007 Park et al.
20070076658 April 5, 2007 Park et al.
20070083669 April 12, 2007 Tsirtsis et al.
20070086389 April 19, 2007 Park et al.
20070091810 April 26, 2007 Kim et al.
20070099618 May 3, 2007 Kim
20070105555 May 10, 2007 Miernik et al.
20070105584 May 10, 2007 Grob et al.
20070121542 May 31, 2007 Lohr et al.
20070147283 June 28, 2007 Laroia et al.
20070147286 June 28, 2007 Laroia et al.
20070147377 June 28, 2007 Laroia et al.
20070171875 July 26, 2007 Suda
20070189282 August 16, 2007 Lohr et al.
20070191054 August 16, 2007 Das et al.
20070191065 August 16, 2007 Lee et al.
20070195788 August 23, 2007 Vasamsetti et al.
20080019293 January 24, 2008 Chang et al.
20080031198 February 7, 2008 Hwang et al.
20080051091 February 28, 2008 Phan et al.
20080074994 March 27, 2008 Jen
20080076424 March 27, 2008 Barber et al.
20080089287 April 17, 2008 Sagfors et al.
20080146231 June 19, 2008 Huang et al.
20080160999 July 3, 2008 Eklund
20080240039 October 2, 2008 Parekh et al.
20080242292 October 2, 2008 Koskela et al.
20080253332 October 16, 2008 Ore et al.
20080259855 October 23, 2008 Yoon et al.
20080261600 October 23, 2008 Somasundaram et al.
20090029706 January 29, 2009 Prakash et al.
20090046573 February 19, 2009 Damnjanovic
20090175448 July 9, 2009 Watanabe et al.
20090181673 July 16, 2009 Barrett
20090190556 July 30, 2009 Venkitaraman
20090191878 July 30, 2009 Hedqvist et al.
20090274086 November 5, 2009 Petrovic et al.
20090285218 November 19, 2009 Adamczyk et al.
20100080126 April 1, 2010 Higashida
20110019614 January 27, 2011 Oneill et al.
20110039546 February 17, 2011 Narasimha et al.
20110039552 February 17, 2011 Narasimha et al.
20110051660 March 3, 2011 Arora et al.
20110103347 May 5, 2011 Dimou
20110250892 October 13, 2011 Gupta et al.
20110268085 November 3, 2011 Barany et al.
20120087312 April 12, 2012 Laroia et al.
20120327908 December 27, 2012 Gupta et al.
20130208709 August 15, 2013 Corson et al.
20130294324 November 7, 2013 Corson et al.
20150030003 January 29, 2015 O'Neill et al.
Foreign Patent Documents
2002353616 May 2003 AU
36022006 June 2007 CL
36052006 June 2007 CL
36032006 July 2007 CL
36042006 July 2007 CL
1043052 June 1990 CN
1133669 October 1996 CN
1344477 April 2002 CN
1345518 April 2002 CN
1416284 May 2003 CN
1481119 March 2004 CN
1514607 July 2004 CN
1650178 August 2005 CN
1859529 November 2006 CN
0740440 October 1996 EP
0813346 December 1997 EP
0974895 January 2000 EP
1088463 April 2001 EP
1128704 August 2001 EP
1345370 September 2003 EP
0926608 March 2004 EP
1458209 September 2004 EP
1473872 November 2004 EP
1489808 December 2004 EP
1507421 February 2005 EP
1565024 August 2005 EP
1720267 November 2006 EP
1764942 March 2007 EP
2322046 August 1998 GB
2395629 May 2004 GB
2084807 March 1990 JP
08116329 May 1996 JP
11308273 November 1999 JP
H11341541 December 1999 JP
2000125343 April 2000 JP
2001217830 August 2001 JP
2001237878 August 2001 JP
2001245355 September 2001 JP
2002111732 April 2002 JP
2002513527 May 2002 JP
2002165249 June 2002 JP
2002281069 September 2002 JP
2002281539 September 2002 JP
2002534923 October 2002 JP
2002537739 November 2002 JP
2003060685 February 2003 JP
2003111134 April 2003 JP
2003348007 May 2003 JP
2003304571 October 2003 JP
2003338833 November 2003 JP
2004007578 January 2004 JP
2004104544 April 2004 JP
2004147228 May 2004 JP
2004187256 July 2004 JP
2004201289 July 2004 JP
2004297130 October 2004 JP
2004328637 November 2004 JP
2005531173 October 2005 JP
2007513569 May 2007 JP
2007521759 August 2007 JP
2007527177 September 2007 JP
2008053889 March 2008 JP
4827994 November 2011 JP
20040004918 January 2004 KR
20040105069 December 2004 KR
20050023194 March 2005 KR
20050065123 June 2005 KR
20050066287 June 2005 KR
20070031810 March 2007 KR
2117396 August 1998 RU
2003120063 February 2005 RU
2256299 July 2005 RU
2005115564 November 2005 RU
2267864 January 2006 RU
2005129079 February 2006 RU
2292669 January 2007 RU
2294596 February 2007 RU
200527930 August 2005 TW
200708018 February 2007 TW
9501706 January 1995 WO
WO9512297 May 1995 WO
9804094 January 1998 WO
WO9833288 July 1998 WO
WO9847302 October 1998 WO
WO9856140 December 1998 WO
WO9905828 February 1999 WO
WO 9927718 June 1999 WO
WO9966748 December 1999 WO
WO0018173 March 2000 WO
WO0041401 July 2000 WO
WO0041426 July 2000 WO
WO0128160 April 2001 WO
WO0158196 August 2001 WO
WO0163947 August 2001 WO
WO0178440 October 2001 WO
0219746 March 2002 WO
WO0243409 May 2002 WO
0247407 June 2002 WO
WO 02/056551 July 2002 WO
WO 03/007484 January 2003 WO
WO03017582 February 2003 WO
WO03092316 November 2003 WO
WO03098816 November 2003 WO
WO03105516 December 2003 WO
2004039022 May 2004 WO
WO2004068739 August 2004 WO
WO2004070989 August 2004 WO
2004075468 September 2004 WO
WO2004079949 September 2004 WO
2004105272 December 2004 WO
WO2004107638 December 2004 WO
WO-2004114695 December 2004 WO
WO2005029790 March 2005 WO
2005048629 May 2005 WO
WO2005062633 July 2005 WO
WO-2005078966 August 2005 WO
WO2005084146 September 2005 WO
WO2005120183 December 2005 WO
WO2006002676 January 2006 WO
2006083131 August 2006 WO
WO2008113373 September 2008 WO
WO-2008131401 October 2008 WO
Other references
  • International Search Report dated Feb. 22, 2007 for PCT/US2006/036580.
  • 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.
  • 3GPP, “3rd Generation Partnership Project, Technical Specification Group Radio Access Network, E-UTRAN Mobility Evalvation 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, 20090203, Feb. 3, 2009; XP050318707.
  • 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 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.
  • 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 Cediz; France, No. V9.1.0, Jan. 7, 2010, pp. 1-221, XP050401822, [retrieved on Jan. 7, 2010].
  • Baker, F., IETF, “RSVP Management Information Base Using SMIv2,” 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).
  • 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.
  • 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; 20100222, Mar. 4, 2010, XP050422194, [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.
  • Johnson, D., et al., IETF Mobile IP Working Group, “Mobility Support in IPv6,” ; February 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-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, 20060823, 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.
  • Perkings, 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” 20020601; 20020600, Jun. 1, 2002, pp. 1-269, XP015009039.
  • Schulzrinne et al., “Application-Layer Mobility Using SIP”, 0-7803-7133 IEEE, pp. 29-36, Jan. 2000.
  • 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, USvol.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.
  • Written Opinion—PCT/US2006/036580, International Search Authority, European Patent Office, Jun. 20, 2006.
  • 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.
  • 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; 20091109, Nov. 9, 2009, XP050392455, [retrieved on Nov. 19, 2009].
  • Droms, R.: “Dynamic Host Configuration Protocol,” IETF Standard, RFC 2131, Internet Engineering Task Force, IETF, CH, pp. 1-45, (Mar. 1997) XP015007915.
  • “Network Layer Protocol,” Jul. 13, 2002, chap. 6, pp. 1-35, URL: http://www2.yamanashi-ken.ac.jp/˜itoyo/lecture/network/network06/index06.htm.
  • “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/˜nagai/lecture.dce.html.
  • International Preliminary Report on Patentability —PCT/US2011/031841, The International Bureau of WIPO —Geneva, Switzerland —Oct. 9, 2012.
  • Taiwan Search Report —TW095134675 —TIPO —Oct. 3, 2012.
  • 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, p. 9.
  • Basic Knowledge of Communications Term of Switching HUB, Nov. 9. 2006, 2 pages, 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.
  • Evolved Universal Terrestrial Radio Access (E-UTRA) and Evolved Universal Terrestrial Radio Access Network (E-UTRAN); Overall description; Stage 2 (Release 9), 3GPP TS 36.300 V9.2.0, Dec. 2009, pp. 56-61, Retrieved from the internet: URL: http://www.3gpp.org/ftp/Specs/archive/36—series/36.300/36300-920.zip.
  • 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/VVG3—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.
Patent History
Patent number: 9066344
Type: Grant
Filed: Jul 14, 2006
Date of Patent: Jun 23, 2015
Patent Publication Number: 20070078999
Assignee: QUALCOMM Incorporated (San Diego, CA)
Inventors: M. Scott Corson (Gillette, NJ), George Tsirtsis (New York, NY), Vincent D. Park (Budd Lake, NJ)
Primary Examiner: Mahendra Patel
Application Number: 11/486,650
Classifications
Current U.S. Class: Synchronization Information Is Distributed Within A Frame (370/512)
International Classification: H04B 15/00 (20060101); H04W 72/04 (20090101); H04W 8/12 (20090101); H04W 40/02 (20090101); H04W 60/04 (20090101);