I. Field
The invention relates generally to communications systems, and more particularly to providing refined quality of service with respect to one or more traffic flows associated with a terminal.
II. Background
Communication networks, such as wireless communication networks, broadband networks, and any other suitable networks are utilized in connection with transferring data, wherein data can include word processing files, streaming video, multimedia files, voice data, and/or the like. Providing appropriate quality of service (QoS) to certain subscribers can be important for retaining customer satisfaction as well as optimizing resources associated with one or more network links. In wireless networks, however, providing appropriate QoS can be difficult, as QoS support must be considered in connection with units that are transitioning between different access nodes (e.g., base stations, access routers, or access points). Thus, providing appropriate QoS treatment to a wireless terminal is a nontrivial case.
In a typical wireless communications network, a set of geographically dispersed access nodes (e.g., base stations) provide wireless access to a communications infrastructure for a plurality of end nodes (e.g., wireless terminals). Cellular network systems have traditionally been primarily based on circuit-switch technology, but a variety of emerging cellular network systems are more heavily based on packet-switched technology (e.g., the Internet Protocol (IP) suite). In such networks, flexible QoS differentiation mechanisms are needed to effectively support a variety of different applications (e.g., telephony, text messaging, streaming audio/video, web browsing, file transfer, . . . ). QoS mechanisms designed primarily for use in fixed, hard-wired, packet-switched network infrastructures are not well suited for use in a cellular network. In particular, aspects such as mobility of subscriber access devices, the potentially constrained nature of a wireless access link, and differences in network architecture impede or preclude use of existing resource control protocols in wireless packet-switched networks.
In connection with requesting QoS support with respect to a particular subscriber, conventional networks utilize a centralized entity or a subscriber with respect to such requests. For instance, if a subscriber needs certain QoS support, such subscriber requests such support from a provider of QoS support. These conventional methods for requesting and receiving QoS support are inflexible and inefficient.
The following presents a simplified summary in order to provide a basic understanding of some aspects of the claimed subject matter. This summary is not an extensive overview, and is not intended to identify key/critical elements or to delineate the scope of the claimed subject matter. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.
The claimed subject matter relates to routing of packets in a wireless communications environment. For example, a data packet can be received, wherein such data packet should be provided to a particular point of attachment from amongst a plurality of points of attachment with respect to a wireless terminal. A creator of such packet may not be aware of an identity or address of the particular point of attachment, however, and can accordingly direct the data packet to a disparate entity or address, such as a one-hop multicast address, a home agent, and/or the like. The data packet can then be encapsulated by, for instance, a wireless terminal or a home agent, within an LLC frame, and within the frame an identity of the particular point of attachment can be included. The LLC can then be routed to the primary point of attachment.
For example, a host device may only be aware of a single interface (or link) to a network, even though a terminal associated therewith may be aware of multiple links (possible to different access nodes). In such a case, packets sent by the host may be directed to a particular interface (from the host perspective) but benefit from being directed to a particular access node from amongst a plurality of access nodes. In a specific example, packets intended for a first hop router from a host perspective (e.g., packets sent to a one-hop IP multicast address) can be directed to the particular link or the particular access node (base station).
In accordance with an aspect, a method for routing a data packet in a cellular communications environment can comprise receiving a data packet and determining that the data packet should be provided to a particular point of attachment from amongst a plurality of available points of attachment with respect to a wireless terminal in the cellular communications environment. For example, the determination can be made based at least in part upon content of the data packet. The method can additionally comprise encapsulating the data packet in an LLC frame and indicating that the LLC frame should be directed towards a particular point of attachment. Additionally, a wireless communications device described herein can comprise means for receiving a data packet, wherein the data packet is associated with a cellular network. The wireless communications device can also include means for analyzing content of the data packet in connection with ascertaining that the data packet should be provided to a particular point of attachment from amongst a plurality of points of attachment with respect to a wireless terminal and means for encapsulating the data packet in an LLC frame.
In accordance with another aspect, a processor can be configured to execute instructions for receiving a data packet in a cellular communications environment and determining that the data packet should be provided to a certain point of attachment from amongst a plurality of available points of attachment with respect to a wireless terminal, wherein the determination is made based at least in part upon content of the received data packet. The processor can be further configured to execute instructions for encapsulating the data packet in an LLC frame and indicating that the LLC frame should be directed towards the certain point of attachment. Moreover, a machine-readable medium is disclosed below, where in the machine-readable medium can have machine-executable instructions stored thereon for receiving a data packet in a cellular network, encapsulating the data packet in an LLC frame, and analyzing content of the data packet. The machine-executable instructions can further include identifying a primary point of attachment from amongst a plurality of available points of attachment with respect to a wireless terminal, wherein the identification is based at least in part upon the analysis.
In accordance with yet another aspect, a wireless communications apparatus can comprise a memory that retains instructions for encapsulating a received data packet in an LLC frame, wherein the received data packet is associated with a cellular communications network. The memory can retain further instructions for identifying within the packet a particular point of attachment to which the data packet is to be forwarded, the particular point of attachment is identified from amongst a plurality of points of attachment associated with a wireless terminal, wherein the identification is based at least in part upon content of the data packet. The wireless communications apparatus can also include a processor that executes the instructions.
In accordance with still another aspect, a method for routing packets in a wireless communications environment can comprise receiving a data packet that is addressed to a node other than an access node at the access node, determining that the data packet is intended for the access node by analyzing the data packet, and executing instructions at the access node based at least in part upon contents of the data packet. Additionally, a communications device is described herein, wherein the communications device can comprise means for receiving a data packet, means for determining that the data packet is addressed to a network entity that is not a receiving entity, means for determining that the data packet is intended for the receiving entity, and means for executing instructions at the receiving entity based at least in part upon contents of the received data packet.
In accordance with yet another aspect, a processor can be configured to execute instructions for determining that a received data packet is addressed to a first network entity, determining that the received data packet is intended for a second network entity, and executing instructions based at least in part upon contents of the received data packet at the second network entity. Moreover, a machine-readable medium can have machine-executable instructions stored thereon for receiving a data packet that is addressed to a wireless terminal at an access node, determining that the data packet is intended for the access node by analyzing the data packet, and executing instructions at the access node based at least in part upon contents of the data packet.
In still yet another aspect, a communications apparatus can comprise a memory that retains instructions for intercepting a data packet intended for a different wireless communications network entity. The communications apparatus can also include a processor that executes the instructions.
To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings. These aspects are indicative, however, of but a few of the various ways in which the principles of the claimed subject matter may be employed and the claimed subject matter is intended to include all such aspects and their equivalents. Other advantages and novel features may become apparent from the following detailed description when considered in conjunction with the drawings.
The claimed subject matter is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the claimed subject matter. It may be evident, however, that such subject matter 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 the claimed subject matter.
Furthermore, various aspects are described herein in connection with a terminal. A terminal can also be called a system, a user device, a subscriber unit, subscriber station, mobile station, mobile device, remote station, remote terminal, access terminal, user terminal, user agent, 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 PDA, a handheld device having wireless connection capability, a module within a terminal, or other processing device connected to a wireless modem.
Moreover, aspects of the claimed subject matter may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer or computing components to implement various aspects of the claimed subject matter. 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 . . . ). Additionally it should be appreciated that a carrier wave can be employed to carry computer-readable electronic data such as those used in transmitting and receiving voice mail or in accessing a network such as a cellular network. Of course, those skilled in the art will recognize many modifications may be made to this configuration without departing from the scope or spirit of what is described herein.
Referring now to
In an example, subscriber 104 may be an individual that is associated with a subscription for certain services of a network. In a different embodiment, subscriber 104 can be a mobile handset, a telephone that is coupled to a router, etc. Provider 102, for instance, can be a base station, a router, a modem, or any other network device that is employed to provide data (messages, packets, etc.) to subscriber 104. In an example, provider 102 and subscriber 104 can communicate by way of FLASH OFDM. It is understood, however, that any suitable data transmission protocols are contemplated by the inventors and are intended to fall under the scope of the hereto-appended claims.
System 100 can also include a first network entity 106, which, for instance, can be an application server that can provide certain applications, or application service(s), to subscriber 104 by way of provider 102. For example, first network entity 106 can be a games server that is utilized to provide certain gaming data to subscriber 104 by way of provider 102. System 100 can also include a second network entity 108. For example, second network entity 108 can be a streaming media server that provides access to audio and/or video content to subscriber 104. It is understood, however, that first and second entities 106 and 108 can be any suitable entities that reside within a network.
Pursuant to an example, first network entity 106 can send a request for QoS resources to provider 102, wherein such request relates to QoS with respect to subscriber 104. In other words, first network entity 106 can make a QoS resource request on behalf of subscriber 104. Provider 102 can thereafter determine, for example, whether subscriber 104 is authorized with respect to QoS parameters indicated within the request. Provider 102 can further determine, for example, whether first network entity 106 is authorized to make the particular QoS resource request on behalf of the subscriber 104. If authorization checks are passed, then provider 102 can be employed to provide appropriate QoS to traffic flows that are delivered to subscriber 104 (wherein traffic flow can be defined as related packets of data as indicated within packet headers).
Second network entity 108 can additionally send a request for particular QoS resources to provider 102 on behalf of subscriber 102. For instance, second network entity 108 may be employed to provide data to subscriber 104 by way of provider 102, wherein such data should be associated with particular QoS parameters (e.g., latency, minimum data rate, maximum data rate, . . . ). Thus, provider 102 can receive requests from separate network entities on behalf of a subscriber. For instance, such requests can be received and serviced at substantially similar times (such as when a user is undertaking a voice call and downloading data from the Internet). Additionally, while not shown, subscriber 104 can be associated with a host that requests QoS support and undertakes QoS management on behalf of subscriber 104 by delivering a request to provider 102. Such request can be provided and/or services at a substantially similar time as other requests (e.g., from first and/or second network entity 106 and 108).
The above-described flexibility in requesting QoS support can be enabled through one or more protocols. For instance, a substantially similar protocol can be utilized by first and second network entities 106 and 108 as is used by a host associated with subscriber 104. The protocol can include message formats that can be utilized by internal network entities as well as hosts on a periphery of a network (and understood by provider 102). One example protocol that can be employed is a MARC protocol, which has been designed to accommodate subscriber mobility, such as when subscriber 104 alters points of attachment within a network. The MARC protocol defines various messaging formats that facilitate subscriber mobility, for example, in an packet-switched mobile environment. Each message/request can include a common message header followed by a variable number of typed objects, where presence, order, and number of typed objects is based at least in part upon message type (as identified in the message header). Each typed object can include a common object header followed by a variable number of object specific fields. Various message types can be utilized, including an add request message, which is an example of what is sent to provider 102 with respect to requesting particular QoS treatment for a traffic flow to and/or from subscriber 104. Additionally, a modify request message can relate to modifying existing QoS treatment with respect to one or more traffic flows associated with subscriber, and a delete request message can relate to deleting existing QoS treatments. QoS treatments encompass particular services as well as filter rules to identify data packets subject to certain services. Below is an example of an add request in accordance with a protocol that may be utilized in connection with system 100.
In this example, an “INTEGRITY” object is an object that facilitates ensuring integrity of the add request. An “INTEGRITY” object can include a timestamp, an index that identifies a security attribute for validation of message integrity, and an integrity check value, which can enable validation of message integrity. A “REQ_ID” object is a requester identifier, which can include an IP address of a requester. A “PROV_ID” object is a provider identifier, which can include an IP address of a provider. A “SUB_ID” object is a subscriber identifier object, which can include an IP address of a subscriber. An SS_ID object is a subscriber service identifier object, which can identify one of several subscriber services. The “Addition(s)” fields relate to particular services or filter rules that are requested by the requester. For instance, the above add message can describe that filter rules and service class instances are desirably added, and such filter rules and service class instances can be specifically provided in the add message through use of an “SCI Object” (service class object) and “FR Object” (filter rule object). An “SCI Object” can include a service class identifier and an amount of time that the service class should be maintained by the provider in the absence of being refreshed. An “FR Object” can include an identifier of a particular filter rule, a priority to be associated with the rule, and various match criteria.
Turning now to
Host 206, like network entity 202, can create a request for QoS resources and/or QoS management and provide such request to provider 102. Therefore, different logical entities can create a request on behalf of subscriber 204 with respect to QoS. Additionally, such entities (e.g., network entity 202 and host 206) can reside on different portions with respect to a network. In other words, network entity 202 can reside within a network infrastructure while host 206 can reside on a “subscriber side” of an access link to/from a network. As described above, host 206 can communicate with provider 102 by way of a wireless link, for instance. Additionally, a protocol utilized by host 206 to provide the QoS request to provider 102 can be substantially similar to a protocol utilized to relay a request by network entity 202. In different situations it may be desirable to allow different entities to request QoS support for subscriber 204, and system 200 provides such flexibility, as a request can for QoS support/management on behalf of subscriber 204 can initiate from one or more network entities and/or a host.
Now referring to
System 300 additionally includes multiple application servers 308-312 that can, e.g., if associated with a subscription of the subscriber 304, be utilized in connection with providing certain services to subscriber 304. In a detailed example, application server 308 may be a gaming server, thereby providing subscriber 304 with data relating to one or more video games. Application server 310 may be associated with voice calls, and application server 312 can be a web server, for instance. To optimize receipt and/or delivery of data by way of application servers 308-312 while not wasting network resources, QoS parameters relating to data provided between base station 302 and subscriber 304 should be tightly controlled. However, different applications (provided by application servers 308-312) should be associated with different QoS parameters. For example, voice data does not need a substantial amount of bandwidth, but latency should be low. In another example, gaming data may utilize three traffic flows operating in parallel to enable appropriate play of the game. In still another example, downloading a file may not require low latency but may need substantial bandwidth to receive a file in a timely manner. Thus, each of the application servers 308-312 may provide requests relating to particular QoS parameters that should exist between base station 302 and subscriber 304. Base station 302 can thereafter be employed to provide requested QoS treatment to traffic flows that are interchanged between base station 302 and subscriber 304 (if subscriber 304 is authorized for such services and/or QoS).
Moreover, host 306 can detect that subscriber 304 is not receiving appropriate QoS treatment with respect to one or more data flows given current state of subscriber 304. Additionally or alternatively, subscriber 304 can detect incorrect treatment of data flows and provide host 306 with an indication that QoS treatment with respect to one or more data flows should be updated. Host 306 can then create such request and then be utilized in connection with relaying the request to base station 302. In another example, host 306 can generate QoS requests based upon requirements of applications running on host 306. In such a case, an application running on host 306 can send requests by way of an application programming interface (API).
Base station 302 can thereafter provide appropriate QoS treatment to subscriber 304 according to contents of the request. Thus, as can be discerned, multiple network entities and/or a host can request QoS support and/or management on behalf of a subscriber, and base station 302 can receive and service such requests. For instance, base station 302 can service requests simultaneously (e.g., provide appropriate QoS treatment to multiple traffic flows based upon multiple requests from several entities).
Referring to
Turning specifically to
With reference to
Turning now to
System 600 can additionally include logical module(s) for simultaneously controlling QoS with respect to a subscriber as a function of the first and second request 606. The terms “providing QoS”, “support QoS”, “managing QoS”, and the like are intended to encompass traffic conditioning, including metering, marking, policing, queue management, scheduling, ARQ, etc. Module(s) 606 can include a processor, memory, a scheduling application that aids in scheduling data over a link, and the like. Logical module(s) 606 can also provide QoS support to the subscriber based upon multiple other requests. Moreover, module(s) 606 can be configured to provide QoS support with respect to multiple requests made by multiple requesters simultaneously.
Now turning to
Referring now to
System 800 can additionally include a home agent (HA) 808, which can be employed to track where in a network terminal 804 resides, e.g., to support forwarding of packets to the terminal 804 and/or the host 806 by way of the current point of attachment. For example, if terminal 804 alters a point of attachment, home agent 808 (through various messaging) can be made aware of such change in point of attachment. Home agent 808 can be communicatively coupled to access node 802, either by direct connection or through one or more other network entities. System 800 can also include a network entity 810 that may desirably provide data or services to terminal 804 and/or host 806. For example, network entity 810 can be an application server, such as a gaming server, that desirably provides particular traffic flows to terminal 804 by way of access node 802.
The system 800 can employ various mechanisms in connection with providing data to access node 802, wherein such access node 802 is the point of attachment at the IP layer with respect to terminal 804. For instance, if an address (e.g., IP address) of access node 802 is known (e.g., by network entity 810 ), then data can be provided directly to access node 802 by way of such address. In other words, it can be known that access node 802 is a point of attachment for terminal 804 (e.g., one of several points of attachment for terminal 804 ). If address of access node 802 is known, then data packets intended for terminal 804 or provided by terminal 804 can be directed to an address associated with access node 802. Additionally, packets, e.g., control signaling and/or messages, pertaining to terminal 804 and/or host 806 can be directed to an address associated with access node 802.
Often, however, as terminal 804 is mobile within a network, point of attachments can change. Thus, network entities may not be aware of which access node is a current point of attachment for terminal 804, and thus may be unaware a specific address. Additionally, host 806 may wish to relay data and/or signaling to a particular entity but may not have knowledge of which access node is the current point of attachment (or a current primary point of attachment). In one example, access node 802 can intercept messages that are addressed to different network entities (but in actuality are intended for access node 802 ). In an example, network entity 810 may wish to provide a QoS request to a point of attachment associated with terminal 804, but may not be aware that access node 802 is such point of attachment. Accordingly, network entity 810 can, for instance, access home agent 808 to determine which access node is currently associated with terminal 804.
Alternatively, network entity 810 can direct, e.g., address, a message to terminal 804 (or host 806 ) and provide an indication in the message, e.g., setting one or more header fields to a predetermined value such as a particular port number, that while the message is directed to terminal 804 (or host 806 ) it is actually intended for an access node that is the point of attachment for terminal 804. In some embodiments the indication includes use of a router alert option in the IP header. The indication can be a message that may be routed and/or forwarded toward terminal 804 by way of access node 802 using a variety of techniques. The path taken by the message to access node 802 can include one or more intermediate nodes, e.g., home agent 808. When access node 802 receives the message, access node 802 can analyze the message and determine, e.g., based on inspection of one or more header fields, that the message (e.g., packet), while addressed to terminal 804 (or host 806 ), is in actuality intended for access node 802. Access node 802 can then perform operations (or determine whether to perform operations) based at least in part upon contents of the received message. Additionally, access node 802 can create a message informing network entity 810 that access node 802 is, for instance, a primary point of attachment with respect to terminal 804, where such message can inform network entity 810 of an address associated with access node 802 to enable subsequent message exchanges without the need to intercept messages directed to the terminal 806.
In another example, host 806 (or another entity on a subscriber-side of a network link) can desirably provide a message to access node 802, but may not be aware of an address of such access node. In another example, host 806 may be associated with wireless links between several access nodes, and may desirably provide a message to one of such access nodes. Accordingly, host 806 can address a message to network entity 810, indicating within such message that, in actuality, the message is intended to be received and analyzed by access node 802. Additionally or alternatively, terminal 804 can intercept the message, encapsulate such message within a Logical Link Control (LLC) frame (indicating that the message is intended for the base station).
In an example, host 806 may desirably request particular QoS support with respect to services provided by network entity 810. Accordingly, host 806 can create a message addressed to network entity 810, and can indicate within the message that it is intended for access node 802 (even though the message is addressed to network entity 810 ). Example manners of indicating that a message is intended for access node 802 are described above (e.g., router alert within an IP header). One-hop multicasting can also be employed in connection with providing a message to an appropriate point of attachment, wherein such multicasting is described in greater detail below.
Turning now to
In some instances, however, it may be imperative to provide a specific point of attachment, e.g., the primary point of attachment, with certain packets, e.g., messages or frames. For example, a primary point of attachment should receive “connect” messages. In IP traffic, however, data is typically forwarded on a packet-by-packet basis using connectionless hop-by-hop routing, such that a packet sent from terminal 902 to a point of attachment, e.g., either first base station 904 or second base station 906, is often destined for some other node and thus is in actuality subsequently relayed elsewhere. To address such an issue, one-hop multicasting can be utilized. For instance, a host 912 can provide messages or packets to one or more one-hop multicast addresses. Often, utilizing the one-hop muiticast address(es) is used to communicate with a function or entity on a directly connected link when a unicast address is unknown. In some instances, however, it may be desirable to direct certain packets (e.g., packets addressed to a one-hop multicast address) to a particular point of attachment (e.g., a primary point of attachment). In an embodiment, packets originating from host 912 can be inspected to determine if such packets should be delivered to a particular point of attachment amongst a plurality of points of attachment (e.g., a primary point of attachment). As an example, each packet provided from host 912 that is directed towards a one-hop multicast address can be directed to a primary point of attachment
Moreover, as alluded to above, interception can occur amongst network infrastructure devices in connection with communicating with points of attachment. For instance, system 900 can include a network entity 914, which may desire to provide a message to a primary point of attachment with respect to wireless terminal 902 (but is not aware of identity and/or address of such point of attachment).
In still another example, base stations 904 and 906 can be communicatively coupled and act as routers, switches, or bridges. For instance, a packet may desirably be provided to first base station 904, but in actuality gets provided to second base station 906, e.g., because the link from wireless terminal 902 to second base station 906 was substantially better at the time that the packet was transmitted. Base station 906 can recognize (by some indication within the packet) that the packet is intended for base station 904, and can relay or re-direct such packet to first base station 904. For example, a packet addressed to a one-hop multicast address would typically not be forwarded beyond the direct link upon which it was sent. If second base station 906 receives a packet addressed to a one-hop multicast address, and determines that packets sent to one-hop multicast addresses should be provided to the first base station 904 (e.g., because first base station 904 is designated as the primary point of attachment), then second base station 906 can re-direct such packet to first base station 904, e.g., encapsulate the received packet in another packet or frame addressed to first base station 904.
Turning now to
Now referring to
At 1108, the data packet is encapsulated in an LLC frame, for instance, and directed to the primary point of attachment. Such encapsulation can occur at a wireless terminal, for example. Once encapsulated, the frame can be provided to an appropriate point of attachment and/or routed to such point of attachment. The methodology 1100 then completes at 1110.
Now turning to
Referring now to
Turning now to
The methodology 1400 starts at 1402, and at 1404 a data packet is received that is addressed to a one hop multicast address. For example, a host device can initiate transmission of the data packet and a wireless terminal associated with the host device can receive such data packet. At 1406, the data packet is encapsulated in a particular frame format (e.g., an LLC frame), and an indication is provided within the header of such frame that the data packet is intended for a primary point of attachment (base station). For instance, a wireless terminal can perform such encapsulation. At 1408, the frame is provided to a base station that is communicatively coupled to the wireless terminal. In more detail, the frame can be provided to a base station that is not the primary point of attachment, but such base station can analyze the frame and determine that the packet should be forwarded to an appropriate base station. In another example, the frame can be directly provided to the primary point of attachment. The methodology 1400 then completes at 1410.
With reference to
Turning now to
Now referring to
System 1700 can also include a network entity 1714 that requests resources from one of access nodes 1704 and 1706 with respect to wireless terminal 1702. For instance, network entity 1714 can be an application server, and can request QoS support/management on behalf of wireless terminal 1702 from a primary access node associated with wireless terminal. In another example, network entity 1714 can be a function that resides within an application server, for example. As described above, however, wireless terminal 1702 can move to different geographic locations within a network, thereby changing its point of attachment (or primary point of attachment) to a network. To ensure that network entity 1714 has knowledge of where to relay resource requests, a message (move message) that informs network entity 1714 that a point of attachment with respect to wireless terminal 1702 has changed is generated by at least one of access nodes 1704 and 1706 and provided to network entity 1714. In addition or alternatively, the message (move message) can inform network entity 1714 that resource state, e.g., data structures corresponding to QoS support for one or more traffic flows, controlled and/or maintained by the network entity 1714 have been moved to a new point of attachment of wireless terminal 1702.
Pursuant to an example, access node 1704 may at first be a point of attachment with respect to wireless terminal 1702, and network entity 1714 can provide access node 1704 with a request for resources. Access node 1704 can retain resource state information (e.g., QoS resource information) and provide wireless terminal 1702 with appropriate traffic flow treatment with respect to the resource request (assuming a subscriber is authorized with respect to requested resources). As wireless terminal 1702 changes location, a handoff may occur such that access node 1706 becomes the point of attachment (e.g., primary point of attachment) with respect to wireless terminal 1702. In another example, access node 1706 can become a point of attachment with respect to a particular resource or resource state while access node 1704 remains a point of attachment for different resources or resource states. Resource state information, including identity/network address of a requester, can be relayed between access node 1704 (a most recent point of attachment) to access node 1706 (a current point of attachment). Access node 1706 can then provide a message to network entity 1714 indicating that access node 1706 is now the point of attachment (e.g., the primary point of attachment) for wireless terminal 1702. In another embodiment, access node 1704 can provide the move message to network entity 1714, indicating that access node 1706 is the new point of attachment for wireless terminal 1702. In still another embodiment, both access node 1704 and access node 1706 can provide the network entity 1714 with a move message. Thereafter, network entity 1714 can provide subsequent resource requests to the current point of attachment (e.g., access node 1706 ).
Wireless terminal 1702 can also be employed to provide a move message, wherein such move message may be provided to host 1712. Pursuant to an example, wireless terminal 1702 may have knowledge that a point of attachment has changed (e.g., from access node 1704 to access node 1706 ). Wireless terminal 1702 can then generate a move message and provide such message to host 1712, thereby enabling host 1712 to have knowledge of where to provide resource requests (e.g., requests for QoS support for particular traffic flows).
As can be discerned, there may be a race condition if, for instance, network entity 1714 initiates a resource request and provides it to an access node that is no longer a primary access node and/or linked to wireless terminal 1702. In such case, resource requests (e.g., to add resources desirably associated with wireless terminal 1702, modify resources associated with wireless terminal 1702, delete resources associated with wireless terminal 1702 ) can time out. Prior to timing out or proximate in time thereto, network entity 1714 can receive a move message. Other manners/mechanisms for managing race conditions are contemplated by the inventors and are intended to fall under the scope of the hereto-appended claims.
Turning now to
With respect to
At 1908, an identity and/or location of an access node that is a new point of attachment (or new primary point of attachment) is determined. For example, such identity/location can be provided from an access node that is a new point of attachment (after handoff), from a wireless terminal that is subject to the handoff, and/or the like. At 1910, the identified resource requester is provided with an identity and/or location of the new point of attachment (or primary point of attachment). Thus, the resource requester will have knowledge of where to provide future resource requests. The methodology 1900 then completes at 1912.
Referring now to
Now turning to
With reference to
Now turning to
To provide additional context for one or more embodiments described herein,
Communications system 2400 depicts a network 2460 that includes access control node 2420, mobility support node 2422, policy control node 2424, and application server node 2426, all of which are connected to an intermediate network node 2428 by a corresponding network link 2432-2438, respectively. In some embodiments, the access control node, e.g., a Remote Authentication Dial In User Service (RADIUS) or Diameter server, supports authentication, authorization, and/or accounting of end nodes and/or services associated with end nodes. In some embodiments, mobility support node 2422, e.g., a Mobile IP home agent and/or context transfer server, supports mobility, e.g., handoff, of end nodes between access nodes, e.g., by way of redirection of traffic to/from end nodes and/or transfer of state associated with end nodes between access nodes. In some embodiments, policy control node 2424, e.g., a policy server or Policy Decision Point (PDP), supports policy authorization for services or application layer sessions. In some embodiments, application server node 2426, e.g., a Session Initiation Protocol server, streaming media server, or other application layer server, supports session signaling for services available to end nodes and/or provides services or content available to end nodes.
Intermediate network node 2428 in network 2460 provides interconnectivity to network nodes that are external from the perspective of network 2460 by way of network link 2434. Network link 2434 is connected to intermediate network node 2430, which provides further connectivity to access nodes 2414, 2416, and 2418 by way of network links 2436-2440, respectively. Each access node 2414-2418 is depicted as providing connectivity to end nodes 2402-2412, respectively, by way of corresponding access links 2442-2452, respectively. In communication system 2400, each access node 2414-2418 is depicted as using wireless technology, e.g., wireless access links, to provide access. Wired technology may also be utilized, however, in connection with provision of access. A radio coverage area, e.g., communications cells 2454-2458 of each access node 2414-2418, is illustrated as a circle surrounding the corresponding access node.
Communication system 2400 can be used as a basis for the description of various embodiments described herein. Alternative embodiments include various network topologies, where a number and type of nodes (including network nodes, access nodes, end nodes, as well as various control, support, and server nodes), a number and type of links, and interconnectivity between various nodes may differ from that of communication system 2400. Additionally, some of the functional entities depicted in communication system 2400 may be omitted or combined. Location or placement of these functional entities may also be varied.
Wireless communication interface module 2504 provides a mechanism by which the internal components of end node 2500 can send and receive signals to/from external devices and network nodes, e.g., access nodes. Wireless communication interface module 2504 includes, e.g., a receiver module 2514 with a corresponding receiving antenna 2516 and a transmitter module 2518 with a corresponding transmitting antenna 2520 used for coupling end node 2500 to other network nodes, e.g., by way of wireless communications channels.
End node 2500 also includes a user input device 2522, e.g., keypad, and a user output device 2524, e.g., display, which are coupled to bus 2510 through user input/output interface 2506. Thus, user input/output devices 2522 and 2524 can exchange information, signals and data with other components of end node 2500 by way of user input/output interface 2506 and bus 2510. User input/output interface 2506 and associated devices 2522 and 2524 provide mechanisms by which a user can operate end node 2500 to accomplish various tasks. In particular, user input device 2522 and user output device 2524 provide functionality that allows a user to control end node 2500 and applications, e.g., modules, programs, routines and/or functions, that execute in memory 2508 of end node 2500.
Processor 2502, under control of various modules, e.g., routines, included in memory 2508 controls operation of end node 2500 to perform various signaling and processing. The modules included in memory 2508 are executed on startup or as called by other modules. Modules may exchange data, information, and signals when executed. Modules may also share data and information when executed. Memory 2508 of end node 2500 includes a control signaling module 2526, an application module 2528, and a traffic control module 2530, which further includes configuration information 2532 and various additional modules.
Control signaling module 2526 controls processing relating to receiving and sending signals, e.g., messages, for controlling operation and/or configuration of various aspects of end node 2500 including, e.g., traffic control module 2530 as well as configuration information 2532 and various additional modules included. In some embodiments, control signaling module 2526 can include state information, e.g., parameters, status and/or other information, relating to operation of end node 2500 and/or one or more signaling protocols supported by control signaling module 2526. In particular, control signaling module 2526 may include configuration information, e.g., end node identification information and/or parameter settings, and operational information, e.g., information about current processing state, status of pending message transactions, etc.
Application module 2528 controls processing and communications relating to one or more applications supported by end node 2500. In some embodiments, application module 2528 processing can include tasks relating to input/output of information by way of the user input/output interface 2506, manipulation of information associated with an application, and/or receiving or sending signals, e.g., messages, associated with an application. In some embodiments, application module 2528 includes state information, e.g., parameters, status and/or other information, relating to operation of one or more applications supported by application module 2528. In particular, application module 2528 may include configuration information, e.g., user identification information and/or parameter settings, and operational information, e.g., information about current processing state, status of pending responses, etc. Applications supported by application module 2528 include, e.g., Voice over IP (VoIP), web browsing, streaming audio/video, instant messaging, file sharing, gaming, etc.
Traffic control module 2530 controls processing relating to receiving and sending data information, e.g. messages, packets, and/or frames, through wireless communication interface module 2504. The example traffic control module 2530 includes configuration information 2532 as well as various additional modules that control various aspects of QoS for packets and/or traffic flows, e.g., associated sequences of packets. Various additional modules are included, in some embodiments, to perform particular functions and operations as needed to support specific aspects of traffic control. Modules may be omitted and/or combined as needed depending on the functional requirements of traffic control. A description of each additional module included in traffic control module 2530 follows.
An admission control module 2534 maintains information relating to resource utilization/availability and determines if sufficient resources are available to support QoS parameters desirably associated with particular traffic flows. Resource availability information maintained by admission control module 2534 includes, e.g., packet and/or frame queuing capacity, scheduling capacity, as well as processing and memory capacity needed to support one or more traffic flows. Control signaling module 2526, application module 2528, and/or other modules included in end node 2500 may query admission control module 2534 to determine if sufficient resources are available to support a new or modified traffic flow, where the admission control determination is a function of QoS parameters of the particular traffic flow and QoS parameters defined within a profile. Configuration information 2532 can include configuration information, e.g., parameters settings, that affect the operation of admission control module 2534, e.g., an admission control threshold value that indicates percentage of resource that may be allocated prior to rejecting additional requests.
An uplink scheduler module 2536 controls processing relating to transmission scheduling, e.g., order and/or timing, and allocation of transmission resources, e.g., information coding rate, transmission time slots, and/or transmission power, for data information, e.g., messages, packets, and/or frames, to be sent by way of wireless communication interface module 2504, e.g., from end node 2500 to an access node. Uplink scheduler module 2536 can schedule transmissions and allocate transmission resources as a function of QoS parameters associated with one or more traffic flows. In some embodiments, scheduling and/or resource allocation operations performed by uplink scheduler module 2536 are additionally a function of channel conditions and other factors, e.g., power budget.
An uplink PHY/MAC module 2538 controls physical (PHY) layer and Media Access Control (MAC) layer processing relating to sending data information, e.g., messages, packets, and/or frames, by way of wireless communication interface module 2504, e.g., from end node 2500 to an access node. For instance, operation of uplink PHY/MAC module 2538 includes both sending and receiving control information, e.g., signals or messages, to coordinate sending of data information, e.g., messages, packets, and/or frames. Configuration information 2532 can include configuration information, e.g., parameters settings, that affect the operation of uplink PHY/MAC module 2538, e.g., a frequency, band, channel, spreading code or hoping code to be used for transmissions, an identifier associated with end node 2500, a request dictionary prescribing use of an assignment request channel, etc.
An uplink LLC (ARQ) module 2540 controls Logical Link Control (LLC) layer processing relating to sending data information, e.g., messages, packets, and/or frames, through wireless communication interface module 2504, e.g., from end node 2500 to an access node. Uplink LLC (ARQ) module 2540 includes processing associated with Automatic Repeat Request (ARQ) capabilities, e.g., retransmission of lost packets or frames. Uplink LLC (ARQ) module 2540 can, for instance, further include processing relating to addition of an LLC header and/or trailer to higher layer messages, e.g., packets, to provide additional functionality, e.g., multi-protocol multiplexing/demultiplexing by way of a type field or error detection through utilization of a checksum field. Uplink LLC (ARQ) module 2540 can additionally perform fragmentation of higher layer messages, e.g., packets, into multiple sub-portions, e.g., frames to be sent by uplink PHY/MAC module 2540. Configuration information 2532 can include configuration information that affect operation of uplink LLC (ARQ) module 2540, e.g., an ARQ window size, maximum number of retransmissions, a discard timer, etc.
An uplink queue management module 2542 maintains information and controls processing relating to storage of data information to be sent by way of wireless communication interface module 2504, e.g., from end node 2500 to an access node. Uplink queue management module 2542 can, for example, control storage of data information awaiting transmission and maintain state information regarding data information awaiting transmission on a per traffic flow basis, e.g., packets associated with each traffic flow may be stored in separate queues. For instance, uplink queue management module 2542 supports a variety of queue management techniques and/or capabilities, e.g., head drop, tail drop, as well as various Active Queue Management (AQM) mechanisms such as Random Early Detection (RED). Configuration information 2532 can include configuration information that affects operation of uplink queue management module 2542, such as a queue limit, drop strategy, and/or AQM thresholds associated with one or more traffic flows.
An uplink classifier module 2544 controls processing relating to identification of data information as belonging to particular traffic flows prior to being sent by way of the wireless communication interface module 2504, e.g., from end node 2500 to an access node. In some embodiments, messages, packets, and/or frames to be sent through utilization of wireless communication interface module 2504 are classified as belonging to one of a variety of traffic flows by uplink classifier module 2544 based on inspection of one or more header and/or payload fields. Results of classification by uplink classifier module 2544 can affect the treatment of classified data information by uplink queue management module 2542 as well as other modules within memory 2508. For example, the results may determine a particular queue the message, packet, and/or frame will be associated with for storage and further affect subsequent processing such as scheduling. Configuration information can include configuration information that affect operation of uplink classifier module 2544, e.g., a set of one or more classifier filter rules that prescribe criteria used to associate data information, e.g., messages, packets, and/or frames, as belonging to one or more traffic flows.
A downlink PHY/MAC module 2546 controls PHY layer and MAC layer processing relating to receiving data information by way of wireless communication interface module 2504. Operation of downlink PHY/MAC module 2546 can include both sending and receiving control information to coordinate receiving of data information. Configuration information 2504 can include configuration information that affect operation of downlink PHY/MAC module 2546, e.g., a frequency, band, channel, spreading code or hoping code to be used for reception, an identifier associated with end node 2500, etc.
A downlink LLC (ARQ) module 2548 controls LLC layer processing relating to receiving data information by way of wireless communication interface module 2504. Downlink LLC (ARQ) module 2548 includes processing associated with ARQ capabilities, e.g., retransmission of lost packets or frames. For example, downlink LLC (ARQ) module 2548 can further included processing relating to an LLC header and/or trailer that encapsulates higher layer messages, which provides additional functionality, e.g., multi-protocol multiplexing/demultiplexing through a type field or error detection by way of a checksum field. Downlink LLC (ARQ) module 2548 can also perform reassembly of frames received by the downlink PHY/MAC module 2546 into higher layer messages. Configuration information 2532 can, and in some embodiments does, include configuration information, e.g., parameters settings, that affect operation of downlink LLC (ARQ) module 2548, e.g., an ARQ window size, maximum number of retransmissions, a discard timer, etc.
Network/internetwork interface module 2606 provides a mechanism by which the internal components of access node 2600 can send and receive signals to/from external devices and network nodes. Network/internetwork interface module 2606 includes a receiver module 2614 and a transmitter module 2616 used for coupling node 2600 to other network nodes, e.g., through copper wires or fiber optic lines. Wireless communication interface module 2608 also provides a mechanism by which the internal components of access node 2600 can send and receive signals to/from external devices and network nodes, e.g., end nodes. Wireless communication interface module 2608 includes, e.g., a receiver module 2618 with a corresponding receiving antenna 2620 and a transmitter module 2622 with a corresponding transmitting antenna 2624. Wireless communication interface module 2608 is used for coupling access node 2600 to other nodes, e.g., by way of wireless communication channels.
Processor 2602 under control of various modules, e.g., routines, included in memory 2604 controls operation of access node 2600 to perform various signaling and processing. The modules included in memory 2604 are executed on startup or as called by other modules. Modules may exchange data, information, and signals when executed. Modules may also share data and information when executed. In the
Control signaling module 2626 controls processing relating to receiving and sending signals, e.g., messages, for controlling operation and/or configuration of various aspects of access node 2600 including e.g., traffic control module 2628 as well as configuration information 2630 and the various additional modules included therein 2632-2654. For instance, control signaling module 2626 includes state information, e.g., parameters, status and/or other information, relating to operation of access node 2600 and/or one or more signaling protocols supported by control signaling module 2626. In particular, control signaling module 2626 may include configuration information, e.g., access node identification information and/or parameter settings, and operational information, e.g., information about current processing state, status of pending message transactions, etc.
Traffic control module 2628 controls processing relating to receiving and sending data information, e.g., messages, packets, and/or frames, by way of wireless communication interface module 2608. For instance, traffic control module can include configuration information 2630 as well as various additional modules 2632-2654 that control various aspects of quality of service for packets and/or traffic flows, e.g., associated sequences of packets. In some embodiments, traffic control module 2628 includes state information, e.g., parameters, status and/or other information, relating to operation of access node 2600, traffic control module 2628, and/or one or more of the various additional modules included therein 2632-2654. Configuration information 2630, e.g., parameter settings, determines, affects and/or prescribes operation of traffic control module 2628 and/or the various additional modules included therein 2632-2654. The various additional modules are included, in some embodiments, to perform particular functions and operations as needed to support specific aspects of traffic control. In various embodiments, modules may be omitted and/or combined as needed depending on the functional requirements of traffic control. A description of each additional module included in traffic control module 2628 follows.
Admission control module 2632 maintains information relating to resource utilization/availability and determines if sufficient resources are available to support quality of service requirements of particular traffic flows. Resource availability information maintained by admission control module 2632 includes, e.g., packet and/or frame queuing capacity, scheduling capacity, as well as processing and memory capacity needed to support one or more traffic flows. Control signaling module 2626 and/or other modules included in access node 2600 can query admission control module 2632 to determine if sufficient resources are available to support a new or modified traffic flow, where the admission control determination is a function of the quality of service requirements of the particular traffic flow and/or the available resources. Configuration information 2630 can include configuration information, e.g., parameters settings, that affect the operation of admission control module 2632, e.g., an admission control threshold value that indicates the percentage of resource that may be allocated prior to rejecting additional requests.
Uplink scheduler module 2634 controls processing relating to transmission scheduling, e.g., order and/or timing, and allocation of transmission resources, e.g., information coding rate, transmission time slots, and/or transmission power, for data information, e.g., messages, packets, and/or frames, to be sent from one or more end nodes to the access node by way of wireless interface module 2608. Uplink scheduler module 2634 can schedule transmissions and allocate transmission resources as a function of the quality of service requirements and/or constraints associated with one or more traffic flows and/or one or more end nodes. Configuration information 2630 can include configuration information that affect the operation of uplink scheduler module 2634, e.g., a priority, rate bound, latency bound, and/or sharing weight associated with one or more traffic flows and/or end nodes. In some embodiments, scheduling and/or resource allocation operations performed by uplink scheduler module 2634 are additionally a function of channel conditions and other factors, e.g., power budget.
Downlink scheduler module 2636 controls processing relating to transmission scheduling, e.g., order and/or timing, and allocation of transmission resources, e.g., information coding rate, transmission time slots, and/or transmission power, for data information, e.g., messages, packets, and/or frames, to be sent from access node 2600 to one or more end nodes through wireless interface module 2608. Downlink scheduler module 2636 can schedule transmissions and allocate transmission resources as a function of the quality or service requirements and/or constraints associated with one or more traffic flows and/or one or more end nodes. Configuration information 2630 can include configuration information that affects the operation of downlink scheduler module 2636, e.g., a priority, rate bound, latency bound, and/or sharing weight associated with one or more traffic flows and/or end nodes. In some embodiments, scheduling and/or resource allocation operations performed by the downlink scheduler module 2636 are additionally a function of channel conditions and other factors, e.g., power budget.
Uplink traffic conditioner module 2638 controls processing relating to traffic conditioning, e.g., metering, marking, policing, etc., for data information, e.g., messages, packets, and/or frames, received by way of wireless interface module 2608, e.g., from an end node to access node 2600. Uplink traffic conditioner module 2638 can condition traffic, e.g., meter, mark and/or police, as a function of the quality of service requirements and/or constraints associated with one or more traffic flows and/or one or more end nodes. Configuration information 2630 can include configuration information that affects the operation of uplink traffic conditioner module 2638, e.g., a rate bound, and/or marking value associated with one or more traffic flows and/or end nodes.
Uplink classifier module 2640 controls processing relating to identification of data information, e.g., messages, packets, and/or frames, received through wireless interface module 2608, e.g., from an end node to access node 2600, as belonging to particular traffic flows prior to being processed by uplink traffic conditioner module 2638. In some embodiments, messages, packets, and/or frames received through wireless communication interface module 2608 are classified as belonging to one of a variety of traffic flows by uplink classifier module 2640 based on inspection of one or more header and/or payload fields. The results of classification by uplink classifier module 2640 can affect the treatment of the classified data information, e.g., messages, packets, and/or frames, by uplink traffic conditioner module 2638, e.g., the results may determine a particular data structure or state machine the message, packet, and/or frame will be associated with and further affect subsequent processing such as metering, marking, and/or policing. Configuration information 2630 can include configuration information that affects the operation of uplink classifier module 2640, e.g., a set of one or more classifier filter rules that prescribe criteria used to associate data information, e.g., messages, packets, and/or frames, as belonging to one or more traffic flows.
Uplink LLC (ARQ) module 2642 controls LLC layer processing relating to receiving data information, e.g., packets and/or frames, by way of wireless communication interface module 2608, e.g., from an end node to access node 2600. Uplink LLC (ARQ) module 2642 includes processing associated with ARQ capabilities, e.g., retransmission of lost packets or frames. In some embodiments, uplink LLC (ARQ) module 2642 further includes processing relating to an LLC header and/or trailer that encapsulates higher layer messages, e.g., packets, which provides additional functionality, e.g., multi-protocol multiplexing/demultiplexing through a type field or error detection by way of a checksum field. Uplink LLC (ARQ) module 2642 can also perform reassembly of frames received by uplink PHY/MAC module 2644 into higher layer messages, e.g., packets. The configuration information 2630 can include configuration information that affects the operation of uplink LLC (ARQ) module 2642, e.g., an ARQ window size, maximum number of retransmissions, a discard timer, etc.
Uplink PHY/MAC module 2644 controls PHY layer and MAC layer processing relating to receiving data information, e.g., packets and/or frames, by way of wireless communication interface module 2608, e.g., from an end node to access node 2600. In some embodiments, operation of uplink PHY/MAC module 2644 includes both sending and receiving control information, e.g., signals or messages, to coordinate receiving of data information, e.g., messages, packets, or frames. Configuration information 2630 can include configuration information that affects the operation of uplink PHY/MAC module 2644, e.g., a frequency, band, channel, spreading code or hopping code to be used for reception, an identifier associated with access node 2600, etc.
Downlink classifier module 2646 controls processing relating to identification of data information, e.g., messages, packets, and/or frames, as belonging to particular traffic flows prior to being sent through wireless communication interface module 2608, e.g., from access node 2600 to an end node. In some embodiments, messages, packets, and/or frames to be sent by way of wireless communication interface module 2608 are classified as belonging to one of a variety of traffic flows by downlink classifier module 2646 based on inspection of one or more header and/or payload fields. The results of classification by downlink classifier module 2646 can affect the treatment of the classified data information, e.g., messages, packets, and/or frames, by downlink queue management module 2650 and other modules 2648, 2652, and 2654, e.g., the results may determine a particular queue the message, packet, and/or frame will be associated with for storage and further affect subsequent processing such as scheduling. Configuration information 2630 can include configuration information, e.g., parameters settings, that affect the operation of downlink classifier module 2646, e.g., a set of one or more classifier filter rules that prescribe criteria used to associate data information, e.g., messages, packets, and/or frames, as belonging to one or more traffic flows.
Downlink traffic conditioner module 2648 controls processing relating to traffic conditioning, e.g., metering, marking, policing, etc., for data information, e.g., messages, packets, and/or frames, to be sent by way of wireless interface module 2608, e.g., from access node 2600 to an end node. Downlink traffic conditioner module 2648 can condition traffic, e.g., meter, mark and/or police, as a function of the quality of service requirements and/or constraints associated with one or more traffic flows and/or one or more end nodes. Configuration information 2630 can include configuration information that affects the operation of downlink traffic conditioner module 2648, e.g., a rate bound, and/or marking value associated with one or more traffic flows and/or end nodes.
Downlink queue management module 2650 maintains information and controls processing relating to storage of data information, e.g., messages, packets, and/or frames, to be sent by way of wireless communication interface module 2608, e.g., from access node 2600 to an end node. Downlink queue management module can control storage of data information awaiting transmission and maintain state information regarding data information awaiting transmission on a per traffic flow basis, e.g., packets associated with each traffic flow may be stored in separate queues. In some embodiments of, Downlink queue management module 2650 supports a variety of queue management techniques and/or capabilities, e.g., head drop, tail drop, as well as various AQM mechanisms such as RED. Configuration information 2630 can include configuration information that affects the operation of downlink queue management module 2650, e.g., a queue limit, drop strategy, and/or AQM thresholds associated with one or more traffic flows.
Downlink LLC (ARQ) module 2652 controls LLC layer processing relating to sending data information, e.g., messages, packets, and/or frames, by way of wireless communication interface module 260, e.g., from access node 2600 to an end node. Downlink LLC (ARQ) module 2652 includes processing associated with ARQ capabilities, e.g., retransmission of lost packets or frames. In some embodiments, downlink LLC (ARQ) module 2652 further includes processing relating to the addition of an LLC header and/or trailer to higher layer messages, e.g., packets, to provide additional functionality, e.g., multi-protocol multiplexing/demultiplexing through a type field or error detection by way of a checksum field. Downlink LLC (ARQ) module 2652 can also perform fragmentation of higher layer messages, e.g. packets, into multiple sub-portions, e.g., frames to be sent by downlink PHY/MAC module 2654. Configuration information 2630 can include configuration information that affects the operation of downlink LLC (ARQ) module 2652, e.g., an ARQ window size, maximum number of retransmissions, a discard timer, etc.
Downlink PHY/MAC module 2654 controls PHY layer and MAC layer processing relating to sending data information, e.g., messages, packets, and/or frames, by way of wireless communication interface module 2608, e.g., from access node 2600 to an end node. In some embodiments, operation of downlink PHY/MAC module 2654 includes both sending and receiving control information, e.g., signals or messages, to coordinate sending of data information, e.g., messages, packets, or frames. Configuration information 2630 can include configuration information that affects the operation of downlink PHY/MAC module 2654, e.g., a frequency, band, channel, spreading code or hoping code to be used for transmissions, an identifier associated with the access node 2600, etc.
The data information, e.g., traffic flows comprising a sequence of messages, packets, or frames, sent from the application module 2528 in the end node 2500 to a corresponding node is shown by a sequence of arrows 2702-2708 to proceed through a sequence of modules 2538-2544 included in end node 2500 for processing, after which the data information is sent from the end node 2500 to the access node 2600, e.g., by way of wireless communication interface module 2504. Following reception by access node 2600, e.g., by way of wireless communication interface module 2608, the data information, e.g., traffic flows comprising a sequence of messages, packets, or frames, sent from the application module 2528 in end node 2500 to the corresponding node is shown by a sequence of arrows 2710-2718 to proceed through a sequence of modules 2638-2644 included in access node 2600 for processing, prior to being forwarded from the access node 2600 toward the corresponding node, e.g., directed in accordance with routing information to an intermediate node connected to the access node by way of network/internetwork interface module 2606.
The data information, e.g., traffic flows comprising a sequence of messages, packets, or frames, sent from a corresponding node to application module 2528 in end node 2528 is shown by a sequence of arrows 2720-2728 to be received by access node 2600, e.g., by way of network/internetwork interface module 2606, and then to proceed through a sequence of modules 2646-2654 included in access node 2600 for processing, after which the data information is sent from the access node 2600 to the end node 2500, e.g., via the wireless communication interface module 2608. Following reception by end node 2500, e.g., by way of wireless communication interface module 2504, the data information, e.g., traffic flows comprising a sequence of messages, packets, or frames, sent from the corresponding node to application module 2528 in end node 2500 is shown by a sequence of arrows 2730-2734 to proceed through a sequence of modules 2546 and 2548 included in end node 2500 for processing, prior to being delivered to the application module 2528 in end node 2500.
In addition to the exchange of data information, e.g., traffic flows,
The exchange of control information, e.g., signaling flows and/or communication interfaces, is also shown a) between another node and control signaling module 2626 in access node 2600, b) between application module 2528 in end node 2500 and control signaling module 2526 in end node 2500, and c) between the respective control signaling modules 2626/2526 in access node 2600 and end node 2500. These exchanges of control information, e.g., signaling flows and/or communication interfaces, enable the configuration and/or operation of traffic control modules 2628/2530 in both access node 2600 and the end node 2500 to be affected by a) one or more additional nodes, e.g. the access control node 2420 and/or application server node 2426, b) application module 2528 in end node 2500, or c) a combination of one or more additional nodes and the application module 2528 in end node 2500. Various embodiments of the present invention may, and do, support all or only a subset of the depicted control information exchanges as needed.
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.
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 Ser. No. 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/486,654, entitled “PROVISION OF QOS TREATMENT BASED UPON MULTIPLE REQUESTS” (Park, et al.); Ser. No. 11/486,650, entitled “STATE SYNCHRONIZATION BETWEEN ACCESS ROUTERS” (Tsirtsis, 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 and patent are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4833701 | Comroe et al. | May 1989 | A |
5117502 | Onoda et al. | May 1992 | A |
5128938 | Borras | Jul 1992 | A |
5200952 | Bernstein et al. | Apr 1993 | A |
5208837 | Richey | May 1993 | A |
5229992 | Jurkevich et al. | Jul 1993 | A |
5247516 | Bernstein et al. | Sep 1993 | A |
5251209 | Jurkevich et al. | Oct 1993 | A |
5267261 | Blakeney, II et al. | Nov 1993 | A |
5268933 | Averbuch | Dec 1993 | A |
5388102 | Griffith et al. | Feb 1995 | A |
5490139 | Baker et al. | Feb 1996 | A |
5491835 | Sasuta et al. | Feb 1996 | A |
5509027 | Vook et al. | Apr 1996 | A |
5539925 | Yli-Kotila et al. | Jul 1996 | A |
5561841 | Markus | Oct 1996 | A |
5572528 | Shuen | Nov 1996 | A |
5574720 | Lee | Nov 1996 | A |
5594943 | Balachandran | Jan 1997 | A |
5694548 | Baugher et al. | Dec 1997 | A |
5722044 | Padovani et al. | Feb 1998 | A |
5737328 | Norman et al. | Apr 1998 | A |
5794137 | Harte | Aug 1998 | A |
5854785 | Willey | Dec 1998 | A |
5870427 | Tiedemann et al. | Feb 1999 | A |
5974036 | Acharya et al. | Oct 1999 | A |
5978366 | Massingill et al. | Nov 1999 | A |
6016316 | Moura et al. | Jan 2000 | A |
6018521 | Timbs et al. | Jan 2000 | A |
6031863 | Jusa et al. | Feb 2000 | A |
6034950 | Sauer et al. | Mar 2000 | A |
6049543 | Sauer et al. | Apr 2000 | A |
6055428 | Soliman | Apr 2000 | A |
6073021 | Kumar et al. | Jun 2000 | A |
6084969 | Wright et al. | Jul 2000 | A |
6094427 | Yi | Jul 2000 | A |
6097952 | Kawabata | Aug 2000 | A |
6101394 | Illidge | Aug 2000 | A |
6137787 | Chawla et al. | Oct 2000 | A |
6144671 | Perinpanathan et al. | Nov 2000 | A |
6151502 | Padovani et al. | Nov 2000 | A |
6157668 | Gilhousen et al. | Dec 2000 | A |
6157833 | Lawson-Jenkins et al. | Dec 2000 | A |
6157978 | Ng et al. | Dec 2000 | A |
6161008 | Lee et al. | Dec 2000 | A |
6163692 | Chakrabarti et al. | Dec 2000 | A |
6195552 | Jeong et al. | Feb 2001 | B1 |
6195705 | Leung | Feb 2001 | B1 |
6201971 | Purnadi et al. | Mar 2001 | B1 |
6256300 | Ahmed et al. | Jul 2001 | B1 |
6272129 | Dynarski et al. | Aug 2001 | B1 |
6285665 | Chuah | Sep 2001 | B1 |
6300887 | Le | Oct 2001 | B1 |
6308267 | Gremmelmaier | Oct 2001 | B1 |
6345043 | Hsu | Feb 2002 | B1 |
6347091 | Wallentin et al. | Feb 2002 | B1 |
6360100 | Grob et al. | Mar 2002 | B1 |
6366561 | Bender | Apr 2002 | B1 |
6370380 | Norefors et al. | Apr 2002 | B1 |
6397065 | Huusko et al. | May 2002 | B1 |
6400722 | Chuah et al. | Jun 2002 | B1 |
6445922 | Hiller et al. | Sep 2002 | B1 |
6446127 | Schuster et al. | Sep 2002 | B1 |
6449481 | Kwon et al. | Sep 2002 | B1 |
6456604 | Lee et al. | Sep 2002 | B1 |
6466964 | Leung et al. | Oct 2002 | B1 |
6473418 | Laroia et al. | Oct 2002 | B1 |
6493725 | Iwai et al. | Dec 2002 | B1 |
6496704 | Yuan | Dec 2002 | B2 |
6510153 | Inoue et al. | Jan 2003 | B1 |
6516352 | Booth et al. | Feb 2003 | B1 |
6519457 | Jiang et al. | Feb 2003 | B1 |
6529732 | Vainiomaki et al. | Mar 2003 | B1 |
6535493 | Lee et al. | Mar 2003 | B1 |
6535739 | Chen et al. | Mar 2003 | B1 |
6553227 | Ho et al. | Apr 2003 | B1 |
6587680 | Ala-Laurila et al. | Jul 2003 | B1 |
6611547 | Rauhala | Aug 2003 | B1 |
6640248 | Jorgensen | Oct 2003 | B1 |
6654363 | Li et al. | Nov 2003 | B1 |
6671512 | Laakso | Dec 2003 | B2 |
6701155 | Sarkkinen et al. | Mar 2004 | B2 |
6708031 | Purnadi et al. | Mar 2004 | B2 |
6714524 | Kim et al. | Mar 2004 | B1 |
6714777 | Naqvi et al. | Mar 2004 | B1 |
6714788 | Voyer | Mar 2004 | B2 |
6728365 | Li et al. | Apr 2004 | B1 |
6754492 | Stammers et al. | Jun 2004 | B1 |
6763007 | La Porta et al. | Jul 2004 | B1 |
6768908 | Jalloul et al. | Jul 2004 | B1 |
6771962 | Saifullah et al. | Aug 2004 | B2 |
6785256 | O'Neill | Aug 2004 | B2 |
6807421 | Ahmavaara | Oct 2004 | B1 |
6842621 | Labun et al. | Jan 2005 | B2 |
6842630 | Periyalwar | Jan 2005 | B2 |
6862446 | O'Neill et al. | Mar 2005 | B2 |
6901063 | Vayanos et al. | May 2005 | B2 |
6917605 | Kakemizu et al. | Jul 2005 | B2 |
6937566 | Forslow | Aug 2005 | B1 |
6947401 | El-Malki et al. | Sep 2005 | B2 |
6950650 | Roeder | Sep 2005 | B2 |
6954442 | Tsirtsis et al. | Oct 2005 | B2 |
6961579 | Inukai et al. | Nov 2005 | B2 |
6965585 | Grilli et al. | Nov 2005 | B2 |
6970445 | O'Neill et al. | Nov 2005 | B2 |
6990088 | Madour | Jan 2006 | B2 |
6990337 | O'Neill et al. | Jan 2006 | B2 |
6990339 | Turanyi et al. | Jan 2006 | B2 |
6990343 | Lefkowitz | Jan 2006 | B2 |
6992994 | Das et al. | Jan 2006 | B2 |
6993332 | Pedersen et al. | Jan 2006 | B2 |
7003311 | Ebata et al. | Feb 2006 | B2 |
7006826 | Cao et al. | Feb 2006 | B2 |
7016317 | Pathak et al. | Mar 2006 | B1 |
7027400 | O'Neill | Apr 2006 | B2 |
7027449 | Garcia-Luna-Aceves et al. | Apr 2006 | B2 |
7047009 | Laroia et al. | May 2006 | B2 |
7068640 | Kakemizu et al. | Jun 2006 | B2 |
7068654 | Joseph et al. | Jun 2006 | B1 |
7069040 | Iwanaga et al. | Jun 2006 | B2 |
7079511 | Abrol et al. | Jul 2006 | B2 |
7089008 | Back et al. | Aug 2006 | B1 |
7116654 | Kim | Oct 2006 | B2 |
7123599 | Yano et al. | Oct 2006 | B2 |
7130291 | Kim et al. | Oct 2006 | B1 |
7155236 | Chen et al. | Dec 2006 | B2 |
7161913 | Jung | Jan 2007 | B2 |
7167447 | Puuskari et al. | Jan 2007 | B2 |
7177641 | Miernik et al. | Feb 2007 | B1 |
7184771 | Mouly et al. | Feb 2007 | B1 |
7197318 | Schwarz et al. | Mar 2007 | B2 |
7233583 | Asthana et al. | Jun 2007 | B2 |
7233794 | Grob et al. | Jun 2007 | B2 |
7263357 | Lee et al. | Aug 2007 | B2 |
7266100 | Le et al. | Sep 2007 | B2 |
7272122 | Trossen et al. | Sep 2007 | B2 |
7283495 | Lee et al. | Oct 2007 | B2 |
7283511 | Hans et al. | Oct 2007 | B2 |
7290063 | Kalliokulju et al. | Oct 2007 | B2 |
7315554 | Baum et al. | Jan 2008 | B2 |
7330542 | Kauhanen et al. | Feb 2008 | B2 |
7336953 | Kim et al. | Feb 2008 | B2 |
7369855 | ONeill et al. | May 2008 | B2 |
7369859 | Gallagher | May 2008 | B2 |
7376101 | Shim et al. | May 2008 | B2 |
7389110 | Lee | Jun 2008 | B2 |
7391741 | Kang | Jun 2008 | B2 |
7403789 | Takano et al. | Jul 2008 | B2 |
7408917 | Kyung et al. | Aug 2008 | B1 |
7408950 | Okuyama | Aug 2008 | B2 |
7409428 | Brabec et al. | Aug 2008 | B1 |
7418264 | Kim | Aug 2008 | B2 |
7420957 | Kim et al. | Sep 2008 | B2 |
7460504 | Tsirtsis et al. | Dec 2008 | B2 |
7492762 | Chowdhury | Feb 2009 | B2 |
7499401 | Buddhikot et al. | Mar 2009 | B2 |
7505765 | Frangione et al. | Mar 2009 | B2 |
7515561 | Koodli et al. | Apr 2009 | B2 |
7525940 | Trossen et al. | Apr 2009 | B2 |
7529239 | Seppanen | May 2009 | B2 |
7567639 | Huh et al. | Jul 2009 | B2 |
7583592 | Park et al. | Sep 2009 | B2 |
7593364 | Asthana | Sep 2009 | B2 |
7623493 | Baba et al. | Nov 2009 | B2 |
7653415 | Van Rooyen | Jan 2010 | B2 |
7668541 | O'Neill et al. | Feb 2010 | B2 |
7672254 | Kim et al. | Mar 2010 | B2 |
7702309 | Faccin et al. | Apr 2010 | B2 |
7706739 | Kjellberg | Apr 2010 | B2 |
7729350 | Singh et al. | Jun 2010 | B2 |
7742781 | Chen et al. | Jun 2010 | B2 |
7773947 | Gerlach | Aug 2010 | B2 |
7962142 | O'Neill et al. | Jun 2011 | B2 |
8112102 | Fischer | Feb 2012 | B2 |
8134976 | Wallace et al. | Mar 2012 | B2 |
8144664 | Pani et al. | Mar 2012 | B2 |
8165587 | Dahlen et al. | Apr 2012 | B2 |
8184615 | Tsirtsis et al. | May 2012 | B2 |
8229120 | Iwamura et al. | Jul 2012 | B2 |
8509799 | Park et al. | Aug 2013 | B2 |
8583044 | Dua | Nov 2013 | B2 |
8588777 | Grob et al. | Nov 2013 | B2 |
8615241 | Gupta et al. | Dec 2013 | B2 |
8830818 | Damnjanovic | Sep 2014 | B2 |
20010019545 | Okubo et al. | Sep 2001 | A1 |
20020061009 | Sorensen | May 2002 | A1 |
20020064144 | Einola et al. | May 2002 | A1 |
20020065785 | Tsuda | May 2002 | A1 |
20020067706 | Bautz et al. | Jun 2002 | A1 |
20020075859 | Mizell et al. | Jun 2002 | A1 |
20020082038 | Mochizuki | Jun 2002 | A1 |
20020085518 | Lim | Jul 2002 | A1 |
20020107908 | Dharanikota | Aug 2002 | A1 |
20020114308 | Takano et al. | Aug 2002 | A1 |
20020126701 | Requena et al. | Sep 2002 | A1 |
20020136226 | Christoffel et al. | Sep 2002 | A1 |
20020161927 | Inoue et al. | Oct 2002 | A1 |
20020168982 | Sorokine et al. | Nov 2002 | A1 |
20020199012 | Cable et al. | Dec 2002 | A1 |
20030009580 | Chen et al. | Jan 2003 | A1 |
20030009582 | Qiao et al. | Jan 2003 | A1 |
20030018774 | Flinck et al. | Jan 2003 | A1 |
20030026220 | Uhlik et al. | Feb 2003 | A1 |
20030027572 | Karlsson et al. | Feb 2003 | A1 |
20030032430 | Lee | Feb 2003 | A1 |
20030036392 | Yukie | Feb 2003 | A1 |
20030078047 | Lee et al. | Apr 2003 | A1 |
20030092444 | Sengodan et al. | May 2003 | A1 |
20030101307 | Gemelli et al. | May 2003 | A1 |
20030103496 | Lakshmi Narayanan et al. | Jun 2003 | A1 |
20030104814 | Gwon et al. | Jun 2003 | A1 |
20030112766 | Riedel et al. | Jun 2003 | A1 |
20030119516 | Tomishima et al. | Jun 2003 | A1 |
20030204599 | Trossen et al. | Oct 2003 | A1 |
20030214922 | Shahrier | Nov 2003 | A1 |
20030216140 | Chambert | Nov 2003 | A1 |
20030217096 | McKelvie et al. | Nov 2003 | A1 |
20030227871 | Hsu et al. | Dec 2003 | A1 |
20030236103 | Tamaki et al. | Dec 2003 | A1 |
20040002362 | Chuah et al. | Jan 2004 | A1 |
20040004736 | Ogura et al. | Jan 2004 | A1 |
20040004967 | Nakatsugawa et al. | Jan 2004 | A1 |
20040008630 | Corson et al. | Jan 2004 | A1 |
20040008632 | Hsu et al. | Jan 2004 | A1 |
20040015607 | Bender et al. | Jan 2004 | A1 |
20040016551 | Bennett | Jan 2004 | A1 |
20040017792 | Khaleghi et al. | Jan 2004 | A1 |
20040017798 | Hurtta et al. | Jan 2004 | A1 |
20040018841 | Trossen | Jan 2004 | A1 |
20040076186 | Chen et al. | Apr 2004 | A1 |
20040087319 | Bos et al. | May 2004 | A1 |
20040090913 | Scudder et al. | May 2004 | A1 |
20040090937 | Chaskar et al. | May 2004 | A1 |
20040104544 | Fan et al. | Jun 2004 | A1 |
20040116153 | Kaminski et al. | Jun 2004 | A1 |
20040120317 | Forssell | Jun 2004 | A1 |
20040139201 | Chaudhary et al. | Jul 2004 | A1 |
20040151148 | Yahagi | Aug 2004 | A1 |
20040151193 | Rune et al. | Aug 2004 | A1 |
20040165551 | Krishnamurthi et al. | Aug 2004 | A1 |
20040166898 | Tajima | Aug 2004 | A1 |
20040179544 | Wilson et al. | Sep 2004 | A1 |
20040192307 | Watanabe et al. | Sep 2004 | A1 |
20040192390 | Tajima | Sep 2004 | A1 |
20040218607 | Hurtta et al. | Nov 2004 | A1 |
20040228301 | Rudolf et al. | Nov 2004 | A1 |
20040228304 | Riedel et al. | Nov 2004 | A1 |
20040242222 | An et al. | Dec 2004 | A1 |
20040253954 | Lee et al. | Dec 2004 | A1 |
20050020262 | Kim | Jan 2005 | A1 |
20050020265 | Funabiki et al. | Jan 2005 | A1 |
20050053043 | Rudolf et al. | Mar 2005 | A1 |
20050058151 | Yeh | Mar 2005 | A1 |
20050059417 | Zhang et al. | Mar 2005 | A1 |
20050063338 | Tsui | Mar 2005 | A1 |
20050063389 | Elliott et al. | Mar 2005 | A1 |
20050079823 | Kurek et al. | Apr 2005 | A1 |
20050089043 | Seckin et al. | Apr 2005 | A1 |
20050090260 | Semper | Apr 2005 | A1 |
20050128949 | Ku et al. | Jun 2005 | A1 |
20050128990 | Eom et al. | Jun 2005 | A1 |
20050141468 | Kim et al. | Jun 2005 | A1 |
20050143072 | Yoon et al. | Jun 2005 | A1 |
20050201324 | Zheng | Sep 2005 | A1 |
20050265303 | Edwards et al. | Dec 2005 | A1 |
20050268153 | Armstrong et al. | Dec 2005 | A1 |
20060002344 | Ono et al. | Jan 2006 | A1 |
20060003768 | Chiou | Jan 2006 | A1 |
20060007936 | Shrum, Jr. et al. | Jan 2006 | A1 |
20060029028 | Kim et al. | Feb 2006 | A1 |
20060056348 | Marinier et al. | Mar 2006 | A1 |
20060067526 | Faccin et al. | Mar 2006 | A1 |
20060069809 | Serlet | Mar 2006 | A1 |
20060089141 | Ho et al. | Apr 2006 | A1 |
20060099948 | Hoghooghi et al. | May 2006 | A1 |
20060099950 | Klein et al. | May 2006 | A1 |
20060104232 | Gidwani | May 2006 | A1 |
20060121883 | Faccin | Jun 2006 | A1 |
20060149845 | Malin et al. | Jul 2006 | A1 |
20060183479 | Liu et al. | Aug 2006 | A1 |
20060217119 | Bosch et al. | Sep 2006 | A1 |
20060221883 | Damnjanovic et al. | Oct 2006 | A1 |
20060230019 | Hill et al. | Oct 2006 | A1 |
20060268924 | Marinier et al. | Nov 2006 | A1 |
20060285520 | Venkitaraman | Dec 2006 | A1 |
20070016637 | Brawn et al. | Jan 2007 | A1 |
20070019584 | Qi et al. | Jan 2007 | A1 |
20070064948 | Tsirtsis et al. | Mar 2007 | A1 |
20070066918 | Dewald et al. | Mar 2007 | A1 |
20070078999 | Corson et al. | Apr 2007 | A1 |
20070083669 | Tsirtsis et al. | Apr 2007 | A1 |
20070086389 | Park et al. | Apr 2007 | A1 |
20070091810 | Kim et al. | Apr 2007 | A1 |
20070099618 | Kim | May 2007 | A1 |
20070105555 | Miernik et al. | May 2007 | A1 |
20070121542 | Lohr et al. | May 2007 | A1 |
20070147283 | Laroia et al. | Jun 2007 | A1 |
20070147286 | Laroia et al. | Jun 2007 | A1 |
20070147377 | Laroia et al. | Jun 2007 | A1 |
20070149126 | Rangan et al. | Jun 2007 | A1 |
20070149194 | Das et al. | Jun 2007 | A1 |
20070171875 | Suda | Jul 2007 | A1 |
20070189282 | Lohr et al. | Aug 2007 | A1 |
20070191054 | Das et al. | Aug 2007 | A1 |
20070191065 | Lee et al. | Aug 2007 | A1 |
20070195788 | Vasamsetti et al. | Aug 2007 | A1 |
20080019293 | Chang et al. | Jan 2008 | A1 |
20080031198 | Hwang et al. | Feb 2008 | A1 |
20080051091 | Phan et al. | Feb 2008 | A1 |
20080074994 | Jen | Mar 2008 | A1 |
20080076424 | Barber et al. | Mar 2008 | A1 |
20080089287 | Sagfors et al. | Apr 2008 | A1 |
20080146231 | Huang et al. | Jun 2008 | A1 |
20080160999 | Eklund | Jul 2008 | A1 |
20080240039 | Parekh et al. | Oct 2008 | A1 |
20080242292 | Koskela et al. | Oct 2008 | A1 |
20080253332 | Ore et al. | Oct 2008 | A1 |
20080259855 | Yoon et al. | Oct 2008 | A1 |
20080261600 | Somasundaram et al. | Oct 2008 | A1 |
20090029706 | Prakash et al. | Jan 2009 | A1 |
20090046573 | Damnjanovic | Feb 2009 | A1 |
20090175448 | Watanabe et al. | Jul 2009 | A1 |
20090181673 | Barrett | Jul 2009 | A1 |
20090190556 | Venkitaraman | Jul 2009 | A1 |
20090191878 | Hedqvist et al. | Jul 2009 | A1 |
20090274086 | Petrovic et al. | Nov 2009 | A1 |
20090285218 | Adamczyk et al. | Nov 2009 | A1 |
20100080126 | Higashida | Apr 2010 | A1 |
20110019614 | ONeill et al. | Jan 2011 | A1 |
20110039546 | Narasimha et al. | Feb 2011 | A1 |
20110039552 | Narasimha et al. | Feb 2011 | A1 |
20110051660 | Arora et al. | Mar 2011 | A1 |
20110103347 | Dimou | May 2011 | A1 |
20110268085 | Barany et al. | Nov 2011 | A1 |
20120087312 | Laroia et al. | Apr 2012 | A1 |
20120327908 | Gupta et al. | Dec 2012 | A1 |
20130208709 | Corson et al. | Aug 2013 | A1 |
20130294324 | Corson et al. | Nov 2013 | A1 |
Number | Date | Country |
---|---|---|
2002353616 | May 2003 | AU |
1043052 | Jun 1990 | CN |
1344477 | Apr 2002 | CN |
1345518 | Apr 2002 | CN |
1416284 | May 2003 | CN |
1481119 | Mar 2004 | CN |
1514607 | Jul 2004 | CN |
1859529 | Nov 2006 | CN |
0740440 | Oct 1996 | EP |
0813346 | Dec 1997 | EP |
0974895 | Jan 2000 | EP |
1088463 | Apr 2001 | EP |
1128704 | Aug 2001 | EP |
1345370 | Sep 2003 | EP |
0926608 | Mar 2004 | EP |
1458209 | Sep 2004 | EP |
1473872 | Nov 2004 | EP |
1489808 | Dec 2004 | EP |
1507421 | Feb 2005 | EP |
1565024 | Aug 2005 | EP |
1720267 | Nov 2006 | EP |
1764942 | Mar 2007 | EP |
2322046 | Aug 1998 | GB |
2395629 | May 2004 | GB |
2084807 | Mar 1990 | JP |
08116329 | May 1996 | JP |
11308273 | Nov 1999 | JP |
H11341541 | Dec 1999 | JP |
2000125343 | Apr 2000 | JP |
2001217830 | Aug 2001 | JP |
2001237878 | Aug 2001 | JP |
2001245355 | Sep 2001 | JP |
2002111732 | Apr 2002 | JP |
2002165249 | Jun 2002 | JP |
2002281069 | Sep 2002 | JP |
2002281539 | Sep 2002 | JP |
2002537739 | Nov 2002 | JP |
2003060685 | Feb 2003 | JP |
2003111134 | Apr 2003 | JP |
2003348007 | May 2003 | JP |
2003304571 | Oct 2003 | JP |
2003338833 | Nov 2003 | JP |
2004007578 | Jan 2004 | JP |
2004104544 | Apr 2004 | JP |
2004147228 | May 2004 | JP |
2004187256 | Jul 2004 | JP |
2004201289 | Jul 2004 | JP |
2004297130 | Oct 2004 | JP |
2004328637 | Nov 2004 | JP |
2005531173 | Oct 2005 | JP |
2007527177 | Sep 2007 | JP |
2008053889 | Mar 2008 | JP |
4827994 | Nov 2011 | JP |
20040004918 | Jan 2004 | KR |
20040105069 | Dec 2004 | KR |
20050023194 | Mar 2005 | KR |
20050065123 | Jun 2005 | KR |
20050066287 | Jun 2005 | KR |
20070031810 | Mar 2007 | KR |
2117396 | Aug 1998 | RU |
2256299 | Jul 2005 | RU |
2292669 | Jan 2007 | RU |
2294596 | Feb 2007 | RU |
200527930 | Aug 2005 | TW |
9501706 | Jan 1995 | WO |
9804094 | Jan 1998 | WO |
9833288 | Jul 1998 | WO |
9847302 | Oct 1998 | WO |
9856140 | Dec 1998 | WO |
9905828 | Feb 1999 | WO |
9927718 | Jun 1999 | WO |
9966748 | Dec 1999 | WO |
0041426 | Jul 2000 | WO |
0128160 | Apr 2001 | WO |
0158196 | Aug 2001 | WO |
0163947 | Aug 2001 | WO |
0219746 | Mar 2002 | WO |
0243409 | May 2002 | WO |
02056551 | Jul 2002 | WO |
03007484 | Jan 2003 | WO |
03017582 | Feb 2003 | WO |
03092316 | Nov 2003 | WO |
03096657 | Nov 2003 | WO |
03098816 | Nov 2003 | WO |
03105516 | Dec 2003 | WO |
2004068739 | Aug 2004 | WO |
2004079949 | Sep 2004 | WO |
2004105272 | Dec 2004 | WO |
2004107638 | Dec 2004 | WO |
2004114695 | Dec 2004 | WO |
2005011231 | Feb 2005 | WO |
2005048629 | May 2005 | WO |
2005078966 | Aug 2005 | WO |
2005084146 | Sep 2005 | WO |
2005120183 | Dec 2005 | WO |
2006002676 | Jan 2006 | WO |
2006083131 | Aug 2006 | WO |
2006105308 | Oct 2006 | WO |
2007073487 | Jun 2007 | WO |
2007075671 | Jul 2007 | WO |
2007075736 | Jul 2007 | WO |
2007075955 | Jul 2007 | WO |
2008113373 | Sep 2008 | WO |
2008131401 | Oct 2008 | WO |
Entry |
---|
Leon-Grcia, Alberto; “Communication Networks: Fundamental Concepts and Key Architectures”; Jul. 16, 2003; McGraw-Hill; 2nd Edition; pp. 44-52, 429-431. |
Miorandi D. et al.: “Analysis of master-slave protocols for real-time industrial communications over IEEE 802.11 WLANs” Industrial Infomatics, 2004,k 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. |
3GPP, “3rd Generation Partnership Project, Technical Specification Group Radio Access Network, E-UTRAN Mobility Evaluation and Enhancement,(Release 9)”, 3GPP Draft, R1-090856 TP for TR for Mobility Studies, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre, 650, Route des Lucioles, F-06921 Sophia-Antipolis Cedex, France, no. Athens, Greece, Feb. 3, 2009, 16 pgs., XP050318707. |
3GPP TS 36.423, “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E UTRA) and Evolved Universal Terrestrial Radio Access Network (EUTRAN); X2 Application Protocol (X2AP)”, version 0.0.1, Release 8, year 2007, pp. 9. |
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 Parnership 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 Cedex ; 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). |
Basic Knowledge of Communications Term of Switching Hub, Nov. 9. 2006, 2 pgs. |
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-34 (Apr. 2001). |
Bos et al., “A Framework for End-to-End Perceived Quality of Service Negotiation”, IETF Internal Draft, draft-bos-mmusic-sdpgos-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-25 (Sep. 1997). |
Braden, R., “Resource ReSerVation Protocol (RSVP)—Ver. 1 Functional Specification”. IETF, Network Working Group, Request for Comments: 2205, pp. 1-112 (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). |
Co-pending U.S. Appl. No. 08/144,901, filed Oct. 28, 1993. |
Droms, R.: “Dynamic Host Configuration Protocol,” IETF Standard, RFC 2131, Internet Engineering Task Force, IETF, Ch, pp. 1-45, (Mar. 1997) XP015007915. |
Etri, “Source Specific Multicast (SSM) Explicit Multicast (Xcast)” pp. 1-27 (Jun. 28, 2001). |
European Search Report—EP10153235—Search Authority—Munich—Mar. 25, 2010. |
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; Feb. 22, 2010, Mar. 4, 2010, XP050422194, 3 pgs. [retrieved on Mar. 4, 2010]. |
Ian F.A., et al., “Mobility Management in Next-Generation Wireless Systems”, Proceedings of the IEEE, IEEE. New York, us, vol. 87, No. 8, Aug. 1, 1999, XP011044241, ISSN: 0018-9219, pp. 1347-1384. |
International Search Report and Written Opinion—PCT/US2006/036584, International Search Authority—European Patent Office—Mar. 2, 2007. |
Johnson, D., et al., IETF Mobile IP Working Group, “Mobility Support in IPv6,” ; Feb. 26, 2003 Downloaded From http://www.join.uni-muenster.de on Dec. 29, 2004, pp. 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. |
Li, Yalun et al. “Protocol Architecture for Universal Personal Computing,” IEEE Journal on Selected Areas in Communications, IEEE Inc. New York, US, vol. 15, No. 8, Oct. 1, 1997, pp. 1467-1476, XP000721278 ISSN: 0733-8716. |
Loughney, J. et al. “Context Transfer Protocol (CXTP)” IETF Standard, Request for Comments: 4067, Internet Engineering Task Force, IETF, CH, Jul. 2005, XP015041932 ISSN: 0000-0003 pp. 1 to 33. |
Mankin, A., et al., “Resource ReSerVation Protocol (RSVP) Version 1, Applicability Statement: Some Guidelines on Deployment”, IETF, Network Working Group, Request for Comments: 2208, pp. 1-6 (Sep. 1997). |
Marshall, W. et al. “Integration of Resource Management and SIP: SIP Extensions for Resource Management,” IETF Internet Draft, draft-ietf-sip-manyfolks-resource-02.txt, Aug. 2001, pp. 1-28. |
Mockapetris P., “Domain Names—Implentation and Specification”, IETF RFC 1035, Nov. 1987. |
Moy, J., “OSPF Version 2”, Network Working Group, Request for Comments: 2328, pp. 1-244 (Apr. 1998). |
“Network Layer Protocol,” Jul. 13, 2002, chap. 6, pp. 1-35, URL: http://www2.yamanashi-ken.ac.jp/˜itoyo/lecture/network/network06/index06.htm. |
Nortel: “Forward Hand-Off options”, R2-071980, 3GPP TSG-RAN WG2 Meeting #58, Kobe, Japan, May 7-11, 2007, sections 2-3. |
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. |
Perkins, C., “IP Mobility Support”, IBM, Network Working Group, Request for Comments: 2002, pp. 1-79 (Oct. 1996). |
Pollini, G P et al., “Trends in Handover Design” IEEE 34(3), pp. 82-90, Mar. 1, 1996, XP00557380. |
Rosenberg J et al:RFAC 3261: “SIP: Session Initiation Protocol” Jun. 1, 2002, pp. 1-269, XP015009039. |
Schulzrinne et al., “Application-Layer Mobility Using SIP”, 0-7803-7133 IEEE, pp. 29-36, Jan. 2000. |
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-134. |
“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. |
Thulasi, A., et al., “IPv6 Prefix Delegation Using ICMPv6”, Network Working Group, Hewlett-Packard, pp. 1-34, 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”, 35 pgs., Mar. 14, 2003. |
Valko, A.G. et al.: “Cellular IP: A New Approach to Internet Host Mobility” Computer Communication Review, Association for Computing Machinery. New York, US vol. 29, No. 1, Jan. 1999, pp. 50-65, XP000823873 ISSN: 0146-4833, p. 56, Line 7-Line13. |
Wedlund et al: “Mobility Support Using SIP”, Proc. of ACM/IEEE International Conference on Wireless and Mobile Multimedia (WoWMoM '99), Seattle, Washington, Aug. 1999. |
Wroclawski, J., “The Use of RSVP with IETF Integrated Services,” IETF, Network Working Group, Request for Comments: 2210, pp. 1-33 (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; Nov. 9, 2009, XP050392455, 4 pgs. [retrieved on Nov. 19, 2009]. |
Number | Date | Country | |
---|---|---|---|
20070076653 A1 | Apr 2007 | US |
Number | Date | Country | |
---|---|---|---|
60718363 | Sep 2005 | US | |
60796653 | May 2006 | US |