|Publication number||US7404015 B2|
|Application number||US 10/227,114|
|Publication date||Jul 22, 2008|
|Filing date||Aug 24, 2002|
|Priority date||Aug 24, 2002|
|Also published as||US20040039787|
|Publication number||10227114, 227114, US 7404015 B2, US 7404015B2, US-B2-7404015, US7404015 B2, US7404015B2|
|Inventors||Rami Zemach, Vitaly Sukonik, William N. Eatherton, John H. W. Bettink, Moshe Voloshin|
|Original Assignee||Cisco Technology, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (30), Non-Patent Citations (4), Referenced by (12), Classifications (20), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This invention especially relates to communications and computer systems; and more particularly, the invention relates to processing of packets such as in a router, packet switching system, or other communications or computer system; more specifically, such processing may include accessing one or more resources shared among processing engines.
The communications industry is rapidly changing to adjust to emerging technologies and ever increasing customer demand. This customer demand for new applications and increased performance of existing applications is driving communications network and system providers to employ networks and systems having greater speed and capacity (e.g., greater bandwidth). In trying to achieve these goals, a common approach taken by many communications providers is to use packet switching technology. Increasingly, public and private communications networks are being built and expanded using various packet technologies, such as Internet Protocol (IP).
A network device, such as a switch or router, typically receives, processes, and forwards or discards a packet based on one or more criteria, including the type of protocol used by the packet, addresses of the packet (e.g., source, destination, group), and type or quality of service requested. Additionally, one or more security operations are typically performed on each packet.
Known packet processes typically have architectures consisting of a pipeline with fixed stages of hardware resource blocks and micro-sequencers. The hardware resource blocks include functionality like parsing of packet headers based on register based configuration for packet classification and longest prefix match search. The micro-sequencers can do header modification based on results from resource blocks. This architecture strikes a balance between high performance (similar to levels of completely hardwired packet processors) and flexibility. There have been numerous tweaks made to the micro-code to support features not understood when the original ASICs were designed that would have required a re-spin if the micro-sequencers had not be included.
The primary difficulty with this architecture is that the pipeline architecture still assumes that the ordering of processing and resource accesses is mostly understood at the time of the application-specific integrated circuit (ASIC) design, and is fairly consistent across all applications. If new applications want to use resources (e.g., memories, lookup engines, or content-addressable memories) in new ways or want to more flexibly trade-off performance and features, the pipeline architecture is rigid. Additionally, the complexity of programming the pipelined engines greatly escalates with an increased number of processor stages. Also, the split packet processing functionality across the various stages of the pipelined architecture greatly constrains the packet processing capabilities. Needed are new methods and apparatus for processing packets.
Methods and apparatus are disclosed for processing packets in a router, packet switching system, or other communications or computer system. Such packet processing may include, for example, but is not limited to (nor all embodiments require) using a high performance massively parallel packet processing architecture, distributing packets or subsets thereof to individual packet processors and gathering the processed packet or subsets and forwarding the resultant modified or otherwise processed packets, accessing packet processing resources across a shared resource network, accessing packet processing resources using direct memory access techniques, and/or storing one overlapping portion of a packet in a global packet memory while providing a second overlapping portion to a packet processor.
In one embodiment, a packet belonging to one of multiple streams of packets is received. A next packet processor is determined based on a distribution pattern. A subset of bytes of the packet is distributed to the next packet processor. The subset of the packet is processed to generate a modified subset, which is gathered from the next packet processor in turn based on the distribution pattern; and a modified packet including the modified subset is forwarded. In one embodiment, a portion of the packet is placed in a global packet memory. In one embodiment, this portion and the processed subset of the packet include overlapping bytes of the packet. In one embodiment, the processing of the packet includes accessing one or more processing resources across a resource network shared by multiple packet processing engines. In one embodiment, the global packet memory is one of these resources. In one embodiment, these resources are accessed using direct memory access (DMA) techniques. In one embodiment, a packet processor can simultaneously have multiple DMA requests outstanding to the same or to different resources. In one embodiment, packet processing is performed using other methods and apparatus disclosed herein.
The appended claims set forth the features of the invention with particularity. The invention, together with its advantages, may be best understood from the following detailed description taken in conjunction with the accompanying drawings of which:
Methods and apparatus are disclosed for processing packet, such as in a router, packet switching system, or other communications or computer component, device, or system. Embodiments described herein include various elements and limitations, with no one element or limitation contemplated as being a critical element or limitation. Each of the claims individually recites an aspect of the invention in its entirety. Moreover, some embodiments described may include, but are not limited to, inter alia, systems, networks, integrated circuit chips, embedded processors, ASICs, methods, and computer-readable medium containing instructions. The embodiments described hereinafter embody various aspects and configurations within the scope and spirit of the invention, with the figures illustrating exemplary and non-limiting configurations.
As used herein, the term “packet” refers to packets of all types or any other units of information or data, including, but not limited to, fixed length cells and variable length packets, each of which may or may not be divisible into smaller packets or cells. The term “packet” as used herein also refers to both the packet itself or a packet indication, such as, but not limited to all or part of a packet or packet header, a data structure value, pointer or index, or any other part or identification of a packet. Moreover, these packets may contain one or more types of information, including, but not limited to, voice, data, video, and audio information. The term “item” is used herein to refer to a packet or any other unit or piece of information or data. The phrases “processing a packet” and “packet processing” typically refer to performing some steps or actions based on the packet, and which may or may not include modifying and/or forwarding the packet.
The term “system” is used generically herein to describe any number of components, elements, sub-systems, devices, packet switch elements, packet switches, routers, networks, computer and/or communication devices or mechanisms, or combinations of components thereof. The term “computer” is used generically herein to describe any number of computers, including, but not limited to personal computers, embedded processing elements and systems, control logic, ASICs, chips, workstations, mainframes, etc. The term “processing element” is used generically herein to describe any type of processing mechanism or device, such as a processor, ASIC, field programmable gate array, computer, etc. The term “device” is used generically herein to describe any type of mechanism, including a computer or system or component thereof. The terms “task” and “process” are used generically herein to describe any type of running program, including, but not limited to a computer process, task, thread, executing application, operating system, user process, device driver, native code, machine or other language, etc., and can be interactive and/or non-interactive, executing locally and/or remotely, executing in foreground and/or background, executing in the user and/or operating system address spaces, a routine of a library and/or standalone application, and is not limited to any particular memory partitioning technique. The steps, connections, and processing of signals and information illustrated in the figures, including, but not limited to any block and flow diagrams and message sequence charts, may be performed in the same or in a different serial or parallel ordering and/or by different components and/or processes, threads, etc., and/or over different connections and be combined with other functions in other embodiments in keeping within the scope and spirit of the invention.
Moreover, the terms “network” and “communications mechanism” are used generically herein to describe one or more networks, communications mediums or communications systems, including, but not limited to the Internet, private or public telephone, cellular, wireless, satellite, cable, local area, metropolitan area and/or wide area networks, a cable, electrical connection, bus, etc., and internal communications mechanisms such as message passing, interprocess communications, shared memory, etc.
The term “storage mechanism” includes any type of memory, storage device or other mechanism for maintaining instructions or data in any format. “Computer-readable medium” is an extensible term including any memory, storage device, storage mechanism, and other storage and signaling mechanisms including interfaces and devices such as network interface cards and buffers therein, as well as any communications devices and signals received and transmitted, and other current and evolving technologies that a computerized system can interpret, receive, and/or transmit. The term “memory” includes any random access memory (RAM), read only memory (ROM), flash memory, integrated circuits, and/or other memory components or elements. The term “storage device” includes any solid state storage media, disk drives, diskettes, networked services, tape drives, and other storage devices. Memories and storage devices may store computer-executable instructions to be executed by a processing element and/or control logic, and data which is manipulated by a processing element and/or control logic. The term “data structure” is an extensible term referring to any data element, variable, data structure, data base, and/or one or more or an organizational schemes that can be applied to data to facilitate interpreting the data or performing operations on it, such as, but not limited to memory locations or devices, sets, queues, trees, heaps, lists, linked lists, arrays, tables, pointers, etc. A data structure is typically maintained in a storage mechanism. The terms “pointer” and “link” are used generically herein to identify some mechanism for referencing or identifying another element, component, or other entity, and these may include, but are not limited to a reference to a memory or other storage mechanism or location therein, an index in a data structure, a value, etc. The term “associative memory” refers to all types of known or future developed associative memories, including, but not limited to binary and ternary content-addressable memories, hash tables, TRIE and other data structures, etc.
The term “one embodiment” is used herein to reference a particular embodiment, wherein each reference to “one embodiment” may refer to a different embodiment, and the use of the term repeatedly herein in describing associated features, elements and/or limitations does not establish a cumulative set of associated features, elements and/or limitations that each and every embodiment must include, although an embodiment typically may include all these features, elements and/or limitations. In addition, the phrase “means for xxx” typically includes computer-readable medium containing computer-executable instructions for performing xxx.
In addition, the terms “first,” “second,” etc. are typically used herein to denote different units (e.g., a first element, a second element). The use of these terms herein does not necessarily connote an ordering such as one unit or event occurring or coming before the another, but rather provides a mechanism to distinguish between particular units. Additionally, the use of a singular tense of a noun is non-limiting, with its use typically including one or more of the particular item rather than just one (e.g., the use of the word “memory” typically refers to one or more memories without having to specify “memory or memories,” or “one or more memories” or “at least one memory”, etc.) Moreover, the phrases “based on x” and “in response to x” are used to indicate a minimum set of items x from which something is derived or caused, wherein “x” is extensible and does not necessarily describe a complete list of items on which the operation is performed, etc. Additionally, the phrase “coupled to” is used to indicate some level of direct or indirect connection between two elements or devices, with the coupling device or devices modify or not modifying the coupled signal or communicated information. The term “subset” is used to indicate a group of all or less than all of the elements of a set. Moreover, the term “or” is used herein to identify a selection of one or more, including all, of the conjunctive items.
Methods and apparatus are disclosed for processing packets in a router, packet switching system, or other communications or computer system. Such packet processing may include, for example, but is not limited to using a high performance massively parallel packet processing architecture, distributing packets or subsets thereof to individual packet processors and gathering the processed packet or subsets and forwarding the resultant modified or otherwise processed packets, accessing packet processing resources across a shared resource network, accessing packet processing resources using direct memory access techniques, and/or storing one overlapping portion of a packet in a global packet memory while providing a second overlapping portion to a packet processor.
In one embodiment, a packet belonging to one of multiple streams of packets is received. A next packet processor is determined based on a distribution pattern. A subset of bytes of the packet is distributed to the next packet processor. The subset of the packet is processed to generate a modified subset, which is gathered from the next packet processor in turn based on the distribution pattern; and a modified packet including the modified subset is forwarded. In one embodiment, the state of the processing is checked prior to gathering from a packet processing element. In one embodiment, the processing of a subset continues after it is gathered, such as in the case of a multicast packet, packet fragmentation, wiretapping or snooping (e.g., routing a copy to another location). In one embodiment, a packet processing element is skipped during a current gathering round. In one embodiment, whether to skip is determined based on an indication provided by the packet processing element. In one embodiment, the same number of skip operations are performed in the gathering of all packets belonging to a particular stream of packets. In one embodiment, a packet to be forwarded is derived from a gathered modified subset of a packet and a subset of the packet stored in a global packet memory. In one embodiment, the subset of the packet manipulated by a packet processing engine and the subset stored in a global packet memory contain overlapping portions of the original packet.
In one embodiment, the processing of the packet includes accessing one or more processing resources across a resource network shared by multiple packet processing engines. In one embodiment, the global packet memory is one of these resources. In one embodiment, these resources are accessed using direct memory access (DMA) techniques. In one embodiment, a packet processor can simultaneously have multiple DMA requests outstanding to the same or to different resources. In one embodiment, a descriptor used in a prior DMA request is modified and then used in a second DMA request.
In one embodiment, component 120 includes a processor 121, memory 122, storage devices 123, and an external interface 124 for receiving and sending packets and other information, which are typically coupled via one or more communications mechanisms 129 (shown as a bus for illustrative purposes.) Various embodiments of component 120 may include more or less elements. The operation of component 120 is typically controlled by processor 121 using memory 122 and storage devices 123 to perform one or more scheduling tasks or processes. Memory 122 is one type of computer-readable medium, and typically comprises random access memory (RAM), read only memory (ROM), flash memory, integrated circuits, and/or other memory components. Memory 122 typically stores computer-executable instructions to be executed by processor 121 and/or data which is manipulated by processor 121 for implementing functionality in accordance with the invention. Storage devices 123 are another type of computer-readable medium, and typically comprise solid state storage media, disk drives, diskettes, networked services, tape drives, and other storage devices. Storage devices 123 typically store computer-executable instructions to be executed by processor 121 and/or data which is manipulated by processor 121 for implementing functionality in accordance with the invention.
A second subset of bytes of a received packet is forwarded to a distributor 220. The second subset includes the information contained in the received packet that is typically required for processing of the packet. In one embodiment, the first and second subset of bytes include overlapping portions of the received packet, which may be advantageous as a packet processing engine can overwrite a determined non-needed portion of the second subset of bytes, or deallocate a corresponding portion of memory. In one embodiment, this overlapping portion of bytes includes bytes which are not modified during packet processing, but their contents may be required for such processing. Thus, the packet processing engine may not need to forward any of the overlapping portion as during a gather phase these bytes will be included from the first subset when the modified packet is assembled during a gather and forwarding process.
Distributor 220 distributes a first subset of the packet to a next available packet processing engine 225 based on a deterministic or random distribution pattern. In one embodiment, a round-robin distribution pattern is used. In one embodiment using a random distribution pattern, a distribution order is tracked for use by a gathering element so that packet order is maintained, at least for packets belonging to a same stream. In one embodiment, a packet processing engine 225 may indicate a skip operation to distributor 220, so that the particular packet processing engine 225 is passed over during a current distribution round. In one embodiment, all packets belonging to a same packet stream cause each packet processing engine delivered one of these packets to generate the same number of skip operations to maintain the original order of the packets. In one embodiment, the original order is not maintained by the packet processor. In one embodiment, distributor 220 will wait, if necessary, for an identified next packet processing engine 225 to become ready before distributing it a packet or before moving on to a next packet processing engine 225.
As shown, packet processing engines 225 are connected via resource fabric 230 to a plurality of resources 235. In one embodiment, global packet buffer 239 is one of these resources 235. In one embodiment, resources 235 may include, inter alia, a resource routing unit, a policer, an associative memory, a traffic engineer, a statistics collector, and/or an authorization unit, etc. For example, a next hop address may be determined and returned to the requesting packet processing engine 225. In one embodiment, resources 235 are accessed by a packet processing engine using direct memory access (DMA) techniques.
After processing is completed, a modified second subset of a received packet is retrieved/received by egress packet header buffer 228, typically in a gathering pattern based on the distribution pattern, and is forwarded to output interface circuitry 240. The remaining portion of the original packet is retrieved/received from global packet buffer 239. Output interface circuitry 240 assembles and forwards the modified packet. 245 to a next component or system. In one embodiment, a packet processing engine 225 may or may not become available to process a next packet, as it may continue to process its current data to generate an additional one or more packets, such as required by a multicast or snoop operation, or to perform some additional processing such a required by certain statistics operations.
Modified second subsets of bytes of received packets are gathered from clusters 315A-315N by packet header gather 330, and are forwarded to packet head output FIFO 335. Modified packets 349 are sent from packet head output FIFO 340 after being assembled based on the first subset of bytes received from global packet buffer shared resource 310 and on the modified subset of bytes received from packet head output FIFO 335.
Next, as determined in process block 612, if a resource needs to be accessed, then as determined in process block 614, if a direct memory access (DMA) descriptor shell already exists, then in process block 616, the pertinent (e.g., remaining, different, etc.) fields of the descriptor are filled; otherwise, in process block 618, the DMA descriptor is build in memory. In process block 620, a DMA request is generated. Processing returns to process block 612 to possibly send out more DMA requests. Note, multiple DMA requests can be outstanding at a same time.
Otherwise, processing proceeds to process block 622 to optionally wait for some results from a DMA request or to receive some other data needed for processing. Then, in process block 624, the packet is manipulated and/or modified as required for the processing to be performed on the packet or subset thereof. In one embodiment, a portion of the subset of the packet being manipulated and/or modified may be overwritten during this process. Next, as determined in process block 626, if there are more results expected, then processing returns to process block 622. Otherwise, in process block 628, the packet processing engine indicates that processing is complete and no skip operation is set. In process block 630, the modified packet or subset thereof is provided to the gatherer upon request or at the appropriate time. As determined in process block 632, if all processing is completed and a new packet or subset thereof is ready to be received, then processing returns to process block 602. Otherwise, in process block 634, the packet processing engine indicates that processing is not complete, and processing returns to process block 608.
In view of the many possible embodiments to which the principles of our invention may be applied, it will be appreciated that the embodiments and aspects thereof described herein with respect to the drawings/figures are only illustrative and should not be taken as limiting the scope of the invention. For example and as would be apparent to one skilled in the art, many of the process block operations can be re-ordered to be performed before, after, or substantially concurrent with other operations. Also, many different forms of data structures could be used in various embodiments. The invention as described herein contemplates all such embodiments as may come within the scope of the following claims and equivalents thereof.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4491945||Jun 25, 1982||Jan 1, 1985||At&T Bell Laboratories||Fast packet switch|
|US4494230||Jun 25, 1982||Jan 15, 1985||At&T Bell Laboratories||Fast packet switching system|
|US4630260||Jun 27, 1985||Dec 16, 1986||At&T Bell Laboratories||Self-routing multipath packet switching network with sequential delivery of packets|
|US4734907||Sep 6, 1985||Mar 29, 1988||Washington University||Broadcast packet switching network|
|US4755986||Sep 11, 1986||Jul 5, 1988||Nec Corporation||Packet switching system|
|US4829227||Dec 30, 1987||May 9, 1989||Washington University||High speed data link|
|US4849968||Mar 4, 1988||Jul 18, 1989||Washington University||Buffer management system|
|US4893304||Sep 2, 1988||Jan 9, 1990||Bell Communications Research, Inc.||Broadband packet switch with combined queuing|
|US4901309||Dec 30, 1987||Feb 13, 1990||Washington University||Cross-connect for switch modules|
|US5127000||Aug 9, 1990||Jun 30, 1992||Alcatel N.V.||Resequencing system for a switching node|
|US5173897||Dec 19, 1990||Dec 22, 1992||Alcatel N.V.||Method of restoring the correct cell sequence, particularly in an atm exchange, and output unit therefor|
|US5179551||Apr 8, 1991||Jan 12, 1993||Washington University||Non-blocking multi-cast switching system|
|US5179556||Aug 2, 1991||Jan 12, 1993||Washington University||Bandwidth management and congestion control scheme for multicast ATM networks|
|US5229991||Jan 30, 1991||Jul 20, 1993||Washington University||Packet switch with broadcasting capability for atm networks|
|US5253251||Jan 8, 1992||Oct 12, 1993||Nec Corporation||Switching system with time-stamped packet distribution input stage and packet sequencing output stage|
|US5260935||Mar 1, 1991||Nov 9, 1993||Washington University||Data packet resequencer for a high speed data switch|
|US5339311||Jan 19, 1993||Aug 16, 1994||Washington University||Data packet resequencer for a high speed data switch|
|US5402415||Apr 22, 1993||Mar 28, 1995||Washington University||Multicast virtual circuit switch using cell recycling|
|US5450411||Sep 2, 1994||Sep 12, 1995||At&T Global Information Solutions Company||Network interface for multiplexing and demultiplexing isochronous and bursty data streams in ATM networks|
|US5842040||Jun 18, 1996||Nov 24, 1998||Storage Technology Corporation||Policy caching method and apparatus for use in a communication device based on contents of one data unit in a subset of related data units|
|US5896501||Feb 4, 1997||Apr 20, 1999||Fujitsu Limited||Multiprocessor system and parallel processing method for processing data transferred between processors|
|US5905725||Apr 18, 1997||May 18, 1999||Juniper Networks||High speed switching device|
|US5949780||Jul 11, 1997||Sep 7, 1999||Network Machines, Inc.||Integration of intelligence with communications in a switching node|
|US6032190||Oct 3, 1997||Feb 29, 2000||Ascend Communications, Inc.||System and method for processing data packets|
|US6128666||Jun 30, 1997||Oct 3, 2000||Sun Microsystems, Inc.||Distributed VLAN mechanism for packet field replacement in a multi-layered switched network element using a control field/signal for indicating modification of a packet with a database search engine|
|US7093027 *||Jul 23, 2002||Aug 15, 2006||Atrica Israel Ltd.||Fast connection protection in a virtual local area network based stack environment|
|US20010049744 *||Mar 2, 2001||Dec 6, 2001||Terrence Hussey||High-speed data processing using internal processor memory space|
|EP1085723A2||Sep 12, 2000||Mar 21, 2001||Kabushiki Kaisha Toshiba||Fast and adaptive packet processing device and method using digest information of input packet|
|WO2002009307A1||May 23, 2001||Jan 31, 2002||Pluris, Inc.||Method and apparatus for load apportionment among physical interfaces in data routers|
|WO2002039667A2||Nov 7, 2001||May 16, 2002||Fast-Chip, Inc.||Switch-based network processor|
|1||Chaney et al., "Design of a Gigabit ATM Switch," Feb. 5, 1996, WUCS-96-07, Washington University, St. Louis, MO, 20 pages.|
|2||Jonathan S. Turner, "An Optimal Nonblocking Multicast Virtual Circuit Switch," Jun. 1994, Proceedings of Infocom, 8 pages.|
|3||Turner et al., "System Architecture Document for Gigabit Switching Technology," Aug. 27, 1998, Ver. 3.5, ARL-94-11, Washington University, St. Louis, MO, 110 pages.|
|4||U.S. Appl. No. 10/227,119, filed Aug. 24, 2002, Sukonik et al.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7664897||Dec 1, 2005||Feb 16, 2010||Cisco Technology Inc.||Method and apparatus for communicating over a resource interconnect|
|US7739426||Oct 31, 2006||Jun 15, 2010||Cisco Technology, Inc.||Descriptor transfer logic|
|US7787462||Mar 6, 2006||Aug 31, 2010||Cisco Technology, Inc.||Applying features to packets in the order specified by a selected feature order template|
|US8321326||Apr 17, 2010||Nov 27, 2012||Auerbach Group Llc||Method and system for enhancing the efficiency of a digitally communicated data exchange|
|US8538861||Oct 11, 2012||Sep 17, 2013||Auerbach Group Llc||Use of adaptive and/or customized compression to enhance the efficiency of digital financial data exchanges|
|US8631304 *||Jan 28, 2010||Jan 14, 2014||Sandisk Il Ltd.||Overlapping error correction operations|
|US8756149||Aug 11, 2013||Jun 17, 2014||Auerbach Group Llc||Use of adaptive and/or customized compression to enhance the efficiency of digital data exchanges|
|US8817799 *||Apr 14, 2011||Aug 26, 2014||Broadcom Corporation||Network processor for supporting residential gateway applications|
|US20070206490 *||Mar 6, 2006||Sep 6, 2007||Cisco Technology, Inc., A California Corporation||Applying features to packets in the order specified by a selected feature order template|
|US20110066539 *||Apr 17, 2010||Mar 17, 2011||Andrew Auerbach||Method and System For Enhancing The Efficiency Of A Digitally Communicated Data Exchange|
|US20110258514 *||Jan 28, 2010||Oct 20, 2011||Sandisk Il Ltd.||Overlapping error correction operations|
|US20120263462 *||Apr 14, 2011||Oct 18, 2012||Broadlight, Ltd.||Network Processor for Supporting Residential Gateway Applications|
|U.S. Classification||710/22, 710/26, 710/23, 710/25, 710/28, 710/27, 710/65, 710/24|
|International Classification||G06F13/12, H04L29/06, G06F13/28, H04L12/56|
|Cooperative Classification||H04L69/22, H04L45/58, H04L45/00, H04L45/60|
|European Classification||H04L45/60, H04L45/00, H04L45/58, H04L29/06N|
|Aug 24, 2002||AS||Assignment|
Owner name: CISCO TECHNOLOGY, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ZEMACH, RAMI;SUKONIK, VITALY;EATHERTON, WILLIAM N.;AND OTHERS;REEL/FRAME:013239/0423;SIGNING DATES FROM 20020806 TO 20020820
|Jan 23, 2012||FPAY||Fee payment|
Year of fee payment: 4
|Jan 22, 2016||FPAY||Fee payment|
Year of fee payment: 8