Abstract: Methods and apparatus are provided for applying color based policing at a network node. Committed information rate (CIR) and peak information rate (PIR) buckets used to monitor transmission rates are augmented using CIR overflow and PIR overflow buckets. The CIR and PIR overflow buckets hold tokens provided to CIR and PIR buckets that exceed the associated burst limits. Based on the availability of tokens and the color associated with a received packet, an action can be applied to the packet that promotes the color associated with the packet.

Abstract: A data flow management system and method in which an application and its clients are made aware of the available credits for each type of transfer before the transfer is attempted. This enables the clients to transmit packets only when the RX side has issued a sufficient number of credits to insure that the transmission will not be stalled. The invention eliminates the need for FIFO buffers in the PCI-Express core, since the application will not transmit packets to the core until the required number of credits for the particular transfer type is available. Therefore, packet transmissions do not require buffering in the core, as they are only sent when they can be sent all the way through the core to the link.

Abstract: A traffic management device and the method thereof are disclosed. The traffic management device includes a control logic unit, a first counting unit, and a second counting unit. The traffic management method follows the dual leaky bucket mechanism. A first count value and a second count value are generated by the first counting unit and the second counting unit, respectively, such that the control logic unit controls the average rate by checking whether the first count value falls within the range of a first threshold and controls the peak rate by checking whether the second count value falls within the range of a second threshold. When both the conditions are satisfied, packets in the queue are transmitted. Thus, the network flow is controlled effectively.

Abstract: 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.

Abstract: A system and/or method for metering and marking packets of data incoming into a communication system having in some embodiments primary and secondary meter selectors, primary and secondary metering processors and a pipeline and wrapper interface controller. Further methods involve measuring an incoming microflow against one or two specified temporal profiles using a two-level metering hierarchy.

Abstract: 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.

Abstract: A switching device comprises M ports, N bandwidth tracking modules, a mapping memory, and a rate limiting module. The N bandwidth tracking modules each have an adjustable first threshold, an adjustable rate, and a fullness level, wherein M and N are integers that are greater than one. The mapping memory contains a map for each of the M ports, wherein each map assigns a set of the N bandwidth tracking modules to a corresponding one of the M ports, wherein each of the sets is individually modifiable to include zero to N of the N bandwidth tracking modules. The rate limiting module that selectively performs an action on a packet received at one of the M ports based on the fullness levels of the set of N bandwidth tracking modules identified by the map for the one of the M ports.

Abstract: Various systems and methods that synchronize local copies of a variable used in a distributed algorithm, such as that used in distributed policing. For example, one system includes several distributed algorithm participants that are coupled to communicate with each other. Each of the each of the distributed algorithm participants maintains a shared variable in order to implement the distributed algorithm. One of the distributed algorithm participants is a synchronizer. The synchronizer is configured to calculate a new value of the shared variable and to communicate the new value to each of the other distributed algorithm participants. The distributed algorithm can be a distributed policing algorithm, and the shared variable can be a global bucket.

Abstract: A network node apparatus is disclosed for the capture, storage and replay of video data at separate respective nodes of a communications network arranged to operably couple the node apparatus. The node apparatus may include a video capture node operable to capture video data and to transmit captured data via the communications network to a video storage node. The video storage node is arranged to store captured video data, and to transmit stored data via the communications network to a video replay node which renders an image therefrom. The video storage node transmits video data to the video replay node only if the content of a transmit buffer therein matches or exceeds a predetermined lower content value and the content of a receive buffer in the replay node does not exceed a predetermined upper content value.

Abstract: An apparatus and a method for managing service traffic in a communications network capable of providing voice, data, and A/V services to a plurality of customers. In particular, the present invention is a digital subscriber line system (DSL), preferably based on ADSL, having a plurality of customer premise equipment (CPEs) coupled to voice, data and A/V services via network system equipment comprising a DSLAM, an ATM switch and a DSL terminator for connecting the system to the internet. The invention provides a network control system that includes a plurality of databases including a provisioning database and a real time database indicative of the actual bandwidth being utilized.

Abstract: A shaping apparatus comprising a plurality of buffer memories allocated for different flows, bandwidth control units associated with the buffer memories, and a read control unit, wherein each of the bandwidth control units issues a first frame output request based on a maximum allowed bandwidth and a second frame output request based on a minimum guaranteed bandwidth, and the read control unit selects a bandwidth control unit to be permitted for frame output execution out of bandwidth control units that are issuing the first or second frame output request, giving priority to the second frame output request.

Abstract: A method, system, and business model are disclosed for supporting handover between a mobile host and a corresponding node located in a heterogeneous network. Handover paths are established to accommodate a plurality of quality of service properties. Admission control is performed that considers the established handover paths and an established first reservation path. Gateways are contacted to determine a handover path to use. The determined handover path is used to support vertical handover. A second reservation path is established while maintaining the first reservation path and the handover path.

Abstract: Communication traffic policing apparatus and methods are disclosed. Communication traffic restrictions for each communication link in a group of communication links are enforced by allowing transfer of communication traffic associated with respective communication links of the group at transfer rates up to respective per-link transfer rates. In a group enforcement stage, transfer of additional communication traffic associated with a communication link of the group, above the per-link transfer rate for the communication link, is allowed where a combined transfer rate of communication traffic associated with another communication link of the group and the additional communication traffic would not exceed the per-link transfer rate for the other communication link. Thus, one or more individual communication links of a group may be allowed to effectively exceed their per-link transfer rates if one or more other communication links of the group have sufficient spare capacity.

Abstract: Methods and systems for fine grain bandwidth allocation are disclosed. According to one method, input is received from a user in a standard bandwidth denomination indicating bandwidth to be provided by a switched network element. The bandwidth is automatically converted into a base bandwidth value and a residual bandwidth value. The base bandwidth value is converted to a number of tokens to be placed in a token bucket every predetermined token bucket refresh interval. The residual bandwidth value is converted into a second number of tokens and a number of predetermined token bucket refresh intervals over which the second number of tokens is to be placed in the token buckets. The token buckets are then refreshed in accordance with the base and residual bandwidth values and the token bucket refresh intervals. The queue is serviced in accordance with available tokens in the token buckets.

Abstract: A method of transmitting data from customers (C1, C2, C3, C4, C5, C6, C7, C8, C9, C10) over a computer network, in particular over the Internet, where the data to be sent is split into packets, in particular into IP packets, where each packet is marked by one of at least two states (IN, OUT) and where the states (IN, OUT) determine which packets are dropped first, if packets are dropped during transmission, is, with regard to optimizing the drop rate of the packets, characterized in that the marking of the packet with a state of high drop precedence (OUT) is based on a random probability (p).

Abstract: 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.

Abstract: A hub apparatus is disclosed that includes plural input ports; a policer unit that monitors the input bandwidth of the input ports and controls acquisition and discarding of input packet data input via the input ports, the policer unit including plural policers assigned to the input ports that have input token buckets for accumulating input tokens; a packet multiplexer that multiplexes the input packet data acquired by the policer unit; a shaper that transmits the multiplexed packet data at equal intervals according to an output bandwidth, the shaper including an output token bucket that accumulates output tokens up to a predetermined amount; and a surplus token recycling unit that recycles surplus tokens exceeding the predetermined amount that are generated at the output token bucket of the shaper by distributing the surplus tokens to the input token buckets of the policers of the policer unit.

Abstract: 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.

Abstract: 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.

Abstract: A switching device includes an ingress memory system having a VOQ-based design to provide an infrastructure for enabling fine-grained QoS and SLAs.

Abstract: A method and system for routing fiber channel frames using a fiber channel switch element is provided. The switch element includes, a port with a buffer having more than one memory slot for receiving fiber channel frames, wherein the port tracks a relative age of a first memory slot with respect to at least another memory slot; and frames are transmitted from a memory slot based on the relative age. The method includes, determining a relative age of a first memory slot with respect to at least another memory slot; and transmitting a frame from a memory slot based on the relative age. The method also includes, sending frames that have resided in a memory slot for a greater period compared to frames residing in at least another memory slot; and setting age bits in plural memory slots when frames are written and the relative age is determined based on the age bits. An aging table may be used to store the age bits of the plural memory slots.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method of providing a discount may include monitoring at least one resource via a communication network. A usage profile may be received from the at least one resource. The usage profile may include a measurement of consumption of a consumable over a period of time for the at least one resource. A first factor may be determined based on the usage profile. A second factor may be determined based on one or more of an ownership level and a participation level of the at least one resource. A discount for a future purchase may be provided based on the first factor and the second factor.

Abstract: A priority scheme is provided for ports assigned to respective channel units in a channel bank. The priority scheme is based on an amount of preallocated bandwidth unused by channel unit ports. A first water level in a first bucket is associated with an amount of allotted bandwidth unused by the channel unit and a second water level in a second bucket is associated with an amount of unused allotted bandwidth exceeding an overflow level of the first bucket. A high priority value is derived from the first water level when the first water level is above zero. A medium priority value is derived from the second water level when the first water level is equal to zero. A low priority value is derived when both water levels are zero. In another aspect of the invention, the total port bandwidth utilization history is preferably accounted for. It is differentially aged to favor recent history over older history, and optionally further compensated to favor long quiet times.

Abstract: A simple admission control mechanism for IP based networks is provided. The decision on whether a new flow is accepted is based on the link load information on the paths from the source to destination. The new flow is accepted when the link load is less than a threshold. When at least one of the links on all of the available paths is larger than the acceptable threshold, access is denied to the flow. More than one threshold level may be used. Under the multiple threshold scenario, the traffic may be divided into different classes. The admission control mechanism helps to ensure a network that is not heavily congested.

Abstract: An edge switch comprises a token bucket control unit which varies the amount of tokens flowing into a token bucket per unit time in accordance with the congestion condition of an IP network, and the output rate of packets to be output onto a packet communication network is adjusted for each line identifier by controlling the output amount of a packet buffer, in accordance with the amount of tokens held in the token bucket; and, an analyzing unit that determines whether the source address of the received packet matches the address of a preregistered emergency call destination, and the token bucket control unit further reduces, when an emergency call is generated, the amount of tokens flowing into the token bucket for any destination address in congestion, other than the emergency call destination, and thereby retaining communication quality for emergency priority communication.

Abstract: The method provides variable granularity to control data flow by using a scalar parameter to modify buffer capacity indicator. The scalar parameter allows for adjustment of the data flow control scheme and may be predetermined or dynamically set as desired or required for the particular system.

Abstract: A two stage rate shaping and scheduling system and method is implemented to control the flow of traffic to at least one output interface. The system and method involves initially queuing incoming packets into type-specific queues and applying individual rate shaping rules to each queue. A first stage arbitration is performed to determine how traffic is queued from the type-specific queues to interface-specific queues. Packets that win arbitration and pass the applied rate shaping rules are queued in interface-specific queues. Rate shaping rules are applied to the interface-specific queues. The interface-specific queues are further distinguished by priority and priority-specific and interface-specific rate shaping rules are applied to each queue. A second stage arbitration is performed to determine how different priority traffic that is targeting the same output interface is dequeued in response to interface-specific requests.

Abstract: The present invention is directed to methods and systems for allocating bandwidth (or other shared resource) among multiple masters. According to an aspect of the present invention, an arbiter assigns a bucket to each CPU (or other device) where each bucket holds the credits for that CPU. Each bucket has a predetermined fill rate and a drain rate. Depending on the priority given to a particular CPU, the corresponding bucket will drain (or fill) at a particular rate. For example, CPUs with a higher priority will drain at a slower rate. For each clock tick (or other period of time) that a CPU is stalled, a number of credits is accrued. The bucket with the highest number of credits has priority and will be given access to the shared resource (e.g., DRAM, SDRAM, SRAM, EPROM, etc.).

Abstract: Systems and methods are disclosed for marking a packet with a precedence value in a TCP-friendly way. One system and method marks packets with a precedence value based on a probability function. Another system and method marks packets with one of three precedence values based on network traffic but enables interleaving of differently marked packets when a certain number of packets have been successively marked with a low or medium precedence value.

Abstract: Methods of handling messages at an interface in a communication system include the steps of receiving a message having an information element indicating the message's type, determining whether a frequency of receipt of messages of a predetermined type exceeds a threshold, handling the message in a normal way if the frequency does not exceed the threshold, and discarding the message if the frequency exceeds the threshold and the message is of the predetermined type. Such methods are useful in avoiding overloads after re-starts of serving GPRS support nodes or base station systems in packet-switched communication systems.

Abstract: A traffic manager and a method are described herein that are capable of performing an active queue management of discard-eligible traffic for a shared memory device (with a per-CoS switching fabric) that provides fair per-class backpressure indications.

Abstract: 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.

Abstract: A method and device for delivering multimedia data using IETF QoS protocols. MPEG media data can be transmitted in packet units through a network using the IETF QoS protocol by mapping MPEG media traffic factors onto IETF QoS traffic factors. By encoding or transcoding MPEG media traffic according to a double leaky bucket model indicated by the four factors, a maximum bit rate, a first buffer size, a guaranteed bit rate, and a second buffer size, the MPEG media traffic factors may be transmitted using the IETF QoS protocol without having to go through the process of being mapped onto QoS traffic factors.

Abstract: According to an embodiment of the invention, a data controller comprises a traffic pattern collector to observe a data traffic pattern, the data traffic being comprised of data packets; a traffic service engine to receive data from the traffic controller concerning the data traffic pattern and to determine a data flow specification for the data traffic pattern, the received data including the size and arrival time of each of the data packets; and a quality of service provider to receive the data flow specification. The data flow specification is the minimum data flow specification data flow specification that will allow each of the data packets to be transferred by the traffic controller within a delay upper bound. According to one embodiment, the minimum data flow specification for the data traffic pattern is determined according to an algorithm known as the Any-Delay TB Algorithm.

Abstract: A traffic management device and the method thereof are disclosed. The traffic management device includes a control logic unit, a first counting unit, and a second counting unit. The traffic management method follows the dual leaky bucket mechanism. A first count value and a second count value are generated by the first counting unit and the second counting unit, respectively, such that the control logic unit controls the average rate by checking whether the first count value falls within the range of a first threshold and controls the peak rate by checking whether the second count value falls within the range of a second threshold. When both the conditions are satisfied, packets in the queue are transmitted. Thus, the network flow is controlled effectively.

Abstract: 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 1509 for permitting transmission of a packet (e.g. a WFQ packet) other than an LLQ packet and a threshold 1501 (larger than the threshold 1509) for permitting transmission of the LLQ packet (two-threshold leaky bucket model). In this manner, even when a WFQ cannot be transmitted, an LLQ can be transmitted with priority. In addition, while the total bandwidth of the WFQ and LLQ, i.e. the bandwidth of the VLL contains fluctuation, the contracted bandwidth can be complied with. The circuit of the model is provided in LLQ and WFQ transmission appointed time calculating circuits so as to calculate respective transmission appointed times so that an LLQ/WFQ is selected and a packet is selected based on the times considering priority.

Abstract: A data traffic policer includes a classifier for separating a packet stream in accordance with class, a first bucket for a first traffic class representing a first transmission rate and a first burst capacity and a plurality of second buckets for a plurality of second traffic classes representing a corresponding second transmission rates and a second burst capacities, the plurality of second buckets being nested within the first bucket thereby being subordinate to the rate and capacity of the first bucket, with the rate of the second bucket being disabled when a fill condition exists in the first bucket. The second bucket for a second traffic class may include a plurality of buckets for a corresponding plurality of traffic classes, with each bucket of the plurality of buckets having a corresponding capacity and rate. The rate defined as a corresponding weight.

Abstract: The present invention is to disclose a scheduler which comprising a priority tagging module for receiving a plurality of information chucks, a plurality of output lines, and a WRR (weighted round robin) module. In this regards, each information chucks are tagged with a priority tag by said priority tagging module according to a priority classification scheme. In addition, the WRR module further comprises a bucket list, which has a plurality of buckets, and a control module. Each bucket stores a ticket, which comprises an identification representing one of the plurality of output lines and an associated weight value of the represented output line. Besides, the control module receives the tagged information chucks from the priority tagging module and schedules the tagged information chucks into the plurality of output lines according to a scheduling scheme based on said bucket list.

Abstract: 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.

Abstract: 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.

Abstract: Roughly described, a packet switching fabric contains a separate queue scheduler for each combination of an input module and a fabric output port. The schedulers may also be specific to a single class of service. Each queue scheduler schedules its packets without regard to state of other input queues and without regard to packets destined for other output ports. In an aspect, the fabric manages per-flow bandwidth utilization of output port bandwidth capacity by monitoring the same and asserting backpressure toward the queue scheduler for any thread that is exceeding its bandwidth allocation. In another aspect, a switching fabric uses leaky buckets to apply backpressure in response to overutilization of downstream port capacity by particular subflows. In another aspect, a switching fabric includes a cascaded backpressure scheme.

Abstract: In a bandwidth policing apparatus which accommodates a large number of user groups, bandwidth policing for each user group is performed at high speed. When there is any extra bandwidth in bandwidth for a user group, the contracted committed information rate for each user is guaranteed invariably while using this effectively. The bandwidth policing apparatus accumulates packets of a plurality of user groups under bandwidth policing in the same packet accumulate FIFO. Also, for a packet which does not exceed the contracted bandwidth for each user, the contracted bandwidth for each user is guaranteed by deciding that the packet does not exceed the contracted bandwidth for each user group.

Abstract: The present invention relates to an IP address lookup method and hardware architecture.

Abstract: 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.

Abstract: A buffer storage memory data scheduler includes a write unit writing data objects to the memory, which unit receives data packets from a data source at a variable transmission rate, calculates attribute data for each received packet, and writes the packet data to the memory as a data object string including linked data objects. The string includes pointer data for linking the objects, calculated attribute data, and packet payload data. The write unit inserts filling objects into the memory between linked data objects to compensate for the variable rate when writing the string to the memory. The write unit increments a counter when the string is written. A time out signaling unit signals to a data processing unit that a buffer-stored data/filling object is ready to be read when the counter reaches a value. The signaling unit decrements the counter corresponding to the data in the object.

Abstract: System and method for allocating and managing a shared Internet access channel on an Internet access device. The system and method prioritize data flow in a multi-user, limited bandwidth networking environment by differentiating data types for disparate processing thereof by which a plurality of aggregation classes are hierarchically ordered to include at least one favored class (bandwidth guaranteed) and at least one disfavored class (best effort). Network sessions are aggregated into these classes according to an aggregation policy and bandwidth is asymmetrically allocated to the sessions according to a plurality of algorithms operating in conjunction with the hierarchy.

Abstract: The invention discloses methods and apparatus for regulating the transfer of data bursts across a data network comprising electronic edge nodes interconnected by fast-switching optical core nodes. To facilitate switching at an electronic edge node, data bursts are organized into data segments of equal size. A data segment may include null data in addition to information bits. The null data are removed at the output of an edge node and the information data is collated into bursts, each carrying only information bits in addition to a header necessary for downstream processing. To ensure loss-free transfer of bursts from the edge to the core, burst transfer permits are generated at controllers of the optical core and sent to respective edge nodes based on flow-rate-allocation requests. Null-padding is not visible outside the edge nodes and only the information content is subject to transfer rate regulation to ensure high efficiency and high service quality.