This application is a non-provisional of U.S. Provisional Patent No. 61/249,592, filed Oct. 7, 2009, entitled “SRV Node Selection L2ME Transaction”, U.S. Provisional Patent Application No. 61/250,952, filed on Oct. 13, 2009, entitled “Dynamic SRV Node Selection L2ME Transaction” and U.S. Provisional Patent Application No. 61/252,950, filed on Oct. 19, 2009, entitled “SRV Selection on MoCA Network”, each of which are incorporated by reference herein in their respective entireties.
The present invention relates generally to information networks and specifically to transmitting information such as media information over communication lines such as coaxial cable (hereinafter “coax”), thereby to form a communications network.
Home network technologies using coax are known generally. The Multimedia over Coax Alliance (MoCA™) provides an example of a suitable specification (MoCA 1.1) for networking of digital video and entertainment through existing coaxial cable in the home which has been distributed to an open membership. The MoCA 1.1 specification is incorporated by reference herein in its entirety.
Home networking over coax taps into the vast amounts of unused bandwidth available on the in-home coax. More than 70% of homes in the United States have coax already installed in the home infrastructure. Many have existing coax in one or, more primary entertainment consumption locations such as family rooms, media rooms and master bedrooms—ideal for deploying networks. Home networking technology allows homeowners to utilize this infrastructure as a networking system and to deliver other entertainment and information programming with high QoS (Quality of Service).
The technology underlying home networking over coax provides high speed (270 mbps), high QoS, and the innate security of a shielded, wired connection combined with state of the art packet-level encryption. Coax is designed for carrying high bandwidth video. Today, it is regularly used to securely deliver millions of dollars of pay per view and premium video content on a daily basis. Home networking over coax can also be used as a backbone for multiple wireless access points used to extend the reach of wireless network throughout a consumer's entire home.
Home networking over coax provides a consistent, high throughput, high quality connection through the existing coaxial cables to the places where the video devices currently reside in the home. Home networking over coax provides a primary link for digital entertainment, and may also act in concert with other wired and wireless networks to extend the entertainment experience throughout the home.
Currently, home networking over coax works with access technologies such as ADSL and VDSL services or Fiber to the Home (FTTH), that typically enter the home on a twisted pair or on an optical fiber, operating in a frequency band from a few hundred kilohertz to 8.5 MHz for ADSL and 12 Mhz for VDSL. As services reach the home via xDSL or FTTH, they may be routed via home networking over coax technology and the in-home coax to the video devices. Cable functionalities, such as video, voice and Internet access, may be provided to homes, via coaxial cable, by cable operators, and use coaxial cables running within the homes to reach individual cable service consuming devices locating in various rooms within the home. Typically, home networking over coax type functionalities run in parallel with the cable functionalities, on different frequencies.
It would be desirable to achieve selection of the Selected SRV Node selection with MoCA devices connected by a MoCA home network.
A system and/or method for selection of a Selected Service Node (“SSN”) using MoCA devices connected by a MoCA home network, substantially as shown in and/or described hi connection with at least one of the figures, as set forth more completely in the claims.
The objects and advantages of the invention will be apparent upon consideration of the following detailed description, taken in conjunction with the accompanying drawings, in which like reference characters refer to like parts throughout, and in which:
In the following description of the various embodiments, reference is made to the accompanying drawings, which form a part hereof, and in which is shown by way of illustration various embodiments in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural and functional modifications may be made without departing from the scope and spirit of the present invention.
As will be appreciated by one of skill in the art upon reading the following disclosure, various aspects described herein may be embodied as a method, a data processing system, or a computer program product. Accordingly, those aspects may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, such aspects may take the form of a computer program product stored by one or more computer-readable storage media having computer-readable program code, or instructions, embodied in or on the storage media. Any suitable computer readable storage media may be utilized, including hard disks, CD-ROMs, optical storage devices, magnetic storage devices, and/or any combination thereof.
In addition, various signals representing data or events as described herein may be transferred between a source and a destination in the form of electromagnetic waves traveling through signal-conducting media such as metal wires, optical fibers, and/or wireless transmission media (e.g., air and/or space).
For ease of reference, the following glossary provides definitions for the various abbreviations and notations used in this patent application:
Certain advanced services implemented over the MoCA network (such as IEEE 802.1 Audio Video Bridging Systems (“AVB”) bandwidth reservation) may require the MoCA network to select one node to run a pre-determined service for the whole MoCA network.
If the service is optional, the Network Controller node (“NC”) may not support this optional service. If the NC does not support this optional service, the NC cannot be selected as the SSN. Instead, any SRV-capable—i.e., capable of supporting the advanced, albeit, optional, service—may be selected as the SSN. In some embodiments of the invention, the SRV node selection protocols described herein are preferably orthogonal to the NC selection and NC handover/backup.
In some embodiments of the invention, possible SSN selection rules of an SRV-selected node may be as follows:
Such rules may include requiring a query message to be submitted by any SRV-capable node that may be admitted to the network, one embodiment of which is described below in
At the completion of the query, any SRV-capable nodes that share the same SRV-node-query related information that is relayed by the entry node can be an SRV-selected node. Further, at the completion of the query, preferably all the SRV-capable nodes, including an entry node, as defined below, share the same information regarding which nodes on the network are SRV-capable and which single node, if any, is the SRV-selected node.
If there is no selected node at the end of the query, then the entry node may select itself and then send a notification of its own selection to the network. Alternatively, another of the SRV-capable nodes may be selected and then notify the NC of its selection.
Yet another embodiment of the invention may implement an efficient technique, as follows, to support dynamic SRV selection.
If the SRV-selected node is removed from the network (either via a graceful shut down/failure/and/or power save), this change of topology may be implemented at least in part via a network notification.
The SRV-capable node with the lowest node ID (“NID”) becomes the SRV-selected node and a selection is submitted to notify the other nodes of the selection.
This scheme is preferably fully compliant with current MoCA specifications and preferably does not require any modification to the specifications.
In some embodiments of the invention, when the selected SRV node fails, another SRV-capable node can be dynamically selected as the new SSN. The SRV selection protocol presented may include a recovery protocol to dynamically select one of the SRV-capable nodes as the new SRV-selected node.
The SRV selection protocol can be based on the L2ME architecture message protocol specified in MoCA 1.1 specification and/or 2.0 specification, which are hereby incorporated herein in their respective entireties.
If no node is SRV-capable, an entry node may become the SRV-selected node.
If more than one node (in addition to the entry node) is SRV-capable and no node is the SRV-selected node, the entry node may select the SRV-capable node with the lowest NID as the SRV-selected node.
When SSN submits an SRV node selection L2ME message prior to entering power saved mode (see
An entry node response may be for confirming the entry node's SSN selection to the NC. In response to a communication regarding the SSN selection from the NC, all the other SRV-capable nodes may transmit an empty response (zero length payloads) to the NC.
The NC preferably broadcasts the request to other nodes 106. The NC preferably relays the payload with the request. Each of the other nodes 106 sends a response, at 112. Each of the other nodes 106 preferably identify themselves by a field characterized by a specific bit configuration. Such a field may be generically referred to as a WAVENODE MASK or, alternatively as a bitmask, or node ID (“NID”) bitmask. Such a mask preferably indicates a range of internet protocol (“IP”) addresses. Such addresses may be used to identify the IP addresses for nodes that are SRV-capable.
Each of the responses 112 preferably include the attribute IEs corresponding to each of the other nodes 106. At 114, the NC preferably broadcasts the sum of responses in a message 114. The sum of response messages 114 preferably includes a payload that includes aggregated IEs for each of the other nodes 106 that responded to the device discovery.
Messages, as shown schematically in
The messaging protocol includes wave 0 208, wave 1 210, wave 2 212, and wave 3 214. Wave 0 208 includes a first message submission 216 to NC 204, by entry node 202. Entry node 202 preferably is a node that requires the SRV service and does not know which node is the SSN. To reiterate, at 216, entry node 202 submits a request for an SSN transaction on the network.
At 218, NC 204 preferably notifies the nodes of the entry node's SSN request. Other nodes 206, and entry node 202, respond to the SSN request 218 at 220.
In wave 1 210, at 224, NC 204 notifies entry node 202, as well as the other SRV-capable nodes 222, regarding the responses to the SSN request. Using the responses received at 226, entry node 202 may build a SRV notification message indicating the SRV-capable bitmask (the bitmask that defines which nodes are SRV-capable) and the SRV-selected bitmask (the bitmask which defines which node, if any, is the SSN). In one embodiment of the invention, when the entry node determines that the network already has an SSN, then the entry node can acquiesce to the SSN that is already existent in the network. If there is no SSN in the network, then the entry node can initiate a node selection transaction, and determine whether the entry node should become the SSN or another—e.g., a node with a lower NID, should become the SSN. At 228, the entry node may communicate the information regarding the two bitmasks to the NC.
In wave 2 212, at step 230, NC 204 notifies the other SRV-capable nodes 222 of the entry node's SRV bitmask determinations 226. SRV-capable nodes 222 transmit to NC 204 their acknowledgement of the entry node's determinations, at 232.
In wave 3 214, NC 204 may then notify, in L2ME's concatenated format, as set forth in MoCA specification 1.1, which is hereby incorporated by reference herein in its entirety, or any other suitable MoCA specification, the entry node, as well as the other SRV-capable nodes, of the responses to the SRV indication request, as shown at 234. Preferably thereafter, SRV-capable nodes 222 may respond to the notification at 236. Entry node 202 may preferably respond to this notification with an empty response, at 238.
Wave 0 310 shows that, in some embodiments of the invention, any SRV-capable node 304, upon its admission to the network may submit an SRV node query to the NC 306. NC 306 may notify the other nodes 308 of the entry node's SRV query at 314. SRV-capable nodes' 316 responses may indicate their respective SRV modes, as shown at 318.
Wave 1 312 may show SRV-capable nodes 318 receiving a notification 320 from NC 304. Notification 320 may preferably include the responses to the SRV query. Responses to notification 320 may be sent to the NC at 322.
At the end of the query, all SRV-capable nodes 318, including entry node 302, preferably share the same information regarding which nodes on the network are SRV-capable and which single node, if any, is the SRV-selected node. If there is no SRV-selected node, the SRV-capable node with the lowest node ID (“NID”), or any other suitably selectable node, can become the SRV-selected node and can submit an SRV Node Select to notify the other SRV-capable nodes.
If the SRV-selected node is removed from the network, either by graceful shut down, power save, and/or fails, preferably thereafter, in one embodiment of the invention, the SRV-capable node with lowest NID becomes the SRV-selected node and submits SRV Node Select to notify the other SRV-capable nodes.
Specifically, SRV-selected entry node 402 preferably shows submission of an SRV Node Select 408. The submission preferably notifies the other SRV-capable nodes SRV selection submission, 410. At 412, the SRV-capable nodes 402/406 may preferably respond to NC 404 regarding submission 408.
Thus, one method has been shown that after a link failure between the SSN and the network, one of the SRV-capable node may send an SRV node selection submit L2ME message to the NC.
It should be reiterated that, in addition to node selection upon failure, prior to entering power save mode and/or shut-OFF, the prior SRV-selected node may also remove itself from the group of SKY-capable nodes and sends a L2ME message indicating its non-availability.
An exemplary L2ME SRV Confirmation Transaction according to the invention is set forth below in
NC 504, at 514, preferably notifies all the nodes of the network of entry node's 502 SRV node confirmation submission.
SRV-capable nodes 506 preferably send a response, at 514.
In certain embodiments of the invention, nodes which do not support SRV (not shown), may preferably return general L2ME response error codes.
One embodiment of a possible L2ME Wave 1 Request 510 is shown after Wave 0 508.
In Wave 1 510, NC 504 preferably notifies node 502, as well as nodes 506, of the responses, as shown at 518, to the SRV node confirmation submission in L2ME. This notification may preferably be implemented in the concatenated payload format available in L2ME.
Using the responses received in step 518, entry node 502 may confirm an SRV notification message to indicate:
An SRV-capable node can preferably include an IEEE SRV Device Attribute Information Element (see
As further described herein, upon completion of the L2ME Device Discovery transaction, preferably all the SRV-capable nodes of the MoCA network may preferably share the same information regarding other SRV-capable nodes. Such information may include:
If no node is selected as the SSN, the SSN selection preferably shall be performed.
The table in
In MoCA, the format of the Device Attribute Information Element is defined. The MoCA specification specifies that when the Attribute field is set to 0xFF, the first 16 bits of the Information field define a Vendor ID. Vendor ID is allocated by MoCA to specific Vendors or entities.
Whatever follows the Vendor ID is Vendor specific. In the following embodiment of the invention, TLV TYPE, TLV LENGTH and TLV VALUE are vendor specific—i.e., each vendor has a different value for these fields which is defined by the vendor, and not by MoCA specification. This means that the vendor specific message can be ignored—i.e., the MoCA L2ME protocol delivers these messages over MoCA without interpreting the content of the vendor specific message. Thus, nodes using the MoCA L2ME protocol deliver the IE to the other nodes without attempting to interpret the vendor ID message. Accordingly, the SRV selection protocol, which is implemented using TLV TYPE, TLV LENGTH and TLV VALUE, is an overlay protocol over the MoCA standard L2ME protocol.
The table in
ATTRIBUTE ID 608;
The value of the ATTRIBUTE ID is 0xFF.
LENGTH (UInteger8) 610;
The value of the LENGTH can be 1. In certain embodiments of the invention, the actual length of the Attribute IE in bits is (LENGTH+1)*32.
VENDOR ID 612;
The value of VENDOR ID may preferably be assigned by the MoCA Alliance and any such assignment is incorporated by reference herein.
TLV TYPE 614; (For example, SRV IEEE Audio Video Bridging Systems (“AVB”) (IEEE 802.1Qat), may implement a value of the TLV TYPE as 0. In other embodiments of the invention, this TLV TYPE may be specified to the same or another suitable value(s) for other suitable services)
TLV LENGTH 616; (the length is needed for implementation of the service specified in TLV TYPE 614)
TLV VALUE 618;
It should be noted that an IE according to the invention may include, in the TLV VALUE field, two bitmasks (not shown): one for indicating whether the node is SRV-capable and one for indicating whether this node is the SRV-selected node.
In the first bitmask of the TLV VALUE field, asserting to 1 the bit corresponding to the node's ID may indicate the node is capable of acting as the SRV-capable node of the network. A value of 0 may indicate the node is not capable to act as an SRV-capable node of the network.
In the second bitmask of the TLV VALUE field, asserting to 1 the bit corresponding to the node's ID may indicate the node is the node selected as the SRV node of the network. A value of 0 may indicate the node is not the selected node. The second bitmask is needed either to define whether a selected node exists on the network or, if there is no selected node on the network, then the first bitmask indicates which nodes are SRV-capable and, based on the selection criteria—e.g., the node with the lowest MD—which node should be selected as the SRV node. The second bitmask also indicates to the other SRV-capable nodes that one node has already been selected. This may prevent conflicts based on other nodes requesting to becoming the SRV node.
Regarding SRV selection and confirmation according to the invention: if either 1) the SRV-selected node indicates that the selected SRV node has been removed from the network (due to failure, power state/down, etc.) or 2) the SRV-capable node discovery does not indicate an SRV-selected node, the SRV-capable node with the lowest node ID, or another suitably-selected node, can start acting as the SRV and can confirm the selection to the other SRV-capable nodes by generating a L2ME SRV Confirmation Transaction.
Thus, systems and methods for providing a MoCA SSN selection strategy have been described.
Aspects of the invention have been described in terms of illustrative embodiments thereof. A person having ordinary skill in the art will appreciate that numerous additional embodiments, modifications, and variations may exist that remain within the scope and spirit of the appended claims. For example, one of ordinary skill in the art will appreciate that the steps illustrated in the figures may be performed in other than the recited order and that one or more steps illustrated may be optional. The methods and systems of the above-referenced embodiments may also include other additional elements, steps, computer-executable instructions, or computer-readable data structures. In this regard, other embodiments are disclosed herein as well that can be partially or wholly implemented on a computer-readable medium, for example, by storing computer-executable instructions or modules or by utilizing computer-readable data structures.
Number | Name | Date | Kind |
---|---|---|---|
3836888 | Boenke et al. | Sep 1974 | A |
4413229 | Grant | Nov 1983 | A |
4536875 | Kume et al. | Aug 1985 | A |
4608685 | Jain et al. | Aug 1986 | A |
4893326 | Duran et al. | Jan 1990 | A |
5052029 | James et al. | Sep 1991 | A |
5170415 | Yoshida et al. | Dec 1992 | A |
5343240 | Yu | Aug 1994 | A |
5421030 | Baran | May 1995 | A |
5440335 | Beveridge | Aug 1995 | A |
5570355 | Dail et al. | Oct 1996 | A |
5638374 | Heath | Jun 1997 | A |
5671220 | Tonomura | Sep 1997 | A |
5796739 | Kim et al. | Aug 1998 | A |
5802173 | Hamilton-Piercy et al. | Sep 1998 | A |
5805591 | Naboulsi et al. | Sep 1998 | A |
5805806 | McArthur | Sep 1998 | A |
5815662 | Ong | Sep 1998 | A |
5822677 | Peyrovian | Oct 1998 | A |
5822678 | Evanyk | Oct 1998 | A |
5845190 | Bushue et al. | Dec 1998 | A |
5850400 | Eames et al. | Dec 1998 | A |
5854887 | Kindell et al. | Dec 1998 | A |
5856975 | Rostoker et al. | Jan 1999 | A |
5877821 | Newlin et al. | Mar 1999 | A |
5886732 | Humpleman | Mar 1999 | A |
5896556 | Moreland et al. | Apr 1999 | A |
5917624 | Wagner | Jun 1999 | A |
5930493 | Ottesen et al. | Jul 1999 | A |
5963844 | Dail | Oct 1999 | A |
5982784 | Bell | Nov 1999 | A |
6009465 | Decker et al. | Dec 1999 | A |
6028860 | Laubach et al. | Feb 2000 | A |
6055242 | Doshi et al. | Apr 2000 | A |
6069588 | O'Neill, Jr. | May 2000 | A |
6081519 | Petler | Jun 2000 | A |
6081533 | Laubach et al. | Jun 2000 | A |
6111911 | Sanderford et al. | Aug 2000 | A |
6118762 | Nomura et al. | Sep 2000 | A |
6157645 | Shobatake | Dec 2000 | A |
6167120 | Kikinis | Dec 2000 | A |
6192070 | Poon et al. | Feb 2001 | B1 |
6219409 | Smith et al. | Apr 2001 | B1 |
6229818 | Bell | May 2001 | B1 |
6243413 | Beukema | Jun 2001 | B1 |
6304552 | Chapman et al. | Oct 2001 | B1 |
6307862 | Silverman | Oct 2001 | B1 |
6434151 | Caves et al. | Aug 2002 | B1 |
6466651 | Dailey | Oct 2002 | B1 |
6481013 | Dinwiddie et al. | Nov 2002 | B1 |
6526070 | Bernath et al. | Feb 2003 | B1 |
6553568 | Fijolek et al. | Apr 2003 | B1 |
6563829 | Lyles et al. | May 2003 | B1 |
6567654 | Coronel Arredondo et al. | May 2003 | B1 |
6611537 | Edens et al. | Aug 2003 | B1 |
6622304 | Carhart | Sep 2003 | B1 |
6637030 | Klein | Oct 2003 | B1 |
6650624 | Quigley et al. | Nov 2003 | B1 |
6745392 | Basawapatna et al. | Jun 2004 | B1 |
6763032 | Rabenko et al. | Jul 2004 | B1 |
6785296 | Bell | Aug 2004 | B1 |
6816500 | Mannette et al. | Nov 2004 | B1 |
6831899 | Roy | Dec 2004 | B1 |
6836515 | Kay et al. | Dec 2004 | B1 |
6859899 | Shalvi et al. | Feb 2005 | B2 |
6862270 | Ho | Mar 2005 | B1 |
6877043 | Mallory et al. | Apr 2005 | B2 |
6877166 | Roeck et al. | Apr 2005 | B1 |
6898210 | Cheng et al. | May 2005 | B1 |
6930989 | Jones, IV et al. | Aug 2005 | B1 |
6940833 | Jonas et al. | Sep 2005 | B2 |
6950399 | Bushmitch et al. | Sep 2005 | B1 |
6961314 | Quigley et al. | Nov 2005 | B1 |
6985437 | Vogel | Jan 2006 | B1 |
6996198 | Cvetkovic | Feb 2006 | B2 |
7035270 | Moore et al. | Apr 2006 | B2 |
7065779 | Crocker et al. | Jun 2006 | B1 |
7089580 | Vogel et al. | Aug 2006 | B1 |
7116685 | Brown et al. | Oct 2006 | B2 |
7127734 | Amit | Oct 2006 | B1 |
7133697 | Judd et al. | Nov 2006 | B2 |
7142553 | Ojard et al. | Nov 2006 | B1 |
7146632 | Miller | Dec 2006 | B2 |
7149220 | Beukema et al. | Dec 2006 | B2 |
7194041 | Kadous | Mar 2007 | B2 |
7292527 | Zhou et al. | Nov 2007 | B2 |
7296083 | Barham et al. | Nov 2007 | B2 |
7327754 | Mills et al. | Feb 2008 | B2 |
7372853 | Sharma et al. | May 2008 | B2 |
7460543 | Malik et al. | Dec 2008 | B2 |
7487532 | Robertson et al. | Feb 2009 | B2 |
7532642 | Peacock | May 2009 | B1 |
7532693 | Narasimhan | May 2009 | B1 |
7555064 | Beadle | Jun 2009 | B2 |
7574615 | Weng et al. | Aug 2009 | B2 |
7606256 | Vitebsky et al. | Oct 2009 | B2 |
7652527 | Ido et al. | Jan 2010 | B2 |
7653164 | Lin et al. | Jan 2010 | B2 |
7664065 | Lu | Feb 2010 | B2 |
7675970 | Nemiroff et al. | Mar 2010 | B2 |
7689706 | Jennings | Mar 2010 | B2 |
7860092 | Yoon et al. | Dec 2010 | B2 |
7916756 | Atsumi et al. | Mar 2011 | B2 |
8060615 | Finn | Nov 2011 | B2 |
8176181 | Hyslop et al. | May 2012 | B2 |
8184550 | Beck et al. | May 2012 | B2 |
20010039660 | Vasilevsky | Nov 2001 | A1 |
20020010562 | Schleiss et al. | Jan 2002 | A1 |
20020021465 | Moore et al. | Feb 2002 | A1 |
20020059623 | Rodriguez et al. | May 2002 | A1 |
20020059634 | Terry et al. | May 2002 | A1 |
20020069417 | Kliger | Jun 2002 | A1 |
20020078247 | Lu et al. | Jun 2002 | A1 |
20020078249 | Lu et al. | Jun 2002 | A1 |
20020097821 | Hebron et al. | Jul 2002 | A1 |
20020105970 | Shvodian | Aug 2002 | A1 |
20020136231 | Leatherbury | Sep 2002 | A1 |
20020141347 | Harp et al. | Oct 2002 | A1 |
20020150155 | Florentin et al. | Oct 2002 | A1 |
20020166124 | Gurantz et al. | Nov 2002 | A1 |
20020174423 | Fifield et al. | Nov 2002 | A1 |
20020194605 | Cohen et al. | Dec 2002 | A1 |
20030013453 | Lavaud et al. | Jan 2003 | A1 |
20030016751 | Vetro et al. | Jan 2003 | A1 |
20030022683 | Beckmann et al. | Jan 2003 | A1 |
20030060207 | Sugaya et al. | Mar 2003 | A1 |
20030063563 | Kowalski | Apr 2003 | A1 |
20030066082 | Kliger | Apr 2003 | A1 |
20030099253 | Kim | May 2003 | A1 |
20030152059 | Odman | Aug 2003 | A1 |
20030169769 | Ho et al. | Sep 2003 | A1 |
20030193619 | Farrand | Oct 2003 | A1 |
20030198244 | Ho et al. | Oct 2003 | A1 |
20040004934 | Zhu et al. | Jan 2004 | A1 |
20040037366 | Crawford | Feb 2004 | A1 |
20040047284 | Eidson | Mar 2004 | A1 |
20040107445 | Amit | Jun 2004 | A1 |
20040163120 | Rabenko et al. | Aug 2004 | A1 |
20040172658 | Rakib et al. | Sep 2004 | A1 |
20040177381 | Kliger | Sep 2004 | A1 |
20040224715 | Rosenlof et al. | Nov 2004 | A1 |
20040258062 | Narvaez | Dec 2004 | A1 |
20050015703 | Terry et al. | Jan 2005 | A1 |
20050097196 | Wronski et al. | May 2005 | A1 |
20050152350 | Sung et al. | Jul 2005 | A1 |
20050152359 | Giesberts et al. | Jul 2005 | A1 |
20050175027 | Miller et al. | Aug 2005 | A1 |
20050204066 | Cohen et al. | Sep 2005 | A9 |
20050213405 | Stopler | Sep 2005 | A1 |
20060059400 | Clark et al. | Mar 2006 | A1 |
20060062250 | Payne, III | Mar 2006 | A1 |
20060068708 | Dessert et al. | Mar 2006 | A1 |
20060078001 | Chandra et al. | Apr 2006 | A1 |
20060104201 | Sundberg et al. | May 2006 | A1 |
20060256799 | Eng | Nov 2006 | A1 |
20060256818 | Shvodian et al. | Nov 2006 | A1 |
20060268934 | Shimizu et al. | Nov 2006 | A1 |
20060280194 | Jang et al. | Dec 2006 | A1 |
20070025317 | Bolinth et al. | Feb 2007 | A1 |
20070040947 | Koga | Feb 2007 | A1 |
20070127373 | Ho et al. | Jun 2007 | A1 |
20070160213 | Un et al. | Jul 2007 | A1 |
20070171919 | Godman et al. | Jul 2007 | A1 |
20070183786 | Hinosugi et al. | Aug 2007 | A1 |
20070206551 | Moorti et al. | Sep 2007 | A1 |
20070217436 | Markley et al. | Sep 2007 | A1 |
20070253379 | Kumar et al. | Nov 2007 | A1 |
20070286121 | Kolakowski et al. | Dec 2007 | A1 |
20080037487 | Li et al. | Feb 2008 | A1 |
20080037589 | Kliger | Feb 2008 | A1 |
20080080369 | Sumioka et al. | Apr 2008 | A1 |
20080089268 | Kinder et al. | Apr 2008 | A1 |
20080117919 | Kliger | May 2008 | A1 |
20080117929 | Kliger | May 2008 | A1 |
20080130779 | Levi | Jun 2008 | A1 |
20080178229 | Kliger | Jul 2008 | A1 |
20080189431 | Hyslop et al. | Aug 2008 | A1 |
20080212591 | Wu et al. | Sep 2008 | A1 |
20080225832 | Kaplan et al. | Sep 2008 | A1 |
20080238016 | Chen et al. | Oct 2008 | A1 |
20080259957 | Kliger | Oct 2008 | A1 |
20080271094 | Kliger | Oct 2008 | A1 |
20080273591 | Brooks et al. | Nov 2008 | A1 |
20080279219 | Wu et al. | Nov 2008 | A1 |
20080298241 | Ohana | Dec 2008 | A1 |
20090010263 | Ma et al. | Jan 2009 | A1 |
20090063878 | Schmidt et al. | Mar 2009 | A1 |
20090092154 | Malik et al. | Apr 2009 | A1 |
20090106801 | Horii | Apr 2009 | A1 |
20090122901 | Choi et al. | May 2009 | A1 |
20090165070 | McMullin | Jun 2009 | A1 |
20090217325 | Kliger | Aug 2009 | A1 |
20090252172 | Hare | Oct 2009 | A1 |
20090254794 | Malik et al. | Oct 2009 | A1 |
20090257483 | French et al. | Oct 2009 | A1 |
20090279643 | Shusterman | Nov 2009 | A1 |
20090285212 | Chu et al. | Nov 2009 | A1 |
20090296578 | Bernard et al. | Dec 2009 | A1 |
20090316589 | Shafeeu | Dec 2009 | A1 |
20100031297 | Klein | Feb 2010 | A1 |
20100080312 | Moffatt et al. | Apr 2010 | A1 |
20100150016 | Barr | Jun 2010 | A1 |
20100158013 | Kliger | Jun 2010 | A1 |
20100158015 | Wu | Jun 2010 | A1 |
20100158021 | Kliger | Jun 2010 | A1 |
20100158022 | Kliger | Jun 2010 | A1 |
20100162329 | Ford et al. | Jun 2010 | A1 |
20100174824 | Aloni et al. | Jul 2010 | A1 |
20100185731 | Wu | Jul 2010 | A1 |
20100185759 | Wu | Jul 2010 | A1 |
20100238932 | Kliger | Sep 2010 | A1 |
20100246586 | Ohana | Sep 2010 | A1 |
20100254278 | Kliger | Oct 2010 | A1 |
20100254402 | Kliger | Oct 2010 | A1 |
20100281195 | Daniel et al. | Nov 2010 | A1 |
20100284474 | Kliger | Nov 2010 | A1 |
20100290461 | Kliger | Nov 2010 | A1 |
20100322134 | Wu | Dec 2010 | A1 |
20110001833 | Grinkemeyer et al. | Jan 2011 | A1 |
20110013633 | Klein | Jan 2011 | A1 |
20110113455 | Wu | May 2011 | A1 |
20110205891 | Kliger et al. | Aug 2011 | A1 |
20110206042 | Tarrab et al. | Aug 2011 | A1 |
20110310907 | Klein et al. | Dec 2011 | A1 |
20120093244 | Levi et al. | Apr 2012 | A1 |
Number | Date | Country |
---|---|---|
1422043 | Jun 2003 | CN |
1588827 | Aug 2004 | CN |
101399623 | Apr 2009 | CN |
101632268 | Jan 2010 | CN |
0 385695 | Sep 1990 | EP |
0 622926 | Nov 1994 | EP |
1501326 | Jan 2005 | EP |
60160231 | Aug 1985 | JP |
WO 9827748 | Jun 1998 | WO |
WO 9831133 | Jul 1998 | WO |
WO 9935753 | Jul 1999 | WO |
WO 9946734 | Sep 1999 | WO |
WO 0031725 | Jun 2000 | WO |
WO 0055843 | Sep 2000 | WO |
WO 0180030 | Oct 2001 | WO |
WO 0219623 | Mar 2002 | WO |
WO-0241577 | May 2002 | WO |
Entry |
---|
Multichannel News , MoCA Brewing Up Bigger Bandwidth, Dec. 15, 2008 Interview with CTO Anton Monk, http://www.multichannel.com/article/160878-MoCa—Brewing—Up—bigger—Bandwidth.php downloaded on Mar 29, 2009. |
Ovadia S., “MoCA: Ubiquitous Multimedia Networking in the Home,” Proceedings of the SPIE—The International Society for Optical Engineering SPIE—The Internaitonal Society for Optical Engineering USA, [Online] 2007, XP002584642 ISSN: 0277-786X, Retrieved on Jul. 28, 2010 from the Internet: URL: http://spiedl.aip.org/getpdf/servlet/getPDFServlet?filetype=pdf&id=PSISDG00677600000167760C00000&idtype=cvips&prog=normal>, as cited in European Search Report. |
International Search Report for International Application No. PCT/US03/27253 dated Dec. 30, 2003 (4 pgs). |
International Search Report for International Application No. PCT/US03/27254 dated Feb. 3, 2004 (5 pgs). |
“Home Networking on Coax for Video and Multimedia, Overview for IEEE 802.1AVB”, Shlomo Ovadia, San Ramon/California, May 30, 2007. |
“Microtune Introduces Industry's First 1-GHZ Cable Tuners Compatible with MoCA—Home Networking Standard”, Business Wire, San Francisco, California, Mar. 19, 2007. |
Number | Date | Country | |
---|---|---|---|
20110080850 A1 | Apr 2011 | US |
Number | Date | Country | |
---|---|---|---|
61249592 | Oct 2009 | US | |
61250952 | Oct 2009 | US | |
61252950 | Oct 2009 | US |