Class / Patent application number | Description | Number of patent applications / Date published |
370235100 | Using leaky bucket technique | 70 |
20080198750 | Bandwidth control module and bandwidth control method thereof - A bandwidth control method is adapted for use in a network device having a system clock. The network device has a register for storing a transmittable data amount to control bandwidth. The method includes: calculating a number of elapsed periods of the system clock so as to change a counting value every predetermined time interval, the counting value being cyclic within a specific range; adjusting the transmittable data amount in the register by a first unit amount when the counting value reaches a first count value; and adjusting the transmittable data amount in the register by a second unit amount after adjusting the transmittable data amount by the first unit amount and elapse of the predetermined time interval and when the counting value corresponds to a second count value. The first count value is different from the second count value, and the first unit amount is different from the second unit amount. | 08-21-2008 |
20080225725 | METHOD AND APPARATUS FOR SUPPORTING UPLINK STARVATION AVOIDANCE IN A LONG TERM EVOLUTION SYSTEM - A method and apparatus for uplink (UL) starvation avoidance includes determining a current buffer status information. The current buffer status information is reported to an evolved Node B (eNB). A grant that includes a determination of a number of tokens a wireless transmit/receive unit (WTRU) may accumulate is received from the eNB. | 09-18-2008 |
20080232253 | PORT RATE SMOOTHING IN AN AVIONICS NETWORK - A communication network is provided. The network includes a least one switch and a plurality of ports. Each port is in communication with the at least one switch. At least one of the ports is configured to introduce a time delay after each transmission of a frame based at least in part on a maximum transmission rate of the at least one port and its allocated transmission rate. | 09-25-2008 |
20080253288 | TRAFFIC SHAPING CIRCUIT, TERMINAL DEVICE AND NETWORK NODE - In order to allow priority transfer (fluctuation) over VLL packets while keeping each contracted bandwidth constantly, a leaky bucket model is expanded to have a threshold | 10-16-2008 |
20080298245 | Scheduling Strategy For Packet Switched Traffic - The invention provides a leaky-bucket method for delivering packets from a first node (A) to a second node (B) in a packet switched network, comprising the steps of: receiving at the first node (A) of at least one transmission comprising buffered packets, and at least one transmission comprising real-time packets; transmitting the received packets to the second node (B) and increase a bucket counter for the bucket, which bucket has a leak rate that is equal to or larger than the byte transmitting ratio of the real-time packets. The method is particularly characterize in that: the bucket size for the buffered packets is set to a first size; the bucket size for real-time packets is set to a second size that is larger than the first bucket size; real-time packets are transmitted to the second node (B) upon arrival at the first node (A), provided that a bucket counter indicates that the second bucket size is not overflowed; buffered packets are transmitted to the second node (B) when the bucket counter indicates that it has leaked enough to receive a buffered packet without overflowing said first bucket size. The invention is also providing an improved node arranged to perform the improved method for a leaky-bucket. | 12-04-2008 |
20090080331 | MODELING PACKET TRAFFIC USING AN INVERSE LEAKY BUCKET - An apparatus, method, and computer program of modeling packet traffic in terms of Leaky Bucket parameters. The Leaky Bucket parameters are tested based on conformance of packet traffic. If a result of the testing is nonconformance of the packet traffic, one or more of the Leaky Bucket parameters is modified such that the packet traffic is conforming. The one or more modified Leaky Bucket parameters is stored in a computer-readable storage medium. | 03-26-2009 |
20090086634 | METHOD AND SYSTEM FOR PACKET RATE SHAPING - Aspects of a method and system for packet rate shaping may include an MMU that enables classification of one or more packets based on a CoS and/or an egress port, and transmission of the packets in accordance with a specified packet rate based on the classification. | 04-02-2009 |
20090097407 | SYSTEM AND METHOD FOR POLICING MULTIPLE DATA FLOWS AND MULTI-PROTOCOL DATA FLOWS - A system and method for policing one or more flows of a data stream of packets associated with differing transmission protocols. The current capacity level for each flow is determined, as is the packet protocol associated with each packet. A packet parameter in the packet that is indicative of the bandwidth consumption of the packet is identified. The packet parameter is converted to a predetermined format if the packet is not associated with a predetermined packet protocol. A common bandwidth capacity test is performed to determine whether the packet is conforming or non-conforming, and is a function of the packet parameter and the current bandwidth capacity level. | 04-16-2009 |
20090196181 | TECHNIQUE TO AUTOMATICALLY DEAGGREGATE AN OPTIMUM SET TO PREVENT SUBOPTIMAL ROUTING OR ROUTING FAILURES WITHIN A LINK STATE FLOODING DOMAIN - In one embodiment, information is signaled between aggregating routers indicating the components of aggregated addresses. This information is used to dynamically leak, or deaggregate, specific parts of the aggregated address space to reduce sub-optimal routing and possibly prevent routing black holes from occurring in a network. | 08-06-2009 |
20090219817 | METHOD AND APPARATUS FOR REDUCING FLOOD TRAFFIC IN SWITCHES - An improved method and apparatus for making forwarding decisions in a switching device. The invention reduces the flooding of frames to particular network segments connected to the switch. To insure a device sees a frame addressed to it, if a switch does not know what segment a device address is connected to for a unicast frame, the switch typically floods the frame to all segments in the broadcast domain. This invention allows segments to be identified as having a predefined maximum number of device addresses that will be associated with it. When that number of addresses is already in the forwarding table the switch will not flood unicast frames to that segment since no more devices should be connected to that segment. | 09-03-2009 |
20100008227 | SYSTEM AND METHOD FOR OVERLOAD CONTROL IN A NEXT GENERATION NETWORK - A Call Server in a network is able to monitor an offered rate of incoming calls per Access Gateway (AGW). A calculated GlobalLeakRate can be distributed between the AGWs in proportion to the traffic rate they offer. A leak rate calculation method is used to calculate the GlobalLeakRate control parameter of the ETSI NR restrictor at an overloaded Control Server The leak rate calculation is based on the POTS call rejection rate. In one particular embodiment of the present invention, the calculation is based on bringing the call reject rate close to a configurable low target reject level. An MGC is able to identify the end of an overload event with a greater degree of confidence and an AGW is able respond appropriately if the AGW is prematurely instructed to stop the control. | 01-14-2010 |
20100046373 | TIMESTAMP METERING AND ROLLOVER PROTECTION IN A NETWORK DEVICE - A network device for processing data on a data network includes a plurality of ports, configured to receive data from a data network and to send processed data to the data network, a memory management unit configured store data on and retrieve data from the memory and a metering unit configured to police a flow of the processed data to be sent to the network device. The metering unit is configured to utilize a series of leaky bucket units, where tokens are added to each leaky bucket unit only when that particular leaky bucket unit is accessed. The metering unit is also configured to add the tokens based on a prior timestamp value, a current timing value and an established rate and a multiplication to establish the tokens is accomplished by shifting a register of the established rate. | 02-25-2010 |
20100118704 | Method and Apparatus for use in a communications network - A method is provided of regulating a load placed on a first node of a telecommunications network caused by messages sent to the first node by a second node of the network according to a signalling protocol between the first node and the second node, comprising: using a leaky bucket restrictor associated with the second node to regulate the load, the leaky bucket having an adjustable leak rate; determining a roundtrip response delay relating to at least some of the messages during a measurement period; and adjusting the leak rate in dependence upon the determined response delay. | 05-13-2010 |
20100149986 | METHOD AND APPARATUS FOR PROVIDING QUEUE DELAY INTERNAL OVERLOAD CONTROL - A method and apparatus for handling an overload condition in a communication network are disclosed. For example, the method calculates a call target rate by at least one core signaling network element. The method then uses the call target rate by the at least one core signaling network element to start throttling signaling traffic if a total queueing delay of the at least one core signaling network element exceeds a predefined high threshold in a measurement interval. | 06-17-2010 |
20100195504 | SINGLE AND DUAL RATE THREE COLOR MARKER SYSTEMS - An advance is made over the prior art in accordance with the principles of the present invention that is directed to a new approach for a system and method of Single Rate Three Color Marker (srTCM) and Two Rate Three Color Marker (trTCM) methodology. The invention eliminates deficiencies present in existing standards that allow a user to defeat the traffic meter that is used to ensure bandwidth usage is within limits imposed by the provider. Adoption of these invention will ensure compliance with the goals of an ideal Single Rate Three Color Marker (srTCM) and Two Rate Three Color Marker (trTCM) scheme. | 08-05-2010 |
20100202295 | PROGRAMMABLE METERING BEHAVIOR BASED ON A TABLE LOOKUP - A network device for processing data on a data network including a plurality of ports, configured to receive data from a data network and to send processed data to the data network via an egress port, a controller interface, configured to communicate with an external controller, a memory management unit, configured store data on and retrieve data from the memory and a metering unit, configured to police a flow of the processed data to be sent to the egress port. The metering unit further includes programmable registers, in communication with the controller interface, configured to be programmed through controller signals sent through the controller interface from the external controller, such at all aspects of the flow of the processed data may be controlled by the external controller. | 08-12-2010 |
20100214925 | SYSTEMS AND METHODS FOR HYBRID RATE-LIMITING SCHEMES BASED ON PROTOCOL DATA UNIT CHARACTERISTICS - A networked computing system that utilizes a hybrid rate-limiting scheme to jointly affect both PDU payload throughput and total PDU throughput. The networked computing system includes one or more service provider devices (SPDs), one or more subscriber computing devices (SCDs), and a data communications network facilitating data communications between a SPD and a SCD. The SPD can apply the hybrid rate-limiting scheme to data communications provided to the SCD, based on both protocol data unit (PDU) header and payload characteristics. The hybrid rate-limiting scheme can simultaneously facilitate rate-limiting PDU payload throughput and rate-limiting total PDU throughput. | 08-26-2010 |
20110075562 | Rate Shaping For Wireless Communication Using Token Bucket That Allows Token Debt - A modified token bucket algorithm in a rate shaping function of a wireless communication network allows for the “borrowing” of tokens, creating the possibility of a token debt, or a token bucket with a negative Token Bucket Counter (TBC) value. In this modified algorithm, an incoming packet is passed along so long as the TBC is positive, even if the packet must “borrow” some tokens, driving the TBC negative. Subsequent incoming packets are stalled until the TBC reaches a positive value. In one embodiment, the modified token bucket algorithm is not applied to a separate rate shaper, but rather to a queue size limiter that operates with a scheduler on a single queue. The inventive scheduler and queue size limiter deliver fewer, larger packets for transmission, allowing for more efficient packing within transmission frames (reducing or eliminating required padding), and allowing other traffic to be scheduled, thus increasing system throughput. | 03-31-2011 |
20110158101 | HIERARCHICAL RATE COLOR MARKER - One embodiment provides a system that facilitates bandwidth-profile enforcement. During operation, the system indicates a packet's compliance with a bandwidth profile based at least on available high-compliance tokens and medium-compliance tokens. The system further converts, within different classes of service (CoSs), an overflow high-compliance token to a medium-compliance token, in a top-down or bottom-up fashion with respect to different CoS priorities. | 06-30-2011 |
20110299397 | COMMUNICATION CONTROL APPARATUS AND SHAPING APPARATUS HAVING TOKEN BUCKET - Various exemplary shaping apparatuses for shaping packets stored in queues are provided. The shaping apparatus includes a token bucket that accumulates tokens with a predetermined rate. When a number of tokens accumulated in the token bucket is equal to or larger than a reference number corresponding to a maximum packet length that the queues may store, the shaping apparatus allows one of the packets stored in the queues to transmit and subtracts a number of tokens corresponding to a length of the packet allowed to be transmitted. Various exemplary communication control apparatuses that incorporate the shaping apparatuses are also provided. | 12-08-2011 |
20110310742 | GUARANTEED BANDWIDTH SHARING IN A TRAFFIC SHAPING SYSTEM - In one aspect the invention provides a method for allocating bandwidth in a network appliance where the network appliance includes a plurality of guaranteed bandwidth buckets used to evaluate when to pass traffic through the network appliance. The method includes providing a shared bandwidth bucket associated with a plurality of the guaranteed bandwidth buckets, allocating bandwidth to the shared bandwidth bucket based on the underutilization of bandwidth in the plurality of guaranteed bandwidth buckets and sharing excess bandwidth developed from the underutilization of the guaranteed bandwidth allocated to the individual guaranteed bandwidth buckets. The step of sharing includes borrowing bandwidth from the shared bandwidth bucket by a respective guaranteed bandwidth bucket to allow traffic to pass immediately through the network appliance. | 12-22-2011 |
20120020223 | PACKET SCHEDULING WITH GUARANTEED MINIMUM RATE IN A TRAFFIC MANAGER OF A NETWORK PROCESSOR - Described embodiments provide rate setting for nodes of a scheduling hierarchy of a network processor. The scheduling hierarchy is a tree structure having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. A traffic manager queues received tasks in a queue of the scheduling hierarchy associated with a data flow of the task. The queue has a parent scheduler at each level of the hierarchy up to the root scheduler. A scheduler selects a child node for transmission based on a number of arbitration credits in an arbitration credit bucket of each child. An arbitration credit value is determined for each child by maintaining a time stamp value corresponding to a time value of a previous selection of the child node and determining an elapsed time value based on the time stamp value and a current time value, scaled by a scaling factor. | 01-26-2012 |
20120039173 | Traffic Management In A Multi-Channel System - A method, system and computer program product in a downstream line card of a Cable Modem Termination System (CMTS) for managing downstream traffic for channels and bonded channel groups is provided herein. The method comprises the step of receiving packets for transmission to cable modems and classifying each packet to a flow based on class of service associated with the packet. The method further includes the step of storing the packets in flow queues based, wherein a flow queue is selected based on a flow a packet is associated with and wherein each flow corresponds to a single flow queue. The method also includes transmitting the packets from the flow queues to channel queues or bonded channel queues using corresponding channel nodes or bonded channel nodes at a rate that is determined based on feedback data and scheduling downstream transmission of packets on a single downstream channel if the packet is stored in a channel queue and on multiple downstream channels that are bonded together to form a bonded channel group if the packet is stored in a bonded channel queue. The feedback data is adjusted for each channel node or bonded channel node based on a queue depth for a corresponding channel queue or bonded channel queue. | 02-16-2012 |
20120039174 | APPARATUS, COMMUNICATIONS SYSTEM AND METHOD FOR OPTIMIZING DATA PACKET FLOW - A datagram flow optimizer apparatus comprises a buffer resource capable of receiving and temporarily storing a plurality of datagrams in respect of a forward path. The apparatus also comprises and a buffer controller arranged to implement, when in use, buffering of received datagrams by the buffer resource until a predetermined threshold number of datagrams has been stored by the buffer resource. The apparatus further comprises an acknowledgement regulator arranged to use the buffer resource to manipulate temporal spacing between acknowledgements of datagrams on a reverse path. The buffer controller is arranged to permit forwarding on the forward path of datagrams stored by the buffer resource in response to the predetermined threshold number of stored datagrams being reached. | 02-16-2012 |
20120075996 | TECHNIQUES TO SUPPORT LARGE NUMBERS OF SUBSCRIBERS TO A REAL-TIME EVENT - Techniques to manage large numbers of subscribers to real-time events are described. Embodiments may filter subscribers dynamically into buckets where publications are distributed only to subscribers in the same bucket as the publisher. Buckets may be dynamically created and removed to lower or raise the publication rate for subscribers to an acceptable level. Embodiments may use a two-level bucketing algorithm for filtering that is memory and CPU efficient, and scales with large numbers of subscriptions. The techniques may also reduce the context loss for a subscriber when a new bucket has to be created and subscribers distributed between buckets. Embodiments may be scaled out to multiple servers, to accommodate very large numbers of subscribers and publications. Other embodiments are described and claimed. | 03-29-2012 |
20120127864 | PERFORMING POLICING OPERATIONS IN PACKET TIME - Methods and apparatus provide for a Packet Policer. The Packet Policer determines a first amount of tokens based on an interval occurring between receipt of a first packet and receipt of a second packet, where the first packet was received before the second packet. The Packet Policer determines a second amount of tokens based on a size of the second packet. The Packet Policer then updates a token bucket with the first amount of tokens as the second amount of tokens is removed from the token bucket. | 05-24-2012 |
20120195200 | METHOD AND APPARATUS FOR HIERARCHICAL POLICING - The invention includes a method and apparatus providing a hierarchical policer in which parent and child policers are atomically coupled with each other and responsively adapt policer operation. | 08-02-2012 |
20120195201 | BANDWIDTH POLICING APPARATUS AND PACKET RELAY APPARATUS - In a packet relay apparatus or bandwidth policing apparatus, when the bandwidth of a flow having a function to respond to a congestion notification surpasses a first threshold, a congestion notification is given to rewrite a value representing the congestion state of the network out of the packet headers of the packet received by the apparatus. The packet is dropped if the bandwidth of the flow surpasses a second threshold higher than the first threshold. One of the following, including packet drop, rewriting the value representing the priority level in the network out of the packet headers and altering the priority level in the apparatus is imposed on the packet when the bandwidth of the flows surpasses a second threshold higher than the first threshold. | 08-02-2012 |
20120243415 | BANDWIDTH CONTROL DEVICE, BANDWIDTH CONTROL METHOD, AND WIRELESS NETWORK SYSTEM - In a network configured using a wireless link in which a transmission rate fluctuates, accommodation efficiency of traffic is improved while communication quality of VBR traffic is maintained. A bandwidth control device includes a stability level calculation unit which calculates a stability level indicating a probability that a bandwidth is available in a wireless link using adaptive modulation, a utilization rate calculation unit which calculates a utilization rate of a bandwidth used by traffic to be accommodated, an allocation unit which allocates, to the traffic, a link bandwidth of the stability level corresponding to the utilization rate of the traffic, and a path control unit which sets a path for the traffic in the wireless network including a communication device that performs communication over the wireless link based on the allocated link bandwidth. | 09-27-2012 |
20120250512 | Systems and Methods for Handling NIC Congestion via NIC Aware Application - The present solution is directed to a system for handling network interface card (NIC) congestion by a NIC aware application. The system may include a device having a plurality of network interface cards (NICs), a transmission queue corresponding to a NIC of the plurality of NICs; and an overflow queue for storing packets for the NIC when congested. The system may also include an application executing on the device outputting a plurality of packets to the transmission queue responsive to detecting that the NIC is identified as not congested. The device identifies the NIC as congested responsive to determining that a number of packets stored in the transmission queue has reached a predetermined threshold and responsive to detecting identification of the NIC as congested, the application stores one or more packets to the overflow queue. The device transmits one or more of the plurality of packets stored in the transmission queue and transmits a predetermined number of packets from the overflow queue. | 10-04-2012 |
20130003555 | TOKEN BUCKET MANAGEMENT APPARATUS AND METHOD OF MANAGING A TOKEN BUCKET - A token bucket management apparatus comprises a processing resource having an input for receiving profile data associated with a classified data stream. The processing resource also comprises an arithmetic unit arranged to maintain a bucket status value for a token bucket associated with the classified data stream. The arithmetic unit is a fixed point arithmetic unit that is arranged to maintain the bucket status value in accordance with a fixed point representation of non-integer numbers having a first accuracy. The arithmetic unit calculates a fixed point non-integer increment value in accordance with a fixed point representation of non-integer numbers having a second accuracy. The arithmetic unit is arranged to manipulate the calculated non-integer increment value so as to bring the second accuracy into agreement with the first accuracy, and to increment the bucket status value by the manipulated non-integer increment value. | 01-03-2013 |
20130170355 | METHOD AND APPARATUS FOR SUPPORTING UPLINK STARVATION AVOIDANCE IN A LONG TERM EVOLUTION SYSTEM - A method and apparatus for uplink (UL) starvation avoidance includes determining a current buffer status information. The current buffer status information is reported to an evolved Node B (eNB). A grant that includes a determination of a number of tokens a wireless transmit/receive unit (WTRU) may accumulate is received from the eNB. | 07-04-2013 |
20130188494 | DYNAMIC LOAD BALANCING WITHOUT PACKET REORDERING - Flows of packets are dynamically mapped to resource queues. Flows of packets are received at a network device to be routed from the network device in a network. Each flow comprises packets to be sent from a source to a connection. Data is stored for a queue allocation table that maintains a plurality of buckets to which received packets for a flow are assigned and indicating which of a plurality of resource queues are allocated for respective buckets. For each packet in a flow, a hash function is computed from values in a header of the packet and the packet is assigned to one of the plurality of buckets based on the computed hash function. One of a plurality of resource queues is allocated for each bucket to which packets are assigned based on the computed hash function. | 07-25-2013 |
20130208596 | CONGESTION MANAGEMENT IN A NETWORK - Management of congestion level, in a computer-related context, is disclosed. Also disclosed is a system generating a plurality of computer network-related tables during system operation. A number of the tables are each separately indexed by a different index. The system includes at least one tangible computer-readable medium adapted to store, at each indexed location, a swap count providing an indication of the congestion level of the indexed location. The system also includes insert logic stored as instructions on the at least one medium for execution. When executed, the insert logic is operable to: i) insert, when a predetermined condition has been satisfied, a new entry by overwriting the current entry stored in the indexed location having the lowest swap count; and ii) update the swap counts in each of the indexed locations in a manner that maintains the total swap count at least substantially constant over time. | 08-15-2013 |
20130242742 | APPARATUS FOR POLICING TRAFFIC IN A COMMUNICATION NETWORK - An apparatus for policing traffic in a communication network is provided. The apparatus includes a packet distributor, a plurality of policing units, and a token management unit. The packet distributor evenly distributes packets that have arrived at the apparatus. Each policing unit determines whether a packet distributed from the packet distributor is permitted to be passed or discarded in accordance with an amount of tokens remaining in a first token bucket provided for the each policing unit, and issues a token request for requesting supply of tokens when an amount of tokens remaining in the first token bucket falls below a first threshold value. The token management unit supplies tokens in units of a predetermined amount to the first token bucket for which the token request has been issued, in accordance with an amount of tokens remaining in a second bucket provided for the token management unit. | 09-19-2013 |
20130286845 | TRANSMISSION RATE CONTROL - A method may include monitoring data packets at a data transmission channel. The data packets may be identified as nonconforming or as conforming data packets. Data packets may be identified as nonconforming if a data transmission rate would exceed a data rate threshold if the data packets were allowed to continue along the data transmission channel. Data packets may be identified as conforming if a data transmission rate would not exceed the data rate threshold if the data packets were allowed to continue along the data transmission channel. The nonconforming data packets may be retained as retained data packets. The retained data packets may again be identified as nonconforming data packets or conforming data packets after a retaining time. Data packets identified as conforming data packets may be released. | 10-31-2013 |
20130294248 | SYSTEM AND METHOD FOR OVERLOAD CONTROL IN A NEXT GENERATION NETWORK - A Call Server in a network is able to monitor an offered rate of incoming calls per Access Gateway (AGW). A calculated GlobalLeakRate can be distributed between the AGWs in proportion to the traffic rate they offer. A leak rate calculation method is used to calculate the GlobalLeakRate control parameter of the ETSI NR restrictor at an overloaded Control Server The leak rate calculation is based on the POTS call rejection rate. In one particular embodiment of the present invention, the calculation is based on bringing the call reject rate close to a configurable low target reject level. An MGC is able to identify the end of an overload event with a greater degree of confidence and an AGW is able respond appropriately if the AGW is prematurely instructed to stop the control. | 11-07-2013 |
20130336125 | Method and System for Controlling Packet Traffic - The present invention applies to the field of communications technologies and provides a method and a system for controlling packet traffic. The method includes: comparing the number of tokens in a token bucket at a current time point with a length of a packet to be sent and a preset virtual threshold when the packet to be sent is received, refreshing the current number of tokens in the token bucket according to a comparison result, and marking the packet to be sent with a color. | 12-19-2013 |
20140050094 | Efficient Urgency-Aware Rate Control Scheme for Mulitple Bounded Flows - A method for controlling a flow rate of multiple data flows at a network node on a path of the data flows includes the following steps. A private restriction token bucket (RTB) and a private guarantee token bucket (GTB) for each of the data flows and a shared token bucket (STB) common to all of the data flows are provided. n tokens are obtained from the RTBi for the data flow i when a message belonging to the data flow i arrives at the node and needs n tokens. An attempt is made to obtain n tokens from the GTBi for the data flow i and/or the STB. The message is transmitted if n tokens are obtained from the GTBi and/or from the STB, otherwise transmission of the message is delayed until n tokens are available in the GTBi and/or in the STB. | 02-20-2014 |
20140056149 | Bandwidth Management in an Advanced Metering Infrastructure - In a network environment, a node may measure and/or recognize network activity or congestion and send feedback to downstream nodes (i.e., higher rank nodes) in response. During periods of lower network activity, lower congestion and/or lower network load, the feedback may direct an upstream flow of packets to be transmitted at a quality of service (QoS) level that allows consumption of more bandwidth than is indicated by a QoS level associated with a service level agreement (SLA) of the upstream flow of packets. During periods of higher network activity, congestion and/or network load, the feedback may limit the upstream flow of packets to the QoS level associated with the SLA of the upstream flow of packets. Accordingly, an upstream node (e.g., a root node) may use feedback to regulate bandwidth used by one or more downstream nodes and/or flows of packets, in part using network activity, congestion and/or bandwidth availability. | 02-27-2014 |
20140064090 | CACHED ROUTING TABLE MANAGEMENT - Techniques are provided for cached routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, then routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry, based on a set of hash functions. Upon accessing the generated routing entry in the modified routing table responsive to a subsequent lookup request for the source address, the set of caches is modified to include the generated routing entry. | 03-06-2014 |
20140064091 | SLICED ROUTING TABLE MANAGEMENT WITH REPLICATION - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received by a switch module having bridge elements and a routing table divided into slices of buckets, each slice having a respective property and including one or more buckets. If a routing entry for the source address is found in a first slice of a first set of buckets of the routing table responsive to a lookup request for the source address, and the property of the first slice satisfies a replication condition, then the routing entry is replicated to a second set of buckets of the routing table. | 03-06-2014 |
20140064092 | SLICED ROUTING TABLE MANAGEMENT WITH REPLICATION - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received by a switch module having bridge elements and a routing table divided into slices of buckets, each slice having a respective property and including one or more buckets. If a routing entry for the source address is found in a first slice of a first set of buckets of the routing table responsive to a lookup request for the source address, and the property of the first slice satisfies a replication condition, then the routing entry is replicated to a second set of buckets of the routing table. | 03-06-2014 |
20140064093 | HASHING-BASED ROUTING TABLE MANAGEMENT - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry and based on a set of hash functions. | 03-06-2014 |
20140112147 | REFRESH MECHANISM FOR A TOKEN BUCKET - Embodiments of the present disclosure provide apparatuses, systems, and methods for accounting for tokens in one or more token buckets. One such embodiment includes memory; and a token bucket administration apparatus configured to iterate through a plurality of token buckets assigned to specific positions within a calendar segment and process each token bucket in sequence by reading a biased token count value from the memory for a token bucket, adjusting the biased token bucket value, and writing the adjusted token bucket value back to the memory. | 04-24-2014 |
20140112148 | METHOD AND AN APPARATUS FOR DETERMINING THE PRESENCE OF A RATE LIMITING MECHANISM IN A NETWORK - A method and device for determining the presence of a rate limiting mechanism arranged between a sending and a receiving data communication node in a data transfer path of a communication network is presented. The method includes determining time difference values for probe packets in a train of probe packets sent from the sending node and received in the receiving node after having traversed the data transfer path during real-time operation of the data transfer path. The method further includes determining the presence of a rate limiting mechanism in the data transfer path upon detecting that an increase in the time difference value between received probe packets in the train of probe packets exceeds a threshold criterion. Other methods and devices for determining the absence of a rate limiting mechanism and corresponding computer program products are further disclosed. | 04-24-2014 |
20140119190 | Method and device for leaky bucket speed-limitation - The disclosure discloses a method for traffic limitation by a leaky bucket, including that: during traffic-limitation of a group of packets sharing a same leaky bucket and having separate weighted priorities, the overall leaky bucket is divided into multiple sub-buckets according to priority parameters of the packets including a number of the weighted priorities and ratios between the weighted priorities; after packet information is received, parameters relevant to traffic-limitation by a leaky bucket is acquired; a total number of tokens to be added to the overall leaky bucket is calculated; token-addition is performed on the sub-buckets according to a state of the overall leaky bucket after addition of the total number of tokens and the weighted priorities corresponding to the sub-buckets; a packet is forwarded, or discarded, or marked according to a length of the packet and a number of tokens in a sub-bucket corresponding to a weighted priority, wherein in performing token-addition on the sub-buckets, after token-addition is performed on all the sub-buckets, any overrunning token is allocated to another sub-bucket not overrun with tokens. The disclosure further discloses a device for traffic limitation by a leaky bucket. With the disclosure, it is possible to limit packet traffic flexibly according to weighted priorities and improve resource utilization. | 05-01-2014 |
20140133309 | Method and Apparatus for Sending Packet - A method for sending a packet includes determining whether a packet is a fragmented packet, if the packet is a fragmented packet, determining whether the number of tokens in a token bucket is sufficient, when the number of tokens in the token bucket is sufficient, sending the fragmented packet, and deducting the number of tokens in the token bucket, where the deducted number of tokens corresponds to the number of bytes of the sent fragmented packet, when the number of tokens in the token bucket is insufficient, sending the fragmented packet, and deducting the number of tokens in the token bucket, where the deducted number of tokens corresponds to the number of bytes of the sent fragmented packet, and the number of tokens in the token bucket is a negative number after the number of tokens corresponding to the number of bytes of the sent fragmented packet is deducted. | 05-15-2014 |
20140177443 | RELAY APPARATUS AND BUFFER CONTROL METHOD - A relay apparatus that transfers data with an identifier corresponding to a transfer rate attached thereto and stores data as a transfer target to adjust the transfer rate, the relay apparatus includes multiple buffers that are respectively associated with multiple time regions that serve as targets to be successively read from a current point of time onward, each buffer having a capacity to store an amount of data determined in accordance with the transfer rate of the identifier, and a controller that reduces a size of a buffer corresponding to a second time region to be smaller than a size of a buffer corresponding to a first time region prior to the second time region in accordance with a time difference between the current point of time and the second time region. | 06-26-2014 |
20140185448 | METHOD AND APPARATUS FOR SUPPORTING UPLINK STARVATION AVOIDANCE IN A LONG TERM EVOLUTION SYSTEM - A method and apparatus for uplink (UL) starvation avoidance includes determining a current buffer status information. The current buffer status information is reported to an evolved Node B (eNB). A grant that includes a determination of a number of tokens a wireless transmit/receive unit (WTRU) may accumulate is received from the eNB. | 07-03-2014 |
20140192652 | TOKEN-BASED FLOW CONTROL OF MESSAGES IN A PARALLEL COMPUTER - Token-based flow control of messages in a parallel computer, the parallel computer including a plurality of compute nodes, each compute node including one or more computer processors, including: allocating, by a token administration module to a plurality of the computer processors in the parallel computer, a number of data communications tokens; identifying all communicators executing on each computer processor, where each communicator is participating in a distinct parallel operation executing on the parallel computer; allocating, to the communicators, the data communications tokens; determining, by a communicator attempting to send data to the destination, whether the communicator has enough available data communications tokens to send the data to the destination; and responsive to determining that the communicator has enough available data communications tokens to send the data, sending, by the communicator, the data to the destination. | 07-10-2014 |
20140254384 | Limiting Rate of MAC Address Change in Wireless Modem - A method includes receiving a command to change a medium access control (MAC) address associated with a wireless local area network (WLAN) apparatus; and changing the medium access control address, without restarting a wireless modem of the apparatus, only if a restriction on an allowed rate of medium access control address changes is not violated. An apparatus that operates in accordance with the method is also described. | 09-11-2014 |
20140293794 | TOKEN BUCKET-BASED TRAFFIC LIMITING METHOD AND APPARATUS - The embodiments of the present invention disclose a token bucket-based traffic limiting method, including: when a packet is received, triggering a filling operation of filling each token bucket in a token bucket set under a scheduling node corresponding to the packet, where the token bucket set includes at least two token buckets; determining the number of tokens filled in each token bucket in the token bucket set according to a moment when the packet is received and a timestamp shared by the token bucket set; and if the number of tokens in a token bucket corresponding to the packet exceeds a length of the packet, allowing the packet to pass through the scheduling node and removing the number of tokens, corresponding to the length of the packet, from the token bucket corresponding to the packet. | 10-02-2014 |
20140321284 | Optimised Packet Delivery Across a Transport Network - A method of prioritising packets for delivery over a transport network interconnecting nodes of a mobile network, where a guaranteed minimum information rate over the transport network is specified for the mobile network. The method comprises, for each bearer to be injected into the transport network from the mobile network, specifying a bearer information rate and marking packets up to that rate as conformant with the bearer information rate and marking packets exceeding that rate as non-conformant with the bearer information rate. A plurality of traffic type streams from the mobile network are converged, each traffic type stream comprising a plurality of bearers. Packets of the converged traffic type streams are inspected to identify packets marked as conformant and non-conformant, and re-marking non-conformant packets, or at least a fraction of non-conformant packets, as conformant if the converged rate of conformant packets is less than said minimum information rate. The transport network prioritises the delivery of packets marked as conformant over those packets marked as non-conformant. | 10-30-2014 |
20140328180 | STRUCTURE FOR IMPLEMENTING OPENFLOW ALL GROUP BUCKETS USING EGRESS FLOW TABLE ENTRIES - An embodiment of the invention includes an Openflow switch. The Openflow switch includes Openflow ALL groups. The Openflow ALL groups include ALL group buckets. During ingress ALL group buckets are represented in ingress as a list of output ports with associated queue ID's and associated copy-counts. Each ALL group bucket is represented in egress by an egress Openflow table entry where the egress Openflow table entry matches a group ID and a bucket ID. An action entry in an ALL group bucket table entry is the set of actions in the Openflow ALL group bucket excluding an output port and queue assignment. | 11-06-2014 |
20140328181 | HIERARCHICAL RATE COLOR MARKER - One embodiment provides a system that facilitates bandwidth-profile enforcement. During operation, the system indicates a packet's compliance with a bandwidth profile based at least on available high-compliance tokens and medium-compliance tokens. The system further converts, within different classes of service (CoSs), an overflow high-compliance token to a medium-compliance token, in a top-down or bottom-up fashion with respect to different CoS priorities. | 11-06-2014 |
20140334310 | Method and System for Automatic Triggering Network Management Control for VoIP Border Elements - The present disclosure is directed to a method and system for automatic triggering network management (NM) control for Voice-Over-IP (VoIP) border elements (BE). The method detects call storm events by monitoring blocked call error messages and maintaining counts according to telephone number based control strings, and controls call storm events by limiting the admitted call rate for calls matching a control string according to an adaptive leaky bucket control. The control drain rate is updated periodically based on a calculated successful call rate and is set to somewhat exceed the successful rate. A control is automatically removed when no blocked calls are observed for a specific number of consecutive windows. | 11-13-2014 |
20140341040 | METHOD AND SYSTEM FOR PROVIDING DETERMINISTIC QUALITY OF SERVICE FOR COMMUNICATION DEVICES - A method and system for transmitting data based on deterministic quality of service by at least one peripheral device in a communication network is disclosed. The method includes exchanging reservation information with peripheral devices in the communication network, negotiating traffic specification (TSPEC) with the at least one peripheral device for at least one traffic type, based on the reservation information, establishing a quality of service associated with the at least one traffic type, using the TSPEC, reserving a wireless medium based on the established quality of service associated with the at least one traffic type and transmitting data through the reserved wireless medium, based on the quality of service and reservation information. | 11-20-2014 |
20140369204 | METHODS OF LOAD BALANCING USING PRIMARY AND STAND-BY ADDRESSES AND RELATED LOAD BALANCERS AND SERVERS - A first data packet of a data flow may be addressed to a primary address and include information for the data flow and a bucket ID may be computed based on the information. Responsive to the bucket ID mapping to first and second servers and the first data packet being addressed to the primary address, the first data packet may be transmitted to the first server. A second data packet may be received addressed to a stand-by address and including the information for the data flow, and a bucket ID may be computed based on the information with the bucket IDs for the first and second packets being the same. Responsive to the bucket ID for the second data packet mapping to first and second servers and the second data packet being addressed to the stand-by address, the second data packet may be transmitted to the second server. | 12-18-2014 |
20140369205 | METHODS AND DEVICES FOR REGULATING TRAFFIC ON A NETWORK - Methods and devices are provided for regulating traffic on a network. According to some aspects of the invention, if a subscriber's upstream traffic exceeds a predetermined level over a first period of time, the subscriber's quality of service is adjusted without requiring the subscriber to re-register. According to some embodiments, a first token bucket is used to determine whether the subscriber's upstream traffic exceeds the predetermined level over the first period of time. In some such embodiments, the first token bucket is used to control the burst size of another token bucket, depending on the subscriber's upstream traffic during the first period of time. | 12-18-2014 |
20150029861 | COMMUNICATION DEVICE AND COMMUNICATION SYSTEM - There is provided a communication device for controlling an upper limit bandwidth of TCP communication for transmission. There is further provided a communication device for enhancing a communication bandwidth for TCP and restricting it to an upper limit for transmission by use of new TCP for enhancing a communication bandwidth. The device comprises a transmission bandwidth control unit for determining a communication bandwidth of each session of TCP or new TCP, a token bucket update unit for determining whether packets are transmittable per session, and a maximum bandwidth control unit for determining whether packets are transmittable based on an upper limit of a total sum of all the set sessions, wherein when the maximum bandwidth control unit determines that packets are transmittable, the token bucket update unit transmits packets of a session determined as transmittable. | 01-29-2015 |
20150036503 | Rate Control By Token Buckets - Aspects of the invention are provided for rate control and management of service requests. A token bucket is employed in conjunction with a capacity sharing scheme to manage processing of service requests. Each token represents the capacity reserved for a particular source of requests. Excess tokens may be shed, with the excess tokens representing available excess capacity. Similarly, a projected time at which the service request(s) may be released may be computed in the event the bucket does not contain the required quantity of tokens to process the request. | 02-05-2015 |
20150063116 | NETWORK COMMUNICATION APPARATUS AND METHOD OF PREFERENTIAL BAND LIMITATION OF TRANSFER FRAME - In a network communication apparatus, transfer and discard processing is realized for each transfer frame having a priority, and a band limitation is carried out to prevent the congestion of a transfer destination apparatus. Specifically, a bucket is provided for every priority, and tokens of an amount determined based on the priority are supplemented. Moreover, before a bucket evaluation, one shared bucket is provided. All of the tokens existing in the bucket provided for every priority are transferred to the shared bucket for every constant period. The tokens overflowing beyond a capacity of the shared bucket are discarded. All of the frames are equally evaluated and transferred regardless of the priority of each of the frames, as far as the token exists in the shared bucket. When there is no token in the shared bucket, switching to the preferential band limitation is carried out and each priority bucket is evaluated. The bucket corresponding to the priority of the frame is checked and when the token exists, transfer processing of the frame is carried out. When there is no token, discard processing of the frame is carried out. | 03-05-2015 |
20150071074 | METHODS, SYSTEMS, AND COMPUTER READABLE MEDIA FOR REGULATION OF MULTI-PRIORITY TRAFFIC IN A TELECOMMUNICATIONS NETWORK - Methods, systems, and computer readable media for network traffic regulation of multi-priority traffic in a telecommunications network are disclosed. According to one aspect, a method for regulation of multi-priority traffic in a telecommunications network includes, at a node for processing messages in a telecommunications network, receiving a message having an intended destination, determining a priority of the message, and obtaining, from a plurality of threshold values, each threshold value being associated with one of a plurality of message priorities, a threshold value that is associated with the determined priority. The number of messages that have been allowed during a current measurement period is determined, an action to perform on the message is selected based a relationship between the threshold value and the message count, and the selected action is performed. The method includes detecting a refresh condition, and, in response to detecting the refresh condition, starting a new measurement period. | 03-12-2015 |
20150117214 | METHOD AND APPARATUS FOR MAINTAINING TOKEN - Embodiments of the present invention disclose a method and an apparatus for maintaining tokens, and relate to the field of communications technologies, so as to solve a problem of a burst excess of data to be transmitted and improve QoS. The method of the present invention includes: obtaining a peak information rate (PIR) of a network node; splitting the PIR into a first rate and a second rate; obtaining, according to the first rate, the first number of added tokens corresponding to a first period, and obtaining, according to the second rate, the second number of added tokens corresponding to a second period; adding tokens according to the first period and the first number of added tokens, and adding tokens according to the second period and the second number of added tokens. | 04-30-2015 |
20150372926 | LEAKY BUCKET MODEL TO MIMIC BEHAVIOR OF A MAC AND A METHOD THEREOF - Embodiments of a leaky bucket model relate to simulation of a MAC (media access control) to enable verification of a core logic and the MAC without the MAC being physically available. The simulated MAC is typically implemented on a computing device that is in communication with the core logic and a SerDes (serializer/deserializer). The simulated MAC uses a leaky bucket model to determine behavior of the core logic and the MAC. | 12-24-2015 |
20160065479 | DISTRIBUTED INPUT/OUTPUT ARCHITECTURE FOR NETWORK FUNCTIONS VIRTUALIZATION - System, method, and computer product embodiments for providing a distributed input/output (I/O) architecture for network functions virtualization. A first load balancer includes an I/O interface for receiving a packet from a network. The first load balancer constructs a flow key using portions of the packet. The flow key is hashed to generate a bucket value. Then, the first load balancer locates a second load balancer for processing the packet by looking up the bucket value from a lookup table stored on the first load balancer. Finally, the first load balancer forwards at least one of the packet, the flow key, or metadata associated with the packet to the second load balancer causing the second load balancer to perform a flow key lookup to determine an application server for processing the packet. | 03-03-2016 |
20160087900 | A COMMUNICATION NODE FOR A PACKET-SWITCHED DATA NETWORK AND A METHOD FOR OPERATION THEREOF - A communication node for a packet-switched data network is proposed, which comprises an integrated circuit having a system of electronic components for sending and/or receiving audio and/or video data, particularly of an audio and/or video data stream. A media access control component for implementing a media access control and a physical interface with transmitting and receiving means, by way of which the communication node is connectable to a communication line of the data network, are provided as components of the system. The media access control component is connected via an internal first interface to the physical interface for exchanging data. The system comprises a real-time clock synchronization unit for synchronizing time information with other communication nodes of the data network as well as a queue management unit. The real time clock synchronization unit and the queue management unit are fully arranged in the physical interface. | 03-24-2016 |
20160087901 | TRANSMISSION APPARATUS AND TRANSMISSION METHOD - A transmission apparatus includes: a memory; one or more processors coupled to the memory and the one or more processors execute: a first management process that manages a remaining amount of tokens in a token bucket; a second management process that manages an amount of data of a frame transmitted in a predetermined period of time; and a transmission control process that controls transmission of a frame to be transmitted, based on whether the remaining amount of tokens is larger than or equal to an amount of data of the frame to be transmitted and whether the amount of data of the frame transmitted in the predetermined period of time is smaller than a predetermined amount. | 03-24-2016 |
20160119201 | ENTRY ADDING METHOD AND SWITCH - An entry adding method includes: a switch receives a first group entry sent by a controller, where the first group entry includes importance indication information of the first group entry, and a first action bucket; the switch determines that the first group entry cannot be added to a group table, and that a second group entry exits in the group table, the switch deletes the second group entry and adds the first group entry to the group table. Where importance of the second group entry is lower than importance of the first group entry; the second group entry includes a second action bucket; a quantity of first action buckets is not greater than the sum of a first value and a quantity of second action buckets; and the first value is a quantity of available action buckets in the group table. | 04-28-2016 |