Abstract: In general, techniques for facilitating a distributed network (L3) subnet by which multiple independent control planes of network devices connected to physically separate L2 networks provide L2 reachability to/from a single L3 subnet. In some examples, a shared L2 network physically situated to connect a plurality of physically separate L2 networks “stitches” the L2 networks together within the respective, independent control planes of switches such that the control planes bridge L2 traffic for a single bridge domain for the separate L2 networks to the shared L2 network and visa-versa. Each of the independent control planes may be configured with a virtual IRB instance associated with the bridge domain and with a common network subnet. Each of the virtual IRBs provides a functionally similar routing interface for the single bridge domain for the separate L2 networks and allows the shared network subnet to be distributed among the independent control planes.

Abstract: In general, techniques are described in which packet replicators of a network device cooperate to generate a distributed hierarchical forwarding structure that the packet replicators then use to replicate and forward multicast packets to multiple output interfaces. For example, packet forwarding engines (PFEs) of a router each receive a new list of interfaces for a multicast packet stream. The PFEs individually construct a hierarchical forwarding structure based on the interface list. The hierarchical forwarding structure specifies interrelationships among the PFEs, which occupy nodes within the hierarchy. Each child PFE determines from the hierarchical forwarding structure the identity of a parent PFE and issues a token, constituting forwarding state for the distributed hierarchical forwarding structure, to the parent PFE.

Abstract: Selection of proper virtual routing and forwarding (VRF) tables is based on a logical interface that is not associated with a physical interface. The selected VRF table is used to perform an output interface lookup for outgoing packets. In one example, a router includes a plurality of network interfaces, and a processing unit configured to select a logical interface not associated with any of the plurality of network interfaces based on an association with a received packet of a virtual private network, select one of a plurality of VRF tables in which to perform an output interface lookup for the packet that corresponds to the selected logical interface, and determine one of the plurality of network interfaces from the one of the plurality of VRF tables based on a destination of the packet, wherein the determined one of the plurality of network interfaces is configured to forward the packet.

Abstract: A route for a data unit through a network may be defined based on a number of next hops. Exemplary embodiments described herein may implement a router forwarding table as a chained list of references to next hops. In one implementation, a device includes a forwarding table that includes: a first table configured to store, for each of a plurality of routes for data units in a network, a chain of links to next hops for the routes; and a second table configured to store the next hops. The device also includes a forwarding engine configured to assemble the next hops for the data units based on using the chain of links in the first table to retrieve the next hops in the second table and to forward the data units in the network based on the assembled next hops.

Abstract: A method for reconciling transactions iteratively by segregating data into homogeneous data sets. The method includes acquiring transactions from two or more systems and comparing with a set of configurable predefined matching rules. Applying, based on the result of the comparison, one or more rules on the acquired transactions. The transactions of the two or more systems are scanned and a user defined function is applied on the transactions of the two systems. A value of the user defined function is calculated. If the value of the user defined function is residual value, a configurable criteria is applied on the value of the user defined function. A residual transaction is created in one of the systems and the value of the user defined function is recalculated. If the value of the user defined function is null value, indicates the transactions are reconciled.

Abstract: In general, techniques for facilitating a distributed network (L3) subnet by which multiple independent control planes of network devices connected to physically separate L2 networks provide L2 reachability to/from a single L3 subnet. In some examples, a shared L2 network physically situated to connect a plurality of physically separate L2 networks “stitches” the L2 networks together within the respective, independent control planes of switches such that the control planes bridge L2 traffic for a single bridge domain for the separate L2 networks to the shared L2 network and visa-versa. Each of the independent control planes may be configured with a virtual IRB instance associated with the bridge domain and with a common network subnet. Each of the virtual IRBs provides a functionally similar routing interface for the single bridge domain for the separate L2 networks and allows the shared network subnet to be distributed among the independent control planes.

Abstract: Selection of proper virtual routing and forwarding (VRF) tables is based on a logical interface that is not associated with a physical interface. The selected VRF table is used to perform an output interface lookup for outgoing packets. In one example, a router includes a plurality of network interfaces, and a processing unit configured to select a logical interface not associated with any of the plurality of network interfaces based on an association with a received packet of a virtual private network, select one of a plurality of VRF tables in which to perform an output interface lookup for the packet that corresponds to the selected logical interface, and determine one of the plurality of network interfaces from the one of the plurality of VRF tables based on a destination of the packet, wherein the determined one of the plurality of network interfaces is configured to forward the packet.

Abstract: In general, techniques are described in which packet replicators of a network device cooperate to generate a distributed hierarchical forwarding structure that the packet replicators then use to replicate and forward multicast packets to multiple output interfaces. For example, packet forwarding engines (PFEs) of a router each receive a new list of interfaces for a multicast packet stream. The PFEs individually construct a hierarchical forwarding structure based on the interface list. The hierarchical forwarding structure specifies interrelationships among the PFEs, which occupy nodes within the hierarchy. Each child PFE determines from the hierarchical forwarding structure the identity of a parent PFE and issues a token, constituting forwarding state for the distributed hierarchical forwarding structure, to the parent PFE.

Abstract: A configurable decoder within a receiver (for example, within a wireless communication device) includes numerous decoders. In one mode, the multiple decoders are used to decode different sub-packets of a packet. When one decoder completes decoding the last sub-packet assigned to it of the packet, then that decoder generates a packet done indication. A control circuit receives the packet done indications, and when all the decoders have generated packet done indications then the control circuit initiates an action. In one example, the action is the interrupting of a processor. The processor responds by reading status information from the control circuit, thereby resetting the interrupt. End-of-packet markers are usable to generate packet done indications and to generate EOP interrupts. Similarly, end-of-group markers are usable to generate group done indications and to generate EOG interrupts. The decoder block is configurable to process sub-packets of a packet using either one or multiple decoders.

Abstract: A route for a data unit through a network may be defined based on a number of next hops. Exemplary embodiments described herein may implement a router forwarding table as a chained list of references to next hops. In one implementation, a device includes a forwarding table that includes: a first table configured to store, for each of a plurality of routes for data units in a network, a chain of links to next hops for the routes; and a second table configured to store the next hops. The device also includes a forwarding engine configured to assemble the next hops for the data units based on using the chain of links in the first table to retrieve the next hops in the second table and to forward the data units in the network based on the assembled next hops.

Abstract: A network device includes a memory, a routing engine and a forwarding engine. The memory stores a forwarding table and the routing engine constructs a first composite next hop that includes multiple next hops, where each of the multiple next hops represents an action to be taken on a data unit as it transits the network device or represents another composite next hop, and where the first composite next hop specifies a function to be performed on the plurality of next hops. The routing engine further stores the composite next hop in an entry of the forwarding table. The forwarding engine retrieves the composite next hop from the forwarding table, and forwards a data unit towards one or more network destinations based on the composite next hop.

Abstract: Layer two (L2) forwarding of multicast traffic between routers of a Virtual Private local area network (LAN) Service (VPLS) domain is described. For example, the techniques allow multicast traffic to generally be forwarded between VPLS routers based on L2 information only, without requiring the routers to examine any layer three (L3) information carried by the multicast traffic for forwarding the multicast traffic. A router dynamically learns a mapping between a multicast source device and an L2 address of a router that introduces multicast traffic into the VPLS domain from the multicast source device. The router installs forwarding information based on the mapping that specifies the L2 address of the router that introduces the multicast traffic, and an L2 multicast group address of the multicast group, and forwards multicast traffic for the multicast group based on the forwarding information without reference to any L3 information of the multicast traffic.

Abstract: A device may include a donor to maintain a pool of addresses; a group of borrowers to obtain addresses from the donor; a daemon that has registered an interest in one or more borrowers in the group of borrowers; and a library to maintain first relationships between donors and borrowers that have obtained addresses from the donors, maintain second relationships between daemons and borrowers in which the daemons have registered an interest, receive a notification regarding an incident associated with the donor, identify, in response to the notification, the group of borrowers based on the first relationships, determine that the daemon has registered an interest in the one or more borrowers in the group of borrowers based on the second relationships, and output, to the daemon, a notification regarding the incident associated with the donor.

Abstract: An egress device of a network tunnel is configured to receive fragmented packets over a tunnel interface when the network tunnel is defined using information that is not present in all of the fragmented packets. For example, an egress device includes an interface to receive packets associated with the network tunnel, at least some of the packets being fragmented packets that are fragments of tunnel encapsulated packets. Some of the fragmented packets include network layer information associated with a network layer header of an original unfragmented tunnel encapsulated packet and do not include transport layer information associated with a transport layer header of the original unfragmented tunnel encapsulated packet. A forwarding engine of the egress device uses a multi-stage chained lookup to determine whether packets conform to tunnel definitions for the network tunnel that define the network tunnel by specifying both network layer information and transport layer information required for the packets.

Abstract: Distribution parameter mapping determines the bit error probability (BEP) of a burst transmitted from a base station to the mobile station using a modulation and coding scheme (MCS) specified in the EDGE standard. Depending on whether the multi-bit soft decisions of the burst most resemble a Gaussian or a Rician distribution, the statistical parameters ? and ? or A and u are determined. The ratio ?/? or A/? is mapped to an empirically determined BEP in a Gaussian or Rician lookup table, respectively. The BEPs are not influenced by the degree of code redundancy in the MCS. The BEPs for the four bursts in a radio block are then averaged, filtered and quantized according to the EDGE standard. The quantization level of the average BEP is reported to the base station so that subsequent radio blocks can be transmitted using an MCS that is appropriate for the estimated BEP.

Abstract: A route for a data unit through a network may be defined based on a number of next hops. Exemplary embodiments described herein may implement a router forwarding table as a chained list of references to next hops. In one implementation, a device includes a forwarding table that includes: a first table configured to store, for each of a plurality of routes for data units in a network, a chain of links to next hops for the routes; and a second table configured to store the next hops. The device also includes a forwarding engine configured to assemble the next hops for the data units based on using the chain of links in the first table to retrieve the next hops in the second table and to forward the data units in the network based on the assembled next hops.

Abstract: A device may include a donor to maintain a pool of addresses; a group of borrowers to obtain addresses from the donor; a daemon that has registered an interest in one or more borrowers in the group of borrowers; and a library to maintain first relationships between donors and borrowers that have obtained addresses from the donors, maintain second relationships between daemons and borrowers in which the daemons have registered an interest, receive a notification regarding an incident associated with the donor, identify, in response to the notification, the group of borrowers based on the first relationships, determine that the daemon has registered an interest in the one or more borrowers in the group of borrowers based on the second relationships, and output, to the daemon, a notification regarding the incident associated with the donor.

Abstract: A device may include a donor to maintain a pool of addresses; a group of borrowers to obtain addresses from the donor; a daemon that has registered an interest in one or more borrowers in the group of borrowers; and a library to maintain first relationships between donors and borrowers that have obtained addresses from the donors, maintain second relationships between daemons and borrowers in which the daemons have registered an interest, receive a notification regarding an incident associated with the donor, identify, in response to the notification, the group of borrowers based on the first relationships, determine that the daemon has registered an interest in the one or more borrowers in the group of borrowers based on the second relationships, and output, to the daemon, a notification regarding the incident associated with the donor.

Abstract: In embodiments, a fast Fourier transform (FFT) engine includes a series of stages, each stage containing a butterfly and a data normalization device configured to scale output of the stage's butterfly. The scaling factors are adjusted, for example, periodically or on as-needed basis, so that the dynamic range of the butterflies and the buffers is increased for a given bit-width, or the bit-width of these devices is decreased for the same dynamic range. Additionally, bit-width of other buffer(s) is decreased because of the scaling of the data.

Abstract: A route for a data unit through a network may be defined based on a number of next hops. Exemplary embodiments described herein may implement a router forwarding table as a chained list of references to next hops. In one implementation, a device includes a forwarding table that includes: a first table configured to store, for each of a plurality of routes for data units in a network, a chain of links to next hops for the routes; and a second table configured to store the next hops. The device also includes a forwarding engine configured to assemble the next hops for the data units based on using the chain of links in the first table to retrieve the next hops in the second table and to forward the data units in the network based on the assembled next hops.