EP2055048B1 - Decoupled connections - Google Patents

Decoupled connections Download PDF

Info

Publication number
EP2055048B1
EP2055048B1 EP07805401A EP07805401A EP2055048B1 EP 2055048 B1 EP2055048 B1 EP 2055048B1 EP 07805401 A EP07805401 A EP 07805401A EP 07805401 A EP07805401 A EP 07805401A EP 2055048 B1 EP2055048 B1 EP 2055048B1
Authority
EP
European Patent Office
Prior art keywords
node
acknowledgement
devices
data
address
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
EP07805401A
Other languages
German (de)
French (fr)
Other versions
EP2055048A2 (en
Inventor
Theodorus A.P.G. Vergoossen
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Koninklijke Philips Electronics NV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics NV filed Critical Koninklijke Philips Electronics NV
Priority to EP07805401A priority Critical patent/EP2055048B1/en
Publication of EP2055048A2 publication Critical patent/EP2055048A2/en
Application granted granted Critical
Publication of EP2055048B1 publication Critical patent/EP2055048B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/17Interaction among intermediate nodes, e.g. hop by hop
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/24Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416Real-time traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/25Flow control; Congestion control with rate being modified by the source upon detecting a change of network conditions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/27Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00Network arrangements, protocols or services for addressing or naming
    • H04L61/09Mapping addresses
    • H04L61/10Mapping addresses of different types
    • H04L61/103Mapping addresses of different types across network layers, e.g. resolution of network layer into physical layer addresses or address resolution protocol [ARP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/324Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/436Interfacing a local distribution network, e.g. communicating with another STB or one or more peripheral devices inside the home
    • H04N21/4363Adapting the video stream to a specific local network, e.g. a Bluetooth® network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/41Structure of client; Structure of client peripherals
    • H04N21/426Internal components of the client ; Characteristics thereof
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/436Interfacing a local distribution network, e.g. communicating with another STB or one or more peripheral devices inside the home
    • H04N21/4363Adapting the video stream to a specific local network, e.g. a Bluetooth® network
    • H04N21/43632Adapting the video stream to a specific local network, e.g. a Bluetooth® network involving a wired protocol, e.g. IEEE 1394
    • H04N21/43635HDMI
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00Details of television systems
    • H04N5/76Television signal recording
    • H04N5/84Television signal recording using optical recording
    • H04N5/85Television signal recording using optical recording on discs or drums

Definitions

  • the invention relates to a decoupled (wireless or optical) connection in an otherwise coupled (wired) connection between a plurality of devices, and in particular relates to methods and nodes for resolving addresses of devices and for acknowledging messages sent across the decoupled connection.
  • US 2004/184431 discloses a home network that includes a master server and several modules.
  • the individual modules are connected to the master server through a bus.
  • the modules provide ways to receive and send data from and to corresponding devices carrying out communications based on protocols thereof.
  • US 2006/120297 discloses a method for network management assisted discovery, includes performing a discovery of network devices in a network; and sending gathered information associated with a first device that supports a first discovery protocol to a second device that supports a second discovery protocol.
  • the method may also include the following: based upon the gathered information, configuring the second device so that the first and second device can communicate with each other.
  • HDMI High-Definition Multimedia Interface
  • HDMI provides an interface between any compatible digital AV source, such as a set-top box, a DVD player, or an A/V receiver and a compatible digital audio and/or video monitor, such as a digital television.
  • CEC Consumer Electronics Control
  • CEC data is transmitted at a relatively low bit rate
  • this protocol can use single byte messages, and feedback from the receiver is required effectively instantaneously after the last bit is transmitted.
  • the CEC protocol does not have any flow control, and having different timing intervals between consecutive messages for new data and retry data increases the complexity.
  • the CEC data is forwarded by a decoupled connection, it is necessary to wait for the returned acknowledgement, which means that the real-time requirements of the ack/nack message cannot be met. If the complete message was captured at the transmitter, forwarded to the receiver via the decoupled connection, and reproduced at the receiver, the message interaction between the transmitter and receiver will be affected and the real-time behaviour of the complete system will be changed.
  • the invention is defined by the independent claims.
  • the dependent claims define advantageous embodiments.
  • aspects of the invention allow address resolution messages in a timing-critical network to work correctly when there is a decoupled (wireless or optical) connection between two or more connected devices.
  • the decoupled connection acts in a transparent way, for example in the same way as copper wire. This reduces the chances of duplicate addresses being allocated to the devices.
  • Another aspect of the invention allows message acknowledgement in a timing-critical network to work correctly when there is a decoupled (wireless or optical) connection between two or more connected devices.
  • the decoupled connection acts in a transparent way, for example in the same way as copper wire. No difference in message sequencing and message order between devices should be observed as a result of using this method.
  • a decoupled connection is a connection which results in a delay between a write operation on the transmit side and a read back operation as a result of the write operation that is significant in comparison to the delay that results from the same operation over a coupled connection, and which affects the operation or effectiveness of a data transmission protocol using the decoupled connection.
  • a coupled connection is a wired connection
  • the decoupled connection can be either a wireless connection or an optical connection.
  • a connection can be 'decoupled', it will be appreciated that it is still possible for this connection to be a physical connection between two nodes, for example in the case of optical fibers being used. It will also be appreciated by a person skilled in the art that other types of decoupled connection can be used in accordance with the invention.
  • Figure 1 shows an audio-visual system 2 in accordance with the invention.
  • a first set of devices 4 are connected to a first node 6 via a coupled connection 8.
  • the first set of devices 4 may comprise one or more devices, and the device or devices can comprise, for example, one or more of a set-top box, a DVD player, an A/V receiver, a compatible digital audio and/or video monitor, such as a digital television, or any other type of compatible digital AV source.
  • a second node 10 is provided which is connected to a second set of devices 12 via a coupled connection 14.
  • the second set of devices 12 may comprise one or more devices, and can again include, for example, one or more of a set-top box, a DVD player, an A/V receiver, a compatible digital audio and/or video monitor, such as a digital television, or any other type of compatible digital AV source.
  • a CEC configuration it is only permitted to have a single registered display device, such as a digital television. If there are several display devices in the configuration, then only the first display device to perform address allocation will be allocated an address. The other display devices will not be able to allocate valid logical addresses. Similar restrictions apply to other types of audio-visual devices, such as DVD players, although in these cases, there might be more than one address available for devices of a particular type.
  • the first node 6 and the second node 10 are connected to each other via a decoupled connection 16.
  • this decoupled connection can be a wireless connection or an optical connection.
  • first and second sets of devices 4, 12 will depend on the particular system and the requirements of the user of the system.
  • the first set of devices 4 in an audio-visual system 2 could comprise audio-visual sources for the system 2
  • the second set of devices 12 could comprise a visual display and/or audio outputs, such as speakers.
  • a decoupled connection allows the display and speakers to be located away from the AV sources, such as on a wall, without having a large number of physical wires or leads trailing from the sources to the display and/or speakers.
  • nodes 6, 10 are illustrated as being separate components to the device or devices in the sets 4, 12, it is possible for a device and a node to be integrally formed.
  • a system could comprise more than two nodes, with each of the nodes communicating with each of the other nodes via a decoupled connection.
  • the devices in the first and second sets of devices 4, 12 are connected to respective data buses or switches (not shown) using coupled connections, and these data buses can be connected to respective nodes 6, 10 via respective coupled connections 8 and 14.
  • Each of the data buses or switches can have a number of physical input ports, such as HDMI ports, whilst the node can have a single physical input port for connection to the data bus.
  • the node can be integrally formed with the data bus, which means that each of the nodes 6, 10 can have a number of physical input ports for connection to respective devices in the first and second sets of devices 4, 12. Therefore, each device is connected directly to its respective node 6, 10. As described above, these connections are coupled connections.
  • Devices that are connected into a system using HDMI can be allocated one of a plurality of possible addresses.
  • there are sixteen possible logical addresses with certain logical addresses usually being assigned to specific types of devices. For example, a display will usually be allocated address 0, while a DVD player will usually be allocated address 4.
  • Each of the first and second nodes 6, 10 has a respective physical address for each input port in the node or bus respectively.
  • the first and second nodes 6, 10 each have a respective associated logical address.
  • each device may also have a logical address, which is either predetermined and allocated to the device, or determined by the device when the device is activated.
  • each of the devices in the first and second sets of devices 4, 12 can be active or inactive.
  • the devices can be activated or deactivated by a user, depending on how the system 2 is to be used. For example, if the user wants to watch a television broadcast, the visual display and set-top box will be activated.
  • the other devices may be deactivated by operating a power button, or by disconnecting the device from a power supply. Alternatively, the other devices may remain active (including being placed in a standby mode), but the display device may be operated to select the data from the set-top box for display.
  • Such operation and functionality is well-known in the art, and will not be described further herein.
  • each of the first and second nodes generates a respective list or data structure, such as a table, which indicates whether any devices connected thereto are active, i.e. the device is connected to a node and is available on the CEC bus.
  • a respective list or data structure such as a table
  • Figure 2 illustrates a method of building a table in the first node 6 and second node 10 in accordance with the invention.
  • step 101 of Figure 2 the first node 6 and the second node 10 are activated, i.e. power is supplied to the first and second nodes 6, 10.
  • the first node 6 polls or scans its input port, which is preferably a CEC port, and specifically each of the possible logical addresses to determine if any active devices are attached to the node 6.
  • the first node 6 may poll its respective data bus for active devices connected to the data bus.
  • This scanning or polling can comprise selecting one of the possible logical addresses and sending a message, such as a single byte message, with the source and destination address for the message corresponding to the selected logical address. If an acknowledgement for the message is received, the logical address is in use. This process repeats for each of the possible logical addresses.
  • the results of the polling step are stored in a table in the first node 6, which is designated Table A.
  • This Table A can contain an entry for each of the logical addresses polled by the first node 6, with an indication of which, if any, active device in the first set of devices 4 is associated with that logical address. Alternatively, if a logical address does not have an associated active device, Table A may not contain an entry for that address. In a further embodiment of the invention, the table may contain a physical address of any active device associated with a logical address, in addition to the relevant logical address.
  • the second node 10 polls or scans its input port, which is again preferably a CEC port, and specifically each of the logical addresses to determine if any active devices are attached to the node 10, or alternatively polls its respective data bus for active devices connected to the data bus, in the same way as the first node 6 in step 103a.
  • its input port which is again preferably a CEC port, and specifically each of the logical addresses to determine if any active devices are attached to the node 10, or alternatively polls its respective data bus for active devices connected to the data bus, in the same way as the first node 6 in step 103a.
  • the results of the polling step are stored in a data structure, such as a table, in the second node 10, which is designated Table B.
  • This Table B can contain an entry for each of the addresses polled by the second node 10, with an indication of which, if any, active device in the second set of devices 12 is associated with that address. Alternatively, if an address does not have an associated active device, Table B may not contain an entry for that address.
  • steps 105a and 105b the first node 6 transmits the contents of Table A to the second node 10 and the second node 10 transmits the contents of Table B to the first node 6 respectively. Both of these transmissions occur over the decoupled connection 16.
  • the first node 6 and second node 10 On reception of the contents of Tables A and B, the first node 6 and second node 10 store the received tables as Table B' and Table A' respectively, in addition to their original tables A and B (steps 107a and 107b). Alternatively, as the nodes 6, 10 poll the same list of addresses, the respective stored and received tables can be combined into a single data structure or table in each node.
  • the first and/or second nodes 6, 10 enable the operation of the data link between the devices in the first set 4 and the devices in the second set 12 (steps 109a and steps 109b). That is, until the nodes receive the copy of the table from the other node, the connection between the devices is disabled, i.e. no CEC messages are transmitted between the nodes, and no acknowledgement messages (whether positive or negative) are generated by the nodes. So-called address reports are sent out by a device when it allocates successfully a logical address. These address reports may advantageously be used by the CEC switches that terminate the decoupled link, for building e.g. routing tables.
  • the address reports that were received by a node while the link was not yet active are regenerated at another node on the other side of the link and vice versa.
  • This step may comprise enabling the complete connection between the devices (i.e. audio-visual data and CEC data in the case of a HDMI connection) or just a specific part of the connection between the devices (i.e. CEC data).
  • the operation may be enabled by one or more of the nodes 6, 10 sending an acknowledgement to the other node 6, 10 indicating that the respective table has been successfully received.
  • the data link or part of the data link not including the CEC link between the devices can be activated prior to the tables being successfully received by the other node.
  • step 111 the nodes 6, 10 operate to transmit data, such as audio-visual and other data, between the devices as described in the HDMI specification.
  • any of the devices in the first and second set of devices 4, 12 can be activated and/or deactivated while the decoupled connection 16 between the first node 6 and second node 10 is active, it is necessary to ensure that the respective tables A and B are current and up to date.
  • the nodes 6, 10 must each periodically poll the logical addresses in order to update their respective tables, to ensure that devices are added to or removed from their tables when they are activated or deactivated. In a preferred embodiment, this periodic polling occurs as often as possible, as devices can be activated or deactivated at any time. This is shown in Figure 2 as the process loops back to steps 103a and 103b after step 111, where the polling steps are repeated. The updated tables are again sent to the other node, so each node has an up to date copy of the table in the other node.
  • devices When devices are activated, they preferably allocate themselves a logical address, and are required by the CEC protocol to send a report to the network indicating its logical and physical addresses. Therefore, this information can be received by the node that the device is connected to, and can be used for updating the table of that node.
  • the nodes are activated before any devices are activated or connected to the nodes, and/or if all devices of the same type (e.g. DVD players) are connected to the same node.
  • an address resolution message which is usually a single byte message, is generated by a first device in the first set of devices 4 for transmission to a second device 20 (step 151).
  • the second device 20 is one of the devices that is in the second set of devices 12 (i.e. one of the devices that is connected to the second node 10 via the coupled connection 14), and if so, whether the device 20 is active or inactive. If the second device 20 is not one of the devices in the second set of devices, it could be that the second device 20 had previously been connected to the second node 10, and has now been physically disconnected. This uncertain connection is indicated as dotted arrow 22 in Figure 1 .
  • step 153 the address resolution message is transmitted from the first device 18 to the first node 6 via the coupled connection 8.
  • the first node 6 determines whether the second device 20 is an active device that is connected to the second node 10. This determination is performed by examining Table B' that is stored in the first node 6, which is the copy of the table generated by the second node 10. If the second device 20 is a device that is currently associated with a logical address, the device will be listed in Table B' with the corresponding address. If the second device 20 is not one of the devices that is currently associated with an address, it will not be listed in Table B'.
  • the first node 6 returns a negative acknowledgement message, otherwise known as a nack message, to the first device 18, and does not forward the address resolution message to the second node 10 (step 157).
  • the nack message may be the absence of a positive acknowledgement message. That is, the source of the transmission can determine that the transmission was unsuccessful if it does not receive a positive acknowledgement message.
  • the first node 6 returns a positive acknowledgement message, otherwise known as an ack message, to the first device 18, and forwards the address resolution message to the second node 10 via the decoupled connection 16 (step 159).
  • a device in the second set of devices 12 is to transmit an address resolution message to a device that might be connected to the first node 6, a corresponding method is used in which the second node 10 examines Table A', which is the copy of the table generated by the first node 6.
  • the copy tables can also be used to return nack messages when longer messages (i.e. multiple byte messages) arrive at the first or second node 6, 10 that are destined for a device that is not active or not connected to the other node.
  • Figure 3 illustrates a method of transmitting an address resolution message from a first device 18 to a second device 20, it will be appreciated that as a CEC connection is bi-directional, a corresponding method can be used for transmitting an address resolution message from the second device 20 to the first device 18.
  • a first device 18 when a first device 18 is to transmit a multiple byte message comprising, for example, a header byte and N data bytes to a second node 20 in a system as shown in Figure 1 , the first node 6 returns an acknowledgement generated by the first node 6 to the first device 18 for the first byte in the message, and subsequently a feedback loop is used in which the first node 6 returns acknowledgements originating from the second device 20 for the first, second, third, etc. bytes as acknowledgements to the second, third, fourth, etc. bytes sent by the first device 6.
  • a signalling diagram illustrating this method is shown in Figure 4 .
  • the CEC protocol transmits messages comprising a plurality of bytes of data, it will be appreciated that the method is applicable to any system which transmits multiple data packet messages.
  • the first device 18 generates and sends a header byte (byte 0) of a multiple byte message comprising N data bytes to the first node 6 (step 201).
  • the first node 6 returns an acknowledgment message to the first device 20 indicating successful reception of the header byte (step 203).
  • this acknowledgement can be generated using the data structures described above with reference to Figures 2 and 3 .
  • the first node 6 then forwards the header byte to the second node 10 via the decoupled connection 16 (step 205).
  • the header byte On reception of the header byte, it is forwarded to the second device 20 (step 207), which generates and returns an acknowledgement or negative acknowledgement message "Ack/Nack-0" as appropriate (step 209).
  • the "Ack/Nack-0" message for the header byte is returned to the first node 6 via the decoupled connection 16 (step 211).
  • the first device 18 After the first device 18 receives the acknowledgement message from the first node 6 for the header byte in step 203, it sends the first data byte of the multiple byte message, "Data byte-1", to the first node 6 (step 213). In order to satisfy the timing requirements of the CEC protocol, the first node 6 the "Ack/Nack-0" message to the first device 18 as an acknowledgement of "Data byte-1" (step 215).
  • Figure 4 indicates that the first device 18 sends "Data byte-1" to the first node 6 before the first node 6 receives the "Ack/Nack-0" message from the second node 10, it will be appreciated that the "Ack/Nack-0" message must be received before reception of "Data byte-1" is completed. It will also be appreciated that the first node 6 could receive the "Ack/Nack-0" message before transmission of "Data byte-1" is completed by the first device 18, so the first node 6 must store the "Ack/Nack-0" message until it is needed. This variation in the timing of the messages could depend on the type of decoupled connection 16 used in the system 2.
  • Data byte-1 is sent to the second node 10 by the first node 6 in step 217, and is forwarded by the second node 10 to the second device 20 in step 219.
  • the acknowledgement message for "Data byte-1", "Ack/Nack-1” will then be used by the first node 6 as an acknowledgement message for "Data byte-2" when it is sent by the first device 18.
  • the process continues with the n th data byte sent by the first device 18 being acknowledged by the first node 6 using the acknowledgement message for the n-1 th data byte generated by the second device 20, until all N data bytes in the message have been sent from the first device 18 to the second device 20. If the acknowledgement message for the N th data byte "Ack/Nack-N" is positive, i.e. it has been received successfully, then "Ack-N" is not required by the first node 6 and is discarded.
  • the CEC protocol allows the transmission of the complete message to be aborted and restarted, which means that the header byte is resent by the first device 18, followed by the N data bytes.
  • the process shown in Figure 4 will return to step 201 and repeat.
  • the first device 18 transmits the last data byte of the message, "Data byte-N", to the first node 6 (step 251), and it is acknowledged using the acknowledgement message for the previous data byte, "Ack/Nack-N-1" (step 253).
  • the last data byte of the message is transmitted to the second node 10 by the first node 6 (step 255) and then to the second device 20 (step 257).
  • the second device 20 receives this last data byte with one or more errors, it returns a negative acknowledgement "Nack-N" to the second node 10 (step 259).
  • the second node 10 On receipt of this "Nack-N" message, the second node 10 must retry sending the complete N-byte message to the second device 20 (step 261). As a result, the second node 10 (and hence the first node 6 for when messages are being sent from a second device 20 to a first device 18) comprises a buffer for storing each of the bytes in the N-byte message.
  • this retransmission of the message to the second device 20 by the second node 10 can be started before a new multiple-byte message is sent from the first device 18.
  • the second node 10 can indicate to the first node 6 that a retry is in progress (step 263), so that if the first device 18 or another device in the first set of devices 4 transmits a data byte from a new message "Data-byte-1" (step 265) or a new message (step 267), the first node 6 can send a Nack message to the source device (step 269) or can temporarily block new data using other means known in the art.
  • the second node 10 informs the first node 6 that the retry has been completed, and that further message transmissions can occur (step 273).
  • the retry may be repeated a finite number of times (for example five). If the transmission is still unsuccessful, the second node 10 may drop the message and inform the first node 6 that further transmissions can continue.
  • the first node 6 can respond with an Ack message (step 277), and the process can proceed as shown in Figure 4 .
  • a computer program may be stored/distributed on a suitable medium, such as an optical storage medium or a solid-state medium supplied together with or as part of other hardware, but may also be distributed in other forms, such as via the Internet or other wired or wireless telecommunication systems. Any reference signs in the claims should not be construed as limiting the scope.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Computer Security & Cryptography (AREA)
  • Communication Control (AREA)
  • Small-Scale Networks (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Piezo-Electric Or Mechanical Vibrators, Or Delay Or Filter Circuits (AREA)
  • Seal Device For Vehicle (AREA)
  • Vehicle Body Suspensions (AREA)

Abstract

Methods and nodes are provided herein that can generate reliable acknowledgements within the time-frame required to transmit a single message over a decoupled connection so as to meet the real-time requirements of the CEC protocol. Specifically, there is provided a method in a communication system, the communication system comprising a first device, a second device, a first node and a second node, the first and second nodes being connected via a decoupled connection, the method comprising sending a plurality of data packets from the first device to the second device via the first and second nodes; on receiving a data packet from the first device, providing an acknowledgement for said data packet from the first node to the first device; wherein the acknowledgement provided to the first device corresponds to an acknowledgement provided to the first node from the second device in respect of a data packet preceding said data packet.

Description

    TECHNICAL FIELD OF THE INVENTION
  • The invention relates to a decoupled (wireless or optical) connection in an otherwise coupled (wired) connection between a plurality of devices, and in particular relates to methods and nodes for resolving addresses of devices and for acknowledging messages sent across the decoupled connection.
  • BACKGROUND TO THE INVENTION
  • US 2004/184431 discloses a home network that includes a master server and several modules. The individual modules are connected to the master server through a bus. The modules provide ways to receive and send data from and to corresponding devices carrying out communications based on protocols thereof.
  • US 2006/120297 discloses a method for network management assisted discovery, includes performing a discovery of network devices in a network; and sending gathered information associated with a first device that supports a first discovery protocol to a second device that supports a second discovery protocol. The method may also include the following: based upon the gathered information, configuring the second device so that the first and second device can communicate with each other.
  • The High-Definition Multimedia Interface (HDMI) is an uncompressed, all-digital audio/video interface. HDMI provides an interface between any compatible digital AV source, such as a set-top box, a DVD player, or an A/V receiver and a compatible digital audio and/or video monitor, such as a digital television.
  • Further developments of the HDMI standard are being made, in particular for providing wireless HDMI connections and also optical HDMI connections. In a conventional system, a number of devices are interconnected by physical HDMI leads, and write and read back operations occur over the connection without delay. However, when a wireless or optical connection is used, the physical wires effectively become 'decoupled', which means that there is a delay between a write operation on the transmit side and a read back operation as a result of the write operation.
  • This is not a problem for the transmission of audio and/or video data over a HDMI connection, as this transmission is unidirectional and does not require fast feedback from the destination to the source. In some cases, feedback may not be required at all. It is also not a problem for the transmission of I2C data, as although acknowledgement on every single byte is required, some delay can be tolerated by only reporting the acknowledgement of the recipient for the last byte of the transmission. In addition, the I2C bus has means for flow control via the so-called clock stretching.
  • However, the delay caused by decoupled connections is a problem for the transmission of Consumer Electronics Control (CEC) data. CEC is an optional protocol in a HDMI system which allows HDMI devices to pass on control functions to all or other devices in the system. These control functions can be originated by a remote control for one of the devices in the system, and can include one-touch play, system standby, one-touch record, timer programming, OSD and device menu control functions.
  • Although CEC data is transmitted at a relatively low bit rate, this protocol can use single byte messages, and feedback from the receiver is required effectively instantaneously after the last bit is transmitted. In addition, the CEC protocol does not have any flow control, and having different timing intervals between consecutive messages for new data and retry data increases the complexity.
  • If the CEC data is forwarded by a decoupled connection, it is necessary to wait for the returned acknowledgement, which means that the real-time requirements of the ack/nack message cannot be met. If the complete message was captured at the transmitter, forwarded to the receiver via the decoupled connection, and reproduced at the receiver, the message interaction between the transmitter and receiver will be affected and the real-time behaviour of the complete system will be changed.
  • Currently, single byte CEC messages are used for a logical address resolution protocol. The address resolution protocol relies on receiving proper acknowledgements, and unique addresses for devices are required for the active devices.
  • SUMMARY OF THE INVENTION
  • It is an object of the invention to provide methods and nodes that can generate reliable acknowledgements within the time-frame required to transmit a single message over a decoupled (wireless or optical) connection so as to meet the real-time requirements of the CEC protocol. The invention is defined by the independent claims. The dependent claims define advantageous embodiments.
  • Aspects of the invention allow address resolution messages in a timing-critical network to work correctly when there is a decoupled (wireless or optical) connection between two or more connected devices. As a result, the decoupled connection acts in a transparent way, for example in the same way as copper wire. This reduces the chances of duplicate addresses being allocated to the devices.
  • Another aspect of the invention allows message acknowledgement in a timing-critical network to work correctly when there is a decoupled (wireless or optical) connection between two or more connected devices. As a result, the decoupled connection acts in a transparent way, for example in the same way as copper wire. No difference in message sequencing and message order between devices should be observed as a result of using this method.
  • These and other aspects of the invention will be apparent from and elucidated with reference to the embodiments described hereinafter.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The invention will now be described, by way of example only, with reference to the following drawings, in which:
    • Figure 1 is a block diagram of a system in accordance with the invention;
    • Figure 2 is a flow chart illustrating the steps in a method in accordance with a first aspect of the invention;
    • Figure 3 is a flow chart illustrating the steps in a method in accordance with a second aspect of the invention;
    • Figure 4 is a timing diagram illustrating a method in accordance with a third aspect of the invention; and
    • Figure 5 is a timing diagram illustrating a further aspect of the method in accordance with the third aspect of the invention.
    DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • Although the invention will be described below with reference to the CEC protocol as used in an audio-visual system connected at least in part in accordance with the HDMI specification, it will be appreciated that that the invention is applicable to any type of system in which data is to be transmitted over a decoupled connection and in which a delay between a write operation on the transmit side and a read back operation as a result of the write operation will impact on the successful operation of the system.
  • In the following, it will be understood that a decoupled connection is a connection which results in a delay between a write operation on the transmit side and a read back operation as a result of the write operation that is significant in comparison to the delay that results from the same operation over a coupled connection, and which affects the operation or effectiveness of a data transmission protocol using the decoupled connection. In the exemplary embodiments described below, a coupled connection is a wired connection, and the decoupled connection can be either a wireless connection or an optical connection. Although a connection can be 'decoupled', it will be appreciated that it is still possible for this connection to be a physical connection between two nodes, for example in the case of optical fibers being used. It will also be appreciated by a person skilled in the art that other types of decoupled connection can be used in accordance with the invention.
  • Figure 1 shows an audio-visual system 2 in accordance with the invention. In the system 2, a first set of devices 4 are connected to a first node 6 via a coupled connection 8. The first set of devices 4 may comprise one or more devices, and the device or devices can comprise, for example, one or more of a set-top box, a DVD player, an A/V receiver, a compatible digital audio and/or video monitor, such as a digital television, or any other type of compatible digital AV source.
  • Futhermore, a second node 10 is provided which is connected to a second set of devices 12 via a coupled connection 14. The second set of devices 12 may comprise one or more devices, and can again include, for example, one or more of a set-top box, a DVD player, an A/V receiver, a compatible digital audio and/or video monitor, such as a digital television, or any other type of compatible digital AV source.
  • In a CEC configuration, it is only permitted to have a single registered display device, such as a digital television. If there are several display devices in the configuration, then only the first display device to perform address allocation will be allocated an address. The other display devices will not be able to allocate valid logical addresses. Similar restrictions apply to other types of audio-visual devices, such as DVD players, although in these cases, there might be more than one address available for devices of a particular type.
  • The first node 6 and the second node 10 are connected to each other via a decoupled connection 16. As described above, this decoupled connection can be a wireless connection or an optical connection.
  • The types and numbers of devices in each of the first and second sets of devices 4, 12 will depend on the particular system and the requirements of the user of the system. In many cases, the first set of devices 4 in an audio-visual system 2 could comprise audio-visual sources for the system 2, while the second set of devices 12 could comprise a visual display and/or audio outputs, such as speakers. In this case, a decoupled connection allows the display and speakers to be located away from the AV sources, such as on a wall, without having a large number of physical wires or leads trailing from the sources to the display and/or speakers.
  • It should be noted that although the nodes 6, 10 are illustrated as being separate components to the device or devices in the sets 4, 12, it is possible for a device and a node to be integrally formed. In addition, although only two nodes are shown in Figure 1, it will be appreciated that a system could comprise more than two nodes, with each of the nodes communicating with each of the other nodes via a decoupled connection.
  • Preferably, the devices in the first and second sets of devices 4, 12 are connected to respective data buses or switches (not shown) using coupled connections, and these data buses can be connected to respective nodes 6, 10 via respective coupled connections 8 and 14. Each of the data buses or switches can have a number of physical input ports, such as HDMI ports, whilst the node can have a single physical input port for connection to the data bus. Alternatively, the node can be integrally formed with the data bus, which means that each of the nodes 6, 10 can have a number of physical input ports for connection to respective devices in the first and second sets of devices 4, 12. Therefore, each device is connected directly to its respective node 6, 10. As described above, these connections are coupled connections.
  • Devices that are connected into a system using HDMI can be allocated one of a plurality of possible addresses. According to the CEC protocol, there are sixteen possible logical addresses, with certain logical addresses usually being assigned to specific types of devices. For example, a display will usually be allocated address 0, while a DVD player will usually be allocated address 4. Each of the first and second nodes 6, 10 has a respective physical address for each input port in the node or bus respectively. The first and second nodes 6, 10 each have a respective associated logical address. As described, each device may also have a logical address, which is either predetermined and allocated to the device, or determined by the device when the device is activated.
  • At any time, each of the devices in the first and second sets of devices 4, 12 can be active or inactive. The devices can be activated or deactivated by a user, depending on how the system 2 is to be used. For example, if the user wants to watch a television broadcast, the visual display and set-top box will be activated. The other devices may be deactivated by operating a power button, or by disconnecting the device from a power supply. Alternatively, the other devices may remain active (including being placed in a standby mode), but the display device may be operated to select the data from the set-top box for display. Such operation and functionality is well-known in the art, and will not be described further herein.
  • In accordance with one aspect of the invention, each of the first and second nodes generates a respective list or data structure, such as a table, which indicates whether any devices connected thereto are active, i.e. the device is connected to a node and is available on the CEC bus. The generation and use of these data structures or tables as described below allows the problems with the real-time requirements of logical address resolution in the CEC protocol to be overcome. Figure 2 illustrates a method of building a table in the first node 6 and second node 10 in accordance with the invention.
  • In step 101 of Figure 2, the first node 6 and the second node 10 are activated, i.e. power is supplied to the first and second nodes 6, 10.
  • In step 103a, the first node 6 polls or scans its input port, which is preferably a CEC port, and specifically each of the possible logical addresses to determine if any active devices are attached to the node 6. Alternatively, the first node 6 may poll its respective data bus for active devices connected to the data bus. This scanning or polling can comprise selecting one of the possible logical addresses and sending a message, such as a single byte message, with the source and destination address for the message corresponding to the selected logical address. If an acknowledgement for the message is received, the logical address is in use. This process repeats for each of the possible logical addresses.
  • The results of the polling step are stored in a table in the first node 6, which is designated Table A. This Table A can contain an entry for each of the logical addresses polled by the first node 6, with an indication of which, if any, active device in the first set of devices 4 is associated with that logical address. Alternatively, if a logical address does not have an associated active device, Table A may not contain an entry for that address. In a further embodiment of the invention, the table may contain a physical address of any active device associated with a logical address, in addition to the relevant logical address.
  • In step 103b, the second node 10 polls or scans its input port, which is again preferably a CEC port, and specifically each of the logical addresses to determine if any active devices are attached to the node 10, or alternatively polls its respective data bus for active devices connected to the data bus, in the same way as the first node 6 in step 103a.
  • The results of the polling step are stored in a data structure, such as a table, in the second node 10, which is designated Table B. This Table B can contain an entry for each of the addresses polled by the second node 10, with an indication of which, if any, active device in the second set of devices 12 is associated with that address. Alternatively, if an address does not have an associated active device, Table B may not contain an entry for that address.
  • In steps 105a and 105b, the first node 6 transmits the contents of Table A to the second node 10 and the second node 10 transmits the contents of Table B to the first node 6 respectively. Both of these transmissions occur over the decoupled connection 16.
  • On reception of the contents of Tables A and B, the first node 6 and second node 10 store the received tables as Table B' and Table A' respectively, in addition to their original tables A and B ( steps 107a and 107b). Alternatively, as the nodes 6, 10 poll the same list of addresses, the respective stored and received tables can be combined into a single data structure or table in each node.
  • In a preferred embodiment of the invention, on successful receipt of the table from the other node, the first and/or second nodes 6, 10 enable the operation of the data link between the devices in the first set 4 and the devices in the second set 12 (steps 109a and steps 109b). That is, until the nodes receive the copy of the table from the other node, the connection between the devices is disabled, i.e. no CEC messages are transmitted between the nodes, and no acknowledgement messages (whether positive or negative) are generated by the nodes. So-called address reports are sent out by a device when it allocates successfully a logical address. These address reports may advantageously be used by the CEC switches that terminate the decoupled link, for building e.g. routing tables. Preferably, the address reports that were received by a node while the link was not yet active are regenerated at another node on the other side of the link and vice versa. This step may comprise enabling the complete connection between the devices (i.e. audio-visual data and CEC data in the case of a HDMI connection) or just a specific part of the connection between the devices (i.e. CEC data). The operation may be enabled by one or more of the nodes 6, 10 sending an acknowledgement to the other node 6, 10 indicating that the respective table has been successfully received. In alternative embodiment of the invention, the data link or part of the data link not including the CEC link between the devices can be activated prior to the tables being successfully received by the other node.
  • In step 111, the nodes 6, 10 operate to transmit data, such as audio-visual and other data, between the devices as described in the HDMI specification.
  • As any of the devices in the first and second set of devices 4, 12 can be activated and/or deactivated while the decoupled connection 16 between the first node 6 and second node 10 is active, it is necessary to ensure that the respective tables A and B are current and up to date.
  • As the CEC protocol does not use any deregister operations, the nodes 6, 10 must each periodically poll the logical addresses in order to update their respective tables, to ensure that devices are added to or removed from their tables when they are activated or deactivated. In a preferred embodiment, this periodic polling occurs as often as possible, as devices can be activated or deactivated at any time. This is shown in Figure 2 as the process loops back to steps 103a and 103b after step 111, where the polling steps are repeated. The updated tables are again sent to the other node, so each node has an up to date copy of the table in the other node.
  • When devices are activated, they preferably allocate themselves a logical address, and are required by the CEC protocol to send a report to the network indicating its logical and physical addresses. Therefore, this information can be received by the node that the device is connected to, and can be used for updating the table of that node.
  • By generating or building these data structures which indicate the addresses that are in use, the problem associated with devices being connected to different nodes and being allocated the same logical address can be overcome. Specifically, when a node sends a copy of its data structure to the other node, it will be immediately apparent if two devices have been allocated the same address. In protocols other than the CEC protocol, action can then be taken by one or more of the nodes to instruct the relevant device or devices to reallocate themselves a logical address. In the CEC protocol, this mechanism is not available, and the only solution is to deactivate or switch off one of the conflicting devices. As a result, when using a system that uses the CEC protocol, it is best if the nodes are activated before any devices are activated or connected to the nodes, and/or if all devices of the same type (e.g. DVD players) are connected to the same node.
  • As described above, the use of the tables and their respective copies in the other node allows the problems with the real-time requirements of logical address resolution in the CEC protocol to be overcome. Specifically, as illustrated in Figure 3, an address resolution message, which is usually a single byte message, is generated by a first device in the first set of devices 4 for transmission to a second device 20 (step 151).
  • At this stage, it is not known whether the second device 20 is one of the devices that is in the second set of devices 12 (i.e. one of the devices that is connected to the second node 10 via the coupled connection 14), and if so, whether the device 20 is active or inactive. If the second device 20 is not one of the devices in the second set of devices, it could be that the second device 20 had previously been connected to the second node 10, and has now been physically disconnected. This uncertain connection is indicated as dotted arrow 22 in Figure 1.
  • In step 153, the address resolution message is transmitted from the first device 18 to the first node 6 via the coupled connection 8.
  • In step 155, the first node 6 determines whether the second device 20 is an active device that is connected to the second node 10. This determination is performed by examining Table B' that is stored in the first node 6, which is the copy of the table generated by the second node 10. If the second device 20 is a device that is currently associated with a logical address, the device will be listed in Table B' with the corresponding address. If the second device 20 is not one of the devices that is currently associated with an address, it will not be listed in Table B'.
  • If the second device 20 is not one of the devices listed in Table B', the first node 6 returns a negative acknowledgement message, otherwise known as a nack message, to the first device 18, and does not forward the address resolution message to the second node 10 (step 157). In accordance with some protocols, such as the CEC protocol, the nack message may be the absence of a positive acknowledgement message. That is, the source of the transmission can determine that the transmission was unsuccessful if it does not receive a positive acknowledgement message.
  • In the following description and claims, whenever the operation of providing a negative acknowledgement is described, it should be considered as covering sending a negative acknowledgement message or failing to send a positive acknowledgement message.
  • If the second device 20 is listed in Table B', the first node 6 returns a positive acknowledgement message, otherwise known as an ack message, to the first device 18, and forwards the address resolution message to the second node 10 via the decoupled connection 16 (step 159).
  • If a device in the second set of devices 12 is to transmit an address resolution message to a device that might be connected to the first node 6, a corresponding method is used in which the second node 10 examines Table A', which is the copy of the table generated by the first node 6.
  • The copy tables can also be used to return nack messages when longer messages (i.e. multiple byte messages) arrive at the first or second node 6, 10 that are destined for a device that is not active or not connected to the other node.
  • Although it is preferred that the tables and their copies are generated as described herein, it will be appreciated that the address resolution message transmission method as shown in Figure 3 can be implemented using tables generated by other methods.
  • Furthermore, although Figure 3 illustrates a method of transmitting an address resolution message from a first device 18 to a second device 20, it will be appreciated that as a CEC connection is bi-directional, a corresponding method can be used for transmitting an address resolution message from the second device 20 to the first device 18.
  • As described above, if CEC data is forwarded over a decoupled connection, it is necessary to wait for the returned acknowledgement, which means that, in a conventional system, the real-time requirements of the ack/nack message cannot be met. If the complete message sent from a first device 18 to a second device 20 was captured at the first node 6, forwarded to the second node 10 via the decoupled connection 16, and reproduced at the second node 10, the message interaction between the first and second devices 18, 20 will be affected and as such the real-time behaviour of the complete system can be changed.
  • Therefore, in accordance with a third aspect of the invention, when a first device 18 is to transmit a multiple byte message comprising, for example, a header byte and N data bytes to a second node 20 in a system as shown in Figure 1, the first node 6 returns an acknowledgement generated by the first node 6 to the first device 18 for the first byte in the message, and subsequently a feedback loop is used in which the first node 6 returns acknowledgements originating from the second device 20 for the first, second, third, etc. bytes as acknowledgements to the second, third, fourth, etc. bytes sent by the first device 6. A signalling diagram illustrating this method is shown in Figure 4.
  • Although the CEC protocol transmits messages comprising a plurality of bytes of data, it will be appreciated that the method is applicable to any system which transmits multiple data packet messages.
  • Specifically, the first device 18 generates and sends a header byte (byte 0) of a multiple byte message comprising N data bytes to the first node 6 (step 201). In order to satisfy the timing requirements of the CEC protocol (i.e. an acknowledgment is required substantially immediately after transmission of each byte), the first node 6 returns an acknowledgment message to the first device 20 indicating successful reception of the header byte (step 203). In some embodiments, this acknowledgement can be generated using the data structures described above with reference to Figures 2 and 3. The first node 6 then forwards the header byte to the second node 10 via the decoupled connection 16 (step 205). On reception of the header byte, it is forwarded to the second device 20 (step 207), which generates and returns an acknowledgement or negative acknowledgement message "Ack/Nack-0" as appropriate (step 209). The "Ack/Nack-0" message for the header byte is returned to the first node 6 via the decoupled connection 16 (step 211).
  • After the first device 18 receives the acknowledgement message from the first node 6 for the header byte in step 203, it sends the first data byte of the multiple byte message, "Data byte-1", to the first node 6 (step 213). In order to satisfy the timing requirements of the CEC protocol, the first node 6 the "Ack/Nack-0" message to the first device 18 as an acknowledgement of "Data byte-1" (step 215).
  • Although Figure 4 indicates that the first device 18 sends "Data byte-1" to the first node 6 before the first node 6 receives the "Ack/Nack-0" message from the second node 10, it will be appreciated that the "Ack/Nack-0" message must be received before reception of "Data byte-1" is completed. It will also be appreciated that the first node 6 could receive the "Ack/Nack-0" message before transmission of "Data byte-1" is completed by the first device 18, so the first node 6 must store the "Ack/Nack-0" message until it is needed. This variation in the timing of the messages could depend on the type of decoupled connection 16 used in the system 2.
  • "Data byte-1" is sent to the second node 10 by the first node 6 in step 217, and is forwarded by the second node 10 to the second device 20 in step 219. The acknowledgement message for "Data byte-1", "Ack/Nack-1" will then be used by the first node 6 as an acknowledgement message for "Data byte-2" when it is sent by the first device 18.
  • The process continues with the nth data byte sent by the first device 18 being acknowledged by the first node 6 using the acknowledgement message for the n-1th data byte generated by the second device 20, until all N data bytes in the message have been sent from the first device 18 to the second device 20. If the acknowledgement message for the Nth data byte "Ack/Nack-N" is positive, i.e. it has been received successfully, then "Ack-N" is not required by the first node 6 and is discarded.
  • If the second device 20 receives any of the bytes with an error and a "Nack-n" message is returned to the first device 18, the CEC protocol allows the transmission of the complete message to be aborted and restarted, which means that the header byte is resent by the first device 18, followed by the N data bytes. Thus, in the event of a "Nack" message being returned to the first device 18, the process shown in Figure 4 will return to step 201 and repeat.
  • However, if there is an error in the last data byte of the message ("Data byte-N") at the second device 20, the feedback loop is not appropriate, as the first device 18 has already received an acknowledgement from the first node 6 for this data byte in the form of the acknowledgement for the penultimate data byte of the message ("Ack/Nack-N-1"). This is illustrated in Figure 5.
  • As shown, the first device 18 transmits the last data byte of the message, "Data byte-N", to the first node 6 (step 251), and it is acknowledged using the acknowledgement message for the previous data byte, "Ack/Nack-N-1" (step 253). The last data byte of the message is transmitted to the second node 10 by the first node 6 (step 255) and then to the second device 20 (step 257).
  • As the second device 20 receives this last data byte with one or more errors, it returns a negative acknowledgement "Nack-N" to the second node 10 (step 259).
  • On receipt of this "Nack-N" message, the second node 10 must retry sending the complete N-byte message to the second device 20 (step 261). As a result, the second node 10 (and hence the first node 6 for when messages are being sent from a second device 20 to a first device 18) comprises a buffer for storing each of the bytes in the N-byte message.
  • Due to the timing specifications in the CEC protocol, this retransmission of the message to the second device 20 by the second node 10 can be started before a new multiple-byte message is sent from the first device 18.
  • The second node 10 can indicate to the first node 6 that a retry is in progress (step 263), so that if the first device 18 or another device in the first set of devices 4 transmits a data byte from a new message "Data-byte-1" (step 265) or a new message (step 267), the first node 6 can send a Nack message to the source device (step 269) or can temporarily block new data using other means known in the art.
  • Once the second device 20 has successfully acknowledged each of the retransmitted data bytes to the second node 10 (step 271), the second node 10 informs the first node 6 that the retry has been completed, and that further message transmissions can occur (step 273).
  • If the second device 20 does not successfully acknowledge each of the retransmitted data bytes to the second node 10, the retry may be repeated a finite number of times (for example five). If the transmission is still unsuccessful, the second node 10 may drop the message and inform the first node 6 that further transmissions can continue.
  • When the first device 18 or other device resends the first byte of the new message (step 275), the first node 6 can respond with an Ack message (step 277), and the process can proceed as shown in Figure 4.
  • It will be appreciated that the method illustrated in Figure 4 does not apply to single byte messages. However, one single-byte message in the CEC protocol is required for the address resolution mechanism, and the timing requirements of the system can then be satisfied using the methods shown in Figures 2 and 3.
  • While the invention has been illustrated and described in detail in the drawings and foregoing description, such illustration and description are to be considered illustrative or exemplary and not restrictive; the invention is not limited to the disclosed embodiments.
  • Other variations to the disclosed embodiments can be understood and effected by those skilled in the art in practicing the claimed invention, from a study of the drawings, the disclosure, and the appended claims. In the claims, the word "comprising" does not exclude other elements or steps, and the indefinite article "a" or "an" does not exclude a plurality. A single processor or other unit may fulfil the functions of several items recited in the claims. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage.
    A computer program may be stored/distributed on a suitable medium, such as an optical storage medium or a solid-state medium supplied together with or as part of other hardware, but may also be distributed in other forms, such as via the Internet or other wired or wireless telecommunication systems. Any reference signs in the claims should not be construed as limiting the scope.

Claims (16)

  1. A method of operating a first node (6), the first node (6) being connected to at least a first device (18) via a wired connection (8), the first node (6) being suitable for connection to a second node (10) via a wireless or optical connection (16), the method executed in the first node (6) comprising:
    - receiving a data structure from the second node (10) via the wireless or optical connection (16), the data structure indicating whether any of a plurality of addresses have devices (12) associated therewith;
    - receiving a message from the first device (18) for a second device (20) connected to the second node (10);
    - examining the data structure to determine whether said second device (20) is a device that is currently associated with an address;
    if said second device (20) is not a device that is currently associated with an address, providing a negative acknowledgement to the first device (18).
  2. A method as claimed in claim 1, further comprising, if the second device (20) is a device that is currently associated with an address, the step of transmitting the message to the second node (10) via the wireless or optical connections (6).
  3. A method as claimed in claim 1 or 2, further comprising, if the second device (20) is a device that is currently associated with an address, the step of transmitting a positive acknowledgement to the first device (18).
  4. A method as claimed in claim 1, 2 or 3, further comprising the steps of:
    - scanning a plurality of addresses at the first node (6) to determine if any devices in a first set of devices (4) being connected to the first node are (6) associated with any of said addresses; and
    - storing the result of the scanning step as a first data structure.
  5. A method as claimed in claim 4, further comprising the step of:
    - providing a copy of the first data structure to the second node (10) via the wireless or optical connection (16).
  6. A method as claimed in claim 4 or 5, wherein the scanning and storing steps are repeated periodically.
  7. A method as claimed in claim 4, 5 or 6, wherein, on receipt of information broadcast by any of said devices in the first set of devices (4) indicating an address that said device is currently associated therewith, the method further comprises:
    - updating the stored data structure to indicate said information.
  8. A method as claimed in claim 4, 5, 6 or 7, wherein the step of scanning comprises, for each address in the plurality of addresses, sending a polling message to the first set of devices (4) with a source and destination address that corresponds to said address in the plurality of addresses.
  9. A method as claimed in claim 8, wherein it is determined that a device in the first set of devices (4) is associated with an address in the plurality of addresses if an acknowledgement is received for a polling message containing said address.
  10. A method as claimed in any of the preceding claims, the method further comprising the steps of:
    - receiving at the first node (6) a plurality of data packets sent from the first device (18) to the second device (20) via the first (6) and second nodes (10);
    - on receiving a data packet from the first device (18), providing an acknowledgement for said data packet from the first node (6) to the first device (18);
    wherein the acknowledgement provided to the first device (18) corresponds to an acknowledgement provided to the first node (6) from the second device (20) in respect of a data packet preceding said data packet.
  11. A method as claimed in claim 10, further comprising:
    - on receiving the first data packet in the plurality of data packets from the first device (19), providing an acknowledgement for said first data packet from the first node (6) to the first device (18), the acknowledgement for the first data packet being generated by the first node (6).
  12. A method as claimed in claim 10 or 11, wherein the acknowledgement can comprise a positive acknowledgement or a negative acknowledgement.
  13. A method as claimed claim 12, wherein, on receipt of a negative acknowledgement from the first node (6), the first device (18) resends the plurality of data packets to the second device (20).
  14. A method as claimed in claim 12 or 13, wherein, on receipt of a negative acknowledgement from the second device (20) in respect of the last data packet in the plurality, the second node (10) resends the plurality of data packets to the second device (20).
  15. A node (6) suitable for connection to other nodes (10) via a wireless or optical connection (16), the node comprising means for performing the steps in the method according to any of claims 1-14.
  16. A node as claimed in claim 15, further comprising:
    - means for receiving a plurality of data packets from a first device (18);
    - means for sending the plurality of data packets to a second node (10) via a wireless or optical connection (16), the second node (10) further transmitting the plurality of data packets to a second device (20);
    - means for receiving an acknowledgement for each data packet in the plurality from the second device (20) via the second node (10);
    - means for providing an acknowledgement to the first device (18) in response to receiving a data packet from the first device (18); wherein the acknowledgement provided to the first device (18) corresponds to the acknowledgement provided from the second device (20) in respect of a data packet preceding said data packet.
EP07805401A 2006-08-18 2007-08-14 Decoupled connections Active EP2055048B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP07805401A EP2055048B1 (en) 2006-08-18 2007-08-14 Decoupled connections

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
EP06119140 2006-08-18
EP07805401A EP2055048B1 (en) 2006-08-18 2007-08-14 Decoupled connections
PCT/IB2007/053223 WO2008020401A2 (en) 2006-08-18 2007-08-14 Decoupled connections

Publications (2)

Publication Number Publication Date
EP2055048A2 EP2055048A2 (en) 2009-05-06
EP2055048B1 true EP2055048B1 (en) 2010-05-05

Family

ID=38969932

Family Applications (1)

Application Number Title Priority Date Filing Date
EP07805401A Active EP2055048B1 (en) 2006-08-18 2007-08-14 Decoupled connections

Country Status (7)

Country Link
US (1) US8054845B2 (en)
EP (1) EP2055048B1 (en)
JP (1) JP5091951B2 (en)
CN (1) CN101507183B (en)
AT (1) ATE467284T1 (en)
DE (1) DE602007006322D1 (en)
WO (1) WO2008020401A2 (en)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5230267B2 (en) 2008-05-27 2013-07-10 キヤノン株式会社 Device control apparatus and control method
US8913527B2 (en) 2008-06-12 2014-12-16 Nokia Corporation Multiple die communication system
US20110194454A1 (en) * 2008-10-08 2011-08-11 Ryosuke Ohmae Wireless transmission system and wireless transmission method
JP5315083B2 (en) * 2009-02-17 2013-10-16 キヤノン株式会社 Display device, method and program
US20120051290A1 (en) * 2009-03-03 2012-03-01 Koichi Murase Wireless communication apparatus, wireless communication method, program, and integrated circuit
US8370536B2 (en) * 2009-04-24 2013-02-05 Analog Devices, Inc. Method and apparatus for providing robust display digital channel transmission
US9237065B2 (en) * 2010-09-16 2016-01-12 Nuvoton Technology Corporation Chip and computer system
US20130173835A1 (en) * 2011-12-29 2013-07-04 Broadcom Corporation Controlling HDMI Devices Via Intelligent Emulation of Consumer Electronics Control (CEC) Protocol
CN107710690B (en) * 2015-06-25 2020-12-11 哉英电子股份有限公司 Host-side transceiver and transceiver system
US11831739B2 (en) 2020-06-22 2023-11-28 Sony Semiconductor Solutions Corporation Communication apparatus and communication system

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6691165B1 (en) * 1998-11-10 2004-02-10 Rainfinity, Inc. Distributed server cluster for controlling network traffic
US6889197B2 (en) * 2000-01-12 2005-05-03 Isuppli Inc. Supply chain architecture
US7698463B2 (en) * 2000-09-12 2010-04-13 Sri International System and method for disseminating topology and link-state information to routing nodes in a mobile ad hoc network
US6957276B1 (en) * 2000-10-23 2005-10-18 Microsoft Corporation System and method of assigning and reclaiming static addresses through the dynamic host configuration protocol
US7117267B2 (en) * 2001-06-28 2006-10-03 Sun Microsystems, Inc. System and method for providing tunnel connections between entities in a messaging system
US20030123394A1 (en) * 2001-11-13 2003-07-03 Ems Technologies, Inc. Flow control between performance enhancing proxies over variable bandwidth split links
US8605623B2 (en) * 2002-05-31 2013-12-10 Koninklijke Philips N.V. Determining and configuring a communication path in a network
JP4369214B2 (en) * 2002-12-11 2009-11-18 パナソニック株式会社 AV system
KR100574519B1 (en) * 2003-03-19 2006-04-27 삼성전자주식회사 Apparatus and method for managing device information via network
KR100568229B1 (en) 2003-07-10 2006-04-07 삼성전자주식회사 A Method And System for Dynamically Refreshing ARP Cash Table on Ad-hoc Network
KR100590866B1 (en) * 2003-12-04 2006-06-19 삼성전자주식회사 apparatus and method for registering wireless terminal using wireless network
KR100631556B1 (en) * 2004-04-06 2006-10-09 삼성전자주식회사 Image processing system and method for processing image
US8930569B2 (en) * 2004-05-05 2015-01-06 Qualcomm Incorporated Methods and apparatus for optimum file transfers in a time-varying network emvironment
WO2005114909A1 (en) 2004-05-21 2005-12-01 Computer Associates Think, Inc. Systems and methods for discovering machines
KR101151148B1 (en) * 2004-11-03 2012-06-01 소니 일렉트로닉스 인코포레이티드 Multimedia display system and multimedia display method for wireless transmission
US7719482B2 (en) * 2004-11-03 2010-05-18 Sony Corporation Method and system for processing wireless digital multimedia
US7869382B2 (en) * 2004-12-06 2011-01-11 Hewlett-Packard Development Company, L.P. Network management assisted discovery
US8312172B2 (en) * 2005-05-26 2012-11-13 Bytemobile, Inc. Method and system for delta compression
US7529256B2 (en) * 2005-07-08 2009-05-05 Cisco Technology, Inc. Communication device client update system and method

Also Published As

Publication number Publication date
CN101507183A (en) 2009-08-12
DE602007006322D1 (en) 2010-06-17
ATE467284T1 (en) 2010-05-15
WO2008020401A3 (en) 2008-07-10
US8054845B2 (en) 2011-11-08
JP5091951B2 (en) 2012-12-05
EP2055048A2 (en) 2009-05-06
CN101507183B (en) 2011-12-21
WO2008020401A2 (en) 2008-02-21
US20100194996A1 (en) 2010-08-05
JP2010502046A (en) 2010-01-21

Similar Documents

Publication Publication Date Title
EP2055048B1 (en) Decoupled connections
JP4091073B2 (en) Home appliance control (CEC) protocol compatible device, CEC command management method, CEC compatible system, and audio / video entertainment system
US8130684B2 (en) Wireless communication system for wirelessly transmitting and receiving CEC message
US7876751B2 (en) Reliable link layer packet retry
WO1999055042A1 (en) System and method for establishing a multicast message delivery error recovery tree in a digital network
JP2002141903A (en) Node configuration information management method and wireless network system
US9276772B2 (en) Method and apparatus for transmitting and receiving data based on secured path bandwidth in network established by using audio/video interface
JP2009049635A (en) Network system, network device, and relay device
JP4879831B2 (en) Wireless communication system
JP2001016209A (en) Information processor and information processing method, and computer-readable medium
JP2002158730A (en) Communication method and communication device
JP2001045056A (en) Communication system
JP2008109711A (en) Radio communication system
WO2010064293A1 (en) Data processing device, system, method and program for data processing, recording medium with program recorded therein, data transfer device, system, method anf program for data transfer, and recording medium with program recorded therein
JPH09282296A (en) System for controlling communication between multiplexed nodes
JP4936469B2 (en) Communications system
JP3148733B2 (en) Signal processing device and signal processing system
JPH06252895A (en) Data transmission system
KR100585677B1 (en) Method for processing message in library based living network control protocol
JP2006100952A (en) Communication device
JPH04273736A (en) Packet communication system and packet re-transmission equipment
KR20120068526A (en) System and method for transmitting data based on udp
JP2006229757A (en) System and management communication equipment for network cooperation
JP2004147081A (en) Radio communication system and radio communication equipment
JP2007028132A (en) Communications system

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20090318

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK RS

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

17Q First examination report despatched

Effective date: 20091021

DAX Request for extension of the european patent (deleted)
GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REF Corresponds to:

Ref document number: 602007006322

Country of ref document: DE

Date of ref document: 20100617

Kind code of ref document: P

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20100505

LTIE Lt: invalidation of european patent or patent extension

Effective date: 20100505

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100816

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100905

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100609

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100906

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: MC

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20100831

26N No opposition filed

Effective date: 20110208

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602007006322

Country of ref document: DE

Effective date: 20110207

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100806

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20100814

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110831

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20110831

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20101106

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20100814

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100505

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20100805

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007006322

Country of ref document: DE

Representative=s name: MEISSNER, BOLTE & PARTNER GBR, DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007006322

Country of ref document: DE

Representative=s name: MEISSNER, BOLTE & PARTNER GBR, DE

Effective date: 20140328

Ref country code: DE

Ref legal event code: R081

Ref document number: 602007006322

Country of ref document: DE

Owner name: KONINKLIJKE PHILIPS N.V., NL

Free format text: FORMER OWNER: KONINKLIJKE PHILIPS ELECTRONICS N.V., EINDHOVEN, NL

Effective date: 20140328

Ref country code: DE

Ref legal event code: R082

Ref document number: 602007006322

Country of ref document: DE

Representative=s name: MEISSNER BOLTE PATENTANWAELTE RECHTSANWAELTE P, DE

Effective date: 20140328

REG Reference to a national code

Ref country code: FR

Ref legal event code: CA

Effective date: 20141126

Ref country code: FR

Ref legal event code: CD

Owner name: KONINKLIJKE PHILIPS ELECTRONICS N.V., NL

Effective date: 20141126

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602007006322

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012240000

Ipc: H04L0041000000

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 16

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240828

Year of fee payment: 18

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240827

Year of fee payment: 18

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240826

Year of fee payment: 18