The present patent relates to vehicles and particularly to quality of service (QoS) within communication networks within vehicles.
Vehicle builders have been using serial communication (multiplexing) between controllers to share information and distribute control for some time.
Doing so has greatly reduced the amount of vehicle signal wiring needed to implement the comfort, convenience, and safety features desired in modern consumer vehicles.
Control of the devices in the vehicle to implement desired features may be divided into controllers by function (powertrain, braking, steering, etc.), by location (engine compartment, seat, door, etc.) or in combinations thereof.
The controller for each of the functions/zones may share information with other controllers using a shared-access serial bus. The bus usually follows an industry standard such as J1850, CAN, LIN, Flexray, MOST and the like, well known to those of skill in the art. Multiple, independent busses may be used. In that case, one of the controllers may act as a gateway for information between the incompatible busses.
An alternative architecture introduces the idea of dividing the vehicle into geographic regions and locating a single controller for all of the features in that region. This architecture may also include the concept of smart peripherals to reduce the number of interconnections in localized areas of the vehicle. The smart peripherals use simple serial communication busses such as LIN busses to relay information from sensors to the zone controller or to accept actuator commands from the zone controller. The zone controllers may be linked by a serial communication bus structure.
Another alternative architecture incorporates a junction block that can be located in various zones of the vehicle. The junction block provides a mechanical and electrical connection point for power, ground and communication for small devices that are used to interface between input and output devices. The junction block also provides over current protection devices for the small connected devices, and multiple power sources distributed at different levels within the system.
Current bus protocols are not easily scalable and are limited in bandwidth. X-by-wire functionality, multimedia infotainment, navigation and other content intensive applications will put more demands on bandwidth and quality of service (QoS) requiring marked improvements in bandwidth, speed, delay, jitter, fault tolerance, message integrity, guaranteed delivery, availability and survivability.
Therefore, there is needed new architecture, such as switch fabric network architecture, for the automotive environment that provides scalability in both capacity and redundancy, at costs on par with existing bus architecture.
This disclosure will describe several embodiments to illustrate its broad teachings. Reference is also made to the attached drawings.
Although the following text sets forth a detailed description of numerous different embodiments of the invention, it should be understood that the legal scope of the invention is defined by the words of the claims set forth at the end of this patent. The detailed description is to be construed as exemplary only and does not describe every possible embodiment of the invention because describing every possible embodiment would be impractical, if not impossible. Numerous alternative embodiments could be implemented, using either current technology or technology developed after the filing date of this patent, which would still fall within the scope of the claims defining the invention. Moreover, structure, features and functions of the herein described embodiments should be considered interchangeable, and every structure, feature or function may be used with any of the embodiments herein described.
It should also be understood that, unless a term is expressly defined in this patent using the sentence “As used herein, the term ‘______’ is hereby defined to mean . . . ” or a similar sentence, there is no intent to limit the meaning of that term, either expressly or by implication, beyond its plain or ordinary meaning, and such term should not be interpreted to be limited in scope based on any statement made in any section of this patent (other than the language of the claims). To the extent that any term recited in the claims at the end of this patent is referred to in this patent in a manner consistent with a single meaning, that is done for sake of clarity only so as to not confuse the reader, and it is not intended that such claim term by limited, by implication or otherwise, to that single meaning. Unless a claim element is defined by reciting the word “means” and a function without the recital of any structure, it is not intended that the scope of any claim element be interpreted based on the application of 35 U.S.C. § 112, sixth paragraph.
The network 102 includes a switch fabric 130 defining a plurality of communication paths 132 between the devices. The communication paths permit multiple simultaneous peer-to-peer or point-to-point, one-to-many, many-to-many, etc. data packet communication between the devices 104-110. During operation of the vehicle 100, data exchanged, for example, between devices 104 and 110 may utilize any available path or paths between the devices. In operation, a single path through the switch fabric 130 may carry all of the data packets representing a communication between the device 104 and the device 110, or several communication paths may carry portions of the data packets. Subsequent communications may use the same paths or other paths as dictated by the then state of the network 102. This flexibility provides reliability and speed advantages over bus architectures that are restricted to single communication paths between devices, and hence are subject to failure with failure of the single path or delays based upon congestion of the path. Moreover, communications between other of the devices 104-110 may occur simultaneously using the communication paths within the switch fabric 130.
The network 102 is a packet data network which may comply with a transmission control protocol/Internet (TCP/IP), asynchronous transfer mode (ATM), Infiniband, RapidIO, or any other packet data protocol now known or later developed. It may also include bus structures that are operated in a packet transit mode, as will be described herein later. As such, the network 102 may use data packets, having fixed or variable length, defined by one or more applicable protocols. For example, if the network 102 uses asynchronous transfer mode (ATM) communication protocol, an ATM standard data cell may be used.
The devices 104-110 need not be discrete devices. Instead, the devices may be systems or subsystems of the vehicle and may include one or more legacy communication media, i.e., legacy bus architectures such as J1850, CAN, LIN, Flexray, MOST or similar bus structures. In such embodiments, the respective interface 112-118 may be configured as a proxy or gateway to permit communication between the active network 102 and the legacy device 104-110.
The communication links 214-230 may be robust transport media and may be adapted from serial communication architecture as will be described. That is, the communication links 214-230 may be capable of providing guaranteed, reliable message transfer between the network elements. Any given communication link 214-230 may be a single bi-directional link, a single uni-directional link or combinations of bidirectional and unidirectional links or any combination of link technologies. The links may be defined according to an existing, robust transport mechanism designed for the automotive environment such as CAN, LIN, FLEXRAY, J1850, and the like or may be defined according to transport protocols in development or that are later developed. The links may also be combinations of technologies, or specified in accordance with virtually any other protocol.
The network 200 may incorporate at some level a system management function providing supervision, control, diagnostics and other related functionality. This functionality may be provide by way of a separate entity coupled to the network 200, or the functionality may be distributed within the network elements 202-212 or other suitable elements of the network 200.
Referring now to
A structure for the network elements may be as illustrated in
A data packet used for communication within the networks described herein may include a packet type identifier, routing information, source ID information, QoS information and payload. Illustrated in
The data packet 600 may be adapted to facilitate source routing, i.e., the route the data packet will take through the network is determined by the information source and this path information is contained within the data packet itself. The data packet 600 may also be adapted to facilitate destination routing, i.e., the route the data packet will take through the network is determined by each intermediate node and the next node information is contained within the data packet.
The data packet 600 may be adapted from known communication packet structures, such as a CAN data packet. As shown in
The networks 200 and 400 may be implemented into existing applications by adapting the communication links 214-232 from existing robust communication medium. In the implementations shown in
On initial startup of a network according to the embodiments described herein, such as networks 200 and 400, it necessary to identify all nodes of the network. The term “node” may refer to network elements, including but not limited to those network elements described in connection with networks 200 and 400, switches, routers and any and all coupled devices. It is also necessary to identify message identifiers that are of interest to particular nodes, to assign logical addresses to each node, to create a translation table of identifiers to node logical address, to create a routing table from node to node, and to create one or more back-up routes from node to node. Several levels of service may be associated with this so-called discovery process. For example, and as will be described in more detail, the network may offer nodes capable of multicast, encryption or other capabilities. Nodes may be configured to receive information or to advertise availability of information.
Discovery processes are known in connection with networks, and the commonly used Dijkstra algorithm may be employed to complete a network discovery process and calculate the routing table. These known processes however, assume a totally dynamic network and completes a full discovery process on each power up or upon detection of any failure. Depending on the scale of the network, this discovery process may take several minutes time, which is not practical in an automotive environment where the user expects to be able to enter the vehicle, start it and immediately operate it or where a fault may occur while the vehicle is operating and any significant delay in the completing the discovery process may present a safety concern. Having to wait several minutes for a discovery process to complete would be viewed as a defect, and would be unacceptable to users and manufacturers.
Networks according to the embodiments described herein generally are not totally dynamic. The network typically only becomes dynamic upon detecting a failure, i.e., the network is not dynamic until something goes wrong, or when new hardware is added to the network. Therefore, a last known state of the network may be saved and an incremental discovery process may be employed upon detecting a network change. The incremental discovery process may be completed with little or no effect on overall network performance. A suitable discovery process is disclosed and described in U.S. patent application Ser. No. 10/463,988, entitled a Discovery Process in a Vehicle Network, the disclosure of which is hereby expressly incorporated by reference.
The flexibility of the described network architecture may be used to implement a variety of network services and capabilities. One such capability is improved QoS. In addition to the inherent QoS advantages provided by the network architecture, advantages may be obtained through the control of messaging and traffic within the network. There are numerous QoS considerations depending on the data being communicated. For example, certain data may be defined as real time mission critical. Delivery of this data must be guaranteed within a few milliseconds (ms). Examples of such data are safety related controls, powertrain operating controls, braking and steering controls and the like. There may also exist non-real time mission critical data. This data also requires guaranteed delivery, but the time constrains on that delivery are flexible and may be in the hundreds of milliseconds. Examples of this data may include non-safety related vehicle operating controls and functions. There may also be real time non-mission critical data. This data may require delivery within tens of milliseconds without delivery guarantee. That is, if the data is not delivered within a delivery time frame, it may be simply dropped. This data may be voice/multimedia related data and the like. The network concepts herein described may be adapted to meet each of these QoS requirements.
Referring to
The network 700 illustrates devices that produce or consume real time mission critical data, i.e., wheel speed sensors (702-708), transmission controller (712) and vehicle speed sensors (710); data that may be used in connection with anti-lock braking, traction and stability control, speed control, collision avoidance and other vehicle operations. The network 700 also illustrates devices that produce or consume real time non mission critical data; i.e., selection and operation control signals and audio output signals from the CD player 718 and the amplifier 720.
The smart nodes 702-712, a system management function (not depicted), a combination thereof, or other network entity may detect that a node, either a smart node or a dumb node, is creating traffic, inhibiting traffic flow or otherwise function in a manner that that degrades the performance of the network. To bring this traffic situation under control, e.g., to make it compatible with the system capacity, multiple classes of service for messages may be defined and implemented. Message class information, or QoS class of the message, may be used to selectively control traffic within the network.
In one possible implementation, network nodes, e.g., the smart nodes 702-712, may be configured to perform an arbitration function. In such a configuration, an adjacent node may be configured to control the links to a node. The adjacent node would then be in a position to assert control of the link, e.g., by applying a dominant state on the link, using the arbitration mechanism defined by the link communication protocol. Each of the foregoing describe communication protocols, CAN, LIN, J1850, Flexray, MOST and the like that may be implemented on the links provide such an arbitration mechanism. Thus, the adjacent node may be used to shut off all traffic from one or more nodes on a link or to throttle the traffic to a set predetermined or average level.
As further described, messages communicated within the network may contain message class data, and the message class data may be used to manage traffic from a given port on a node. Messages may be assigned one of a number of different classes based upon the mission critical, non-mission critical and various other classes of messages that may be defined within the network. Message classes may be assigned by the node creating the message or may be generated by a central or distributed management function. The message class data may be carried in dedicated packages/frames or combined with the messages themselves or with other messages.
Both arbitration and message class traffic management allows for a reducing to a desired level or entirely stopping all or a portion of the traffic within all or a portion of the network. In another implementation, the physical link control mechanism may be used to disable one or more links for a set or dynamic percent of time or set or dynamic period of time responsive to any number of criteria. For example, the link may be caused to be disabled for a set period of time after a predetermined number of messages are sent or the average message rate exceeds a selectable threshold. The percent or period may be selective as to message class or other message characteristic, such as destination. For example, the network may disable a link for x seconds after n high message (QoS) class messages are sent within y seconds. The link may be responsive to the presence of a token, or similar permissive structure, at a node that defines a level of messaging traffic on the link to or from the node. The token may define a message budget, e.g., allowing x number of messages per unit time. The token may further be time limited, and thus may expire after a defined period of activity or time.
The messaging rate can be similarly used to completely stop traffic, throttle to a given rate or selectively throttle messages by message (QoS) class. In addition, the messaging mechanism allows the flexibility of sending a node budget or token allowing it to send a given number of messages per message characteristic such as message (QoS) class or destination node. This can be applied in many situations. For example, a node receiving an overload of messages from multiple sources could send a message for all or some nodes to throttle all messages, specific messages or all messages of a given message (QoS) class.
To further ensure satisfactory QoS for the real time mission critical data, a configurable fraction or partition of communication bandwidth may be dedicated to a particular kind of message traffic, e.g., mission critical traffic. In general, the ability to handle multiple message classes on a switched network requires schemes to reserve resources in the network. This reservation may be static or may be dynamically changed in response to network traffic conditions or requests from specific applications.
In general, memory needs to be allocated to allow for the queuing of messages. This allocation may be on a per node port basis and may be separately allocated for input and output messages. An alternative may be to have shared memory for all ports. In any case, memory may be allocated based on message (QoS) class or other message characteristic.
For any buffering scheme, the algorithm to handle queuing may be selective based on message characteristic. For example, one message (QoS) class may be handled on a first-in-first-out (FIFO) basis while another class may be handled on a last-in-first-out (LIFO) basis.
Another approach to managing the flexible allocation of bandwidth is to throttle data at the smart nodes such that the smart node is limited to transmitting only at a fraction F of the available time averaged over a time period W. F and W may vary by traffic class and node, and these values may be preconfigured and/or configured by a system management function. Sufficient buffer space may be needed within the network, but not necessarily for all of the smart nodes, such that at least all real time mission critical traffic can be buffered in the case of output port contention. The buffer size and availability may be based upon the QoS of the traffic class. To prevent buffer overflow, and loss of data, throttling messages may be used to stop non-mission critical traffic as buffer occupancy grows to a trigger point. For example, smart nodes 702, 704 and 706 are coupled to a network 700. Each smart node 702 and 704 may be configured to send 0.25 Mbs to node 706 averaged over a 0.1 sec. time period. Both smart nodes 702 and 704 could potentially send a 1 Mbs burst for 0.25 sec. simultaneously to 706. In this case, the network 708 has to buffer at least 25 kb of data for 0.025 sec. As will be appreciated, requirements for buffering can quickly grow large unless small averaging windows are used. If 702 is non-mission critical, a throttling message may be employed to prevent it from simultaneously with 704 transmitting to 706. Alternatively or additionally, the averaging window for 702 may be made sufficiently small to reduce buffer requirements.
The networks described herein have application and as demonstrated may be adapted to operate with legacy architecture, systems and devices. It may become necessary or desirable to retrofit an existing vehicle that is specified with legacy architecture with one or more features that take advantage of the improved capability and QoS of the network structures according to this patent.
Other modifications and alternative embodiments of the invention will be apparent to those skilled in the art in view of the foregoing description. This description is to be construed as illustrative only, and is for the purpose of teaching those skilled in the art the best mode of carrying out the invention. The details of the structure and method may be varied substantially without departing from the spirit of the invention, and the exclusive use of all modifications which come within the scope of the appended claims is reserved.
This application claims benefit under 35 U.S.C. § 119(e) to provisional patent application Ser. No. 60/477,897, filed Jun. 12, 2003, the disclosure of which is hereby expressly incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5323385 | Jurewicz et al. | Jun 1994 | A |
5524213 | Dais et al. | Jun 1996 | A |
5596722 | Rahnema | Jan 1997 | A |
5629928 | Calvignac et al. | May 1997 | A |
5732074 | Spaur et al. | Mar 1998 | A |
5831980 | Varma et al. | Nov 1998 | A |
5881316 | Chaney et al. | Mar 1999 | A |
5959993 | Varma et al. | Sep 1999 | A |
6252614 | Mullin | Jun 2001 | B1 |
6252884 | Hunter | Jun 2001 | B1 |
6259699 | Opalka et al. | Jul 2001 | B1 |
6292862 | Barrenscheen et al. | Sep 2001 | B1 |
6349246 | Smith et al. | Feb 2002 | B1 |
6356823 | Iannotti et al. | Mar 2002 | B1 |
6430164 | Jones et al. | Aug 2002 | B1 |
6519263 | Huth | Feb 2003 | B1 |
6542739 | Garner | Apr 2003 | B1 |
6559783 | Stokening | May 2003 | B1 |
6611537 | Edens et al. | Aug 2003 | B1 |
6611755 | Coffee et al. | Aug 2003 | B1 |
6631134 | Zadikian et al. | Oct 2003 | B1 |
6747365 | Reinold et al. | Jun 2004 | B2 |
6753867 | Mullin | Jun 2004 | B2 |
6877048 | Bilak et al. | Apr 2005 | B2 |
6885916 | Remboski et al. | Apr 2005 | B2 |
6912221 | Zadikian et al. | Jun 2005 | B1 |
6931004 | Reinold et al. | Aug 2005 | B2 |
6934612 | Remboski et al. | Aug 2005 | B2 |
6940813 | Ruutu | Sep 2005 | B2 |
7023851 | Chakravorty | Apr 2006 | B2 |
7027387 | Reinold et al. | Apr 2006 | B2 |
7170853 | Remboski et al. | Jan 2007 | B2 |
7173903 | Remboski et al. | Feb 2007 | B2 |
7206325 | Nong | Apr 2007 | B2 |
7231455 | Marejka et al. | Jun 2007 | B2 |
7272496 | Remboski et al. | Sep 2007 | B2 |
7310327 | Fehr et al. | Dec 2007 | B2 |
20010001319 | Beckert et al. | May 2001 | A1 |
20020044553 | Chakravorty | Apr 2002 | A1 |
20020114305 | Oyama et al. | Aug 2002 | A1 |
20020132611 | Immonen et al. | Sep 2002 | A1 |
20020150050 | Nathanson | Oct 2002 | A1 |
20030026268 | Navas | Feb 2003 | A1 |
20030033394 | Stine | Feb 2003 | A1 |
20030042792 | Reinold et al. | Mar 2003 | A1 |
20030043739 | Reinold et al. | Mar 2003 | A1 |
20030043750 | Remboski et al. | Mar 2003 | A1 |
20030043779 | Remboski et al. | Mar 2003 | A1 |
20030043793 | Reinold et al. | Mar 2003 | A1 |
20030043799 | Reinold et al. | Mar 2003 | A1 |
20030043824 | Remboski et al. | Mar 2003 | A1 |
20030045234 | Remboski et al. | Mar 2003 | A1 |
20030045971 | Reinold et al. | Mar 2003 | A1 |
20030045972 | Remboski et al. | Mar 2003 | A1 |
20030046327 | Reinold et al. | Mar 2003 | A1 |
20030051131 | Reinold et al. | Mar 2003 | A1 |
20030065630 | Brown et al. | Apr 2003 | A1 |
20030093798 | Rogerson | May 2003 | A1 |
20030135639 | Marejka et al. | Jul 2003 | A1 |
20030204636 | Greenblat et al. | Oct 2003 | A1 |
20030222982 | Hamdan et al. | Dec 2003 | A1 |
20040001593 | Reinold et al. | Jan 2004 | A1 |
20040002794 | Pillar et al. | Jan 2004 | A1 |
20040002799 | Dabbish et al. | Jan 2004 | A1 |
20040003227 | Reinold et al. | Jan 2004 | A1 |
20040003228 | Fehr et al. | Jan 2004 | A1 |
20040003229 | Reinold et al. | Jan 2004 | A1 |
20040003230 | Puhl et al. | Jan 2004 | A1 |
20040003231 | Levenson et al. | Jan 2004 | A1 |
20040003232 | Levenson et al. | Jan 2004 | A1 |
20040003233 | Reinold et al. | Jan 2004 | A1 |
20040003234 | Reinold et al. | Jan 2004 | A1 |
20040003237 | Puhl et al. | Jan 2004 | A1 |
20040003242 | Fehr et al. | Jan 2004 | A1 |
20040003243 | Fehr et al. | Jan 2004 | A1 |
20040003245 | Dabbish et al. | Jan 2004 | A1 |
20040003249 | Dabbish et al. | Jan 2004 | A1 |
20040003252 | Dabbish et al. | Jan 2004 | A1 |
20040095907 | Agee | May 2004 | A1 |
20040151114 | Ruutu | Aug 2004 | A1 |
20040199664 | Feldman | Oct 2004 | A1 |
20040213295 | Fehr | Oct 2004 | A1 |
20040227402 | Fehr et al. | Nov 2004 | A1 |
20040252697 | Wille et al. | Dec 2004 | A1 |
20040254700 | Fehr et al. | Dec 2004 | A1 |
20040258001 | Remboski et al. | Dec 2004 | A1 |
20050004727 | Remboski et al. | Jan 2005 | A1 |
20050004756 | Remboski et al. | Jan 2005 | A1 |
20050038583 | Fehr et al. | Feb 2005 | A1 |
20050113988 | Nasr et al. | May 2005 | A1 |
20050144309 | Gish | Jun 2005 | A1 |
20050210073 | Oeda et al. | Sep 2005 | A1 |
20050243797 | Schrodi | Nov 2005 | A1 |
20060020717 | Remboski et al. | Jan 2006 | A1 |
20060266273 | Westberg et al. | Nov 2006 | A1 |
Number | Date | Country | |
---|---|---|---|
20050038583 A1 | Feb 2005 | US |
Number | Date | Country | |
---|---|---|---|
60477897 | Jun 2003 | US |