Abstract: A method and apparatus for processing bytes received from a data stream includes multiple parallel byte processing engines that simultaneously process a first set of bytes received from a data channel during a first cycle and simultaneously process a second set of bytes received from the data channel during a second cycle. The method and apparatus further includes a state memory for storing byte information pertaining to the first set of bytes. When processing HDLC protocol bytes, the multiple parallel byte processing engines process the first and second set of bytes to identify at least one delineating byte contained within the data channel in accordance with a HDLC protocol.

Abstract: A method and apparatus for sharing storage in a cross-connect. According to one embodiment of the invention, a cross-connect includes a number of sets of data input lines and a number of matrices. Each of the sets of data input lines is to be coupled to a different line card. Each of the matrices is coupled to every one of the sets of data input lines. In addition, each of the matrices has a set of data output lines, where the set of data input lines of each of the matrices is to be coupled to a different one of the line cards.

Abstract: A method and apparatus for maintaining consistent data is described. A computer implemented method comprises generating a first command for a set of network data to be executed on a local memory, executing a second command for the set of network data on a remote memory in response to generation of the first command, determining whether the second command has been executed successfully on the remote memory, executing the first command on the local memory upon determining the second command is executed successfully, and generating an error upon determining the second command is not executed successfully.

Abstract: In one embodiment, a method comprises receiving a packet of a number of packets for storage into an egress port. The egress port has a number of queues associated with nodes of a hierarchy tree. The hierarchy tree has a level of nodes associated with contexts for the number of packets. The method also includes storing the packet into a queue of the number of queues of the egress port based the associated node within the hierarchy tree.

Abstract: A method and apparatus for processing data packets of differing protocols across different channels within signals are described. In an embodiment, a method includes receiving at least one signal, wherein the at least one signal includes a number of channels such that each of the number of channels can include different protocols and different configurations for the different protocols. The method also includes processing data packets in each of the number of channels in a predefined order.

Abstract: In accordance with one aspect of the present invention, an access request associated with a cache miss to a single cache line having a pending cache fill can be handled in a non-blocking manner by storing the cache miss in a retry queue while the cache fill is pending. The retry queue then detects the return of the cache fill and inserts the access request associated with the cache miss onto the cache pipeline for processing.

Abstract: Free memory can be managed by creating a free list having entries with address of free memory location. A portion of this free list can then be cached in a cache that includes an upper threshold and a lower threshold. Additionally, a plurality of free lists are created for a plurality of memory banks in a plurality of memory channels. A free list is created for each memory bank in each memory channel. Entries from these free lists are written to a global cache. The entries written to the global cache are distributed between the memory channels and memory banks.

Abstract: Free memory can be managed by creating a free list having entries with address of free memory location. A portion of this free list can then be cached in a cache that includes an upper threshold and a lower threshold. Additionally, a plurality of free lists are created for a plurality of memory banks in a plurality of memory channels. A free list is created for each memory bank in each memory channel. Entries from these free lists are written to a global cache. The entries written to the global cache are distributed between the memory channels and memory banks.

Abstract: A computer implemented method in which Internet Protocol (IP) packets are routed within a first Internet Service Provider's (ISP's) domain from a single network device with a first database. The first database includes addresses of the first ISP. IP packets are also routed within a second ISP's domain from single network device with a second database. The second database, which is separate from the first database, includes addresses of the second ISP.

Abstract: A method and apparatus for the restart communication between network elements are described. In one embodiment, a method for restarting communication between a first network element and a second network element in a network comprises transmitting a modified hello packet to the second network element. The modified hello packet includes a time value that is greater than a time value of a hello packet that was transmitted to the second network element prior to International-System-International-System (IS-IS) network communications in the first network element becoming non-operational. The method also including updating routing information within the first network element through transmission of Complete Sequence Number Packets of the IS-IS standard to the second network element, independent of tearing down a communication link between the first network element and the second network element after IS-IS network communications in the first network element have become non-operational.

Abstract: Providing different levels of quality of service for different data flows being transported over a data link requires a very fast way to classify individual packets. Providing meaningful classification generally requires classifying data packets in several dimensions. A classification method represents a rule base as a hierarchy of linked tables and sequentially matches each parameter value in a packet signature against tables in the hierarchy. The method supports longest prefix matching and avoids time consuming backtracking by adding rules to the rule base.

Abstract: Providing different levels of quality of service for different data flows being transported over a data link requires a very fast way to schedule individual packets for forwarding on the data link. The invention provides scheduling methods which give preference to higher priority packets while treating lower priority packets fairly. The methods can provide shorter latencies for higher priority packets than can many prior scheduling methods. The methods and apparatus of the invention are readily adaptable for use with scheduling rules provided in the form of hierarchical policy trees.

Abstract: Providing different levels of quality of service for different data flows being transported over a data link requires a very fast way to classify individual packets. Providing meaningful classification generally requires classifying data packets in several dimensions. A classification method processes multiple parameter values for a packet in parallel to obtain answer sets indicating which rules are matched by each parameter value. Answer indexes identify logical blocks in each answer set which contain TRUE values. The method performs an AND operation on the answer indexes to identify those blocks in the answer sets which could contain bits corresponding to matched rules. An AND operation is performed on the identified blocks to identify the particular rule matched by the packet. The classification method allows extremely fast wire speed packet classification.

Abstract: A method and apparatus for performing bit stuffing operations for transmission signals are described. In an embodiment, a method includes receiving data for a number of channels of a signal. The method also includes recursively processing the data for the number of channels in an order. The processing of a channel of the number of channels includes retrieving a previous state for the channel upon determining that a timeslot for the channel is being processed. The previous state includes a history of values of a depth of a First In First Out (FIFO) for the channel. Moreover, the processing of the channel of the number of channels within the signal includes determining whether to make a bit stuffing decision for the channel upon determining whether the timeslot is associated with a bit stuffing opportunity for the channel. The bit stuffing decision is based on a current value and the history of the values of the depth of the FIFO for the channel.

Abstract: A method and apparatus for processing data packets of differing protocols across different data channels and control channels within signals are described. In an embodiment, a method includes receiving at least one data signal, wherein the at least one data signal includes a number of channels. The number of channels includes data channels and control channels, such that each of the data channels can include different protocols and different configurations for the different protocols and such that the control channels includes control data for controlling the at least one data signal. Additionally, the method includes processing data packets in each of the number of channels in a predefined order.

Abstract: A network policy management system and methods define service templates. The service templates contain information on the topologies of services such as video calls, web services, order processing applications, or the like. The service templates also contain information about the quality of service required by each of the data flows which will be generated when an instance of the service is used. The policy management system allows users to add new services by selecting a service template and specifying endpoints for the service on a map of the network. The system automatically generates updated packet forwarding rules for use at a plurality of packet processing devices in the network.