Inflight entertainment system network configurations

Information

  • Patent Grant
  • 9344351
  • Patent Number
    9,344,351
  • Date Filed
    Monday, May 18, 2015
    9 years ago
  • Date Issued
    Tuesday, May 17, 2016
    8 years ago
Abstract
Serial networking dedicated fiber optic inflight entertainment (IFE) systems, methods therefor and components thereof, that exhibit improved configuration and failover attributes through implementation of novel network configuration protocols. In some aspects of the invention, such an IFE system comprises a plurality of head end line replaceable units (HE-LRUs) and a plurality of serial networking line replaceable units (SN-LRUs), wherein each of the SN-LRUs individually detects that a closed system network has been formed between the plurality of HE-LRUs and the plurality of SN-LRUs based on a plurality of packets sourced by at least one of the HE-LRUs and received on a plurality of ports of each of the SN-LRUs, and wherein in response to detecting that the closed system network has been formed one of the SN-LRUs blocks one of its ports based on further detecting that the SN-LRU is a middle SN-LRU.
Description
BACKGROUND OF THE INVENTION

Inflight entertainment (IFE) systems have evolved significantly over the last 25 years. Prior to 1978, IFE systems consisted of audio-only systems. In 1978, Bell and Howell (Avicom Division) introduced a group viewing video system based on VHS tapes. In 1988, Airvision introduced the first inseat video system allowing passengers to choose between several channels of broadcast video. In 1997, Swissair installed the first interactive video on demand (VOD) system. Currently, several IFE systems provide VOD with full digital video disc-like controls.


The commercial viability of an IFE system generally depends on its line replaceable units (LRUs). The term “LRU” is a term of art generally describing a complex component (e.g. “black box”) on an airplane that is designed to be replaced quickly on the flight line or airport ramp area. LRUs can be beneficial because they are generally self-contained units that can be rapidly swapped-out in the event that maintenance is required thus allowing the airplane to continue to operate with little down time. Before being installed on an airplane, an LRU design should be approved by the Federal Aviation Administration by means defined in Title 14 of the Code of Federal Regulations. An IFE system's installation costs, operating costs, maintenance costs and passenger comfort depend greatly on the size, form factor, number and weight of its LRUs, as well as the number of distinct LRUs deployed in a single aircraft and across an airline's entire fleet of aircraft.


SUMMARY OF THE INVENTION

The dedicated fiber optic IFE system architecture described in U.S. Patent Application Publication No. 2007/0077998, for example the system marketed under the tradename FIBER-TO-THE-SCREEN™ (FTTS™) by Lumexis, Inc., has provided the airline industry with a modular, scalable, extensible, and future proofed IFE system that leverages terrestrial VOD hardware and software advances and is packaged to minimize the number of distinct LRU not only in a single aircraft but across an airline's entire fleet of aircraft (e.g. regional jets to jumbo jets). In some dedicated fiber optic IFE systems, such as the system shown in FIG. 1, head end servers are interconnected in a ring using bidirectional fiber optic links and communicate with passenger seat video display units (VDUs) over respective bidirectional links. This architecture offers advantages over traditional IFE systems in eliminating distribution area LRUs (i.e. there are no active components between the head end and the seat end). However, this architecture has certain drawbacks. First, a head end server is single point of failure for all passenger seat VDUs and cabin management terminals that connect directly to that head end server. Second, the implementation of a star wired network topology wherein each passenger seat VDU has a dedicated optical fiber “home run” to a head end server adds cost and complexity to the system. For example, over two miles of fiber are required on a typical narrow body aircraft installation and over four miles of fiber are required on a typical wide body aircraft installation. The high cost of aircraft grade fiber and fiber optic connectors, coupled with the cost and complexity of installing these fiber components, make this architecture very expensive to implement.


This architecture can be enhanced as generalized in FIG. 2, wherein reliability can be improved and costs reduced by providing a serial networking dedicated fiber optic IFE system wherein “chains” of passenger seat VDUs are connected on both ends to a “ring” of head end servers. In this enhanced architecture, rather than communicating with the head end over a dedicated data path, each passenger seat VDU communicates with the head end over a shared loop-free data path of a serial network established on selected redundant physical connections. This architecture reduces fiber component requirements relative to the architecture generalized in FIG. 1 and has the potential to exhibit superior failure recovery characteristics. However, known network configuration protocols that create loop-free network topologies, such as Rapid Spanning Tree Protocol (IEEE Std. 802.1w), are not well-suited for use in serial networking dedicated fiber optic IFE systems.


Accordingly, in some embodiments, the present invention provides serial networking dedicated fiber optic IFE systems, methods therefor and components thereof, that exhibit improved configuration and failover attributes through implementation of novel network configuration protocols. In various aspects of the invention, head end LRUs (HE-LRUs) may be head end servers of an IFE system and serial networking LRUs (SN-LRUs) may be passenger seat VDUs of an IFE system, by way of example.


In some aspects of the invention, an IFE system comprises a plurality of HE-LRUs and a plurality of SN-LRUs, wherein each of the SN-LRUs individually detects that a closed system network has been formed between the plurality of HE-LRUs and the plurality of SN-LRUs based on a plurality of packets sourced by at least one of the HE-LRUs and received on a plurality of ports of each of the SN-LRUs, and wherein in response to detecting that the closed system network has been formed at least one of the SN-LRUs blocks at least one of its ports based on further detecting that the SN-LRU is a middle SN-LRU. The SN-LRU may determine that it is a middle SN-LRU based on a comparison of hops to head end values contained in the plurality of packets. The SN-LRU may determine that it is a middle SN-LRU based on the comparison indicating a difference between the hops to head end values of no greater than one. The SN-LRU may clear a topology database on the SN-LRU in response to detecting that the closed system network has been formed and based on further detecting that the SN-LRU is a middle SN-LRU. The SN-LRU may transmit a topology change packet on an unblocked at least one of its ports in response to detecting that the closed system network has been formed and based on further detecting that the SN-LRU is a middle SN-LRU. Moreover, each of the HE-LRUs may individually detect that a closed head end network has been formed between the plurality of HE-LRUs based on a packet transmitted by the HE-LRU on a first port and received by the HE-LRU on a second port, wherein in response to detecting that the closed head end network has been formed at least one of the HE-LRUs block at least one of the first or second port based on further detecting that the HE-LRU is a designated break LRU. The HE-LRU may clear a topology database on the HE-LRU in response to detecting that the closed head end network has been formed and based on further detecting that the HE-LRU is a designated break LRU. The HE-LRU may transmit a topology change packet on an unblocked at least one of its ports in response to detecting that the closed head end network has been formed and based on further detecting that the HE-LRU is a designated break LRU.


In other aspects of the invention, a SN-LRU for an IFE system having a plurality of HE-LRUs and a plurality of SN-LRU comprises a processor and a plurality of ports communicatively coupled with the processor, wherein under control of the processor the SN-LRU selectively blocks at least one of the ports based on a comparison of a first hops to head end value contained in a first packet sourced by a HE-LRU and received on a first one of the ports and a second hops to head end value contained in a second packet sourced by a HE-LRU and received on a second one of the ports. The SN-LRU may under control of the processor block at least one of the ports if the comparison indicates that a difference between the hops to head end values is no greater than one. The SN-LRU may under control of the processor block at least one port over which the packet containing the higher hops to head end value was received. The SN-LRU may under control of the processor selectively clear a topology database on the SN-LRU based on the comparison. The SN-LRU may under control of the processor selectively transmit a topology change packet on an unblocked at least one of the ports based on the comparison.


In yet other aspects of the invention, a HE-LRU for an IFE system having a plurality of HE-LRUs and a plurality of SN-LRU comprises a processor and a plurality of ports communicatively coupled with the processor, wherein under control of the processor the HE-LRU blocks at least one of the ports based on detecting that a packet transmitted on a first one of the ports has been received on a second one of the ports and based on further detecting that the HE-LRU is a designated break LRU. The HE-LRU may under control of the processor clear a topology database on the HE-LRU based on detecting that a packet transmitted on a first one of the ports has been received on a second one of the ports and based on further detecting that the HE-LRU is a designated break LRU. The HE-LRU may under control of the processor transmit a topology change packet on at least one unblocked port based on detecting that a packet transmitted on a first one of the ports has been received on a second one of the ports and based on further detecting that the HE-LRU is a designated break LRU.


In yet other aspects of the invention, a network configuration method performed by a SN-LRU of an IFE system having a plurality of HE-LRUs and a plurality of SN-LRUs comprises the steps of receiving on a first port of the SN-LRU a first packet sourced by a HE-LRU and having a first hops to head end value, receiving on a second port of the SN-LRU a second packet sourced by a HE-LRU and having a second hops to head end value, comparing the first and second hops to head end values, and selectively blocking at least one of the ports based on the comparison. The method may further comprise blocking at least one of the ports if the comparison indicates that a difference between the first and second hops to head end values is no greater than one. The method may further comprise blocking at least one of the ports over which the packet containing the higher hops to head end value was received. The method may further comprise selectively clearing a topology database on the SN-LRU based on the comparison. The method may further comprise selectively transmitting a topology change packet on an unblocked port based on the comparison.


In yet other aspects of the invention, an IFE system comprises a plurality of HE-LRUs and a plurality of SN-LRUs, wherein each of the SN-LRUs individually detects that a closed system network has been formed between the plurality of HE-LRUs and the plurality of SN-LRUs based on a plurality of packets sourced by at least one of the HE-LRUs and received on a plurality of ports of each of the SN-LRUs, and wherein in response to detecting that the closed system network has been formed at least one of the SN-LRUs provides a logical break point for the network based on historical break information.


In still other aspects of the invention, a network configuration method performed by a SN-LRU of an IFE system having a plurality of HE-LRUs and a plurality of SN-LRUs comprises the steps of receiving on a first port of the SN-LRU a first packet sourced by a first HE-LRU, receiving on a second port of the SN-LRU a second packet sourced by a second HE-LRU, determining by the SN-LRU that a closed system network has been formed between the plurality of HE-LRUs based on the first and second packet, determining by the SN-LRU that the SN-LRU provides a logical break point for the network based on historical break information and providing by the SN-LRU a logical break point for the network.


These and other aspects of the invention will be better understood when taken in conjunction with the detailed description of the preferred embodiment and the drawings that are briefly described below. Of course, the invention is defined by the appended claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a known dedicated fiber dedicated fiber optic system architecture



FIG. 2 shows a known serial networking dedicated fiber optic system architecture.



FIG. 3 shows a serial networking dedicated fiber optic system architecture in which the present invention may be operative.



FIG. 4 shows network configuration packets transmitted in a serial networking dedicated fiber optic system in some embodiments of the invention.



FIG. 5 shows a LRU presence packet generation flow in some embodiments of the invention.



FIG. 6 shows a HE-LRU hops packet generation flow in some embodiments of the invention.



FIG. 7 shows a method performed by a SN-LRU packet handler in some embodiments of the invention.



FIG. 8 shows a method performed by SN-LRU decision logic in some embodiments of the invention.



FIG. 9 shows a method performed by a HE-LRU packet handler in some embodiments of the invention.



FIG. 10 shows a method performed by HE-LRU decision logic in some embodiments of the invention.



FIGS. 11A and 11B show a method performed by SN-LRU decision logic in some embodiments of the invention.





DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT


FIG. 3 shows a serial networking dedicated fiber optic system architecture in which the present invention may be operative. The architecture includes HE-LRUs 300, which may be head end servers, and SN-LRUs 310, which may be seat VDUs. Each HE-LRU has at least two HE-LRU ports 304 that each connect to an adjacent HE-LRU and zero or more SN-LRU ports 305 that each connect to an adjacent SN-LRU. Each of the HE-LRU ports 304, 305 can be communicatively coupled with a processor on the HE-LRU (e.g. processor 302). Each SN-LRU has at least two ports 308, 309 that can each connect to an adjacent HE-LRU or SN-LRU. The ports 308, 309 can be communicatively coupled with a processor on the SN-LRU (e.g. processor 312). Moreover, each HE-LRU and SN-LRU can have a topology database, such as a forwarding table that associates media access control (MAC) addresses of other LRUs with output ports of the HE-LRU or SN-LRU. The topology database in each HE-LRU and SN-LRU can be communicatively coupled with the processor on the HE-LRU or SN-LRU.


In the architecture illustrated, a HE-LRUs 300 is connected to SN-LRUs at the edge of a serial chain of SN-LRUs 310 over a bidirectional link, e.g. fiber optics. Generally, the edge SN-LRUs connect back to different HE-LRUs 300. At the head end, HE-LRUs 300 are connected to adjacent HE-LRUs over bidirectional links to form a ring of HE-LRUs. At the seat end, SN-LRUs 310 are connected to adjacent SN-LRUs over bidirectional links to form a serial chain of SN-LRUs. The system can employ most any type of bidirectional link, such as fiber optics, copper wire, coaxial cable, wireless communication, or the like. In several embodiments, fiber optic links are employed to, among other advantages, increase data transfer rate and/or capacity.


Network configuration protocols described herein are generally run to create and maintain a loop-free network topology on top of the architecture through selective transmission and processing of configuration packets and selective blocking and unblocking of HE-LRU and SN-LRU ports.



FIG. 4 shows some of the types of network configuration packets transmitted in a serial networking dedicated fiber optic system in some embodiments of the invention. Network configuration packets may pass through both blocked and unblocked HE-LRU and SN-LRU ports, whereas data packets (e.g. entertainment packets) may pass through unblocked ports but may not pass through blocked ports.


A LRU presence packet 400 contains a packet type identifier indicating that packet 400 is a LRU presence packet. Packet 400 is used by a LRU to determine whether a port is connected to a live LRU.


A HE-LRU hops packet 410 contains at least three fields. A first field is a packet type identifier indicating that packet 410 is a HE-LRU hops packet. A second field is an identifier uniquely associated with the HE-LRU that originated packet 410. This field is used by a HE-LRU to determine whether a received packet was originated by the HE-LRU itself (i.e. whether the packet has looped-back). A third field is a hops to head end (HHE) value that is used to track the number of LRU hops packet 410 has completed over a serial network chain.


A SN-LRU topology change packet 420 contains a packet type identifier indicating that packet 420 is a SN-LRU topology change packet. Packet 420 is transmitted over a serial network chain and each SN-LRU that receives packet 420 clears its topology database and forwards packet 420 along the chain. HE-LRUs convert received SN-LRU topology change packets into HE-LRU topology change packets that are circulated at the head end of the system.


A HE-LRU topology change packet 430 contains at least two fields. A first field is a packet type identifier indicating that packet 430 is a HE-LRU topology change packet. A second field is an identifier uniquely associated with the HE-LRU that originated packet 430. Packet 430 is circulated at the head end of the system in response to a detected topology change. In some embodiments, each HE-LRU that receives packet 430 clears its topology database.



FIG. 5 shows a LRU presence packet generation flow in some embodiments of the invention. After startup (500), an originating LRU (e.g. HE-LRU and/or SN-LRU) under local processor control generates and sends a LRU presence packet out all the originating LRU's ports (510). The originating LRU delays for a period of time equal to the inverse of a configured refresh rate for the presence packet (520) after which it repeats the process in loop. In some embodiments, each HE-LRU and SN-LRU include a processor and execute this presence packet generation flow method under local processor control.



FIG. 6 shows a HE-LRU hops packet generation flow in some embodiments of the invention. After startup (600), an originating HE-LRU under local processor control generates and sends a HE-LRU hops packet out all the originating HE-LRU's ports (610). The originating HE-LRU delays for a period of time equal to the inverse of a configured refresh rate for the HE-LRU hops packet (620) after which it repeats the process in loop. In some embodiments, each HE-LRU executes this hops packet generation flow method under local processor control.



FIG. 7 shows a method performed by a SN-LRU packet handler in some embodiments of the invention. Upon reception of a management packet, a packet handler executed by a processor on the SN-LRU determines the packet type by inspecting the packet type identifier field in the packet (700). In some arrangements, the packet handler processes three packet types: LRU presence packet, HE-LRU hops packet, and SN-LRU topology change packet. If the packet is a LRU presence packet, the packet handler sets a current state variable of the ingress port (i.e. the port on which the packet was received) to active (710). The current state variable informs decision logic executed by the processor that the ingress port is connected to a live LRU. If the packet is a HE-LRU hops packet, the packet handler increments the HHE value in the packet, sets the ingress port HHE count to the HHE value in the packet, and forwards the updated HE-LRU hops packet to the non-ingress port (720). If the packet is a SN-LRU topology change packet, the packet handler clears the topology database on the SN-LRU and forwards the packet out the non-ingress port (730).



FIG. 8 shows a method performed by SN-LRU decision logic in some embodiments of the invention. After startup (800), logic executed by a processor on the SN-LRU blocks both ports of the SN-LRU and sets a last state variable of both ports to blocked (810). The flow then proceeds to the main processing loop. At the start of each pass through the main processing loop, the logic sets a current state variable of both ports to inactive and sets the HHE count for both ports to zero (820). The logic then delays for a period greater than the presence loop and hop loop periods to afford the packet handler ample time to perform the steps shown in FIG. 7 on packets generated in accordance with FIGS. 5 and 6, which updates port state variables and HHE count based on the current network topology. After the delay, the logic determines whether the serial network chain of which the SN-LRU is a part is closed or open by inspecting the HHE count for both ports. If either count is zero, then the network is open (i.e. paths do not exist in both directions to a HE-LRU). If both counts are non-zero, the network is closed (i.e. paths exist in both directions to a HE-LRU) (830).


If the network is closed, the flow proceeds to Step 840 where the logic first determines whether the SN-LRU on which the logic is operative is a middle LRU of a serial network chain. This is determined by comparing the HHE count for both ports. If the HHE count for both ports is the same or differs by only one hop, the SN-LRU is a middle LRU; otherwise, the SN-LRU is not a middle LRU. If the SN-LRU is a middle LRU, the SN-LRU has responsibility to break the chain and create a loop-free network topology. In that event, the logic blocks the port with the higher HHE count (i.e. longer path to the head end) and unblocks the other port. If the HHE count for both ports is identical, the logic blocks a predetermined at least one of the ports and unblocks the other port. The logic next determines whether the last state variable of the blocked port is unblocked. If the last state variable of the blocked port is unblocked, the network topology changed in a way that put the SN-LRU at the end of a chain and thus the SN-LRU should inform the system of the topology change. Accordingly, the logic clears the topology database and generates and transmits on the unblocked port a SN-LRU topology change packet, forcing relearning of the network topology. The logic next sets the last state variable of the blocked port to blocked, and sets the last state variable of the unblocked port to unblocked. If the SN-LRU determines it is not a middle LRU, the logic unblocks both ports and sets the last state variable of both ports to unblocked.


If the network is open, the flow proceeds to Step 850 where the logic determines for each port whether the current state variable is active or inactive and takes appropriate action. If the current state variable is active, the logic unblocks the port and sets the last state variable to unblocked. If the current state variable is inactive, the logic blocks the port and, if the last state variable is unblocked, clears the topology database and transmits a SN-LRU topology change packet on the unblocked port, forcing relearning of the network topology. Finally, the logic sets the last state variable to blocked.



FIG. 9 shows a method performed by a HE-LRU packet handler in some embodiments of the invention. Upon reception of a management packet, a packet handler executed by a processor on the HE-LRU determines the packet type by inspecting the packet type identifier field in the packet (900). In the embodiment shown, the HE-LRU packet handler processes four packet types: LRU presence packet, HE-LRU hops packet, SN-LRU topology change packet, and HE-LRU topology change packet. If the packet is a LRU presence packet, the packet handler sets the current state variable of the ingress port to active (910). The current state variable generally informs decision logic executed by the processor that the ingress port is connected to a live LRU. If the packet is a HE-LRU hops packet, the packet handler first determines whether the ingress port is a SN-LRU port and, if so, discards the packet. The packet handler then determines if the packet was originated by the HE-LRU itself (i.e. whether the packet has looped-back). If the HE-LRU is the originating HE-LRU for this packet, the network is closed and the packet handler sets a network state variable to closed and discards the packet. If, on the other hand, the HE-LRU is not the originating HE-LRU for this packet, the packet handler forwards the packet on the non-ingress HE-LRU port (920). Upon reception of a SN-LRU topology change packet, the packet handler clears the topology database and transmits a HE-LRU topology change packet on both HE-LRU ports to inform other HE-LRUs of the topology change (930). Upon reception of a HE-LRU topology change packet, the packet handler first determines if the packet was originated by the HE-LRU itself (i.e. whether the packet has looped-back). If the HE-LRU is the originating HE-LRU for this packet, the packet handler discards the packet; otherwise, the packet handler clears the topology database and forwards the packet to the non-ingress HE-LRU port (940).



FIG. 10 shows a method performed by HE-LRU decision logic in some embodiments of the invention. After startup (1000), logic executed by a processor on the HE-LRU generally blocks both HE-LRU ports, unblocks all SN-LRU ports, and sets a last state variable of both HE-LRU ports to blocked (1010). The flow then proceeds to the main processing loop. At the start of each pass through the main processing loop, the logic sets a current state variable of both HE-LRU ports to inactive and sets the network state variable to open (1020). The logic then delays for a period greater than the presence loop and hop loop periods to afford the packet handler ample time to perform the steps shown in FIG. 9 which updates port state variables and the network state variable based on the current network topology. After the delay, the logic determines whether the head end ring network of which the HE-LRU is a part is closed or open by reference to the network state variable (1030).


If the network is closed, the logic at Step 1040 first determines whether the HE-LRU on which the logic is operative has been designated to break the loop. This is determined by referencing a unique break LRU identifier available to the HE-LRU. If the HE-LRU is the designated break LRU, the HE-LRU has responsibility to break the ring and create a loop-free head end network topology. In that event, the logic blocks a predetermined at least one of the HE-LRU ports and unblocks the other HE-LRU port. The logic next determines whether the last state variable of the blocked port is unblocked. If the last state variable of the blocked port is unblocked, the HE-LRU should inform the system of the topology change. Accordingly, the logic clears the topology database and generates and transmits a HE-LRU topology change packet on the unblocked HE-LRU port, forcing relearning of the network topology. The logic next sets the last state variable of the blocked HE-LRU port to blocked, and sets the last state variable of the unblocked HE-LRU port to unblocked. If the HE-LRU determines it is not the designated break LRU, the logic unblocks both HE-LRU ports and sets the last state variable of both HE-LRU ports to unblocked.


If the network is open, the logic at Step 1050 determines for each HE-LRU port whether the current state variable is active or inactive and takes appropriate action. If the current state variable is active, the logic unblocks the port and sets the last state variable to unblocked. If the current state variable is inactive, the logic blocks the port and, if the last state variable is unblocked, clears the topology database and transmits a HE-LRU networking topology change packet on the unblocked port, forcing relearning of the network topology. Finally, the logic sets the last state variable to blocked.



FIGS. 11A and 11B show a method performed by SN-LRU decision logic in some embodiments of the invention. In these embodiments, after an SN-LRU chain recovers from a fault, the break point in an SN-LRU chain is maintained at the initial break point rather than reverting to the middle of the SN-LRU chain. The initial break point is kept in these embodiments to avoid “ping ponging” between the initial break point and a break point at the middle of the SN-LRU chain when failure at the initial break point is a recurring problem. As shown in FIG. 4, in these embodiments historical break information is shared between SN-LRUs using a logical break port identifier that is carried in HE-LRU hops packets 410, as will be explained now in greater detail.


Referring to Step 720 of FIG. 7, an SN-LRU that has detected a physical break at one of its ports applies to an HE-LRU hops packet that it receives on its ingress port a logical break port identifier identifying its physical break port before forwarding the HE-LRU hops packet on its non-ingress port, replacing any logical break port identifier contained in the packet as received. SN-LRUs in an SN-LRU chain reference the logical break port identifiers (or absence thereof) in received HE-LRU packets to identify an appropriate physical break point for the chain, as will now be explained in conjunction with FIGS. 11A and 11B.


After startup (1100), logic executed by a processor on the SN-LRU blocks both ports of the SN-LRU, sets a last state variable of both ports to blocked, and sets its logical break port identifier to undefined (1110). The flow then proceeds to the main processing loop. At the start of each pass through the main processing loop, the logic sets a current state variable of both ports to inactive and sets the HHE count for both ports to zero (1120). The logic then delays for a period greater than the presence loop and hop loop periods to afford the packet handler ample time to perform the steps shown in FIG. 7 on packets generated in accordance with FIGS. 5 and 6, which updates port state variables and HHE count based on the current network topology. After the delay, the logic determines whether the serial network chain of which the SN-LRU is a part is closed or open by inspecting the HHE count for both ports. If either count is zero, then the network is open (i.e. paths do not exist in both directions to a HE-LRU). If both counts are non-zero, the network is closed (i.e. paths exist in both directions to a HE-LRU) (1130).


If the network is closed, the flow proceeds to Step 1140 where the logic first determines whether a logical break port exists in the network as a result of a previous failure from which recovery has been made. If either of the ports on the SN-LRU on which the logic is operative is a logical break port (due to a previous physical break at that port) and no other logical break port exists in the network, the flow returns to Step 1120 without further action, resulting in a blocked port on the SN-LRU remaining blocked.


If either of the ports on the SN-LRU on which the logic is operative is a logical break port and another logical break port exists in the network, a further check is made to determine which of the logical break ports is closer to the middle of the SN-LRU chain, which can be determined by reference to HHE counts. In that event, if the logical break port on the SN-LRU on which the logic is operative is closer to the middle, or is the same distance from the middle and indicated to win in the event of a tie, the flow returns to Step 1120 without further action, resulting in a blocked port on the SN-LRU remaining blocked. On the other hand, if the logical break port on the SN-LRU on which the logic is operative is further from the middle, or is the same distance from the middle and indicated to lose in the event of a tie, the logic unblocks both of the ports on the SN-LRU.


In some embodiments, if neither of the ports on the SN-LRU on which the logic is operative is a logical break port and another logical break port exists in the network, the logic unblocks both of the ports on the SN-LRU.


In certain arrangements, if neither of the ports on the SN-LRU on which the logic is operative is a logical break port and no other logical break port exists in the network, the SN-LRU on which the logic is operative determines if it is a middle LRU of a serial network chain. This is determined by comparing the HHE count for both ports. If the HHE count for both ports is the same or differs by only one hop, the SN-LRU is a middle LRU; otherwise, the SN-LRU is not a middle LRU. If the SN-LRU is a middle LRU, the logic blocks the port with the higher HHE count (i.e. longer path to the head end) and unblocks the other port. If the HHE count for both ports is identical, the logic blocks a predetermined at least one of the ports and unblocks at least one other port. If the SN-LRU determines it is not a middle LRU, the logic unblocks both ports.


Generally, if the last state variable of any blocked port was unblocked, the logic clears the topology database and generates and transmits on the unblocked port a SN-LRU topology change packet, forcing relearning of the network topology. The logic also sets the last state variable of any blocked port to blocked, and sets the last state variable of unblocked ports to unblocked.


If the network is open, the flow proceeds to Step 1150 where the logic determines for each port whether the current state variable is active or inactive and takes appropriate action. If the current state variable is active, the logic unblocks the port and sets the last state variable to unblocked. If the current state variable is inactive, the logic sets the logical break port identifier to the current port, blocks the port and, if the last state variable is unblocked, clears the topology database and transmits a SN-LRU topology change packet on the unblocked port, forcing relearning of the network topology. Finally, the logic sets the last state variable to blocked.


It will be appreciated by those of ordinary skill in the art that the invention can be embodied in other specific forms without departing from the spirit or essential character hereof. The present description is therefore considered in all respects to be illustrative and not restrictive. The scope of the invention is indicated by the appended claims, and all changes that come with in the meaning and range of equivalents thereof are intended to be embraced therein.

Claims
  • 1. An in-flight entertainment (IFE) system comprising: a plurality of serial networking line replaceable units (SN-LRUs); anda plurality of head end line replaceable units (HE-LRUs) in communication with the SN-LRUs, at least one of the plurality of HE-LRUs being a blocking HE-LRU, the blocking HE-LRU comprising: a processor; anda plurality of ports communicatively coupled with the processor, the plurality of ports comprising a first port and a second port, the blocking HE-LRU configured to transmit a packet on at least the first port and to determine whether the packet has been received on the second port;the blocking HE-LRU in communication with a database comprising unique identifiers for each of the plurality of HE-LRUs, the blocking HE-LRU configured to determine whether the unique identifier for the blocking HE-LRU is designated as a break line replaceable unit (LRU);wherein, under control of the processor, the blocking HE-LRU is configured to block one of the first and second ports in response to determining that a condition is satisfied, the condition comprising: the packet transmitted on the first port has been received on the second port; andthe unique identifier for the blocking HE-LRU is designated as the break line replaceable unit (LRU).
  • 2. The IFE system of claim 1, wherein, in response to determining that the condition is satisfied, the blocking HE-LRU is further configured to clear a topology database on the blocking HE-LRU.
  • 3. The IFE system of claim 2, wherein under control of the processor, the blocking HE-LRU is further configured to transmit a topology change packet, via an unblocked one of the first and second ports, to at least one other of the plurality of HE-LRUs.
  • 4. The IFE system of claim 1, wherein, in response to determining that the condition is satisfied, the HE-LRU is further configured to unblock the other of the first and second ports.
  • 5. The IFE system of claim 4, wherein: the blocking HE-LRU further comprises a last state variable for the first port and a last state variable for the second port; andin response to determining that the condition is satisfied, the blocking HE-LRU is further configured to: determine whether the last state variable of the blocked port indicates blocked or unblocked; andin response to determining that the last state variable of the blocked port indicates unblocked, to transmit a topology change packet on the unblocked port.
  • 6. The IFE system of claim 5, wherein, in response to determining that the condition is satisfied, the blocking HE-LRU is further configured to: set the last state variable of the blocked port to blocked; andset the last state variable of the unblocked port to unblocked.
  • 7. The IFE system of claim 1, wherein, in response to determining that the unique identifier for the blocking HE-LRU is not designated as the break LRU, the blocking HE-LRU is further configured to: unblock the first port;set a last state variable of the first port to unblocked;unblock the second port; andset a last state variable for the second port to unblocked.
  • 8. The IFE system of claim 1, wherein the blocking HE-LRU comprises a server.
  • 9. The IFE system of claim 1, wherein the plurality of SN-LRUs comprise video display units.
  • 10. The IFE system of claim 9, wherein each of the plurality of SN-LRUs are configured to individually determine whether a closed communication network has been formed between the plurality of HE-LRUs and the plurality of SN-LRUs, such determination being at least partially based on a plurality of packets sent from at least one of the HE-LRUs and received on a plurality of ports of each of the SN-LRUs.
  • 11. The IFE system of claim 10, wherein one of the plurality of SN-LRUs is configured to block one of its ports in response to detecting that an SN-LRU condition is satisfied, the SN-LRU condition comprising: the closed communication network has been formed between the plurality of HE-LRUs and the plurality of SN-LRUs; andthe one of the plurality of SN-LRUs comprises a middle SN-LRU.
  • 12. A method of operating an in-flight entertainment (IFE) system comprising a plurality of serial networking line replaceable units (SN-LRUs) and a plurality of head end line replaceable units (HE-LRUs), at least one of the plurality of HE-LRUs being a blocking HE-LRU, the method comprising: determining, with the blocking HE-LRU, that a closed HE-LRU network exists, wherein determining that a closed HE-LRU network exists comprises: transmitting a packet on a first port of the blocking HE-LRU; andreceiving the packet on a second port of the blocking HE-LRU;determining, with the blocking HE-LRU, that the blocking HE-LRU is designated as a break LRU, wherein determining that the blocking HE-LRU is designated as the break LRU comprises: referencing a unique break LRU identifier; anddetermining whether the unique break LRU identifier identifies the blocking HE-LRU as the designated break line replaceable unit (LRU); andin response to determining that the closed HE-LRU network exists and that the blocking HE-LRU is designated as the break LRU: blocking one of the first and second ports of the blocking HE-LRU, thereby creating a loop-free HE-LRU network topology.
  • 13. The method of claim 12, further comprising: in response to determining that the closed HE-LRU network exists and that the blocking HE-LRU is designated as the break LRU: unblocking the other of the first and second ports of the blocking HE-LRU.
  • 14. The method of claim 12, further comprising: determining whether a last state variable of the blocked port indicates blocked or unblocked; andin response to determining that the last state variable of the blocked port indicates unblocked, informing another of the plurality of HE-LRUs of a topology change.
  • 15. The method of claim 14, wherein informing another of the plurality of HE-LRUs of a topology change comprises: transmitting a topology change packet on the unblocked port of the blocking HE-LRU.
  • 16. The method of claim 15, further comprising clearing the topology database on each of the plurality of HE-LRUs.
  • 17. The method of claim 16, further comprising: setting the last state variable of the blocked port to indicate blocked; andsetting a last state variable of the unblocked port to indicate unblocked.
  • 18. The method of claim 12, further comprising: in response to determining that the blocking HE-LRU is not designated as the break LRU: unblocking the first port;setting a last state variable of the first port to indicate unblocked;unblocking the second port; andsetting a last state variable for the second port to indicate unblocked.
  • 19. An in-flight entertainment (IFE) system comprising: a plurality of serial networking line replaceable units (SN-LRUs); anda plurality of head end line replaceable units (HE-LRU), at least one of which comprises: a processor; anda plurality of ports communicatively coupled with the processor, the HE-LRU configured to transmit a packet on at least one of the plurality of ports;wherein, under control of the processor, the at least one HE-LRU is configured to block one of its ports in response to: detecting that a packet transmitted on a first one of the at least one HE-LRU's ports has been received on a second one of the at least one HE-LRU's ports; anddetecting that the HE-LRU is a designated break line replaceable unit (LRU).
  • 20. The IFE system of claim 19, wherein the HE-LRU under control of the processor clears a topology database on the HE-LRU based on detecting that a packet transmitted on a first one of the ports has been received on a second one of the ports and based on further detecting that the HE-LRU is a designated break LRU.
  • 21. The IFE system of claim 19, wherein the HE-LRU under control of the processor transmits a topology change packet on an unblocked one of the ports based on detecting that a packet transmitted on a first one of the ports has been received on a second one of the ports and based on further detecting that the HE-LRU is a designated break LRU.
  • 22. The IFE system of claim 19, wherein the HE-LRU comprises a server.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 13/685,525, entitled “SERIAL NETWORKING FIBER OPTIC INFLIGHT ENTERTAINMENT SYSTEM NETWORK CONFIGURATION”, filed on Nov. 26, 2012, now U.S. Pat. No. 9,036,487, which is a continuation of U.S. application Ser. No. 12/860,437, entitled “SERIAL NETWORKING FIBER OPTIC INFLIGHT ENTERTAINMENT SYSTEM NETWORK CONFIGURATION,” filed on Aug. 20, 2010, now U.S. Pat. No. 8,416,698, which claims priority from U.S. provisional application No. 61/274,726 entitled “SERIAL NETWORKING FIBER-TO-THE-SEAT INFLIGHT ENTERTAINMENT SYSTEM NETWORK MANAGEMENT,” filed on Aug. 20, 2009, the entirety of each of which is incorporated herein by reference.

US Referenced Citations (425)
Number Name Date Kind
3964826 Joseph et al. Jun 1976 A
4337909 Harja Jul 1982 A
4408144 Lukes Oct 1983 A
4433301 Lukes Feb 1984 A
4433344 Gradin et al. Feb 1984 A
4467381 Harjo Aug 1984 A
4577191 Pargee, Jr. Mar 1986 A
4639106 Gradin Jan 1987 A
4827252 Busbridge et al. May 1989 A
4828378 Ellis May 1989 A
4832449 Mundy et al. May 1989 A
4833333 Rand May 1989 A
4833337 Kelley et al. May 1989 A
4894818 Fujioka et al. Jan 1990 A
4903017 Wooler Feb 1990 A
4946129 Eastwick Aug 1990 A
4952809 McEwen Aug 1990 A
4958381 Toyoshima Sep 1990 A
4969724 Ellis Nov 1990 A
4993788 Steward Feb 1991 A
4994794 Price et al. Feb 1991 A
5007699 Stout Apr 1991 A
5014342 Pudsey May 1991 A
5056737 Taylor Oct 1991 A
5059781 Langdon Oct 1991 A
5076524 Reh et al. Dec 1991 A
5093567 Staveley Mar 1992 A
5096271 Portman Mar 1992 A
5121702 Johnson et al. Jun 1992 A
5123728 Gradin et al. Jun 1992 A
5132527 Karpati Jul 1992 A
5150122 Bell Sep 1992 A
5179447 Lain Jan 1993 A
5181013 Bagshaw et al. Jan 1993 A
5181771 Robak et al. Jan 1993 A
5184231 Ellis Feb 1993 A
5200757 Jairam Apr 1993 A
5203220 Lerman Apr 1993 A
5208938 Webb May 1993 A
5210409 Rowe May 1993 A
5220456 Haessig, Jr. Jun 1993 A
5222780 Reh et al. Jun 1993 A
5262762 Westover et al. Nov 1993 A
5267775 Nguyen Dec 1993 A
5289196 Gans et al. Feb 1994 A
5307206 Haessig, Jr. Apr 1994 A
5311302 Berry et al. May 1994 A
5333002 Gans et al. Jul 1994 A
5341140 Perry Aug 1994 A
5344210 Marwan et al. Sep 1994 A
5353109 Langdon et al. Oct 1994 A
5369355 Roe Nov 1994 A
5374103 Stange et al. Dec 1994 A
5398991 Smith et al. Mar 1995 A
5400079 Martinez et al. Mar 1995 A
5421530 Bertagna et al. Jun 1995 A
5440337 Henderson et al. Aug 1995 A
5442556 Boyes et al. Aug 1995 A
5467106 Salomon Nov 1995 A
5481868 Davies et al. Jan 1996 A
5517508 Scott May 1996 A
5523551 Scott Jun 1996 A
5529265 Sakurai Jun 1996 A
5535884 Scott et al. Jul 1996 A
5539560 Dennis et al. Jul 1996 A
5539657 Utsumi et al. Jul 1996 A
5543818 Scott Aug 1996 A
5548356 Portman Aug 1996 A
5568484 Margis Oct 1996 A
5574497 Henderson et al. Nov 1996 A
5577205 Hwang et al. Nov 1996 A
5583674 Mosley Dec 1996 A
5596647 Wakai et al. Jan 1997 A
5601208 Scott Feb 1997 A
5636055 Portman et al. Jun 1997 A
5638236 Scott Jun 1997 A
5640297 Labaze Jun 1997 A
5641092 Scott Jun 1997 A
5647505 Scott Jul 1997 A
5648904 Scott Jul 1997 A
5666291 Scott et al. Sep 1997 A
5675752 Scott et al. Oct 1997 A
5704798 Portman et al. Jan 1998 A
5705860 Ninh et al. Jan 1998 A
5731782 Walls Mar 1998 A
5738392 Portman Apr 1998 A
5786801 Ichise Jul 1998 A
5786917 Maeno Jul 1998 A
5790787 Scott et al. Aug 1998 A
5793330 Gans et al. Aug 1998 A
5796185 Takata et al. Aug 1998 A
5801749 Ninh et al. Sep 1998 A
5805821 Wang et al. Sep 1998 A
5811791 Portman Sep 1998 A
5812778 Peters et al. Sep 1998 A
5813048 Thom Sep 1998 A
5826091 Shah et al. Oct 1998 A
5831805 Sekine et al. Nov 1998 A
5832279 Rostoker et al. Nov 1998 A
5835127 Booth et al. Nov 1998 A
5838802 Swinbanks Nov 1998 A
5847522 Barba Dec 1998 A
5848235 Scott et al. Dec 1998 A
5848367 Lotocky et al. Dec 1998 A
5854591 Atkinson Dec 1998 A
5857869 Parcel et al. Jan 1999 A
5859616 Gans et al. Jan 1999 A
5871173 Frank et al. Feb 1999 A
5872934 Whitehouse et al. Feb 1999 A
5881228 Atkinson et al. Mar 1999 A
5884096 Beasley et al. Mar 1999 A
5889466 Ferguson Mar 1999 A
5889775 Sawicz et al. Mar 1999 A
5892478 Moss Apr 1999 A
5894413 Ferguson Apr 1999 A
5896129 Murphy et al. Apr 1999 A
5898401 Walls Apr 1999 A
5907827 Fang et al. May 1999 A
5910814 Portman et al. Jun 1999 A
5910966 Sekine et al. Jun 1999 A
5914576 Barba Jun 1999 A
5920186 Ninh et al. Jul 1999 A
5923673 Henrikson Jul 1999 A
5923743 Sklar Jul 1999 A
5926759 Severwright Jul 1999 A
5929895 Berry et al. Jul 1999 A
5939997 Sekine et al. Aug 1999 A
5942811 Stumfall et al. Aug 1999 A
5944803 Whitehouse Aug 1999 A
5945631 Henrikson et al. Aug 1999 A
5953429 Wakai et al. Sep 1999 A
5957798 Smith, III et al. Sep 1999 A
5963877 Kobayashi Oct 1999 A
5973722 Wakai et al. Oct 1999 A
5978736 Greendale Nov 1999 A
5986810 Webb Nov 1999 A
5991138 Sklar et al. Nov 1999 A
5999520 Little Dec 1999 A
6008779 Ellis Dec 1999 A
6011322 Stumfall et al. Jan 2000 A
6014381 Troxel et al. Jan 2000 A
6031299 Stumfall et al. Feb 2000 A
6034688 Greenwood et al. Mar 2000 A
6038426 Williams, Jr. Mar 2000 A
6052426 Maurice Apr 2000 A
6055634 Severwright Apr 2000 A
6057875 Ferguson et al. May 2000 A
6058288 Reed et al. May 2000 A
6092868 Wynn Jul 2000 A
6110261 Guiragossian Aug 2000 A
6130636 Severwright Oct 2000 A
6131119 Fukui Oct 2000 A
6134674 Akasheh Oct 2000 A
6154910 Corney Dec 2000 A
6157471 Bignolles et al. Dec 2000 A
6160591 Stumfall et al. Dec 2000 A
6163823 Henrikson Dec 2000 A
6185643 Asprey et al. Feb 2001 B1
6189127 Fang et al. Feb 2001 B1
6195040 Arethens Feb 2001 B1
6208307 Frisco et al. Mar 2001 B1
6249913 Galipeau et al. Jun 2001 B1
6266736 Atkinson et al. Jul 2001 B1
6266815 Shen et al. Jul 2001 B1
6272572 Backhaus et al. Aug 2001 B1
6310286 Troxel et al. Oct 2001 B1
6359608 Lebrun et al. Mar 2002 B1
6366311 Monroe Apr 2002 B1
6373216 Ho Apr 2002 B1
6390920 Infiesto et al. May 2002 B1
6452155 Sherlock et al. Sep 2002 B1
6453259 Infiesto Sep 2002 B1
6453267 Rudzik et al. Sep 2002 B1
6457837 Steffensmeier Oct 2002 B1
6466258 Mogenis et al. Oct 2002 B1
6477152 Hiett Nov 2002 B1
6490510 Choisnet Dec 2002 B1
6493147 Baudou et al. Dec 2002 B1
6499027 Weinberger Dec 2002 B1
6507952 Miller et al. Jan 2003 B1
6520015 Alause et al. Feb 2003 B1
6529706 Mitchell Mar 2003 B1
6535490 Jain Mar 2003 B1
6549754 Miller et al. Apr 2003 B1
6556114 Guillemin et al. Apr 2003 B1
6559812 McCarten et al. May 2003 B1
6561006 Roberge et al. May 2003 B1
6588117 Martin et al. Jul 2003 B1
6611311 Kretz et al. Aug 2003 B1
6612870 Rauscent Sep 2003 B1
6614126 Mitchell Sep 2003 B1
6633156 Choisnet Oct 2003 B1
6654806 Wall et al. Nov 2003 B2
6661353 Gopen Dec 2003 B1
6661664 Sarno et al. Dec 2003 B2
6679112 Collot et al. Jan 2004 B2
6681250 Thomas et al. Jan 2004 B1
6698281 Choisnet Mar 2004 B1
6715150 Potin Apr 2004 B1
6731639 Ors et al. May 2004 B1
6735309 Lemanski et al. May 2004 B1
6741841 Mitchell May 2004 B1
6754609 Lescourret Jun 2004 B2
6756304 Robert Jun 2004 B1
6775462 Wang et al. Aug 2004 B1
6782392 Weinberger et al. Aug 2004 B1
6801769 Royalty Oct 2004 B1
6806885 Piper et al. Oct 2004 B1
6807148 Eicher Oct 2004 B1
6807538 Weinberger et al. Oct 2004 B1
6810527 Conrad et al. Oct 2004 B1
6811348 Meyer et al. Nov 2004 B1
6812992 Nemeth Nov 2004 B2
6813777 Weinberger et al. Nov 2004 B1
6815716 Sanson et al. Nov 2004 B2
6817240 Collot et al. Nov 2004 B2
6822812 Brauer Nov 2004 B1
6824317 Finizio et al. Nov 2004 B2
6844874 Maurice Jan 2005 B2
6845658 Roberge et al. Jan 2005 B2
6876905 Farley et al. Apr 2005 B2
6894490 Lescourret May 2005 B2
6899390 Sanfrod et al. May 2005 B2
6918294 Roberge Jul 2005 B1
6919874 Maurice Jul 2005 B1
6920461 Hejlsberg Jul 2005 B2
6924785 Kretz et al. Aug 2005 B1
6937194 Meier et al. Aug 2005 B1
6938258 Weinberger et al. Aug 2005 B1
6956680 Morbieu et al. Oct 2005 B2
6972747 Bayot et al. Dec 2005 B2
6973479 Brady, Jr. et al. Dec 2005 B2
6977638 Bayot et al. Dec 2005 B1
7028304 Weinberger et al. Apr 2006 B1
7040697 Tuccinardi et al. May 2006 B1
7042528 Lester et al. May 2006 B2
7068712 Zang et al. Jun 2006 B1
7076724 Cole et al. Jul 2006 B2
7088525 Finizio et al. Aug 2006 B2
7090128 Farley et al. Aug 2006 B2
7102691 Dischert et al. Sep 2006 B2
7113978 Beasley et al. Sep 2006 B2
7114171 Brady et al. Sep 2006 B2
7124426 Tsuria et al. Oct 2006 B1
7177638 Funderburk et al. Feb 2007 B2
7187498 Bengoechea et al. Mar 2007 B2
7199396 Lebrun Apr 2007 B2
7200229 Spring et al. Apr 2007 B2
7213055 Kathol May 2007 B1
7216296 Broberg et al. May 2007 B1
7221650 Cooper et al. May 2007 B1
7236488 Kavipurapu Jun 2007 B1
7249167 Liaw et al. Jul 2007 B1
7269761 Yi Sep 2007 B2
7280134 Henderson et al. Oct 2007 B1
7280825 Keen et al. Oct 2007 B2
7286289 Bengoechea et al. Oct 2007 B2
7289499 Chinn et al. Oct 2007 B1
7330649 Finizio et al. Feb 2008 B2
7337043 Bull Feb 2008 B2
7343157 Mitchell Mar 2008 B1
7344102 Royer et al. Mar 2008 B1
7352929 Hagen et al. Apr 2008 B2
7403780 VanLaningham et al. Jul 2008 B2
7405773 Lester et al. Jul 2008 B2
7438511 Legeay Oct 2008 B2
7483382 Toillon et al. Jan 2009 B1
7483696 Mitchell Jan 2009 B1
7486960 Brady, Jr. et al. Feb 2009 B2
7487938 Brady, Jr. et al. Feb 2009 B2
7496361 Mitchell et al. Feb 2009 B1
7565143 Takeuchi et al. Jul 2009 B2
7566254 Sampica et al. Jul 2009 B2
7580528 Farley et al. Aug 2009 B2
7587733 Keen et al. Sep 2009 B2
7587734 Logan et al. Sep 2009 B2
7599691 Mitchell Oct 2009 B1
7600248 Berry Oct 2009 B1
7619422 Tsamis et al. Nov 2009 B2
7620364 Higashida et al. Nov 2009 B2
7621770 Finizio et al. Nov 2009 B1
7628357 Mercier et al. Dec 2009 B2
7642974 Brady, Jr. et al. Jan 2010 B2
7649696 Finizio et al. Jan 2010 B2
7675849 Watson et al. Mar 2010 B2
7676225 Funderburk et al. Mar 2010 B2
7680092 VanLaningham et al. Mar 2010 B2
7715783 Girard et al. May 2010 B2
7725569 Brady, Jr. et al. May 2010 B2
7792189 Finizio et al. Sep 2010 B2
7808891 Law et al. Oct 2010 B2
7830781 Zogg et al. Nov 2010 B2
7836472 Brady, Jr. et al. Nov 2010 B2
7843554 Koenck et al. Nov 2010 B2
7859995 Bejerano et al. Dec 2010 B2
7876688 Hauenstein et al. Jan 2011 B2
8184974 Cline May 2012 B2
8416698 Petrisor et al. Apr 2013 B2
8424045 Petrisor Apr 2013 B2
8659990 Petrisor et al. Feb 2014 B2
9036487 Petrisor et al. May 2015 B2
20020045484 Eck et al. Apr 2002 A1
20020046300 Hanko et al. Apr 2002 A1
20020063924 Kimbrough et al. May 2002 A1
20020180904 Lauzun et al. Dec 2002 A1
20030016806 Emerson Jan 2003 A1
20030021241 Dame et al. Jan 2003 A1
20030025599 Monroe Feb 2003 A1
20030033459 Garnett Feb 2003 A1
20030060156 Giaccherini et al. Mar 2003 A1
20030064714 Sanford et al. Apr 2003 A1
20030085818 Renton et al. May 2003 A1
20030088360 Ikhlef et al. May 2003 A1
20030093798 Rogerson May 2003 A1
20030107248 Sanford et al. Jun 2003 A1
20030110466 Dricot et al. Jun 2003 A1
20030110509 Levinson et al. Jun 2003 A1
20030149983 Markel Aug 2003 A1
20030184957 Stahl et al. Oct 2003 A1
20030217363 Brady et al. Nov 2003 A1
20040052372 Jakoubek Mar 2004 A1
20040081083 Sekihata Apr 2004 A1
20040105459 Mannam Jun 2004 A1
20040217976 Sanford Nov 2004 A1
20040235469 Krug Nov 2004 A1
20050005225 Johnson et al. Jan 2005 A1
20050044186 Petrisor Feb 2005 A1
20050044564 Stopniewicz et al. Feb 2005 A1
20050053237 Hanson Mar 2005 A1
20050055228 Boyer et al. Mar 2005 A1
20050055278 Boyer Mar 2005 A1
20050132407 Boyer, Jr. et al. Jun 2005 A1
20050152289 Nagata et al. Jul 2005 A1
20050177763 Stoler Aug 2005 A1
20050193257 Stoler Sep 2005 A1
20050200697 Schedivy et al. Sep 2005 A1
20050216938 Brady, Jr. et al. Sep 2005 A1
20050256616 Rhoads Nov 2005 A1
20050268319 Brady, Jr. et al. Dec 2005 A1
20050278753 Brady, Jr. et al. Dec 2005 A1
20050278754 Bleacher et al. Dec 2005 A1
20060107295 Margis et al. May 2006 A1
20060143660 Logan et al. Jun 2006 A1
20060143661 Funderburk et al. Jun 2006 A1
20060143662 Easterling et al. Jun 2006 A1
20060174285 Brady, Jr. et al. Aug 2006 A1
20060179457 Brady, Jr. et al. Aug 2006 A1
20060184583 Renton et al. Aug 2006 A1
20060194575 Stadelmeler et al. Aug 2006 A1
20060238497 Velagapudi Oct 2006 A1
20060277589 Margis et al. Dec 2006 A1
20060291803 Watson et al. Dec 2006 A1
20070044126 Mitchell Feb 2007 A1
20070060063 Wright et al. Mar 2007 A1
20070077998 Petrisor Apr 2007 A1
20070130591 Brady, Jr. et al. Jun 2007 A1
20070164609 Shalam et al. Jul 2007 A1
20070280199 Rong Dec 2007 A1
20070292108 Reichert et al. Dec 2007 A1
20070294732 Brady et al. Dec 2007 A1
20080023600 Perlman Jan 2008 A1
20080040756 Perlman et al. Feb 2008 A1
20080050512 Lower et al. Feb 2008 A1
20080056178 Alexander et al. Mar 2008 A1
20080089658 Grady et al. Apr 2008 A1
20080105784 Barroca May 2008 A1
20080142585 Foreman et al. Jun 2008 A1
20080157997 Bleacher et al. Jul 2008 A1
20080159174 Enomoto et al. Jul 2008 A1
20080187282 Brady et al. Aug 2008 A1
20080189748 Bleacher et al. Aug 2008 A1
20080237440 Lester et al. Oct 2008 A1
20080240029 Lynch et al. Oct 2008 A1
20080240038 Lynch et al. Oct 2008 A1
20080240061 Lynch et al. Oct 2008 A1
20080240062 Lynch et al. Oct 2008 A1
20080244664 Hong et al. Oct 2008 A1
20080259023 Chang Oct 2008 A1
20080285459 Diab et al. Nov 2008 A1
20080310609 Brady, Jr. et al. Dec 2008 A1
20080312778 Correa et al. Dec 2008 A1
20080313259 Correa et al. Dec 2008 A1
20090007193 Correa et al. Jan 2009 A1
20090007194 Brady, Jr. et al. Jan 2009 A1
20090034540 Law Feb 2009 A1
20090068474 Lower et al. Mar 2009 A1
20090077595 Sizelove et al. Mar 2009 A1
20090079705 Sizelove et al. Mar 2009 A1
20090081947 Margis Mar 2009 A1
20090083805 Sizelove et al. Mar 2009 A1
20090094635 Aslin et al. Apr 2009 A1
20090096857 Frisco et al. Apr 2009 A1
20090100476 Frisco et al. Apr 2009 A1
20090119721 Perlman et al. May 2009 A1
20090168914 Chance et al. Jul 2009 A1
20090202241 Yu et al. Aug 2009 A1
20090228908 Margis et al. Sep 2009 A1
20090243352 Cailleteau Oct 2009 A1
20090246355 Lower et al. Oct 2009 A9
20090262290 Sampica et al. Oct 2009 A1
20090279257 Lower et al. Nov 2009 A1
20090282469 Lynch et al. Nov 2009 A1
20100008503 Farley et al. Jan 2010 A1
20100013279 Cailleteau Jan 2010 A1
20100027461 Bothorel Feb 2010 A1
20100028019 Yu et al. Feb 2010 A1
20100032999 Petitpierre Feb 2010 A1
20100060739 Salazar Mar 2010 A1
20100064327 Lynch et al. Mar 2010 A1
20100066616 Brady, Jr. et al. Mar 2010 A1
20100088731 Vanyek Apr 2010 A1
20100098418 Bouet et al. Apr 2010 A1
20100138581 Bird et al. Jun 2010 A1
20100138582 Bird et al. Jun 2010 A1
20100138879 Bird et al. Jun 2010 A1
20100144267 Funderburk et al. Jun 2010 A1
20100152962 Bennett et al. Jun 2010 A1
20100180299 Girard et al. Jul 2010 A1
20100189089 Lynch et al. Jul 2010 A1
20100195634 Thompson Aug 2010 A1
20100199196 Thompson Aug 2010 A1
20100205333 Francois et al. Aug 2010 A1
20110003505 Greig et al. Jan 2011 A1
20110162015 Holyoake et al. Jun 2011 A1
20140269262 Petrisor et al. Sep 2014 A1
Foreign Referenced Citations (21)
Number Date Country
1048478 Jan 1991 CN
1362349 Aug 2002 CN
1726716 Jan 2006 CN
1469652 Oct 2004 EP
2462513 Jun 2012 EP
2235800 May 1993 GB
5596145 Aug 2014 JP
WO 9015508 Dec 1990 WO
WO 9850848 Nov 1998 WO
WO 02061594 Aug 2002 WO
WO 02093925 Nov 2002 WO
WO 03098378 Nov 2003 WO
WO 2004075486 Sep 2004 WO
WO 2005004490 Jan 2005 WO
WO 2006062641 Jun 2006 WO
WO 2007035739 Mar 2007 WO
WO 2008033870 Mar 2008 WO
WO 2011017233 Feb 2011 WO
WO 2011020071 Feb 2011 WO
WO 2011022708 Feb 2011 WO
WO 2011044148 Apr 2011 WO
Non-Patent Literature Citations (18)
Entry
Chinese First Office Action re App. No. 200680034350.3, dated Jul. 10, 2009.
Cisco Headquarters, “Guide to ATM Technology,” 1999, Cisco Systems, Inc.
International Preliminary Report on Patentability in corresponding International Application No. PCT/US2010/046246, issued Mar. 1, 2012, 6 pages.
Marsh, George, “A380: Jumbo Step for In-Flight-Entertainment,” Avionics Magazine, Mar. 1, 2006, http://www.aviationtoday.com/av/categories/commercial/792.html, 3 pages.
PCT International Patentability Report and Written Opinion re App. No. PCT/US2006/036492, dated Mar. 26, 2008.
PCT International Preliminary Report and Written Opinion re App. No. PCT/US2007/078202, dated Mar. 17, 2009.
PCT International Search Report and Written Opinion, re App. No. PCT/US2010/44017, dated Oct. 25, 2010.
PCT International Search Report and Written Opinion re App. No. PCT/US 10/46246, mailed Nov. 29, 2010.
PCT International Search Report and Written Opinion, re App. No. PCT/US2010/45538, dated Nov. 12, 2010.
PCT International Search Report re App. No. PCT/US2006/036492, dated Mar. 8, 2007.
PCT International Search Report re App. No. PCT/US2007/078202, dated Oct. 28, 2008.
PCT Search Report re App. No. PCT/US10/51505 dated Dec. 28, 2010.
PCT Search Report re App. No. PCT/US2004/019030, dated Jan. 14, 2005.
Texas Instruments, “IrDA Transceiver with Encoder/Decoder”, http://www.ti.com/lit/ds/slus254/slus254.pdf, 1999.
International Preliminary Report on Patentability in corresponding International Application No. PCT/US2010/044017, issued Feb. 16, 2012, 9 pages.
International Preliminary Report on Patentability in corresponding International Application No. PCT/US2010/045538, issued Feb. 14, 2012, 6 pages.
International Preliminary Report on Patentability in corresponding International Application No. PCT/US2010/051505, issued Apr. 11, 2012, 5 pages.
Office Action received in corresponding Chinese Application No. 200680034350.3, mailed Mar. 31, 2012, 9 pages.
Related Publications (1)
Number Date Country
20160072698 A1 Mar 2016 US
Provisional Applications (1)
Number Date Country
61274726 Aug 2009 US
Continuations (2)
Number Date Country
Parent 13685525 Nov 2012 US
Child 14715437 US
Parent 12860437 Aug 2010 US
Child 13685525 US