This invention is a bus communication protocol. A master device stores bus credits. The master device may transmit a bus transaction only if it holds sufficient number and type of bus credits. Upon transmission, the master device decrements the number of stored bus credits. The bus credits correspond to resources on a slave device for receiving bus transactions. The slave device must receive the bus transaction if accompanied by the proper credits. The slave device services the transaction. The slave device then transmits a credit return. The master device adds the corresponding number and types of credits to the stored amount. The slave device is ready to accept another bus transaction and the master device is re-enabled to initiate the bus transaction. In many types of interactions a bus agent may act as both master and slave depending upon the state of the process.

A network device for a communications network includes a port configured to transmit data to the network at a maximum transmit data rate. The device also includes a transmit buffer configured to buffer data units that are ready for transmission to the network, and a packet buffer configured to buffer data units before the data units are ready for transmission. The packet buffer is configured to output data units at a maximum packet buffer transmission rate faster than the maximum transmit data rate. The device includes a rate controller configured to control a transmission rate of data from the packet buffer to the transmit buffer so that averaged over a period, the transmission rate from the packet buffer to the transmit buffer is at most equal to the maximum transmit data rate, while allowing the transmission rate, at one or more time intervals, to exceed the maximum transmit data rate.

In some embodiments, a peer matching service classifies client devices into a bucket where similar network identification information is received from the client devices and is associated with an access point to which the client devices are connected to transfer content via a peer to peer transfer. The service determines whether to transition the bucket from a first operating mode into a contention management mode based on a status of client devices in the bucket. The status is based on a connection type for the client devices. When the bucket is transitioned into the contention management mode, the service applies instructions associated with the contention management mode to characteristics associated with the client devices to determine a restriction for peer to peer transfer of the content and communicates with the client devices to apply the restriction to the peer to peer transfer of the content through the access point.

Packet forwarding includes creating a first lookup table for mapping packets to nodes based on the number of nodes in a first set of nodes. A received packet is mapped to a mapping value using a predetermined mapping function. The first lookup table is indexed using a first subset of bits comprising the mapping value. A second lookup table is created in response to adding a node to the first set of nodes. A subsequently received packet is mapped to a mapping value using the same predetermined mapping function to index the second lookup table using a second subset of bits comprising the mapping value.

A computer-implemented system and method include a rate-limiting server. The server receives a request from a client and uses an early stage process to search for a rate-limiting token bucket (TB) using metadata associated with the request. Responsive to finding the TB using the first metadata, a response operation is performed. Responsive to not finding the TB using the first metadata, a late stage process is used to search for the rate-limiting TB using server-side session data associated with the request. Responsive to not finding the TB using the session data, the TB is created and associated with at least two search indexes comprising the first metadata associated with the request and the session data. Finally, the response operation is performed that comprises transmitting a determined response to the client.

A pricing policy to be applied to token population changes at a token bucket used for admission control during burst-mode operations at a work target is determined. Over a time period, changes to the token population of that bucket are recorded. An amount to be charged to a client is determined, based on the recorded changes in token population and an associated pricing amount indicated in the policy.

A packet queueing system includes an ingress port configured to receive packets; queueing logic communicatively coupled to one or more egress queues for transmission via an egress port, wherein the queueing logic is configured to maintain an Acceptable Burst Size (ABS) token bucket which is set to enable absorption of microbursts, and implement a congestion avoidance algorithm to one of randomly drop packets and queue packets, wherein the congestion avoidance algorithm only performs the randomly drop packets responsive to the ABS token bucket being empty.

The present invention relates to methods, systems and apparatus for providing efficient packet flow fillrate adjustments and providing protection against distributed denial of service attacks. One exemplary embodiment in accordance with the invention is a method of operating a communication system including the steps of receiving, at a session border controller, a first SIP invite request message; making a decision, at the session border controller, as to whether the first SIP invite request originated from an Integrated Access Device or an IP-PBX device; generating, at the SBC, a packet flow fillrate based on said decision as to whether the SIP invite request originated at an Integrated Access Device or an Internet Protocol-Private Branch Exchange (IP-PBX) device.

A system to support Time Division Duplex (TDD) Full Duplex (FDX) with a remote Duty Cycle (DS) framer may be provided. The system may comprise a core and a Remote PHY Device (RPD). The core may comprise a Downstream (DS) Quality-of-Service (QoS) scheduler and a DS duty cycle rate regulator. The DS duty cycle rate regulator may comprise a plurality of token buckets and a plurality of data framing queues. The RPD may comprise a plurality of TG queue blocks and switching logic.

The present disclosure related to routing methods. One example method includes configuring a first path and a second path in charge of load sharing for a data flow, and configuring a third path in charge of reroute protection. A first group entry is generated for instructing the forwarding device to use the first path and the second path as load-sharing paths and use the third path to perform reroute protection on the first path and the second path. A flow entry for instructing to perform an operation of going to the first group entry is generated.