The invention relates generally to providing a capability list of a predefined format in a communications network.
Information, including data, audio, video, and voice information, can travel in circuit-switched and/or packet-switched forms over different types of networks, including wireline and wireless networks. The various nodes along a communications path may perform various types of processing functions in addition to routing or forwarding the information toward the next node. These features may include signal processing functions, such as controlling gain and providing noise reduction and echo cancellation. In many cases, the various nodes along a particular communications path may provide the same and/or different signal processing functions. For example, multiple nodes may provide echo cancellation and noise reduction, while other nodes may provide gain control. Further, other nodes may provide echo cancellation, noise reduction, and gain control. Accordingly, all of the communication nodes must be properly controlled and coordinated to provide the appropriate functions at the appropriate places and times. If provisioning of these functions is not properly implemented, the information being transferred along the path may be degraded. Such control and coordination is difficult to implement for relatively static conditions, and even more difficult to implement when the communication path dynamically changes, such as when a node fails and rerouting of the communication path is required.
In general, a method for use in a communications network having plural nodes includes receiving, by a first node, a capability list that has a predefined format and includes plural entries identifying data processing functions supported by one or more nodes along a communications path of a communications session involving the first node. The first node adds at least one additional entry into the capability list in response to determining that the first node supports a data processing function that is not identified in the capability list.
Other or alternative features will become apparent from the following description, from the drawings, and from the claims.
In the following description, numerous details are set forth to provide an understanding of the present invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these details and that numerous variations or modifications from the described embodiments may be possible.
In accordance with some embodiments, an improved coordination protocol among signal processing network equipment (SPNE) in a communications network is provided. This protocol is referred to as an SPNE coordination protocol. Improved coordination among SPNE according to the SPNE coordination protocol is provided by exchanging capability lists identifying capabilities of the SPNE along a communications path, in response to various triggering events. Also, each capability list has a predefined format to provide a modular design for the capability list. The capability list has multiple entries to indicate “data processing functions” supported by SPNE along a communications path. A “data processing function” refers to any one or more of voice enhancement and signal processing functions, with examples being bearer traffic (e.g., voice, data) compression/decompression, automatic level control (or automatic gain control), echo cancellation, noise reduction, and acoustic echo control. In the ensuing discussion, an SPNE is more generally referred to as a “node” of a communications path.
Each entry in the capability list for identifying a data processing function can have a predefined (known) size (e.g., 2 bytes or some other size). An entry is added to a capability list to indicate a particular data processing function supported by a node, assuming that the particular data processing function is not already identified in the capability list. An entry for a particular data processing function will be absent from the capability list if the particular data processing function is not supported by any node in the communications path. Each entry of the capability list carries just information that is relevant to the control of the particular data processing function.
A capability list is also applicable to different transport protocol designs and is bearer independent. For a given communications session (e.g., voice call session, data transfer session, etc.), different types of transports of the communications network may be utilized, with the different types of transports interconnected by nodes. For example, one transport can be based on NbUP/RTP/UDP/IP (UMTS NbUP over Real-Time Protocol/User Datagram Protocol/Internet Protocol), where NbUP is located in a user plane of a core network and is used to convey data between media gateways (MGWs). Other example transports can be based on RFC/RTP/UDP/IP, I.366.2/ATM (I.366.2 trunking format over Asynchronous Transfer Mode), or TDM (time-division multiplexing). In accordance with some embodiments, a capability list is embedded in a payload of a packet or frame according to any of the protocols listed above to enable easy exchange across different types of transports.
Also, in accordance with some embodiments, a capability list has a generic format that allows the capability list to be encapsulated with appropriate information for inter-operability over different network configurations. The capability list can be applied to either in-band signaling (signaling along the communications path of a communications session) or out-of-band signaling (signaling along a path different than the communications path of a communications session).
Other features and characteristics associated with capability lists are discussed further below.
Some embodiments of the invention operate to provide end-to-end coordination of data processing functions available at the respective nodes along the communications path, including the routing nodes 16 and the communications terminals 12. The coordination of processing functions along the communications path generally involves one or more of the following. The nodes are able to provide their capabilities to other nodes, as well as obtain the capability of other nodes along the communications path. When multiple nodes can support the same data processing functions, the involved nodes are operable to resolve the conflict and to determine whether or not they should implement a certain data processing function on the data being carried along the communication path. When network topologies change, the affected nodes are operable to effectively update each other relative to these changes. Similarly, the nodes may be operable to control the relative provisioning of data processing functions in a dynamic fashion as would be desired when network changes impact the communications path.
In general, the nodes along the communications path determine each other's relative capabilities to provide various data processing functions, and individually determine whether to implement certain data processing functions in light of a rule set that is available to all the nodes along the communications path. Again, these nodes may also include just the routing nodes 16 forming the communication path, or may include the communications terminals 12. The rule set will address the needs of a particular communications session over a communications path, as well as conflicts amongst nodes, when these nodes can provide the same functionality. In operation, there are a set of predefined data processing functions that may be provided by the various nodes along the communications path. A set of functions is defined and updated for a type of communications session. For example, a set of voice signal processing functions is defined for voice communication applications. A set of video signal processing functions is defined for video communication applications.
For each communications path that is supporting traffic in one direction, each node will provide a capability list to at least the next upstream and downstream nodes along the communications path. When each node receives a capability list from an adjacent node, it will make note of the available data processing functions of the other nodes and forward this information to the respective upstream and downstream nodes. As such, each node along the communications path will ultimately recognize the capabilities of the other nodes along the communications path or at least the fact that other nodes along the communication path, either upstream or downstream, are capable of providing certain data processing functions.
In general, data processing functions should be enabled close to the source of traffic of interest to provide the data processing functions effectively. A capability list exchanged in the same direction as the flow of traffic of interest helps nodes in a communications path to identify the presence of other nodes upstream that are offering similar data processing functions. However, it is also advantageous to exchange capability lists in the opposite direction of the flow of traffic of interest. Note, however, that capability lists exchanged in the opposite direction of the flow of traffic of interest is not intended for negotiation and coordination of functions (such as discontinuous transmission or DTX functions) that require coordinated support by the two endpoints of a communications session.
Generally, note that most communications sessions (e.g., voice call sessions, text chat sessions, and so forth) involve bi-directional traffic flows. Therefore, there are two pairs of forward/reverse capability lists. In other words, for a communications session having a first traffic flow in a first direction (from endpoint A to endpoint B), and a second traffic flow in a second, opposite direction (from endpoint B to endpoint A), there will be a first pair of forward capability list and reverse capability list for the first traffic flow, and a second pair of forward capability list and reverse capability list for the second traffic flow.
Note also that capability lists are exchanged on a per-communications session basis. Each communications session will involve its own set of capability list exchanges among nodes involved in the corresponding communications session.
There are two main reasons to communicate a capability list in the opposite direction of traffic flow: load balancing and position-dependent activation. For load balancing, position-insensitive data processing functions can be relocated from a heavily loaded node to a less loaded node downstream. A position-insensitive data processing function refers to a function that can be implemented anywhere along a communications path. The capability of relocating a data processing function to a different downstream node may be desirable for dynamic handling of wide range of traffic processing requirements and network configurations, including as examples cellular, wireline, WiFi (a wireless local area network technology), or WiBro (wireless broadband), within an operator's network. For load balancing purposes, each entry of a capability list can be tagged with information and conditions on the level of support provided by a particular node.
Upon receiving capability list 200B, node SPNE2 (which supports ALC), notes that an upstream node already supports ALC. Therefore, node SPNE2 does not add another entry to the capability list 200B. Node SPNE2 forwards the capability list 200B further downstream.
A reverse (upstream) capability list is also communicated in the direction opposite to the direction of the traffic flow. Node SPNE2 receives or initiates an upstream capability list 202A, which initially does not have entries identifying data processing functions. Since node SPNE2 supports ALC, node SPNE2 adds an entry to the capability list 202A, where the added entry identifies the ALC function. The updated capability list is capability list 202B, which is forwarded to node SPNE1.
Knowing that the ALC function is also available at an SPNE downstream based on the reverse capability list 202B, node SPNE1 has the following options: (1) continue to provide support for ALC; or (2) relinquish ALC support to relieve itself of signal processing overloading if the ALC function for the current communications session is position insensitive. Node SPNE2 then adds another entry to the capability list 202B to indicate support for the ECAN function, and forwards the updated capability list 202C further upstream. Moreover, being the first SPNE offering an echo canceller function, node SPNE1 continues providing its support of this function which is preferred because it is nearer to the source of the traffic.
In most scenarios, it is desirable to activate data processing functions nearer to the traffic source. In some scenarios, however, it is more desirable to activate data processing functions farther away from the source. One example of the latter scenario is discussed below.
In
It is noted that support for the SPNE coordination protocol according to some embodiments at any particular node in a communications environment is optional. For example, a media gateway can be configured to provide null, partial, or full support of the SPNE coordination protocol.
Furthermore, a media gateway can provide active support of the SPNE coordination protocol on a subset of interfaces of the media gateway. The number of interfaces providing active support can be selectively defined or configured. For example, a wireless media gateway with one interface to a wireless access network and another interface to an IP core network may be configured to provide no support for the SPNE coordination protocol for traffic communicated with the wireless access network, but can provide active support for the SPNE coordination protocol for traffic communicated with the IP core network.
It is noted that if a media gateway exists that provides no support for the SPNE coordination protocol in a communications path, the SPNE coordination protocol is effectively terminated on both sides of the media gateway. As a result, end-to-end SPNE coordination will not be achieved.
Support for the SPNE coordination protocol can be generally classified into three general types: (1) active support; (2) passive support; and (3) no support. Active support is provided by nodes equipped and capable of offering data processing functions. In active support, a node is capable of initiating, receiving, modifying, and interpreting capability lists through at least one communication interface. Where active support is provided at more than one interface of a node (such as at both interfaces of a media gateway), the node is able to relay the capability lists between the interfaces of the node.
Passive support is provided by nodes not capable of offering data processing functions for bearer traffic. However, in passive support, a node is capable of receiving and relaying capability lists between two interfaces.
A node that provides no support for the SPNE coordination protocol will not initiate, receive, or relay capability lists through an interface with an external network. This type of node should be able to ignore capability lists at an input interface.
As discussed above, capability lists exchanged among nodes in a communications path have various features and characteristics. As discussed above, some of these features and characteristics include: portability of the capability lists to different types of transports; in-band or out-of-band communication of the capability lists; and modular design of a capability list.
In one example of support for in-band communication of a capability list, the capability list can be communicated with in-band signaling over a TDM (time-division multiplex) transport. The in-band communication of a capability list over a TDM transport can co-exist with tandem-free operation (TFO) in-band signaling. In the presence of TFO messages over a TDM connection, a capability list can be encapsulated and exchanged in the form of TFO embedded messages, in one implementation.
In addition, according to an embodiment, the predefined and generic format of a capability list allows inter-operability and communication between nodes that provide active protocol support and passive protocol support. Also, a generic design allows for relatively easy enhancement of the SPNE coordination protocol such that format conversion can be avoided.
A further characteristic of a capability list according to an embodiment is that the capability list is designed to be non-intrusive and non-destructive. A capability list is transparent to any nodes not supporting the SPNE coordination protocol. When a capability list is received by a node of a network that is not capable of supporting the SPNE coordination protocol, the capability list can be dropped and ignored without negative impact on bearer traffic processing, negative impact on control signal processing, and negative impact on the operation of the node (e.g., computation and resource usage).
Other features and characteristics according to some embodiments include a re-transmission feature. Re-transmission of capability lists is supported by a node to ensure proper capability update end-to-end in the communications path. In the event of a capability list transmission failure, the originator of the capability list is notified to re-transmit the capability list to the receiver. Transmission failure notification and capability re-transmission is performed on a hop-by-hop basis to minimize bandwidth consumption.
Another feature or characteristic associated with capability lists is backward compatibility such that any new release of the SPNE coordination protocol is backwards compatible with previous versions of the SPNE coordination protocol. In some embodiments, a version field is provided in a capability list to identify a version of the SPNE coordination protocol. This is provided to facilitate proper identification of protocol capability and content.
Capability lists are also designed to ensure forward compatibility. In the event of a version mismatch, the version field of an outgoing capability list is assigned a value equal to the higher value between the received version and the local support version (so that the capability list is updated to indicate support for the more recent version of the SPNE coordination protocol). Enhanced information or newly defined entries in a capability list is transparent to a node supporting an earlier version of the protocol. A node providing active or passive support to an earlier version of the protocol would be able to relay the un-recognized capability list information without corruption to the information or negative impact on the node itself.
Also, as part of the forward compatibility feature, any node that provides active or passive support for an earlier version of the SPNE coordination protocol and that receives a capability list according to a more recent version of the SPNE coordination protocol will ignore any un-recognized fields in the capability list. The node will also maintain the integrity of the un-recognized fields.
The capability list 300 also includes a field 306 containing an AEC (acoustic echo control) field identifier, and a field 308 containing attributes of the AEC function. Further, the capability list 300 includes a field 310 containing a noise reduction field identifier and a field 312 containing attributes of the noise reduction function. Additionally, the capability list 300 includes a field 314 containing an AGC (automatic gain or level control) field identifier, and a field 316 containing attributes of the AGC function.
In addition, the capability list 300 contains a version field 318 to identify the version of the SPNE coordination protocol associated with the capability list 300. Moreover, the capability list 300 has a field 320 that indicates the direction (forward or reverse) of the capability list. A forward capability list is sent in the direction of the corresponding traffic flow, while a reverse capability list is sent in the direction opposite to the corresponding traffic flow.
In the example format of
A particular entry is added to the capability list by a node if the node supports the data processing function associated with the particular entry. A particular entry will be absent from the capability list if the corresponding data processing function is not supported by the node. By not adding entries to the capability list for data processing functions not supported by nodes in a communications path, the average size of capability lists can be reduced to conserve network bandwidth usage. When a node is not adding an entry to a particular capability list, then the node can simply forward the particular capability list without processing the capability list.
In operation, capability lists are exchanged by nodes in a communications path in response to various triggering events, including the following: (1) update of a data processing function capability (e.g., new function added, existing function deleted, or existing function modified); (2) relaying of or reacting to a received capability list (received from another node); (3) change in call topology or change in network configuration that affects the communications session (e.g., call transfer to a different user; handover between different wireless access networks, etc.); (4) a heartbeat communication; (5) setup of a communications session; and (6) insertion of a node into a communications path. Capability lists can be exchanged asynchronously.
Note that due to signaling latency and topology change, nodes in a communications session may not all be activated at the same time. A node providing active support of the SPNE coordination protocol participates in the coordination activity by updating capability lists, if necessary, at its earliest convenience. As an example of the above,
A further feature of the SPNE coordination protocol according to some embodiments is that a heartbeat mechanism for exchanges of capability lists is provided to maintain integrity of communications between active nodes in a communications session. With the heartbeat mechanism, capability lists are exchanged even in the absence of a capability update by any of the active nodes. To avoid flooding a communications path with heartbeat capability lists sent by all active nodes, the heartbeat mechanism provides for release of heartbeat capability lists in a coordinated manner.
An active node releases a heartbeat capability list at predefined time intervals. Specifically, the active node releases a heartbeat capability list a CTime (time interval) after the last capability list release.
In the example of
Also in the example of
As noted above, capability lists are also sent by nodes in response to other triggers, including after call setup or after insertion of a node into a communications path (such as due to a handover, a transfer, and other causes). At call setup or upon insertion of a node into a communications path, the node sends a pair of forward and reverse capability lists for data processing functions for each traffic flow direction.
Another trigger that causes the sending of a capability list by a node is a trigger due to an update of a data processing function in the node, where the update includes insertion of a new data processing function, deletion of an existing data processing function, and modification of an existing data processing function. In response to this trigger event, the node also sends a pair of forward/reverse capability lists for each traffic flow direction.
When a node receives a capability list that is different from a previously received capability list at an input termination point, the node replies with the capability list which was previously sent out from that termination point. For example, in the context of
On the other hand, when a node receives a capability list that is identical to a previously received capability list at the same input termination point, the node does not have to respond by sending capability lists from any termination point (to conserve network bandwidth utilization).
The following describes example use cases to illustrate the use of capability list exchange in the SPNE coordination protocol, in accordance with some embodiments.
As depicted in
Media gateway MGW2 supports the following data processing functions for traffic flow from MS1 to MS2: encoding (e.g., low bit rate encoding); network echo cancellation (EC); and automatic level control (ALC). The media gateway MGW2 supports the following data processing functions for traffic flow from MS2 to MS1: decoding (e.g., low bit rate decoding); acoustic echo control (AEC); and automatic level control (ALC).
In the example, capability lists are assumed to be exchanged using in-band messages over TDM. Note that in the discussed example, MGW1 supports TFO negotiation but MGW2 does not. It is assumed that TFO in-band signaling messages have higher priority than SPNE coordination in-band signaling messages. If TFO is not successfully negotiated and established or if TFO is not supported, SPNE coordination message can still be attempted. When TFO is successfully negotiated, traffic exchange is in low bit rate compressed format, and nodes in the communications path are assumed to be disabled. If in-band SPNE coordination is desired after TFO is successfully established, SPNE coordination in-band messages can be carried by the “TFO Embedded Message” mechanism (defined by ETSI TS 128 062, entitled “Inband Tandem Free Operation (TFO) of Speech Codecs; Service Description”, v 6.1.0, published in December 2004).
Also,
indicates that a capability list is sent in the forward direction (same as traffic flow), and indicates that data processing function “x” is supported by a node upstream and function “y” is supported by the local node.
On the other hand,
indicates that a capability list is sent in the reverse direction (against traffic flow), and indicates that data processing function “x” is supported by a node downstream and function “y” is supported by the local node.
Also, in
At time T0, call setup is performed, in which media gateway 1 (MGW1) and media gateway 2 (MGW2) are through connected with duplex traffic. At time T1, MGW1 starts TFO negotiation by transmitting TFO in-band messages on TDM traffic toward MGW2, and MGW2 starts SPNE coordination protocol by transmitting messages containing capability lists.
At time T1, MGW1 continues TFO negotiation with no response. MGW2 continues SPNE capability lists transmission with no response. At this time (prior to receiving a capability list from MGW1), MGW2 determines from the capability list exchanges at 602 that MGW2 is the first and last node with EC and ALC support for MS1→MS2 traffic. MGW2 thus continues EC and ALC support for MS1→MS2 traffic. MGW2 determines from the capability list exchanges at 604 that it is the first and last SPNE with ALC and AEC support for MS1←MS2 traffic. MGW2 thus continues ALC and AEC support on MS1←MS2 traffic.
At time T3, MGW1 stops TFO message transmission after timeout. MGW1 monitors MS1←MS2 traffic from PSTN for TFO messages. MGW1 also starts SPNE coordination protocol. MGW1 transmits SPNE messages and monitors for incoming SPNE messages.
At time T4, capability information exchange has reached a steady state. MGW1 determines from capability list exchanges (606) that it is the first and last node with AEC support for MS1→MS2 traffic. MGW1 continues AEC support for MS1→MS2 traffic. MGW1 also determines from capability list exchanges (606) that it is the first but not the last node with ALC on MS1→MS2 traffic.
MGW2 realizes from capability list exchanges (608) that it is not the first but is the last node with ALC support for MS1→MS2 traffic. According to a defined set of rules, MGW1 continues ALC support for MS1→MS2 traffic, and MGW2 discontinues ALC support for MS1→MS2 traffic. MGW2 also determines from the capability list exchanges (608) that it is the first and last node with EC support for MS1 MS2 traffic. MGW2 thus continues EC support for MS1→MS2 traffic.
Likewise, based on the capability list exchanges (610), MGW1, being the first and last node, continues EC support for MS1←MS2 traffic. Based on the capability list exchanges (612), MGW2, being the first and last node, continues AEC support for MS1←MS2 traffic. MGW2, being the first but not the last node, continues ALC on MS1←MS2 traffic (according to a defined set of rules).
At time T1, capability information exchange has reached steady state. MGW1 determines from capability list exchanges (802) that it is the first and last node with AEC support for MS1→MS2 traffic. MGW1 continues AEC support for MS1→MS2 traffic. MGW1 also determines from capability list exchanges (802) that it is the first but not the last node with ALC support for MS1 MS2 traffic.
MGW2 determines from capability list exchanges (804) that it is not the first but is the last node with ALC on MS1→MS2 traffic. According to a defined set of rules, MGW1 continues ALC support for MS1→MS2 traffic, and MGW2 discontinues ALC support for MS1→MS2 traffic. Likewise, based on the capability list exchanges (806) MGW2, being the first and last node, continues AEC support for MS1←MS2 traffic. According to a defined set of rules, MGW2, being the first but not the last node, continues ALC support for MS1←MS2 traffic. Moreover, based on capability list exchanges (808), MGW1 discontinues ALC support for MS1←MG2 traffic.
At time T2, MS2 handover takes place such that media gateway MGW3 serves MS2 after the handover. At time T3, capability information exchange has reached steady state. MGW1 determines from capability list exchanges (810) that it is the first and last node with AEC and ALC support for MS1→MS2 traffic. MGW1 thus continues AEC and ALC support for MS1→MS2 traffic as before MS2 handover. MGW1 determines from capability list exchanges (816) that it is the first and last node with ALC support for MS1←MS2 traffic. MGW1 re-enables ALC support for MS1←MS2 traffic after MS2 handover. MGW3 determines from capability list exchanges (814) that it is the first and last node with AEC support for MS1←MS2 traffic. MGW3 continues AEC support for MS1←MS2 traffic after MS2 handover. Note that MGW3 also determines from capability list exchanges (812) that ALC and AEC support are provided for MS1→MS2 traffic upstream.
Instructions of various software (e.g., including software 902 depicted in
Data and instructions (of the software) are stored in respective storage devices, which are implemented as one or more machine-readable storage media. The storage media include different forms of memory including semiconductor memory devices such as dynamic or static random access memories (DRAMs or SRAMs), erasable and programmable read-only memories (EPROMs), electrically erasable and programmable read-only memories (EEPROMs) and flash memories; magnetic disks such as fixed, floppy and removable disks; other magnetic media including tape; and optical media such as compact disks (CDs) or digital video disks (DVDs).
While some embodiments have been disclosed with respect to a limited number of embodiments, those skilled in the art will appreciate numerous modifications and variations there from. It is intended that the appended claims cover such modifications and variations as fall within the true spirit and scope of the invention.
This claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Application Ser. No. 60/731,358, entitled “Capability List Design for SNPE Coordination,” filed Oct. 28, 2005, which is hereby incorporated by reference. This is a continuation-in-part of PCT International Application No. PCT/IB2005/000730, entitled “Communicating Processing Capabilities Along a Communications Path,” filed Mar. 21, 2005, which claims priority to U.S. Provisional Application Ser. No. 60/554,605, filed Mar. 19, 2004, both hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
3652798 | McNeilly et al. | Mar 1972 | A |
4048446 | Hafner et al. | Sep 1977 | A |
4455649 | Esteban et al. | Jun 1984 | A |
4545052 | Steierman | Oct 1985 | A |
5295136 | Ashley et al. | Mar 1994 | A |
5375121 | Nishino et al. | Dec 1994 | A |
5612957 | Gregerson et al. | Mar 1997 | A |
5710976 | Hill et al. | Jan 1998 | A |
5740157 | Demiray et al. | Apr 1998 | A |
5905873 | Hartmann et al. | May 1999 | A |
5930264 | Nguyen | Jul 1999 | A |
5933487 | Strickland | Aug 1999 | A |
5995923 | Mermelstein et al. | Nov 1999 | A |
5999529 | Bernstein et al. | Dec 1999 | A |
6006189 | Strawczynski et al. | Dec 1999 | A |
6009467 | Ratcliff et al. | Dec 1999 | A |
6026086 | Lancelot et al. | Feb 2000 | A |
6031904 | An et al. | Feb 2000 | A |
6046999 | Miki et al. | Apr 2000 | A |
6078595 | Jones et al. | Jun 2000 | A |
6141784 | Davis et al. | Oct 2000 | A |
6144667 | Doshi et al. | Nov 2000 | A |
6147988 | Bartholomew et al. | Nov 2000 | A |
6172990 | Deb et al. | Jan 2001 | B1 |
6185424 | Pon et al. | Feb 2001 | B1 |
6246879 | Segura et al. | Jun 2001 | B1 |
6256612 | Vo et al. | Jul 2001 | B1 |
6272358 | Brent et al. | Aug 2001 | B1 |
6275578 | De Trana et al. | Aug 2001 | B1 |
6295302 | Hellwig et al. | Sep 2001 | B1 |
6298055 | Wildfeuer | Oct 2001 | B1 |
6324409 | Shaffer et al. | Nov 2001 | B1 |
6324515 | Rabipour et al. | Nov 2001 | B1 |
6339594 | Civanlar et al. | Jan 2002 | B1 |
6353666 | Henderson et al. | Mar 2002 | B1 |
6389016 | Sabaa et al. | May 2002 | B1 |
6392993 | Hamilton et al. | May 2002 | B1 |
6414964 | Holmquist et al. | Jul 2002 | B1 |
6424637 | Pecen et al. | Jul 2002 | B1 |
6463454 | Lumelsky et al. | Oct 2002 | B1 |
6549945 | Sinibaldi et al. | Apr 2003 | B1 |
6553423 | Chen | Apr 2003 | B1 |
6574469 | Xiang et al. | Jun 2003 | B1 |
6600738 | Alperovich et al. | Jul 2003 | B1 |
6614781 | Elliott et al. | Sep 2003 | B1 |
6625169 | Tofano | Sep 2003 | B1 |
6647428 | Bannai et al. | Nov 2003 | B1 |
6658064 | Rotola-Pukkila et al. | Dec 2003 | B1 |
6671367 | Graf et al. | Dec 2003 | B1 |
6693996 | Mansfield | Feb 2004 | B2 |
6721269 | Cao et al. | Apr 2004 | B2 |
6731627 | Gupta et al. | May 2004 | B1 |
6731647 | Yao | May 2004 | B2 |
6765931 | Rabenko et al. | Jul 2004 | B1 |
6778517 | Lou et al. | Aug 2004 | B1 |
6781983 | Armistead | Aug 2004 | B1 |
6795437 | Räsänen et al. | Sep 2004 | B1 |
6842461 | Harris | Jan 2005 | B2 |
6845089 | Gu et al. | Jan 2005 | B1 |
6850778 | Honkala et al. | Feb 2005 | B1 |
6850883 | Kapanen et al. | Feb 2005 | B1 |
6865220 | Abrishami | Mar 2005 | B2 |
6876646 | Dore et al. | Apr 2005 | B1 |
6885638 | Xu et al. | Apr 2005 | B2 |
6898208 | Sligo et al. | May 2005 | B1 |
6944166 | Perinpanathan et al. | Sep 2005 | B1 |
6956816 | Alexander et al. | Oct 2005 | B1 |
6967958 | Ono et al. | Nov 2005 | B2 |
6967972 | Volftsun et al. | Nov 2005 | B1 |
6973024 | Joseph et al. | Dec 2005 | B1 |
6983163 | Sato et al. | Jan 2006 | B2 |
6985530 | Zerbe | Jan 2006 | B1 |
6990340 | Tamura et al. | Jan 2006 | B2 |
6999459 | Callon et al. | Feb 2006 | B1 |
7006489 | Li et al. | Feb 2006 | B2 |
7023819 | Falsafi | Apr 2006 | B2 |
7054318 | Eneroth et al. | May 2006 | B2 |
7054320 | Lee et al. | May 2006 | B1 |
7058085 | Earnshaw et al. | Jun 2006 | B2 |
7068623 | Barany et al. | Jun 2006 | B1 |
7072358 | Suvanen | Jul 2006 | B2 |
7082143 | LeBlanc et al. | Jul 2006 | B1 |
7085289 | Cromer et al. | Aug 2006 | B2 |
7089011 | Mangal | Aug 2006 | B1 |
7095733 | Yarlagadda et al. | Aug 2006 | B1 |
7103021 | Jou | Sep 2006 | B2 |
7106701 | Stümpert et al. | Sep 2006 | B2 |
7136375 | Koistinen | Nov 2006 | B1 |
7162024 | Wah et al. | Jan 2007 | B2 |
7180892 | Tackin | Feb 2007 | B1 |
7181209 | Tamura | Feb 2007 | B2 |
7203226 | Rabipour et al. | Apr 2007 | B1 |
7233595 | Hollis et al. | Jun 2007 | B1 |
7240000 | Harada | Jul 2007 | B2 |
7245589 | Neulist et al. | Jul 2007 | B2 |
7245931 | Wang et al. | Jul 2007 | B2 |
7280530 | Chang et al. | Oct 2007 | B2 |
7304984 | Butler et al. | Dec 2007 | B2 |
7305229 | Fox et al. | Dec 2007 | B2 |
7349698 | Gallagher et al. | Mar 2008 | B2 |
7369859 | Gallagher | May 2008 | B2 |
7400881 | Kallio | Jul 2008 | B2 |
7471655 | Gallagher et al. | Dec 2008 | B2 |
7483374 | Nilakantan et al. | Jan 2009 | B2 |
7593415 | Li et al. | Sep 2009 | B2 |
7639601 | Rabipour et al. | Dec 2009 | B2 |
7729346 | Lee et al. | Jun 2010 | B2 |
7792096 | Doleh et al. | Sep 2010 | B2 |
20010036158 | Hallenstal et al. | Nov 2001 | A1 |
20010043577 | Barany et al. | Nov 2001 | A1 |
20020001302 | Pickett | Jan 2002 | A1 |
20020013147 | Fauconnier et al. | Jan 2002 | A1 |
20020019881 | Bokhari et al. | Feb 2002 | A1 |
20020027930 | Huh et al. | Mar 2002 | A1 |
20020049860 | Koistinen | Apr 2002 | A1 |
20020054571 | Falsafi | May 2002 | A1 |
20020072364 | Tamura | Jun 2002 | A1 |
20020106029 | Bunn et al. | Aug 2002 | A1 |
20020118673 | Abrishami et al. | Aug 2002 | A1 |
20030005106 | Isoda | Jan 2003 | A1 |
20030032440 | Sato et al. | Feb 2003 | A1 |
20030058822 | Jou | Mar 2003 | A1 |
20030063569 | Kalliokulju et al. | Apr 2003 | A1 |
20030072273 | Aiello et al. | Apr 2003 | A1 |
20030093509 | Li et al. | May 2003 | A1 |
20030112796 | Kwan | Jun 2003 | A1 |
20030117954 | De Neve et al. | Jun 2003 | A1 |
20030123466 | Somekh et al. | Jul 2003 | A1 |
20030123485 | Yi et al. | Jul 2003 | A1 |
20030133423 | LaDue | Jul 2003 | A1 |
20030134653 | Sarkkinen et al. | Jul 2003 | A1 |
20030135376 | Harada | Jul 2003 | A1 |
20030135784 | Yamaguchi et al. | Jul 2003 | A1 |
20030189270 | Wandel et al. | Oct 2003 | A1 |
20030210659 | Chu et al. | Nov 2003 | A1 |
20030233274 | Urken et al. | Dec 2003 | A1 |
20040008652 | Tanzella et al. | Jan 2004 | A1 |
20040010582 | Oliver | Jan 2004 | A1 |
20040037224 | Choi et al. | Feb 2004 | A1 |
20040037314 | Spear | Feb 2004 | A1 |
20040047364 | Briggs et al. | Mar 2004 | A1 |
20040066745 | Joe | Apr 2004 | A1 |
20040073424 | Geppert et al. | Apr 2004 | A1 |
20040090989 | Kobayashi | May 2004 | A1 |
20040100914 | Hellwig et al. | May 2004 | A1 |
20040101125 | Graf et al. | May 2004 | A1 |
20040110539 | El-Maleh et al. | Jun 2004 | A1 |
20040114588 | Bhaskaran | Jun 2004 | A1 |
20040114626 | Cline et al. | Jun 2004 | A1 |
20040114922 | Hardee | Jun 2004 | A1 |
20040131025 | Dohler et al. | Jul 2004 | A1 |
20040131051 | Rabipour et al. | Jul 2004 | A1 |
20040133419 | El-Maleh et al. | Jul 2004 | A1 |
20040136447 | LeBlanc | Jul 2004 | A1 |
20040196867 | Ejzak et al. | Oct 2004 | A1 |
20040208132 | Neulist et al. | Oct 2004 | A1 |
20040228279 | Midtun et al. | Nov 2004 | A1 |
20040252681 | Rabipour et al. | Dec 2004 | A1 |
20040254786 | Kirla et al. | Dec 2004 | A1 |
20040266426 | Marsh et al. | Dec 2004 | A1 |
20040267897 | Hill et al. | Dec 2004 | A1 |
20050007973 | Jang et al. | Jan 2005 | A1 |
20050013281 | Milton et al. | Jan 2005 | A1 |
20050013286 | Holland et al. | Jan 2005 | A1 |
20050027948 | Marlan et al. | Feb 2005 | A1 |
20050048973 | Hou et al. | Mar 2005 | A1 |
20050064907 | Nealon | Mar 2005 | A1 |
20050073977 | Vanghi et al. | Apr 2005 | A1 |
20050074017 | Qian et al. | Apr 2005 | A1 |
20050084094 | Gass et al. | Apr 2005 | A1 |
20050085181 | Tao | Apr 2005 | A1 |
20050099940 | Ohenoja et al. | May 2005 | A1 |
20050105512 | Myhre et al. | May 2005 | A1 |
20050157823 | Sudhakar | Jul 2005 | A1 |
20050172013 | Tan et al. | Aug 2005 | A1 |
20050185604 | Agarwal | Aug 2005 | A1 |
20050195829 | Ward | Sep 2005 | A1 |
20050232232 | Farber et al. | Oct 2005 | A1 |
20050265279 | Markovic et al. | Dec 2005 | A1 |
20050267746 | Jelinek et al. | Dec 2005 | A1 |
20050286466 | Tagg et al. | Dec 2005 | A1 |
20060046658 | Cruz et al. | Mar 2006 | A1 |
20060050664 | Guey | Mar 2006 | A1 |
20060062225 | Li | Mar 2006 | A1 |
20060067221 | Lee et al. | Mar 2006 | A1 |
20060072555 | St. Hilaire et al. | Apr 2006 | A1 |
20060092927 | Li et al. | May 2006 | A1 |
20060133353 | Wang et al. | Jun 2006 | A1 |
20060154686 | Sarkkinen et al. | Jul 2006 | A1 |
20060193289 | Ronneke et al. | Aug 2006 | A1 |
20060198347 | Hurtta et al. | Sep 2006 | A1 |
20060209873 | Knabchen et al. | Sep 2006 | A1 |
20060229068 | Niemela et al. | Oct 2006 | A1 |
20060268845 | He et al. | Nov 2006 | A1 |
20060268888 | Liu et al. | Nov 2006 | A1 |
20060286981 | Suumaki et al. | Dec 2006 | A1 |
20060291454 | Ali | Dec 2006 | A1 |
20060291483 | Sela | Dec 2006 | A1 |
20070011727 | Mielenz et al. | Jan 2007 | A1 |
20070041360 | Gallagher et al. | Feb 2007 | A1 |
20070043558 | Schwarz et al. | Feb 2007 | A1 |
20070123196 | Tamura | May 2007 | A1 |
20070127357 | Tamura | Jun 2007 | A1 |
20070127436 | Karimi-Cherkandi et al. | Jun 2007 | A1 |
20070135165 | Junghanns et al. | Jun 2007 | A1 |
20070140214 | Zoltan | Jun 2007 | A1 |
20070140293 | Agarwal et al. | Jun 2007 | A1 |
20070171841 | Witzel et al. | Jul 2007 | A1 |
20070186002 | Campbell et al. | Aug 2007 | A1 |
20070286082 | Hikspoors et al. | Dec 2007 | A1 |
20080008312 | Ganesamoorthi et al. | Jan 2008 | A1 |
20080039087 | Gallagher et al. | Feb 2008 | A1 |
20080102794 | Keevill et al. | May 2008 | A1 |
20080123596 | Gallagher et al. | May 2008 | A1 |
20080151845 | Jaakkola et al. | Jun 2008 | A1 |
20080225765 | Marinier et al. | Sep 2008 | A1 |
20080240079 | Chu et al. | Oct 2008 | A1 |
20080288245 | El-Maleh et al. | Nov 2008 | A1 |
20080293416 | Yi et al. | Nov 2008 | A1 |
20080316980 | Ahlen et al. | Dec 2008 | A1 |
20100305943 | Witzel et al. | Dec 2010 | A1 |
Number | Date | Country |
---|---|---|
2 336 699 | Jan 2000 | CA |
1504039 | Jun 2004 | CN |
198 29 822 | Jan 2000 | DE |
0 907 280 | Apr 1999 | EP |
1 017 217 | Jul 2000 | EP |
1 0 76 466 | Feb 2001 | EP |
20011715 | Feb 2003 | FI |
2363295 | Dec 2001 | GB |
2 389 486 | Dec 2003 | GB |
WO 99291326 | Jun 1999 | WO |
WO 9940569 | Aug 1999 | WO |
WO 0051330 | Aug 2000 | WO |
WO 0070885 | Nov 2000 | WO |
WO 0126390 | Apr 2001 | WO |
WO 02052414 | Jul 2002 | WO |
WO 03019961 | Mar 2003 | WO |
WO 03043299 | May 2003 | WO |
WO 03103313 | Dec 2003 | WO |
WO 2004019568 | Mar 2004 | WO |
WO 2004075582 | Sep 2004 | WO |
WO 2005050960 | Jun 2005 | WO |
WO 2005089055 | Sep 2005 | WO |
WO 2007061548 | May 2007 | WO |
Number | Date | Country | |
---|---|---|---|
20070104114 A1 | May 2007 | US |
Number | Date | Country | |
---|---|---|---|
60731358 | Oct 2005 | US | |
60554605 | Mar 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | PCT/IB2005/000730 | Mar 2005 | US |
Child | 11589435 | US |