text:
|Publication number
|Publication type
|Application number
|Publication date
|Sep 30, 2003
|Filing date
|Jun 4, 1998
|Priority date
|Jun 4, 1998
|Fee status
|Also published as
|Publication number
|Jamal Hadi Salim
|Original Assignee
|Nortel Networks Limited
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (3), Non-Patent Citations (2), Referenced by (75), Classifications (15), Legal Events (12)
|External Links: USPTO, USPTO Assignment, Espacenet
1. Field of the Invention
The invention relates to packet processing apparatus, to methods of reconfiguring a packet processor, and to methods of using a packet processor.
2. Background Art
It is known to transmit data in packets, each packet having header information as part of the packet, for use in processing the packet. The location and meaning of the header information within each packet is defined by a protocol. Most packet data transmission networks use multiple layers of protocols, in a hierarchy, according to the well known ISO model. Starting with the raw data from a top level application, each protocol adds its own header information to that added previously by preceding (higher) protocols. In the course of transmission through the network, the packet may pass through and be routed, forwarded switched or processed according to information stored in various parts of the packet header, depending on which level of the various levels of protocols, is being used.
Conventionally, in a router or switch operating according to a given one of the protocols, for each incoming packet, particular bits in the header relating to that given protocol are examined. The packet would be routed using those bits and passed to a chosen output port. Dedicated hardware is often used for speed of operation.
New types of protocol processing using different parts of header or payload information with different meanings, are always being proposed, at all different layers, to meet new requirements for e.g. quality of service, billing functions, error handling, grouping of packets, prioritizing, and so on. However, development of appropriate hardware is time consuming, even when groups of programmable logic chips are used, for a number of reasons. Connections between such chips must be defined and fixed, and changes made to the relatively complex logic which is often involved, will often have consequences to other parts of the logic, which are difficult to manage.
Software simulations and verifications of hardware designs can be carried out, but often do not reveal all the problems of a real hardware implementation.
Programmable chips for switching packets of particular protocols are known, e.g. ethernet switching chips, and protocol-specific dedicated router chips. Such router chips can extract destination information from a packet using hardcoded logic to achieve higher speed or throughput. They use a routing table whose entries can programmed from an external host.
A chipset produced by Obtek provides multiprotocol packet routing. A programmable filter examines the contents of each incoming packet to derive the buried protocols and retrieve source and destination addresses. The filter passes a packet descriptor to a routing systems control chip which manages memory allocation, input and output queues.
This filter is programmable using a proprietary language, a rule-based language which enables a programmer to define actions to be taken according to recognition of bits in a packet. As the filter's active structure parses and processes the unknown incoming packet, it is capable of activating other processors (including a host) or special hardware (for very high performance) to perform concurrent and supporting tasks.
It is an object of the invention to provide improved methods and apparatus.
According to a first aspect of the invention there is provided a packet processing apparatus comprising:
a programmable hardware discriminator for receiving incoming packets, and selecting bits from any part of the incoming packets;
a decision table for storing information relating to how the packets are to be processed;
programmable hardware searching logic coupled to the decision table and to the discriminator for accessing the information in the table according to the selected bits; and
a packet handler coupled to the searching logic, for processing the packets according to the result of the access.
Advantages include the following:
a) Providing programmable table searching logic means that the search algorithm and any corresponding table maintenance functions can be altered without necessarily altering the table contents, or the bit selection hardware. This separation of these functions can make it easier to develop and refine applications using new protocol components, since changes to algorithms can be made more directly, at a lower level. It may enable applications to be developed to run faster, or use memory more efficiently for example. This was not possible in previous arrangements in which it was only possible to define the overall outputs of such algorithms for given states of the bits selected from the packet, without being able to define how the selected bits were processed, or how a table of all the possible outputs is searched.
b) Since many networking processing tasks can be broken down into bit selection and table searching, this generic type of arrangement will suit a wide variety of applications.
c) Having the bit selection function programmable, and able to select bits from any part of the incoming packets enables a wider range of operations using different protocols to be handled. This also makes it easier to interface with different input line interfaces, and enables subsequent processing to be streamlined, if all the necessary information in the packet can be extracted in one step.
d) Providing the table searching logic in hardware enables the speed of operation to be faster than equivalent software, and makes it easier for the developer to resolve timing issues in the design.
e) Developing logic directly in hardware can reduce the effort needed to convert a working prototype into a product ready for use in the field, and thus reduce the all important time to market for a product. The arrangement could be used in networks which are designed to be reconfigurable in operation, e.g. active networks which may be reconfigured to suit traffic conditions.
f) Having a programmable search algorithm enables the algorithm to be tailored to reduce search times, and improve throughput, for example by using the minimum number of bits or columns in the table necessary for searching, according to the application.
g) Having an explicit table can make it easier to maintain the contents of the table if it can be accessed directly. This is in contrast to previous arrangements having an implicit table not accessible directly, but defined by mappings of output for a given state of bits selected from the packet. If there are many such mappings having the same output, then any change in that one output would require changing all the mappings which mention that output. Having direct access to the table enables one table entry to be changed which may be simpler and quicker than changing multiple mappings in such a case.
Preferably the apparatus further comprises at least one packet output port, and the packet handler comprises a programmable hardware interpreting logic coupled to the packet output port, for interpreting the result of the access, to control the packet output port.
An advantage of providing a programmable interpreting logic is that the reaction to the result of the table search can be separately programmed, without necessarily altering other elements.
Preferably the interpreting logic is arranged to react to both a match and a mismatch result.
An advantage of being able to program action on a mismatch is that it broadens the range of applications to cover for example those in which a mismatch result can be used to alter the table, or to broadcast a packet. This is significant for following the "route once, switch many" principle, which means where a packet is received, if the table does not include its destination, it may be routed by for example a host CPU based routing algorithm, or by broadcasting to neighbouring nodes, but thereafter, the table learns the destination, and the remaining packets can be switched without the lengthy delay of using the CPU, or the inefficiency inherent in broadcasting.
Preferably the programmable hardware searching logic being arranged to be reprogrammable while in operation without interrupting the accessing of the information in the table.
One advantage is that changes or upgrades can be made more easily, without needing to reinitialize the system. In field applications, maintenance or upgrades become easier, since service can be maintained without interruption. Furthermore, it makes the apparatus more suitable for use as an active node in an active network, since the node can be reconfigured more easily with less likelihood of disrupting service.
Preferably, the apparatus further comprises a table maintenance means coupled to the decision table to modify the decision table according to parameters derived from the incoming packets.
An advantage of being able to modify the table from incoming packets is that the apparatus can better cover applications in which the table must be self learning. This feature is also significant for following the "route once, switch many" principle. This applies whether the table maintenance means receives the derived parameters from the host CPU or whether it receives the packets and derives the parameters itself.
Preferably the table maintenance means comprises programmable hardware logic for deriving the parameters from the incoming packet. An advantage of this, is that such modifications can be made more quickly than if the host CPU makes the derivation.
Preferably the apparatus further comprises at least one packet output port, and the packet handler comprises programmable hardware interpreting logic coupled to the packet output port, for interpreting the result of the access, to control the packet output port, the table maintenance means being coupled to the interpreting logic, and being arranged to modify the decision table on the basis of an output of the interpreting logic. An advantage of such an arrangement is that self learning of the table resulting for example from null search results, can be carried out more quickly than if the host CPU needs to be invoked.
Preferably the apparatus further comprises a host processor, the table maintenance means being coupled to the host processor and being arranged to modify the decision table on the basis of an output of the host processor. An advantage is the greater flexibility enabled by having the host CPU control the operation.
Preferably the discriminator further comprises a comparator for receiving the incoming packets, and comparing at least a portion of each packet with predetermined data, to identify particular types of packet from the incoming packets, the table maintenance means being coupled to the comparator and being arranged to modify the decision table on the basis of an output of the comparator. An advantage of being able to modify the table upon identification of a predetermined packet is that protocols which include packets carrying routing information for example, can be handled more quickly than if they must be passed to the host CPU.
Preferably the discriminator further comprises a comparator for receiving the incoming packets, and comparing at least a portion of each packet with predetermined data, to identify particular types of packet from the incoming packets, and process the packet according to its type. An advantage is that packets destined for the host CPU for example, can be routed there directly without the delay and additional processing overhead of a table search.
Preferably the programmable hardware searching logic is arranged to access concurrently the information in the table relating to a plurality of the incoming packets. An advantage arising is an increase in throughput for what may otherwise be a bottleneck, particularly if the table is large.
Preferably the packet handler further comprises a packet switching fabric.
Preferably the apparatus is part of a programmable packet filter.
Preferably the apparatus is part of a programmable node in an active network.
According to a further aspect of the invention there is provided a packet processing apparatus comprising:
a programmable hardware discriminator for receiving incoming packets, and selecting bits from any part of the incoming packets;
a programmable hardware table processor coupled to the discriminator and comprising a decision table containing information relating to how the packets are to be processed, the processor further comprising hardware searching logic for accessing the information in the table according to the selected bits;
a packet handler coupled to the table processor, for processing the packets according to the accessed information; and
and a means to modify the decision table according to parameters derived from the incoming packets. According to a further aspect of the invention there is provided a method of reconfiguring a packet processor, the packet processor comprising:
a programmable hardware discriminator for receiving incoming packets, and selecting bits from any part of the incoming packets;
a decision table containing information relating to how the packets are to be processed; and
programmable hardware searching logic coupled to the decision table and to the discriminator for accessing the information in the table according to the selected bits; the method comprising the steps of:
determining a column structure for the decision table;
determining which bits to select from each packet;
determining a correspondence between the selected bits and the columns of the table;
determining which bits are to be used in the search;
deriving a new configuration for the discriminator on the basis of the determination of which bits to select;
deriving a new configuration for the searching logic on the basis of the column structure, which bits are to be used in the search, and the correspondence; and
loading the new configurations into the searching logic, and the discriminator respectively.
According to a further aspect of the invention there is provided a method of reconfiguring a packet processor, the packet processor comprising:
a programmable hardware discriminator for receiving incoming packets, and selecting bits from any part of the incoming packets;
a decision table containing information relating to how the packets are to be processed; and
programmable hardware searching logic coupled to the decision table and to the discriminator for accessing the information in the table according to the selected bits; the method comprising the steps of:
receiving incoming packets, and using the packet processor to recognise an incoming packet which indicates that the processor should be reconfigured;
deriving from the incoming packet new configurations for at least one of the discriminator, the searching logic, and the decision table.
According to a further aspect of the invention there is provided a method of using the above mentioned packet processor apparatus.
Any of the preferred features may be combined, and combined with any aspect of the invention, as would be apparent to a person skilled in the art. Other advantages will be apparent to a person skilled in the art, particularly in relation to prior art other than that mentioned above.
To show, by way of example, how to put the invention into practice, embodiments will now be described in more detail, with reference to the accompanying drawings.
FIG. 1 shows a prior art arrangement;
FIG. 2 shows processing apparatus according to an embodiment of the invention;
FIG. 3 shows an example of the apparatus of FIG. 2;
FIG. 4 shows an example of the programmable discriminator of FIG. 2 or 3;
FIG. 5 shows an example of the programmable table search/maintenance logic of FIG. 3;
FIG. 6 shows an example of the interpreting logic of FIG. 3;
FIG. 7 shows method steps in a definition phase, a conversion phase, and an execution phase, related to the apparatus of FIG. 3;
FIG. 8 shows another example of the apparatus of FIG. 2 with dual redundant;
FIG. 9 shows alternative reconfiguration possibilities following a reconfiguration indication contained in one of the incoming packets;
FIG. 10 shows a number of reconfiguration possibilities following detection of a reconfiguration indication in an incoming packet, by the discriminator;
FIG. 11 shows a number of reconfiguration possibilities initiated by an instruction from a remote network management system to the host CPU;
FIG. 12 shows an example of the apparatus of FIG. 2, suitable for filtering or conditioning a stream of packets;
FIG. 13 shows an example of applying the apparatus of FIG. 2 to an Ethernet switch; and
FIG. 14 shows an example of the apparatus of FIG. 2, applied to an IP router.
The term packet is intended to encompass any bounded data unit, such as ATM (Asynchronous transfer Mode) cells, frame relay frames, ethernet frames, T1 data units, and IP packets. The term programmable is intended to encompass hardware whose function can be changed by programming all or part of a chip, or by changing the contents of registers, or by changing control inputs.
FIG. 1, Prior Art
FIG. 1 shows in schematic form a known arrangement based on a router using Obtek chips. The main components are the PSP 110 (Packet Script Processor), the RSC (Routing Systems Controller)130, and the ETAC filter 120. Additional components shown, include a host CPU 100, an input interface 115, a switch and output interface 140, and packet buffer memory 150. The input interface separates the packet headers, and feeds them to the ETAC filter. The ETAC filter can be programmed to identify protocols, addresses, subnets, or implement firewalls, from packet headers. The routing system controller receives descriptors produced by the ETAC filter, and manages memory allocation, input and output queues, and other network management tasks.
The PSP controls the output of packets through the switch 140, and may make alterations to outgoing packets based on input received from the ETAC. The ETAC can be programmed to recognise predetermined bits or a signature of bits in the header, and map them into a descriptor, which indicates how the packet is to be processed. This descriptor is sent to the RSC. Furthermore, although there is a programming language to enable a developer to specify a mapping, there is no way to program how the mapping is achieved within the chip. There is no explicit table, but the mappings result in an implicit table. Thus self learning of table elements or any other action as a consequence of mismatches apparently cannot be programmed. Furthermore, with no explicit table, table maintenance is more difficult.
FIG. 2—Embodiment of the Invention
FIG. 2 shows the principal elements in schematic form.
A programmable discriminator 200 selects bits from incoming packets. These are used by programmable table search logic 220, to access a decision table 230. The results of this access are ultimately used by the packet handler 240 for processing packets. Some examples of how the individual elements can be implemented, and examples of how the arrangement can be used in various applications, will be described below. The packet handler may be exemplified by programmable interpreting logic as described below, or by other circuitry for passing the table output directly to a packet switch or packet filter for example. In the case of this other circuitry, there may be no need for it to be programmable, and the table output may indicate directly an output port for the packet, or a go/no go instruction, also described in more detail below.
FIG. 3—Example of the Embodiment of FIG. 2
FIG. 3 shows the programmable discriminator 200, the programmable table search/maintenance logic 220 and the decision table 230 of FIG. 2, and in addition shows other surrounding elements. Line cards 300 with input packet buffers handle physical and data link layer protocols, and feed incoming packets to the programmable discriminator. These line cards will make the necessary conversion from whichever physical hardware is used for the data transmission. Packets are also fed directly to packet buffers 330, where they may be queued, ready for output on appropriate output line cards illustrated as 340. In practice, the output and input line card functions are usually merged onto a single card.
A host CPU 320 is connected to the principal elements via an interface 325, for the purpose of managing and maintaining these elements, and for providing high level application functions, depending on the purpose of the apparatus.
The apparatus as shown in FIG. 3 would be configurable for use as a packet filter, or a bridge between networks, or as a router, for example. It could be used for developing new configurations for the hardware, to develop new protocol components, or new application features. In principle, the same hardware configuration could then be taken and used in the field, to minimize the time to market.
Connected to the programmable table search/maintenance logic is a programmable interpreting logic 310 which is for interpreting the results of the table search. This element will be described in more detail below, with reference to FIG. 6. Outputs of this logic are shown going back to the programmable table search/maintenance logic, to the packet buffers 310, and to the programmable discriminator 200 as well as to the host CPU. This is one of the ways of making the whole system reconfigurable on the basis of incoming packets. For example, depending on the results of the search, the interpreting logic may trigger adaptation or switching to particular destination output line cards, of packets in the packet buffers 330. Alternatively, registers or control lines in the programmable discriminator or the programmable table search/maintenance logic may be changed, to change or extend the operation of these blocks. Furthermore, the interpreting logic can make changes in the decision table, via the table maintenance logic.
The host CPU 320 may perform housekeeping tasks for other elements, and, in service, it may be connected via other parts (not shown) to remote centralized network management systems. Reconfiguration in the field may be triggered by instructions sent from such remote systems to the host CPU. Alternatively, the host CPU may monitor local conditions and initiate reconfiguration on that basis.
When being used in experimental set-ups, a separate general purpose CPU (not shown) with a general purpose operating system may be used to run compilers for developing programs for the various programmable elements in the apparatus. Alternatively, such development could be carried out remotely and compiled programs downloaded to the host CPU across the network. In both cases, the host CPU could carry out authentication, verification and validation, before such programs are downloaded to the programmable elements.
The programmable hardware elements, the discriminator 200, the table search/maintenance logic, and the interpreting logic, may be implemented in any form of programmable hardware. Preferably it should be electronically programmable hardware, such as field programmable gate arrays (FPGA). Alternatives would include other programmable logic arrays to provide Boolean logic where appropriate, being programmable by setting control lines, or registers, as appropriate. Another alternative would be the provision of micro-controllers or digital signal processors, or microprocessors dedicated to performing these tasks at comparable rates to rates achieved by other hardware implementations.
The decision table 230 may be implemented in RAM, or in CAM (Content Addressable Memory) as appropriate. Conventional applications for routing tables involve either RAM tables, requiring two-stage look-up, or hashing again using RAM. Hashing may result in collisions, leading to non-deterministic set-up times, and also has limited flexibility of address allocations. RAM tables lose speed through the two-stage look-up, and result in limited flexibility in address allocation. CAMs represent the ultimate in flexibility and convenience but have poor capacity at present. CAMs normally have a fixed maximum width for the combination of the match field and output field, e.g. 64 bits in the MCM 69C232. This limits the programmability, which may limit the range of applications.
CAMs are widely available, the Motorola MCM69C232 is one example suitable for communications applications. A data input word is read in and compared to all the entries in a table. If a match is found, the data associated with the matching entry is output. The width of the match field and the output field are programmable. Inserting new table entries can be carried out without interrupting matching operations.
Equivalent functions including the table could be provided entirely within an FPGA, by using comparative and control logic, and storage elements for example, but at the cost of limiting the size of the table severely, since current FPGAs have limited size. For more genericity, a two stage search algorithm is preferred, the first stage being used to generate an address in memory, the second stage involving using the address to access a table element. The first stage could be implemented in an FPGA or possibly using a CAM, while the second stage is preferably implemented in fast RAM to achieve faster access without limiting the table size or structure. The generation of the address in the FPGA might be achieved by selection logic or by look up table, or hash table functionality, or other algorithm which can be set up in the FPGA.
The capabilities of the FPGA will limit the range of possibilities. However the use of an FPGA to interface with the RAM, means that as better RAM becomes available, the FPGA can be reprogrammed with an interface to suit the new RAM, to provide an upgrade path. The choice of which components such as FPGAs to use, and how to interconnect them with RAM or CAM, and with each other, would be a matter of design implementation which would be within the capabilities of one skilled in the art, and so need not be described here in more detail.
The various programmable elements may communicate with each other by means of messages, rather than hard wired interfaces, to increase flexibility. Suitable messaging formats are well known, and need not be described here in more detail.
FIG. 4—Programmable Discriminator Embodiment
FIG. 4 shows an example to illustrate some of the functions which may be configured in the programmable discriminator. A packet store 420 receives packets, which are logically ANDed by AND function 410, with the contents of a mask register 400, to output selected bits of the packet to output selector 450. The mask register 400 may be set by the host CPU or by the above-mentioned interpreting logic.
The selected bits may be in the form of several groups of bits, corresponding to particular sections of the packet, and may be output directly to the search logic, or may be passed to the host CPU, or conceivably to the table maintenance logic, if, for example, the packet is determined to be one which is to be used to alter the table entries directly.
As well as the bit selection function, the discriminator may have a bits recognition function. This is show in the form of a comparator 440, which compares the contents of the packet store, or part of the packet store, to predetermined data set-up in a discriminating register 430. The output of the comparator, indicating whether a match is found, may be output directly to the host CPU. This would enable packets destined for the host CPU to be sent there directly without leaving a table search. Furthermore, this would enable recognition of packets which are intended to directly alter the decision table. In this case, all or part of the packet itself could be sent to the table maintenance logic, using the output select function 450.
For ease of programming the discriminator, there may be provided multiple masks and multiple and functions which can be selected by appropriate control signals from the CPU or the interpreting logic. Likewise, there may be multiple discriminating registers, and multiple comparators, to enable rapid reconfiguration, by simply selecting different ones of the registers or comparators, according to control signals from the host CPU or the interpreting logic.
A statistics reporting function 460 is also shown, for reporting, for example, numbers of packets and types of packets received, and number of successful recognitions, back to the host CPU. This may also report details of the current configuration of the discriminator back to the host CPU.
FIG. 5—Table Search/maintenance Logic Example
FIG. 5 shows logic for interfacing to the decision table, with two separate functions, table maintenance, and table search. The table maintenance logic 500 includes an input handling control section 510, for selecting and handling inputs from the host CPU, from the discriminator, and from the interpreting logic. Each of these may be allowed to change entries in the decision tables. Logic for controlling the addition of new entries is shown at 520. This may involve queuing new entry requests, or handling overflows of the table. Furthermore, it may involve controlling the data preformatting block 550. This involves ensuring the data received from the input handling/control block is suitable for the current configuration of the columns of the decision table.
Aging and deleting logic 530, is provided for controlling the deletion of table entries, and ensuring that in appropriate applications, old table entries are deleted after a certain time.
CAM interface control logic 540 is shown for the case where the decision table uses CAM. If RAM were to be used, then suitable interface logic would also be required. An appropriate op code for the different operations of adding a new entry or deleting an entry, need to be output to the CAM.
The table search logic may include several different search algorithms. If the table is stored in CAM, for a single stage search algorithm example, the level of programmability of the search may be limited to specifying which bits in which columns of the decision table are to be searched. For a more generic or flexible arrangement, a two stage search algorithm may be used, in which the selected bits are pre-processed before being fed to the matching field of the CAM.
A search algorithm selection/control section 560 determines which of two search algorithms 570, 580 are to be used. The selection may be made on the basis of the application, the nature of the packet, or the size of the table. An output selector 590 connects the chosen search algorithm to the table. If the table is a CAM, then an appropriate op code, and matching data, needs to be output to the CAM. The CAM returns matched output data, or a null result (for example in the form of high impedance output signals), to the search results output control logic 600. This may feed the results directly to the interpreting logic, and to a statistics reporting function 610, which reports back to the host CPU. The statistics reporting function 610 may also report to the host CPU on the current configuration of the table, the search algorithm, and other parameters.
FIG. 6—Interpreting Logic Example
A variety of functions may be initiated and controlled by interpreting logic on the basis of the output of the decision table. A number of examples are shown in FIG. 6. Some or all of these functions may be triggered on a mismatch, and some or all may be triggered on a match. Mismatched logic function select 650 and match logic function select 660 may be used for distinguishing a match or a mismatch, and selecting an appropriate action, from a number of programmed possibilities. At 670, a packet update function is shown, for driving the packet buffers or the output line cards, to change some part of a packet, such as its destination or time stamp information. A send packet function 680 is shown, for directing the output packet buffers to send out the corresponding packet, to an output port corresponding to one of the line cards, which may be specified in the output field of the decision table.
A packet may be sent out on the basis of a matching result, or if there is a mismatch, a packet may be sent back to the originator of the incoming packet, or the packet may be broadcast to all output ports, depending on the application.
A table update control function 690 is shown, selectable either by the matched logic or the mismatched logic. In some cases, new table entries can be derived from information in incoming packets. The decision table may be updated directly without going through the host CPU or, in more complex cases, or less time sensitive applications, the table update function may invoke an appropriate process on the host CPU.
An explicit CPU process invocation function 700 is also shown, selectable by the mismatched logic, or by the matching logic.
A function for reprogramming the search algorithm 710 is shown, which would enable the decision table to contain entries to recognize packets intended to reconfigure search algorithms, perhaps to adapt them to different sizes of decision tables, for example.
A function for reprogramming the interpreting logic control 720 is also shown. This might enable further functions to be added, or disabled, or change the matching logic or mismatching logic, to change the function select criteria. This could be carried out by changing the contents of registers or by changing control lines, to alter the operation.
A further function, 730, enables the discriminator to be reprogrammed, again for example by changing contents of its registers, or changing control lines, to alter the logic. A packet discard function 735 is also shown.
The matched logic and mismatched logic will select an appropriate function based on the decision table output data, and perhaps dependent on other bits of the corresponding incoming packet. Any of the functions may be selectable either on a match or a mismatch, as desired.
For better programmability, the various functions could be implemented in the form of a single microcoded engine, having for example a four bit opcode, enabling up to sixteen different functions to be implemented. Many configurations for achieving this are conceivable and could be implemented within an FPGA, or using other types of programmable hardware.
FIG. 7—Phases of Operation
Three phases are shown, a definition phase, a conversion phase for turning definitions into hardware logic, and an execution phase. In the definition phase, a number of parameters are defined, either by a developer, or indirectly, by a remote network management system. At 800, the decision table columns for matching and output are defined. In the most straightforward case, this step may not be needed, if the decision table can be a straightforward look-up table using the matching bits to address the memory, or if the apparatus is limited by fixing the column structure of the table. However, this step will be necessary in more complex cases where matching is needed, or where the output is a pointer to a second stage of a search.
At 810, which bits of the packet correspond to which match columns in the table is defined.
At 820, search rules are defined, for example, which bits in which table columns are to be matched, and, if necessary, which combinations are these bits.
Action to be taken on a matching result for given inputs or outputs of the decision table is defined at 830. Corresponding action on mismatched results is defined at 840.
The conversion phase, turning these definitions into hardware logic, is described next. The outputs of this conversion phase are shown as follows. At 850, an output program for programming the discriminator is needed, which is based on the definition of which bits of the packet corresponds to the particular table columns. The program for the programmable search logic is produced at 860, based on the defined search rules, and based on the definitions of the table match and output columns.
A program for the interpreting logic 870 can be derived from the definition of decision table output columns, from the definition of matching results action, and from the definition of mis-match results action.
Finally, the decision table can be filled at 880, based on the definition of decision table match and output columns, on the definition of actions for a match result, and those for a mis-match. In some applications, there may be no need to fill the decision table initially, if it can be completely self learning.
Compilers suitable for turning high level definitions into compiled finite state machine (FSM) models for FPGAs, or code for microcontrollers or sequencers, are available, and will not be discussed in more detail here.
Loading of new code into such devices may require them to be taken off-line, which is feasible for development purposes, but may be a problem when reconfiguration is needed on apparatus in the field. One solution is to provide dual redundant devices, to enable "hot switching" between devices, so that while one is being programmed, the other is in operation and vice versa. This will be described in more detail below.
FIG. 7 also shows steps in an execution phase. At 890 bits are extracted from the incoming packet by the discriminator. At 900, the search logic is used to search the decision table. At 910, matched or mismatched actions are carried out on the basis of the result of the search of the decision table. Examples of the sorts of different actions which may be carried out have been described above in relation to FIG. 6.
FIG. 8—Dual Redundant Hardware Example
Separate FPGAs 915, 920 and 935 are shown for the discriminator, table control and interpreter functions. They are duplicated by a second set of FPGAs 945, 955 and 960. A decision table 1, 925 is shown for the first set of FPGAs, and a corresponding table 2, 965 is shown for the second set of FPGAs. An OR gate 940 allows one of the outputs from the duplicate interpreting logic functions 935 and 945, to be output to the rest of the system. A host CPU 320 is connected to all the FPGAs, to enable them to be programmed. A bus is provided between all the FPGAs to enable them to interact, by means of messages.
An FPGA selection control function 950 is provided, operating on the basis of inputs from the host CPU and from the two discriminator FPGAs. This has three outputs, one for each pair of duplicate FPGAs, to select one of the pair as the operative FPGA, while the other is off-line, to enable it to be reprogrammed. This selection control function determines when to switch between FPGAs, to ensure that switching takes place between packets, rather than in the middle of processing a given packet. The input from the host CPU can indicate when reprogramming is not complete. The inputs from the discriminators can indicate when a packet has been received, and is being processed. Other ways of ensuring switching takes place at the right time using inputs from other elements, can be conceived.
Various different levels of reprogramming of the programmable elements are possible, as will be described below with relation to FIGS. 9,10 and 11.
FIG. 9—Reconfiguration Possibilities Triggered by a Table Match
FIG. 9 shows some alternative reconfiguration possibilities. At 1000, a search of the decision table produces a match on a packet which is intended to indicate a table maintenance operation. At 1060, reconfiguration is carried out by means of new table entries for the decision table. The host CPU determines the new table entries and the table maintenance logic carries out the changes at step 1070. The table entries may be changed without reference to the host CPU as shown in step 1080, where the interpreting logic determines the new table entries and passes them to the table maintenance logic.
At 1005, a search of the decision table produces a match on a packet which is intended to indicate a reprogramming operation for one or more of the programmable hardware elements. At 1030, the host CPU is alerted, via the interpreting logic. The host CPU downloads the new configuration to an appropriate FPGA or FPGAs. At 1040, the host CPU switches the reconfigured FPGA into the circuit. An alternative is shown at step 1050, where the host CPU changes FPGA operation not by downloading a completely new configuration, but merely by changing an FPGA input or register. In a further alternative, the interpreting logic could change the operation of any of the FPGAs without reference to the host CPU, by changing an FPGA control input or the contents of a register in the FPGA.
The packets which trigger a reconfiguration, either by changes in the decision table contents, or by reprogramming the hardware, may be sent by a network management system for that purpose, or may be packets containing data to be carried across the network, but carried in a format which prompts the reconfiguration.
FIG. 10—Reconfiguration Triggered by the Discriminator
Where the discriminator contains recognition circuitry, as described in relation to FIG. 4, it may detect packets which are intended to trigger changes in the table, at 1010. As described above, the host CPU may determine new table entries at 1060, or the discriminator may trigger changes in the decision table at 1070 without reference to the host CPU. An example of a network management packet which might trigger a routing table change in local area network routing is a RIP (Routing Information Protocol) packet used for advertising routes.
If the discriminator detects packets which are intended to trigger reprogramming of the hardware, as at 1015, this may cause the host CPU to download a new configuration to one or more of the FPGAs, at 1030 and 1040. Alternatively, the host CPU may change the FPGA operation by changing an input or a register, at 1050.
FIG. 11—Reconfiguration Possibilities Initiated by a Remote Network Manager
FIG. 11 shows how a remote network manager may instruct a reconfiguration, either by a table maintenance instruction 1020, or by a reprogramming instruction 1025. In either case, the instruction may be sent by sending a packet across the network, or conceivably by a distinct management communication path (not shown). As described above, the packet can be passed to the host CPU which can thereby be instructed to download a new configuration to any of the FPGAs at 1030. Alternatively, the host CPU can change FPGA operation by changing an input or a register at 1050, or change table entries at 1060, using the table maintenance logic at 1070.
FIG. 12—Packet Filter/conditioner Example
FIG. 12 shows some of the principal elements in a packet filter/conditioner. An input line interface 1100 feeds the discriminator 200, the decision table 230, and table control function 1120, including search, maintenance, and interpretation of search results. A line interface 1110 is arranged to output or reject or amend packets as appropriate, on the basis of the search result, and the contents of the decision table as described above. Such apparatus may be used for firewall purposes, or admission control, or IP traffic conditioning for example. In the traffic conditioning example, packets may be rejected if the user is exceeding his negotiated bandwidth, and a shaping algorithm may be used to limit the excess bandwidth used by a user beyond what was negotiated. In this case, the decision table would contain as input columns, source and destination IP address and ports, protocol type, (TCP or UDP for example,) and allocated bandwidth. If there is a match, then a calculation can be made as to how much of the allocated bandwidth has been used. This may be carried out in the host CPU, for example. The host CPU could update an output column in the table to indicate when a given source has used all its allocated bandwidth in a given time window. Then this output column could be used to control the line interface directly, in the case of a match, to prevent any more packets going from that source to the given destination, until the next time window.
Another application for the arrangement of FIG. 12 would be in converting packets between formats or translating network addresses. Other applications needing only a single input and output for packets can be envisaged.
Although the arrangement of FIG. 12 has a single input and a single output, and needs no switching function, clearly such applications which do not use switching, could be implemented in combination with switching functions, using the same programmable hardware elements described above. In such cases, the decision table may contain routing information as well as filtering information.
FIG. 13—Ethernet Switch Example
FIG. 13 shows a simplified example of an Ethernet switch 1150, for interconnecting a number of hosts, and a router. Not shown for the sake of clarity are virtual LAN and Spanning Tree algorithms. The apparatus as shown in FIG. 2 or 3 could form part of the Ethernet switch. Only the decision table is illustrated. In practice there may be many ports on the switch, only four are shown—ports 0 to 3. Port 0 is connected to host 1, 1130, port 1 is connected to router 2,1140, which also connects host X also. Port 2 is connected to host 123,1160, and port 3 is connected to host 4, 1170.
The decision table 230 is illustrated in expanded form to show its contents. A matching column on the left contains the destination MAC for each of the entities visible to the Ethernet switch. The right-hand column of the table contains the output port on which a packet would be output to reach the given destination set out in the left-hand column.
In this case the matched action would be to send the incoming packet to the output port specified in the output of the table when the search is carried out.
The mismatched action would be to create a new table entry with the source MAC address in the left-hand column, and the right-hand column would specify the port on which the packet was received. This takes advantage of the fact that Ethernet packets specify the source address of the packet. Therefore, if the Ethernet switch was previously unaware of that originating host, and had no table entry for it, it can create a new table entry, for use by any packets which might be sent back to that originating host.
A further mismatched action would be to broadcast the incoming packet to all output ports to try to ensure that it reaches its destination, even though there is no entry in the decision table for that particular destination.
An example of pseudo-code for configuring the table and the programmable hardware elements, might be as follows (where % indicates a comment). This particular example uses an index which is efficient in a LAN environment where all NICs (Network Interface Cards) are from the same manufacturer. This means the first three bytes of the ethernet address will always be the same, and so the search algorithm can be tailored to ignore these bytes.
% datafill register (only interested in one)
%this says extract starting offset 0 for 48 bits to
% be compared with column 1 (table columns start at 1, 0 is a
% special case which means no comparison needed)
% Information passed down to the search is:
%val: the extracted bits
%inport: the port the data came through
%col: table column to compare with (in this case 1)
ASSIGN index val[4]<<8 |val[5]
%The above is an example of an index which is part of a search
%algorithm. It takes only the last 16 bits of the 48 bit ethernet
% address extracted by the discriminator for use as an index
% for table searching operations eg in add, delete operations
%This particular index is efficient in a LAN environment where
% all NICs are from the same manufacturer
%If the table is implemented using fast RAM, the index could be
% used to generate an address in the RAM.
% the line below is how the index is used to find and output a
% table row
ASSIGN row search(index,MAC)
% the search statement uses the index to access the table location
%, and uses the entire MAC address only if necessary e.g. where
% the index points to more than one entry. The row is passed
% down to the interpreting logic; it is NULL if
% the search failed to produce anything
% Define the matched action
REPLACE exitport with row.outport
SEND to exitport
END MatchedAction
% Define the not matched action; simple case assuming entry not
% in table already
NOT MatchedAction:
CREATE table_entry new_entry
ASSIGN new_entry.MAC bits 48-95
ASSIGN new_entry.outport inport
SEND to allports!=inport ps Each of the programs after being compiled is downloaded to the apparatus before the specific code is activated
FIG. 14—IP Router Example
FIG. 14 shows a configuration for an IP router. A bus 1190 interconnects a number of in/out interfaces, of which one is shown, 1180. A packet buffer 1250 is connected to the bus for storing packets which enter on one of the in/out interfaces, but are to exit on another. A packet routing controller 1200 controls the interconnection of the packet buffer and the in/out interfaces. This controller is an application for the programmable hardware described above. The controller includes a decision table 230, a discriminator 1220, and table control logic 1240. A single host CPU/network processor 1210 is provided for housekeeping purposes, for overall management, and for downloading table entries and reprogramming hardware elements of the bus controller.
Incoming packets may be switched and sent out again by a single one of the in/out interfaces, or it may be sent to the packet buffer 1250. The packet or just the IP header of the packet are sent to the controller for routing. The discriminator which corresponds to the programmable discriminator described above in relation to FIG. 4 may feed selected bits to the table control function 1240. This corresponds to the table search, and table maintenance functions described above with reference to FIG. 5.
The table control function 1240 may feed destination information obtained by the discriminator from the packets, such as destination IP address, and destination IP port, into the decision table 230 according to an appropriate search algorithm. The decision table, which operates as a routing table, will output an indication of which of the in/out interfaces the packet should be routed to. This routing indication can be used straight away or can be stored for use when the corresponding packet reaches the top of whatever type of queue is used in the packet buffer. The routing indication can be used to control the bus access to enable the packet to be written onto the bus and read from it into the correct in/out interface.
In this example, the output of the table can be used directly, and is used for only one purpose so there is no need for interpreting logic. The bus and in/out interfaces are one example of a packet handler for processing the packets according to the result of the table access. Interpreting logic might be useful if it is desired to define action which should be carried out in the event of a mismatch. Alternatively, such mismatch actions could be carried out by notifying the host CPU and having the CPU carry out the action.
The function of a router is to determine the next hop for each packet, for given destinations. As this decision may change, as particular links become overloaded, or as a result of failure, new routing tables may be determined by the network processor 1210, and downloaded to each of the in/out interfaces as required. As the discriminator 1220 can easily be reprogrammed, changes in protocol can be handled by reprogramming, without needing to change the hardware. Furthermore, if the function of the router were to be changed from being a backbone router to an edge router, based on traffic characteristics, as might be desired in an active network, again, such changes could be made by reprogramming without having to change the hardware. Since an edge router will exhibit much more localized traffic than a backbone router, it may be appropriate to change its algorithms for the table search, to change the table maintenance criteria, and to change the packet forwarding criteria.
Such a reconfiguration could be triggered based on local measurements of traffic, or the traffic analysis and a switch-over decision could be made on a remote host from RMON/SNMP traces. It could be carried out using the network processor as a host.
In this example, if IPv4 is used, there are 32 bits in the address, and the table could be implemented in fast (e.g. 10 nsec access is available) RAM, and addressed directly in a one stage search. If IPv6 is being used, there are 128 bits in the address and so a two stage search algorithm might be appropriate.
Other configurations for the router are conceivable to provide faster processing, or greater capacity, the above example is for illustrative purposes only.
Other Application Examples
In a firewall application for IPV4, the table could be defined as including columns for matching bits for the source IP, the source port number, the destination IP address, the destination port number, and the IP protocol field in the IP packet. The matched action could be to consult a routing engine on the host CPU to determine the appropriate output port. The mismatched action could be to send an ICMP (Internet Control Message Protocol) unreachable message to the source IP. The unsuccessful attempt to get through the firewall could be recorded, then the packet discarded.
Another application would be for a router bypass device, which learns the router table by analyzing packets going into and out of the router, then builds up its own routing table, and switches packets for recognized destinations so as to avoid the router, and ease any congestion.
Other Matters and Other Variations
Although for simplicity of explanation, the programmable elements are shown as handling one packet at a time, to achieve greater throughput, the various elements should be pipelined, and should have multiple paths to enable them each to concurrently handle more than one packet. Blocking and contention issues may arise, as would be well known. As there are various approaches following well-known principles, there is no need to discuss these issues further here.
As can be seen, the information in the decision table relating to how the packets are to be processed, can encompass both information on how the present incoming packet is to be processed, and information relating to reconfiguration of the programmable hardware elements to enable future incoming packets to be processed differently.
Other variations within the scope of the claims will be apparent to persons of average skill in the art, and are not intended to be excluded.
|Cited Patent
|Filing date
|Publication date
|Jul 5, 1995
|Nov 5, 1996
|Motorola, Inc.
|Data routing method and apparatus for communication systems having multiple nodes
|Oct 1, 1997
|Feb 13, 2001
|Kabushiki Kaisha Toshiba
|Network node and method of frame transfer
|Dec 18, 1997
|May 22, 2001
|Advanced Micro Devices, Inc.
|Method and apparatus for managing learning in an address table in memory
|"Telecommunication Routers", User Manual dated Apr. 16, 1998, published by Obtek L.L.C., P.O. Box 399, Rockwall, Texas 75087-0399 U.S.A.
|Alexander, D. Scott, et al. "Active Bridging",SIGCOMM 97, Cannes,France, Sep. 1997.
|Citing Patent
|Filing date
|Publication date
|Jun 30, 2000
|Aug 17, 2004
|E. Z. Chip Technologies Ltd.
|High-performance network processor
|Jan 19, 2001
|Nov 2, 2004
|Motorola, Inc.
|Method and apparatus for determining existence of an address in an address look-up table
|May 22, 2001
|Sep 13, 2005
|Agere Systems Inc.
|Method and apparatus for performing frame interrogation
|Jul 7, 2000
|Mar 14, 2006
|802 Systems Llc
|Methods for packet filtering including packet invalidation if packet validity determination not timely made
|Oct 23, 2001
|Mar 28, 2006
|Broadcom Corporation
|Network switching architecture with fast filtering processor
|Dec 21, 2000
|Apr 18, 2006
|802 Systems Llc
|PLD-based packet filtering methods with PLD configuration data update of filtering rules
|Dec 28, 2000
|Jul 11, 2006
|Alcatel Internetworking, Inc. (Pe)
|Programmable packet processor with flow resolution logic
|Jul 14, 2000
|Dec 19, 2006
|Symantec Corporation
|System and method for preventing detection of a computer connection to an external device
|Jun 25, 2005
|May 1, 2007
|Vulcan Portals, Inc.
|Processor module packaging for a portable electronic device display
|Jun 17, 2004
|May 22, 2007
|Vulcan Portals, Inc.
|Removable module for a portable electronic device having stand-alone and system functionality
|Jun 22, 2004
|Sep 18, 2007
|Vulcan Portals, Inc.
|Processor module packaging for a portable electronic device display
|Jun 23, 2004
|Apr 1, 2008
|Dinochip, Inc.
|Network processing using fractional time stamp values
|Sep 21, 2001
|Jun 10, 2008
|Stonesoft Corporation
|Data packet filtering
|Sep 8, 2003
|May 5, 2009
|Oki Electric Industry Co., Ltd.
|Routing processing device and packet type identification device
|Sep 12, 2005
|Jan 12, 2010
|Sprint Communications Company L.P.
|System and method for caching called number information
|Feb 6, 2004
|Apr 6, 2010
|Sprint Communications Company L.P.
|System and method for providing a graphical user interface to, for building, and/or for monitoring a telecommunication network
|Jun 21, 2005
|Jun 8, 2010
|Tridonicatco Gmbh & Co. Kg
|Method for the monitoring of transmissions of a bidirectional interface
|Jul 6, 2010
|Dinochip, Inc.
|Processing network packets using fractional time stamp values
|Jul 13, 2010
|Broadcom Corporation
|Programmable packet field replacement based on a range technique
|Feb 1, 2006
|Sep 14, 2010
|Marvell Israel (M.I.S.L.) Ltd.
|Secure automatic learning in ethernet bridges
|Oct 12, 2010
|Juniper Networks, Inc.
|Filter-based forwarding in a network
|Nov 2, 2010
|Symantec Corporation
|System and method for preventing detection of a selected process running on a computer
|Nov 23, 2010
|Xilinx, Inc.
|Formatting fields of communication packets
|Aug 18, 2006
|Dec 14, 2010
|Symantec Corporation
|System and method for generating fictitious content for a computer
|Jan 10, 2006
|Dec 28, 2010
|Cisco Technology, Inc.
|Network processor system including a central processor and at least one peripheral processor
|Feb 22, 2011
|Alaxala Networks Corporation
|Packet forwarding device with packet filter
|Nov 15, 2011
|Sprint Communications Company L.P.
|System and method for controlling a call processing system
|Jul 8, 2009
|Jan 17, 2012
|Ralink Technology Corporation
|Method and apparatus for forwarding packets
|Feb 27, 2008
|Feb 28, 2012
|Autonetworks Technologies, Ltd.
|On-vehicle communication system
|Jun 4, 2013
|802 Systems, Inc.
|Data protection system selectively altering an end portion of packets based on incomplete determination of whether a packet is valid or invalid
|Feb 12, 2008
|Oct 1, 2013
|Symantec Corporation
|System and method for computer security
|Feb 27, 2007
|Nov 5, 2013
|Symantec Corporation
|System and method for using timestamps to detect attacks
|Oct 25, 2010
|Nov 4, 2014
|802 Systems Inc.
|Methods for updating the configuration of a programmable packet filtering device including a determination as to whether a packet is to be junked
|Feb 11, 2013
|Jun 9, 2015
|Xcelemor, Inc.
|Hardware computing system with software mediation and method of operation thereof
|Mar 7, 2013
|Jun 9, 2015
|Xcelemor, Inc.
|Hardware computing system with extended calculation and method of operation thereof
|Sep 9, 2010
|Aug 11, 2015
|Juniper Networks, Inc.
|Filter-based forwarding in a network
|Aug 10, 2012
|Jan 5, 2016
|Wisconsin Alumni Research Foundation
|Lookup engine with reconfigurable low latency computational tiles
|Mar 5, 2001
|Oct 25, 2001
|Kei Kato
|Data transferring method and communication network system
|Jun 8, 2001
|Dec 13, 2001
|Nec Corporation
|Router setting method and router setting apparatus
|Jun 11, 2001
|Jan 10, 2002
|Hajime Kikkawa
|Readily reconfigurable data relay device and multiplex communication system
|Oct 23, 2001
|May 9, 2002
|Broadcom Corporation
|Network switching architecture with fast filtering processor
|Dec 14, 2001
|Jun 20, 2002
|Trevalon Inc.
|Network server
|Dec 21, 2000
|Jun 27, 2002
|802 Systems, Inc.
|Methods and systems using PLD-based network communication protocols
|Dec 21, 2000
|Jun 27, 2002
|802 Systems, Inc.
|Methods and systems using PLD-based network communication protocols
|Dec 28, 2000
|Jul 4, 2002
|Jim Cathey
|Programmable packet processor with flow resolution logic
|Jan 10, 2002
|Jul 25, 2002
|Kazuhiro Shitama
|Information processing device and method thereof, recording medium and program
|Jan 19, 2001
|Sep 12, 2002
|Motorola, Inc.
|Method and apparatus for determining existence of an address in an address look-up table
|May 22, 2001
|Nov 28, 2002
|Mcginn Colleen J.
|Method and apparatus for performing frame interrogation
|Jun 11, 2002
|Dec 19, 2002
|Method of transmitting an active message in a virtual circuit
|Oct 4, 2001
|May 1, 2003
|Satoshi Yoshizawa
|Method and apparatus for programmable network router and switch
|Sep 21, 2001
|Jun 26, 2003
|Kari Nurmela
|Data packet filtering
|Dec 12, 2002
|Sep 18, 2003
|Broadcom Corporation
|Programmable packet field replacement based on a range technique
|Mar 27, 2002
|Oct 2, 2003
|Moshe Valenci
|Dynamically loading parsing capabilities
|Sep 8, 2003
|Mar 18, 2004
|Oki Electric Industry Co., Ltd.
|Routing processing device and packet type identification device
|Feb 6, 2004
|Aug 12, 2004
|Sprint Communications Company, L.P.
|System and method for providing a graphical user interface to, for building, and/or for monitoring a telecommunication network
|Jun 17, 2004
|Mar 24, 2005
|Kee Martin J.
|Portable electronic device having high and low power processors operable in a low power mode
|Jun 22, 2004
|Apr 7, 2005
|Martin Kee
|Processor module packaging for a portable electronic device display
|Jun 17, 2004
|Apr 7, 2005
|Kee Martin J.
|Removable module for a portable electronic device having stand-alone and system functionality
|Jun 25, 2005
|Oct 27, 2005
|Martin Kee
|Processor module packaging for a portable electronic device display
|Sep 7, 2005
|Jan 12, 2006
|Broadcom Corporation
|Network switching architecture with fast filtering processor
|Nov 20, 2003
|Feb 16, 2006
|Adnan Al-Adnani
|Reconfigureable system architecture
|Jan 10, 2006
|Jun 1, 2006
|Petersen Brian A
|Network processor system
|Feb 9, 2006
|Jun 15, 2006
|Kee Martin J
|Portable electronic device having high and low power processors operable in a low power mode
|Apr 17, 2006
|Aug 17, 2006
|Krumel Andrew K
|Methods and systems using PLD-based network communication protocols
|May 30, 2006
|Sep 28, 2006
|Hitachi, Ltd.
|Method and apparatus for programmable network router and switch
|Jul 26, 2007
|Jan 29, 2009
|Telefonaktiebolaget L M Ericsson (Publ)
|Protocol-Independent Packet Header Analysis
|Jun 21, 2005
|Feb 5, 2009
|Reinhard Boeckle
|Method for the Monitoring of Transmissions of a Bidirectional Interface
|Feb 27, 2008
|May 6, 2010
|Autonetworks Technologies, Ltd.
|On-vehicle communication system
|Jan 27, 2010
|May 27, 2010
|Alaxala Networks Corporation
|Packet forwarding device with packet filter
|Jul 8, 2009
|Jul 22, 2010
|Ralink Technology Corporation
|Method and apparatus for forwarding packets
|Aug 11, 2011
|Krumel Andrew K
|Real time firewall/data protection systems and methods
|Feb 11, 2013
|Jun 20, 2013
|Xcelemor, Inc.
|Hardware computing system with software mediation and method of operation thereof
|Mar 7, 2013
|Jul 25, 2013
|Xcelemor, Inc.
|Hardware computing system with extended calculation and method of operation thereof
|Aug 10, 2012
|Feb 13, 2014
|Karthikeyan Sankaralingam
|Lookup Engine with Reconfigurable Low Latency Computational Tiles
|Mar 10, 2005
|Sep 13, 2006
|Siemens Aktiengesellschaft
|Management method for a communication system
|U.S. Classification
|370/389, 370/401
|International Classification
|Cooperative Classification
|European Classification
|Jun 4, 1998
Owner name: NORTHERN TELECOM LIMITED, CANADA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HADI SALIM, JAMAL;REEL/FRAME:009220/0369
Effective date: 19980529
|Dec 23, 1999
Owner name: NORTEL NETWORKS CORPORATION, CANADA
Free format text: CHANGE OF NAME;ASSIGNOR:NORTHERN TELECOM LIMITED;REEL/FRAME:010567/0001
Effective date: 19990429
|Aug 30, 2000
Owner name: NORTEL NETWORKS LIMITED, CANADA
Free format text: CHANGE OF NAME;ASSIGNOR:NORTEL NETWORKS CORPORATION;REEL/FRAME:011195/0706
Effective date: 20000830
Owner name: NORTEL NETWORKS LIMITED,CANADA
Free format text: CHANGE OF NAME;ASSIGNOR:NORTEL NETWORKS CORPORATION;REEL/FRAME:011195/0706
Effective date: 20000830
|Feb 17, 2007
|Fee payment
Year of fee payment: 4
|Feb 4, 2010
Owner name: CITIBANK, N.A., AS ADMINISTRATIVE AGENT,NEW YORK
Free format text: SECURITY AGREEMENT;ASSIGNOR:AVAYA INC.;REEL/FRAME:023892/0500
Effective date: 20100129
Owner name: CITIBANK, N.A., AS ADMINISTRATIVE AGENT, NEW YORK
Free format text: SECURITY AGREEMENT;ASSIGNOR:AVAYA INC.;REEL/FRAME:023892/0500
Effective date: 20100129
|Feb 5, 2010
Owner name: CITICORP USA, INC., AS ADMINISTRATIVE AGENT,NEW YO
Free format text: SECURITY AGREEMENT;ASSIGNOR:AVAYA INC.;REEL/FRAME:023905/0001
Effective date: 20100129
Owner name: CITICORP USA, INC., AS ADMINISTRATIVE AGENT, NEW Y
Free format text: SECURITY AGREEMENT;ASSIGNOR:AVAYA INC.;REEL/FRAME:023905/0001
Effective date: 20100129
|Feb 26, 2010
Owner name: AVAYA HOLDINGS LIMITED,NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NORTEL NETWORKS LIMITED;REEL/FRAME:023998/0799
Effective date: 20091218
Owner name: AVAYA INC.,NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NORTEL NETWORKS LIMITED;REEL/FRAME:023998/0878
Effective date: 20091218
Owner name: AVAYA INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NORTEL NETWORKS LIMITED;REEL/FRAME:023998/0878
Effective date: 20091218
Owner name: AVAYA HOLDINGS LIMITED, NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NORTEL NETWORKS LIMITED;REEL/FRAME:023998/0799
Effective date: 20091218
|Mar 2, 2011
|Fee payment
Year of fee payment: 8
|Feb 11, 2015
|Fee payment
Year of fee payment: 12
|Mar 25, 2015
Owner name: AVAYA INC., CALIFORNIA
Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CITIBANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:035252/0338
Effective date: 20150325
Owner name: AVAYA INC., CALIFORNIA
Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CITICORP USA, INC., AS ADMINISTRATIVE AGENT;REEL/FRAME:035252/0575
Effective date: 20150325
|Mar 27, 2015
Owner name: RPX CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AVAYA, INC.;REEL/FRAME:035279/0294
Effective date: 20150325
|Mar 9, 2016
Owner name: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT, IL
Free format text: SECURITY AGREEMENT;ASSIGNORS:RPX CORPORATION;RPX CLEARINGHOUSE LLC;REEL/FRAME:038041/0001
Effective date: 20160226


text:
We will be making charoset, creating pillow covers, building pyramids (with cardboard blocks) and having a Seder plate station. During circle time we will learn songs that we can sing at our Seder. Members and non-members are welcome to join us. RSVPs are not required, but appreciated. Please contact Ann Zisser
The Bet Am Shalom office will be closed on Tuesday, January 27.
If weather allows, the office will reopen Wednesday morning.
Torah La'am Kitah Vav (6th Grade) will be selling hamsas they made in an art workshop as well as baked goods in the Round Room. All money raised will be donated to the Israel Guide Dog Center for the Blind.
Following the Early Bedtimers' Services, families will gather at the home of Alison and Jason Hill for "Pizza in the Hut" and a special "art project" and Sukkot-themed dessert in their Sukkah.
Pizza dinner will begin at 6:15 PM. Please RSVP to Alison Hill.
For those who cannot make the trip to the Lower East Side, we will bring the Lulav & Etrog Market to BAS. You will be able to experience the fun of seeking out the "gesunter essrig" for purchase ($36 per set). Pre order by contacting Karen Dolins.
All families are invited to join us for a picnic lunch on the BAS lawn to celebrate Lag B'Omer together.
Camp JRF is a joyful, creative, and inclusive Reconstructionist overnight camp for ages 7-17. Many of our BAS children and teens enjoy amazing summers at Camp JRF!
This Sunday, November 2nd, we are bringing Camp JRF to Bet Am Shalom with "A Taste of Camp JRF" activities in the BAS Simcha Room:10:30-11:00am for all BAS 2nd-4th graders11:00-11:30am for all BAS 5th & 6th graders
Parent Information Session from 11-11:30am in Activity Room 1Meet Sheira, Camp JRF Associate Director, to learn more about Camp JRF.
Prospective parents are invited to visit our Torah La'am classes for grades K-6.
All Torah La'am students and families invited to Purim Fest!
Established March 2, 1956/19 Adar, 5716
Click on any listing for more information.

subset: commoncrawl


text:
New Products
Tower Technology Corporation announces a promotional offer of its object oriented development system for Linux. TowerEiffel for Linux includes a high performance Eiffel 3 compiler, open development environment, programming tools and a base set of reusable software components. Key features include fast executable code, global system optimization, user controllable garbage collection, clear and precise error messages, exception handling, genericity, automatic system builds, automatic documentation generation and built in test support. A unique capability of TowerEiffel is Eiffel, C, and C++ interoperability.
Eiffel is a non-proprietary object-oriented programming language.
For more information, including details of the special promotional offers, visit the Tower World Wide Web Page at http://www.cm.cf.ac.uk/Tower/ Access the Tower Automated Reply System by sending an e-mail message to email@example.com. Call (800) 285-5124 or (512) 452-9455, or fax (512) 452-1721.
COBOL developers can now combine the benefits of the Linux environment with the application development features of ACUCOBOL-85 and take advantage of its many features, including: programmable hot keys, advanced window capabilities, a user replaceable file system and a built-in-source code debugger. Once an application is compiled in ACUCOBOL-85, developers can use Acucobol's full range of COBOL development tools and enjoy its portability to over 600 different platforms and operating environments without recompiling.
For more information, e-mail email@example.com, send mail to Acucobol, Inc., 7950 Silverton Avenue, Suite 201, San Diego, CA 92126, phone (619) 689-7220, or fax (619) 566-3071.
Renegade Solutions has announced the availability of scientific instrumentation libraries for Linux. Currently offered are a basic driver for the Epix Silicon Video MUX series of video frame grabbing boards, a driver for a low budget serial port D/A and A/D device and a driver for a custom DSP board based on the TI C25 and C50 series DSPs.
The Silicon Video MUX family of framegrabbers provide up to 752x480 8 bit grayscale images making it suitable for demanding computer vision and research applications. The basic driver package includes a simple GUI program to demonstrate the boards capabilities as well as source code for the library, and is priced at $500. Motif based image editing, processing and analysis software is also available. The driver for the serial port module also includes a GUI demonstration program and sells for $200. A driver for a low cost DSP board built by FroZen Technologies is also priced at $200.
Renegade Solutions will develop custom drivers for the above hardware, as well as for other instruments. For more information, call Renegade Solutions at (208) 524-6440 or e-mail firstname.lastname@example.com.
March 20, 1995—Darwin Open Systems today unveiled the OPEN LOOK, XView and NeWS Archive. This CD-ROM includes the full text of two books from the O'Reilly X series: the previously-unpublished Volume 3, User's Guide, OPEN LOOK edition, and Volume 7, XView Programming Manual. Both are on the CD in PostScript and in Adobe's Portable Document Format (PDF). There are also many other documents such as FAQs, and man pages for everything (included in troff, cat-able, PostScript and PDF, and usable from the CD-ROM by setting MANPATH). There is source code for the latest XView Toolkit, full source for many other OPEN LOOK programs and games including sample programs from several textbooks, pre-built search indexes for tools such as Glimpse, LQ-Text, viewers for PostScript and PDF, and other goodies. Also included is the full source code for two complete window systems:
The X Window System, Version 11, Release 6, (latest patch Level 11), including XFree86 (3.1.1.), and
The MGR Window System by Steve Uhler of Bellcore.
In addition to the textbooks, tool, and source code, there is an online "tour" of OPEN LOOK, XView, and other parts of the CD-ROM. The Tour is written in validated HTML, usable with Mosaic, Netscape, TkWWW, or your favorite Web viewer. If you are on the Internet, you can follow links to the outside. HTML hyperlinks are provided to the original FTP sources for much of the free software so you will be able to obtain updates, later versions, binaries for other platforms, etc.
Contact: Darwin Open Systems, P.O. Box 278, Palgrave, Ontario Canada L0N 1P0, by phone at +1 800-463-2108, or by e-mail to firstname.lastname@example.com.
Trending Topics
Practical Task Scheduling Deployment
On Demand
One of the best things about the UNIX environment (aside from being stable and efficient) is the vast array of software tools available to help you do your job. Traditionally, a UNIX tool does only one thing, but does that one thing very well. For example, grep is very easy to use and can search vast amounts of data quickly. The find tool can find a particular file or files based on all kinds of criteria. It's pretty easy to string these tools together to build even more powerful tools, such as a tool that finds all of the .log files in the /home directory and searches each one for a particular entry. This erector-set mentality allows UNIX system administrators to seem to always have the right tool for the job.
Cron traditionally has been considered another such a tool for job scheduling, but is it enough? This webinar considers that very question. The first part builds on a previous Geek Guide, Beyond Cron, and briefly describes how to know when it might be time to consider upgrading your job scheduling infrastructure. The second part presents an actual planning and implementation framework.
Join Linux Journal's Mike Diehl and Pat Cameron of Help Systems.
Free to Linux Journal readers.View Now!
|The Firebird Project's Firebird Relational Database
|Jul 29, 2016
|Stunnel Security for Oracle
|Jul 28, 2016
|SUSE LLC's SUSE Manager
|Jul 21, 2016
|My +1 Sword of Productivity
|Jul 20, 2016
|Non-Linux FOSS: Caffeine!
|Jul 19, 2016
|Murat Yener and Onur Dundar's Expert Android Studio (Wrox)
|Jul 18, 2016
- The Firebird Project's Firebird Relational Database
- Stunnel Security for Oracle
- My +1 Sword of Productivity
- Non-Linux FOSS: Caffeine!
- SUSE LLC's SUSE Manager
- Managing Linux Using Puppet
- Murat Yener and Onur Dundar's Expert Android Studio (Wrox)
- Parsing an RSS News Feed with a Bash Script
- Google's SwiftShader Released
- Doing for User Space What We Did for Kernel Space
Geek Guides
With all the industry talk about the benefits of Linux on Power and all the performance advantages offered by its open architecture, you may be considering a move in that direction. If you are thinking about analytics, big data and cloud computing, you would be right to evaluate Power. The idea of using commodity x86 hardware and replacing it every three years is an outdated cost model. It doesn't consider the total cost of ownership, and it doesn't consider the advantage of real processing power, high-availability and multithreading like a demon.
This ebook takes a look at some of the practical applications of the Linux on Power platform and ways you might bring all the performance power of this open architecture to bear for your organization. There are no smoke and mirrors here—just hard, cold, empirical evidence provided by independent sources. I also consider some innovative ways Linux on Power will be used in the future.Get the Guide


text:
|By Business Wire
Article Rating:
|November 12, 2012 03:03 AM EST
Moxie Software, Inc.:
|Ben Werner, senior product marketing manager, Microsoft, and Nikhil Govindaraj, vice president of products, Moxie Software
|Moxie Software Webinar: Moxie Software + Microsoft Dynamics CRM – Delivering Customer Experience Excellence
Tuesday, November 13, at 9 a.m. PT/12 p.m. ET
To register for this webinar, please visit: http://resources.moxiesoft.com/1112MicrosoftDynamics_Reg.html
Moxie Software™, Inc., the leading provider of customer-centric enterprise social software, today announced it is hosting a complimentary webinar with Microsoft addressing the Spaces by Moxie™ offering within Microsoft Dynamics CRM. Moxie Software and Microsoft recently announced a partnership to provide Microsoft Dynamics CRM with comprehensive multi-channel and knowledge base solutions to deliver superior customer experiences.
The webinar will discuss how to improve the way organizations interact, understand, and deliver superior service through customer channels such as email, chat, knowledge base, or web self-service. Moxie's partnership with Microsoft Dynamics CRM helps organizations:
- Provide a single source of truth: ensure Microsoft Dynamics CRM is your sole source for accurate data on all customer information and interactions.
- Drive seamless multi-channel interactions: access contact and case records within Microsoft Dynamics CRM in a single agent desktop.
- Resolve inquiries faster: search for answers, create and view cases, and update information in Dynamics CRM from within the agent desktop.
To receive additional details about the webinar, please register. Also, use the hashtag #MoxieCast to join the live discussion, tweeting questions or comments. Find us on Twitter at @Moxiesoft and @MSDynamicsCRM.
About Moxie Software, Inc.
Moxie Software provides the only customer-centric enterprise social software suite that enables companies and organizations to effectively connect employees, customers and partners to engage in business, share knowledge and collaborate. Spaces by Moxie is a comprehensive solution that powers more than three billion social interactions per year for leading organizations in consumer services, financial, healthcare, high-tech and media and entertainment. Moxie Software's customers are able to innovate faster, improve operational efficiencies and provide superior customer experiences. To learn more about Moxie Software, visit www.moxiesoft.com.
Moxie Software is a trademark of Moxie Software, Inc. All other company and product names mentioned are used only for identification purposes and may be trademarks or registered trademarks of their respective companies.
The 19th International Cloud Expo has announced that its Call for Papers is open. Cloud Expo, to be held November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA, brings together Cloud Computing, Big Data, Internet of Things, DevOps, Digital Transformation, Microservices and WebRTC to one location. With cloud computing driving a higher percentage of enterprise IT budgets every year, it becomes increasingly important to plant your flag in this fast-expanding business opportuni...
Jul. 23, 2016 10:15 PM EDT Reads: 2,400
From wearable activity trackers to fantasy e-sports, data and technology are transforming the way athletes train for the game and fans engage with their teams. In his session at @ThingsExpo, will present key data findings from leading sports organizations San Francisco 49ers, Orlando Magic NBA team. By utilizing data analytics these sports orgs have recognized new revenue streams, doubled its fan base and streamlined costs at its stadiums. John Paul is the CEO and Founder of VenueNext. Prior ...
Jul. 23, 2016 09:30 PM EDT Reads: 1,936
A critical component of any IoT project is what to do with all the data being generated. This data needs to be captured, processed, structured, and stored in a way to facilitate different kinds of queries. Traditional data warehouse and analytical systems are mature technologies that can be used to handle certain kinds of queries, but they are not always well suited to many problems, particularly when there is a need for real-time insights.
Jul. 23, 2016 08:45 PM EDT Reads: 1,637
CenturyLink has announced that application server solutions from GENBAND are now available as part of CenturyLink's Networx contracts. The General Services Administration (GSA)'s Networx program includes the largest telecommunications contract vehicles ever awarded by the federal government. CenturyLink recently secured an extension through spring 2020 of its offerings available to federal government agencies via GSA's Networx Universal and Enterprise contracts. GENBAND's EXPERiUS™ Application...
Jul. 23, 2016 08:30 PM EDT Reads: 1,764
"My role is working with customers, helping them go through this digital transformation. I spend a lot of time talking to banks, big industries, manufacturers working through how they are integrating and transforming their IT platforms and moving them forward," explained William Morrish, General Manager Product Sales at Interoute, in this SYS-CON.tv interview at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.
Jul. 23, 2016 08:30 PM EDT Reads: 2,010
Internet of @ThingsExpo, taking place November 1-3, 2016, at the Santa Clara Convention Center in Santa Clara, CA, is co-located with the 19th International Cloud Expo and will feature technical sessions from a rock star conference faculty and the leading industry players in the world and ThingsExpo Silicon Valley Call for Papers is now open.
Jul. 23, 2016 08:00 PM EDT Reads: 2,408
Big Data engines are powering a lot of service businesses right now. Data is collected from users from wearable technologies, web behaviors, purchase behavior as well as several arbitrary data points we'd never think of. The demand for faster and bigger engines to crunch and serve up the data to services is growing exponentially. You see a LOT of correlation between "Cloud" and "Big Data" but on Big Data and "Hybrid," where hybrid hosting is the sanest approach to the Big Data Infrastructure pro...
Jul. 23, 2016 08:00 PM EDT Reads: 1,777
The IoT is changing the way enterprises conduct business. In his session at @ThingsExpo, Eric Hoffman, Vice President at EastBanc Technologies, discussed how businesses can gain an edge over competitors by empowering consumers to take control through IoT. He cited examples such as a Washington, D.C.-based sports club that leveraged IoT and the cloud to develop a comprehensive booking system. He also highlighted how IoT can revitalize and restore outdated business models, making them profitable ...
Jul. 23, 2016 07:15 PM EDT Reads: 1,863
We all know the latest numbers: Gartner, Inc. forecasts that 6.4 billion connected things will be in use worldwide in 2016, up 30 percent from last year, and will reach 20.8 billion by 2020. We're rapidly approaching a data production of 40 zettabytes a day – more than we can every physically store, and exabytes and yottabytes are just around the corner. For many that's a good sign, as data has been proven to equal money – IF it's ingested, integrated, and analyzed fast enough. Without real-ti...
Jul. 23, 2016 07:00 PM EDT Reads: 858
I wanted to gather all of my Internet of Things (IOT) blogs into a single blog (that I could later use with my University of San Francisco (USF) Big Data "MBA" course). However as I started to pull these blogs together, I realized that my IOT discussion lacked a vision; it lacked an end point towards which an organization could drive their IOT envisioning, proof of value, app dev, data engineering and data science efforts. And I think that the IOT end point is really quite simple…
Jul. 23, 2016 06:15 PM EDT Reads: 785
With 15% of enterprises adopting a hybrid IT strategy, you need to set a plan to integrate hybrid cloud throughout your infrastructure. In his session at 18th Cloud Expo, Steven Dreher, Director of Solutions Architecture at Green House Data, discussed how to plan for shifting resource requirements, overcome challenges, and implement hybrid IT alongside your existing data center assets. Highlights included anticipating workload, cost and resource calculations, integrating services on both sides...
Jul. 23, 2016 06:00 PM EDT Reads: 1,878
"We are a well-established player in the application life cycle management market and we also have a very strong version control product," stated Flint Brenton, CEO of CollabNet,, in this SYS-CON.tv interview at 18th Cloud Expo, held June 7-9, 2016, at the Javits Center in New York City, NY.
Jul. 23, 2016 05:30 PM EDT Reads: 1,713
The IoT has the potential to create a renaissance of manufacturing in the US and elsewhere. In his session at 18th Cloud Expo, Florent Solt, CTO and chief architect of Netvibes, discussed how the expected exponential increase in the amount of data that will be processed, transported, stored, and accessed means there will be a huge demand for smart technologies to deliver it. Florent Solt is the CTO and chief architect of Netvibes. Prior to joining Netvibes in 2007, he co-founded Rift Technologi...
Jul. 23, 2016 05:00 PM EDT Reads: 934
Unless your company can spend a lot of money on new technology, re-engineering your environment and hiring a comprehensive cybersecurity team, you will most likely move to the cloud or seek external service partnerships. In his session at 18th Cloud Expo, Darren Guccione, CEO of Keeper Security, revealed what you need to know when it comes to encryption in the cloud.
Jul. 23, 2016 04:00 PM EDT Reads: 2,301
We're entering the post-smartphone era, where wearable gadgets from watches and fitness bands to glasses and health aids will power the next technological revolution. With mass adoption of wearable devices comes a new data ecosystem that must be protected. Wearables open new pathways that facilitate the tracking, sharing and storing of consumers' personal health, location and daily activity data. Consumers have some idea of the data these devices capture, but most don't realize how revealing and...
Jul. 23, 2016 04:00 PM EDT Reads: 1,974
What are the successful IoT innovations from emerging markets? What are the unique challenges and opportunities from these markets? How did the constraints in connectivity among others lead to groundbreaking insights? In her session at @ThingsExpo, Carmen Feliciano, a Principal at AMDG, will answer all these questions and share how you can apply IoT best practices and frameworks from the emerging markets to your own business.
Jul. 23, 2016 03:45 PM EDT Reads: 1,505
Basho Technologies has announced the latest release of Basho Riak TS, version 1.3. Riak TS is an enterprise-grade NoSQL database optimized for Internet of Things (IoT). The open source version enables developers to download the software for free and use it in production as well as make contributions to the code and develop applications around Riak TS. Enhancements to Riak TS make it quick, easy and cost-effective to spin up an instance to test new ideas and build IoT applications. In addition to...
Jul. 23, 2016 03:30 PM EDT Reads: 1,838
You think you know what's in your data. But do you? Most organizations are now aware of the business intelligence represented by their data. Data science stands to take this to a level you never thought of – literally. The techniques of data science, when used with the capabilities of Big Data technologies, can make connections you had not yet imagined, helping you discover new insights and ask new questions of your data. In his session at @ThingsExpo, Sarbjit Sarkaria, data science team lead ...
Jul. 23, 2016 03:15 PM EDT Reads: 816
Extracting business value from Internet of Things (IoT) data doesn't happen overnight. There are several requirements that must be satisfied, including IoT device enablement, data analysis, real-time detection of complex events and automated orchestration of actions. Unfortunately, too many companies fall short in achieving their business goals by implementing incomplete solutions or not focusing on tangible use cases. In his general session at @ThingsExpo, Dave McCarthy, Director of Products...
Jul. 23, 2016 03:00 PM EDT Reads: 1,652
Ask someone to architect an Internet of Things (IoT) solution and you are guaranteed to see a reference to the cloud. This would lead you to believe that IoT requires the cloud to exist. However, there are many IoT use cases where the cloud is not feasible or desirable. In his session at @ThingsExpo, Dave McCarthy, Director of Products at Bsquare Corporation, will discuss the strategies that exist to extend intelligence directly to IoT devices and sensors, freeing them from the constraints of ...
Jul. 23, 2016 02:30 PM EDT Reads: 1,702


text:
Skip to Main Content
IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards,
eBooks, and eLearning courses.
Learn more about:
IEEE membership
IEEE Xplore subscriptions
We report significant progress toward full development of a unique magnetic-gradient-tensor-based "scalar triangulation and ranging (STAR)" method for detection, localization and classification (DLC) of magnetic targets. The STAR method converts magnetic tensors to rotationally invariant scalar parameters that are virtually unaffected by the effects of sensing platform motion. Thus, the STAR method is particularly appropriate for magnetic target DLC using highly mobile sensing platforms such as autonomous underwater vehicles (AUV). Prior work has resulted in development of a two-dimensional (2D) magnetic target-homing concept for fully autonomous localization of mines using crawler-type AUVs. However, the simple 2D STAR approach cannot effectively discriminate between magnetic clutter and mine-like target signatures. Improved, 3D simulations demonstrate that the STAR concept can be applied to measurements of the vector positions and dipole signatures of magnetic objects. The new results indicate that an improved STAR system will provide an enhanced capability for discrimination between magnetic clutter and real targets such as magnetic mines and Unexploded Ordnance (UXO). Consequently, further development of the advanced STAR concept will provide high-mobility autonomous sensing platforms (such as AUVs and man-portable systems) with a uniquely effective modality for DLC of magnetic mines and UXO
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.© Copyright 2016 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.


text:
CamCard Free - Business Card R
No. 1 business card app, loved by 100 million users * Top Developer on Google Play * Must
Free • 70.6K
All Android applications categories
All Android games categories
No. 1 business card app, loved by 100 million users * Top Developer on Google Play * Must
Free • 70.6K
Scan barcodes on products, or Data Matrix and QR Codes containing URLs, contact info, etc. Almost every question and negative review comment is addressed by one of the following. Please save everyone time by reading these first: Nobody is stealing your information. The app allows you to share contacts, apps, and bookmarks in a QR Code. This is wh…
Free • 609K
LIMITED TIME DISCOUNT! 90% off: original price $11.99 -> now $0.99 No. 1 business card app
Business Card Scanner & Reader Free Bric is a professional networking app that facilitates
Free • 165
Formerly AT&T Code Scanner: QR, Data Matrix, and UPC Barcode Reader. Shop Smarter with Code
Free • 30.8K
Scan your business cards and save them to your contacts! With the FREE business card scanner
Free • 97
The free Kaspersky QR Scanner protects you from rogue QR codes containing dangerous links that can
Free • 11.7K
to take you directly into the specific part of the app you use most: create business cards, history
Free • 343.4K
's cloud storage. This will make business cards database trouble-free, updated and accessible from all your
Free • 3.2K
, notes, invoices, business cards, whiteboards and other paper text. With Fast Scanner, you can quickly
Free • 59.7K
. Once purchased, you can upgrade CamScanner Free version to CamScanner Full version. The world's No. 1
networks we are using. Contacts If you scan a QR Code that contains someone's business card
Free • 29.5K
Other users also searched for:
scan business cards, cam scanner, cam card, cb scanner, german tv, russian tv, ecards, english conversation, korean tv, chinese tv, french tv
Apps available in other platforms:
Last review
BADLAND 2: "Rolling Along"
by Noel Catherine
THE VERDICT Twist, turn, and roll your way through a terrain that wants to leave you dead in BADLAND 2. This game puts you through the elements and makes you come out the other side. THE PROS The visuals in this game are stunning, especially on…
Explore our channels


text:
Comments by geneshan2
Posted on July 21 at 9:52 a.m. (Suggest removal)
Now, if only the County had enough beds to support the travelers......
From: Montgomery County gets funds to repave part of Erie Canalway Trail
Posted on July 11 at 4:04 p.m. (Suggest removal)
What a concept...consider the person for the job, rather than his/her political affiliation.
From: Trump's VP curveball: He's considering a retired general... who's a Democrat
Posted on June 20 at 4:03 p.m. (Suggest removal)
I wish I was old, like I am now, when I took American History in high school so I could have appreciated what shaped our country. The wrongs that were done, as well as the rights, all had meaning and reasons.
From: Dress said to originate from Battle of Little Bighorn
Posted on June 10 at 7:55 a.m. (Suggest removal)
What's the big deal? This guy should file the paperwork that the Town requires, as long as he has nothing to hide, and be done with it. The permitting process could/would protect the Town from any possible lawsuits.
From: Glenville, ropes course owner at odds over permit
Posted on April 29 at 3:32 p.m. (Suggest removal)
And just how, except with some known persons, are the police supposed to know if they are dealing with a mentally ill person, or just someone bent on having a confrontation with the law? The police have every right to protect themselves and others in situations where the "bad guy's" mental state is unknown.
From: Should police be retrained on how they deal with mentally ill offenders?
Posted on April 15 at 2:45 p.m. (Suggest removal)
Say good bye Sheldon.
From: Prosecutors in Sheldon Silver case cite extramarital affairs
Posted on April 7 at 8:16 a.m. (Suggest removal)
Does this mean the Thruway may become a toll-free highway as promised for the mid 90's, back when the Thruway was built? What a boon to economic development in the Mohawk Valley IF those tolls are lifted.
From: Power authority to take over state Canal Corporation management
Posted on March 23 at 2:55 p.m. (Suggest removal)
Pretty soon there will be no choice, ONE bank for us to be able to use. The big get bigger and less friendly to the small customer.
From: Shareholders approve KeyCorp, First Niagara merger
Posted on March 2 at 11:26 a.m. (Suggest removal)
I guess the Republican leadership can't listen to the voting public...and they wonder why people want change. Anyone who thinks Trump could/would run amok as president couldn't have accepted Obama either. No one is perfect by any means, but whoever is ultimately elected will be subject to the checks and balances that our forefathers put in place to keep the Republic running as smoothly as possible.
From: Republican split is becoming deep chasm
Posted on February 11 at 7:34 a.m. (Suggest removal)
I can understand that some may still be fighting the Civil War and find the confederate flag offensive, but from what I've read, the ISIS flag is also available for sale. Which is more offensive? Just saying, If I had a choice........
From: Washington County Fair to allow sale of Confederate flag


text:
Martin Truex Jr. appears to be almost a lock to qualify for the NASCAR's Chase for the Championship for the first time since 2007.
You must login to view the full content on this page.
© 2016 Press of Atlantic City. All rights reserved. This material may not be published, broadcast, rewritten or redistributed.


text:
|Home | About | Journals | Submit | Contact Us | Français
Mixed ligand complexes of Ni(II) with 1,10-phenanthroline (1,10-Phen) and Schiff bases L1(MIIMP); L2(CMIIMP); L3(EMIIMP); L4(MIIMNP); L5(MEMIIMP); L6(BMIIMP); L7(MMIIMP); L8(MIIBD) have been synthesized. These metal chelates have been characterized by elemental analysis, IR, 1H-NMR, 13C-NMR, Mass, UV-Vis, magnetic moments, and thermogravimetric (TG&DTA) analysis. Spectral data showed that the 1,10-phenanthroline act as neutral bidentate ligand coordinating to the metal ion through two nitrogen donor atoms and Schiff bases acts as monobasic bidentate coordinating through NO donor atoms. All Ni(II) complexes appear to have an octahedral geometry. The antimicrobial activity of mixed ligand complexes has been studied by screening against various microorganisms, it is observed that the activity enhances upon coordination. The DNA binding studies have been investigated by UV-Vis spectroscopy, and the experimental results indicate that these complexes bind to CT DNA with the intrinsic binding constant Kb = 2.5 ± 0.2 × 105M−1. MTT is used to test the anticancer effect of the complexes with HL60 tumor cell. The inhibition ratio was accelerated by increasing the dosage, and it had significant positive correlation with the medication dosage.
PubMed Central Canada is a service of the Canadian Institutes of Health Research (CIHR) working in partnership with the National Research Council's national science library in cooperation with the National Center for Biotechnology Information at the U.S. National Library of Medicine(NCBI/NLM). It includes content provided to the PubMed Central International archive by participating publishers.