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

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

Abstract: A method of generating IP traffic flow based on a time bucket divides, in order to generate flows using all IP packets arriving in a preset time bucket, a previous time bucket flow table (PTBFT) and a current time bucket flow table (CTBFT) with reference to a current time when the flows are generated using IP packets collected from a high-speed line in a flow generating unit. Accordingly, the method allows real-time analysis of flows.

Abstract: A packet switch including input ports having various input bandwidths initializes credit values for the input ports. An arbiter of the packet switch selects input ports based on the credit values and routes data packets from the selected input ports to a switch fabric of the packet switch. The switch fabric routes data packets from the selected input ports to output ports of the packet switch. Moreover, the arbiter modifies the credit value of each selected input port based on the latency for routing the data packet from the selected input port to the switch fabric. In this way, the arbiter promotes fairness in routing additional data packets through the packet switch. In some embodiments, the switch fabric includes a buffered crossbar and the arbiter modifies credit values of crosspoints in the buffered crossbar based on the latency for routing data packets from the crosspoints to the output ports.

Abstract: In a bandwidth management apparatus that outputs packets by observing the bandwidth set value predetermined for each destination, provisions are made to prevent a situation where the contracted bandwidth cannot be provided due to influences from packets destined for other destinations. When performing bandwidth management using token buckets provided one for each destination, each token bucket is updated by setting the upper limit token value higher when any packet is stored in the corresponding queue than when no packets are stored; this serves to prevent a situation where even when a packet has already arrived at the queue, the packet cannot be output because a packet is being output from some other queue and, as a result, unconsumed tokens are discarded at the next update time.

Abstract: A system and method provides Link Aggregation that internalizes the link aggregation to improve internal traffic capacity, in addition to sharing traffic across external links to connecting packet systems.

Abstract: In a multi-QOS level queuing structure, packet payload pointers are stored in multiple queues and packet payloads in a common memory pool. Algorithms control the drop probability of packets entering the queuing structure. Instantaneous drop probabilities are obtained by comparing measured instantaneous queue size with calculated minimum and maximum queue sizes. Non-utilized common memory space is allocated simultaneously to all queues. Time averaged drop probabilities follow a traditional Weighted Random Early Discard mechanism. Algorithms are adapted to a multi-level QOS structure, floating point format, and hardware implementation. Packet flow from a router egress queuing structure into a single egress port tributary is controlled by an arbitration algorithm using a rate metering mechanism. The queuing structure is replicated for each egress tributary in the router system.

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

Abstract: A novel policer mechanism that incorporates randomization of the rate threshold which prevents “lockup” and “synchronization” problems associated with prior art policers that employ fixed rate thresholds. In one embodiment, a policer machine utilizes the well known sliding window technique to implement traffic control. In a second embodiment, a policer machine utilizes the well known token bucket technique to implement traffic control. In both embodiments, a random dimension is added to the rate threshold used by each policer algorithm. For the sliding window embodiment, the effect of randomization of the rate threshold is that the policer machine applies a scattering of rate values centered around the desired rate to the incoming traffic. For the token bucket embodiment, a random dimension is added to the empty bucket (i.e. zero tokens) threshold.

Abstract: A frame multiplexer includes a plurality of counters each of which is provided for each of the lines. A flow monitoring unit monitors frame flow of each line by referring to the counter of the line, and adds length of a passed frame to a value of the counter. A bandwidth managing unit cyclically selects one of the lines through which a frame is input, and subtracts a predetermined token value from a value of the counter of the selected line. An output control unit stores a frame passed through the flow monitoring unit in a queue buffer, and outputs the frame at an output rate of the frame multiplexer.

Abstract: Apparatus and methods for controlling effective communication traffic rates are disclosed. Communication signals that include communication traffic are generated for transfer on a wireless communication link based on fixed signalling characteristics. An effective communication traffic rate of the wireless communication link is controlled by controlling a rate at which communication traffic is provided to a communication module, illustratively a wireless transceiver, that generates the communication signals. Techniques according to embodiments of the invention thereby enable rate control for wireless communication links without changing wireless signalling characteristics or subjecting links to downtime during link reconfiguration. Collaborative rate control, in which rate control information is exchanged between rate control systems, is also contemplated.

Abstract: A computer network system with congestion control includes an edge router, a core router, and an inter-domain router in a computer network domain. A token level is inserted into the packet header of a data packet for congestion control in the computer network domain.

Abstract: A network device for scheduling packets in a plurality of queues. The network device includes a plurality of configurable mechanisms, each of which is configured to process information in one of a plurality of queues based on a predefined bandwidth. A scheduler services an associated one of the plurality of queues based on the predefined bandwidth. The network device also includes means for tracking whether or not the plurality of queues has exceeded a predefined threshold. If the plurality of queues has exceeded the predefined threshold, a new bandwidth allocation is calculated for each of the plurality of queues. The new bandwidth allocation replaces the predefined bandwidth and is proportional to the predefined bandwidth for each of the plurality of queues.

Abstract: A method for scheduling a network resource comprises adding tokens to first and second accumulators at first and second fill rates, respectively. A number of tokens corresponding to a size of a packet is subtracted from the first accumulator and a highest priority is assigned to a queue with which the packet is associated, if a number of tokens in the first accumulator is greater than zero. The number of tokens is subtracted from the second accumulator, and a default priority assigned to the queue, if the number of tokens in the first accumulator is less than zero and a number of tokens in the second accumulator is greater than zero. The network resource is assigned for transmission of the packet from the queue using a schedule that is based on the priority assigned to the queue. The packet is transmitted using the assigned network resource.

Abstract: Traffic control for a communication network using a token bucket. Tokens stored in the token bucket and data throughput to/from a data buffer are monitored, and a new token rate is determined based on the data throughput during the period that at least one token is stored in the token buffer.

Abstract: A method and apparatus for controlling ingress to a communications network to control quality of service is described. A request to admit a new communications flow is received. A polynomial and its coefficients representing a state of the network is determined and applied to the network state plus the new communications flow to determine whether admission of the new communications flow would cause the network to operate in a stable or unstable state. In response to determining that the network would operate in the unstable state, a communications flow for the ingress device is downgraded in its quality of service. By another approach, it is determined whether the new communications flow exceeds an allocated quota of bandwidth. Admission or rejection of the communications flow can be determined.

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

Abstract: A surplus amount of token calculating unit calculates a surplus amount of token for a station in which a residual amount of output buffer is smaller than a residual amount of token. A necessary amount of token calculating unit calculates a necessary amount of token for a station in which the residual amount of output buffer is larger than the residual amount of token. A token distributing unit distributes a token within a range of the surplus amount of token to a token counter of a station in which the necessary amount of token has been calculated, from a station in which the surplus amount of token has been calculated.

Abstract: Devices, systems, methods, and other embodiments associated with message processing are described. In one embodiment, an apparatus includes an interaction logic to interact with a message associated with an isochronous stream. The message is associated with a class of information provided on the isochronous stream. The apparatus includes a history logic to monitor messages associated with the class of information. The history logic determines a class history for the class of information. The apparatus includes a process logic to selectively process the message based on the class history.

Abstract: A method of metering bandwidth allocation on a server using credits is disclosed. The method may receive a request for data from a client, respond to the request for data and determining if the request for data for the client exceeds a current data allocation credit limit for the client. Using the round trip time, the method may calculate a connection throughput for a client and may increase the current data allocation credit limit for the client if the server has resources to spare, the client is actively using the current pipeline depth allowed and network connection latency and bandwidth indicate a deeper pipeline is necessary for saturation. The method may decrease the current data allocation credit limit for the client if the server does not have resources to spare.

Abstract: A FIFO communication system is provided using a FIFO and connection circuit to transmit data from a single source to multiple sinks. The connection circuit operates to enable simultaneous reads by the multiple sinks with a single output port FIFO. Multiple FIFOs can likewise be used to distribute data from a single source to multiple sinks without requiring a simultaneous read by both sinks. Similarly, a multiple output port FIFO can be used to supply multiple sinks without requiring simultaneous reads and without requiring additional memory use.

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 network system capable of dynamically controlling a data flow is disclosed. The network system includes: a forwarding unit, for receiving a packet and for providing a QoS (quality of service) function; and a processor, for accessing data from the forwarding unit through an interface and setting at least one parameter of the forwarding unit. The interface is coupled between the forwarding unit and the processor, and the processor executes a software program to set the at least one parameter of the forwarding unit. In this way, the forwarding unit can classify received packets into different QoS levels according to their transmission properties, and can provide different forwarding methods and QoS services to reduce the amount of the output queues physically.

Abstract: In a bandwidth allocation method and/or apparatus for adaptively allocating radio channels in a mobile communication system, a token bucket is periodically filled with an amount of tokens that corresponds to a requested amount of bandwidth, and a bandwidth is allocated in accordance with the amount of tokens in the token bucket. In a further bandwidth allocation method and/or apparatus for adaptively allocating radio channels in a mobile communication system, a packet classification module classifies received packets on the basis of one of an Internet Protocol address, a port, and an upper layer protocol, a packet scheduler module receives the classified packet from a buffer module for transmission to a mobile station, and a bandwidth allocation module forms the buffer module for bandwidth allocation and processes traffic services by inter-working with the packet scheduler module when the bandwidth allocation is requested.

Abstract: Data communication in network traffic is modeled in real time and is analyzed using a 2-state Markov modified Poissen process (MMPP). The traffic inter-arrival times for bursty and idle states define a transition window [?1max, ?2min] represented by the boundary values ?1max for the inter-arrival time for bursty traffic, and ?2min for the inter-arrival time for idle traffic. Changes in the values of ?1max and ?2min are tracked over time, and the size of the transition window is enlarged or decreased based upon relative changes in these values. If the inter-rival times for the bursty state and the idle state become approximately equal, the model defaults to a single state model. The modeling is applicable to the synchronization of polling and blocking in a low-latency network system. This permits the adoptive selection of poll or block to maximize CPU utilization and interrupt latency.

Abstract: Audio-visual data is provided to a network-connected terminal. First audio-visual data containing first information encoded at a first data rate and second audio-visual data containing first information encoded at a second data rate that is more than the first data rate are received. The first audio-visual data is provided to the network-connected terminal. A condition is identified to the effect that the amount of data being sent to the terminal is less than the available bandwidth. The difference between the data rates of the first and second audio-visual data is calculated, additional data packets are sent to the terminal to determine whether the available bandwidth is large enough to provide the first audio-visual data to the terminal; and if it is determined that the available bandwidth is large enough, provision of the first audio-visual data to the terminal is stopped and the second audio-visual data is provided instead.

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.

Abstract: Various improvements are provided for prior art policing methods, including token bucket methods and virtual time policing methods. Some preferred methods of the invention involve assigning a non-zero drop probability even when the packet would otherwise have been transmitted according to a prior art policing method. For example, a non-zero drop probability may be assigned even when there are sufficient tokens in a token bucket to allow transmission of the packet. A non-zero drop probability may be assigned, for example, when a token bucket level is at or below a predetermined threshold or according to a rate at which a token bucket is being emptied. Some implementations involve treating a token bucket as a virtual queue wherein the number of free elements in the virtual queue is proportional to the number of remaining tokens in the token bucket.

Abstract: A method and device for in-line processing a data packet is provided. The data packet is received at a first buffer. The data packet is divided into a number of cells that are stored in a first queue. For each cell, a cell state code is stored that indicates an address of the corresponding cell in the first queue and an indication of a sequence order of the cell within the data packet.

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: This invention provides a tool for reliability evaluation and performance analysis of an IP backbone network by using the network packet loss ratio as the main measurement. A queuing model and algorithm is presented for calculating packet loss at congested interfaces or links. A reliability model is presented for considering network hardware component failures such as router failures, ATM switch failures, and physical link failures. Based on the measurement and models presented, a network reliability and performance (NetRAP) apparatus calculates IP network reliability and performance measurements. The NetRAP apparatus uses the network topology, a traffic matrix, and the reliability parameters of a network as inputs and calculates the network packet loss ratio and sigma score, and provides a list of heavily congested links under non-failure or different single failure conditions.

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

Abstract: A shaper circuit includes a storage part storing a current token, an add token, and a max token, a subtraction part subtracting a packet length of a dequeue target from the current token stored in the storage part and storing the current token in the storage part, an addition part adding the add token stored in the storage part to the current token stored in the storage part at constant periodic intervals and storing the current token in the storage part, a comparison part comparing the result of the addition with the max token stored in the storage part and preventing the addition result from exceeding the max token, and a determining part outputting a dequeue permission request. A number of bits in a decimal part of the current token are set and a number of bits in an integer part of the add token are set.

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

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

Abstract: Disclosed is an apparatus and method for granting guaranteed bandwidth between one or more data transmission priority requesting sources and one or more resources upon request. Data sources that do not request an assigned bandwidth are served on a “best efforts” basis. The system allows additional bandwidth to priority requesting sources when it is determined that the resource and/or the communication path to the resource is under-utilized. The system further allows the granted bandwidth to be shared by more than one source in a multiprocessor system.

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

Abstract: A hierarchical multi-rate multi-precedence policer is disclosed. The policer discards packets based on assigned precedence levels. When traffic exceeds an available service rate, the policer drops packets of lower precedence levels to make room for packets of higher precedence levels. In certain implementations, the policer also guarantees bandwidth to each level, thus preventing complete loss of lower precedence traffic when there is a large amount of higher precedence traffic.

Abstract: A method and apparatus for combating fraudulent use of a telecommunication system by subscribers who terminate calls improperly without allowing the termination of the call to be recorded, and thereby attempt to avoid correct payment for the call. The apparatus comprises a record means for creating a call detail record (CDR) of certain events for each call on which billing for each call can be based. A modified Call Agent (22) is provided for monitoring certain events related to all calls. The Call Agent (22) is also operable to check periodically whether a call is active or has been terminated improperly without the termination event having been recorded in the respective CDR for that call.

Abstract: An ATM network traffic shaper is implemented in hardware. The traffic shaper shapes transmit data on one or more virtual circuits (VCs) according to the specified quality of service (QoS) parameters. Thus, the traffic shaper provides for the delivery of associated data cells in accordance with the specified QoS parameters. The traffic shaper is scalable in that the number of supported VCs can be increased with a relatively small increase in the size of the device and associated logic gates. The traffic shaper supports constant bit rate (CBR), variable bit rate (VBR), and unknown bit rate (UBR) service types and generates cell transmit requests with zero cell delay variation (CDVT). The traffic shaper also provides very high resolution in terms of bit rate specification. Varying shaping resolutions are achieved by varying a shaping interval time (SIT) generated by a SIT counter.

Abstract: Transfer of data is facilitated between at least one application and a peer via a network. Data destined for the peer is provided from the at least one application for transmission to the peer via the network. Modulation event tokens are managed, and protocol processing of the data with the peer is based in part on a result of the modulation event tokens managing such that protocol processed data is caused to be transmitted to the peer via the network nominally with desired data transmission rate characteristics. A result of the protocol processing step is fed back to the to the modulation event tokens managing. The desired data transmission rate characteristics may include, for example, shaping and pacing.

Abstract: To provide a communications apparatus for preventing degradation in data quality, which is caused by the missing of reception data at the time of a data communication, an application processing unit comprises a load monitor processing unit for monitoring a load imposed at the time of a reception data process, and a reception response processing unit for issuing a reception response instruction to a protocol processing unit, and the protocol processing unit comprises a first data notifying unit for transmitting a reception response to reception data, and a second data notifying unit for transmitting a reception response according to an instruction from the reception response processing unit.

Abstract: A metering device has a first token bucket with a profile, a rate, and a maximum number of tokens. The device has another token bucket with its own profile, two associated rates, and a maximum number of tokens. In operation, the device adds tokens in the first token bucket at its rate if the bucket has less than the maximum number of tokens for that bucket, and adds a number of tokens in the other token bucket at the same rate if the first token bucket is full and the other token bucket is not. Additionally, the device adds tokens in the second token bucket according to the second rate associated with the token bucket if it is not full.

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

Abstract: A system architecture for thwarting denial of service attacks on a victim data center is described. The system includes a first plurality of monitors that monitor network traffic flow through the network. The first plurality of monitors is disposed at a second plurality of points in the network. The system includes a central controller that receives data from the plurality of monitors, over a hardened, redundant network. The central controller analyzes network traffic statistics to identify malicious network traffic. In some embodiments of the system, a gateway device is disposed to pass network packets between the network and the victim site. The gateway is disposed to protect the victim site, and is coupled to the control center by the redundant hardened network.

Abstract: System for bandwidth assignment to manage congestion over a network bottleneck, comprises a regulation point being set up downstream of the bottleneck in the network to manage congestion in data packets arriving from various sources via the bottleneck. For each of the sources, a priority level assigner assigns priority levels to respective data packets. A token bucket assigns tokens at a limiting rate to the prioritized data packets, the tokens allowing passage of packets to which they are assigned. The token bucket is a multi-priority token bucket, meaning it has at least two thresholds corresponding to the priority levels assigned to the packets. The token bucket only assigns a token to an arriving packet having a respective priority level if there are sufficient tokens currently in the bucket to reach the threshold corresponding to the packet's priority level.

Abstract: The Fiber Channel standard was created by the American National Standard for Information Systems (ANSI) X3T11 task group to define a serial I/O channel for interconnecting a number of heterogeneous peripheral devices to computer systems as well as interconnecting the computer systems themselves through optical fiber and copper media at gigabit speeds (i.e., one billion bits per second). Multiple protocols such as SCSI (Small Computer Serial Interface), IP (Internet Protocol), HIPPI, ATM (Asynchronous Transfer Mode) among others can concurrently utilize the same media when mapped over Fiber Channel. A Fiber Channel Fabric is an entity which transmits Fiber Channel frames between connected Node Ports. The Fiber Channel fabric routes the frames based on the destination address as well as other information embedded in the Fiber Channel frame header. Node Ports are attached to the Fiber Channel Fabric through links.

Abstract: A method and system for allocating bandwidth of a wireless channel to different types of traffic includes partitioning the bandwidth of the wireless channel into a plurality of contention periods. Traffic flows are associated with access categories, and one or more of the access categories are assigned to each contention period. During at least one of the contention periods, traffic flows associated with a proper subset of the access categories contend for access to the wireless channel.

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.