Abstract: Methods and apparatus provide for allocating bandwidth in a resilient packet ring (RPR), including: determining a relationship between an arrival rate A(n) as a function of a fairness rate Fk(n) of a kth node of the RPR over time; computing an estimate of a slope M of the relationship A(Fk(n)) at time n; and computing a next fairness rate Fk(n+1) of the kth node as a function of the slope M at time n+1.

Abstract: The method is based on marking packets with the partial address information of ingress interface only. The attack victim is able to recover the complete address(es) information after receiving several packets from a particular attacking host or hosts. The full path is not really essential for the traceback since it can be different for different packets for different reasons. In order to make tracing slaves from reflectors possible, the potential reflectors keep the log of two fields of every packet, which they receive. The two fields are source address for the mark. The entry is kept in the log for a reasonable period of time in order for the victim to be able to use that information. By analyzing the marks from the logs, which cannot be spoofed, and that are sure to be from the slaves, the victim can reconstruct the ingress addresses of the slaves which sent the packets to the reflectors.

Abstract: The invention enables the use of TCP protocol for reliable transport of data over a wireless network, resolving the problems associated with frequent packet loss. Additional benefits include delivery of significant performance improvement, bandwidth saving and backward compatibility compared to the wire-line TCP protocol, and contribution to power savings in wireless handsets and devices. To make the retransmission process more granular, transport layer segments are subdivided into sub-segments. The invention utilizes a split TCP based approach and produces a series of smaller-sized segments that share the same transport layer header. A NACK-based message exchange, a new header format and a special windowing protocol are used to achieve reliability, flow-control, and efficient buffer handling.

Abstract: The deterministic packet marking (DPM) method is based on marking packets with the partial address information of ingress interface only. The attack victim is able to recover the complete address(es) information after receiving several packets from a particular attacking host or hosts. The full path is not really essential for the traceback since it can be different for different packets for different reasons. In order to deal with fragmenation, it is required that the ID field (as well as some other fields) of all the fragments in a given series is the same. DPM randomly selects the marks from the pool, which is created at startup. The mark completely occupies the ID field in the IP packet header, as well as Reserved Flag. Since every single packet passing through the DPM-enabled interface is marked, the ID field of all the fragments of a series are ensured to be the same.

Abstract: The deterministic packet marking (DPM) method is based on marking packets with the partial address information of ingress interface only. The attack victim is able to recover the complete address(es) information after receiving several packets from a particular attacking host or hosts. The full path is not really essential for the traceback since it can be different for different packets for different reasons.

Abstract: A method including identifying at least two subsets of pixels within a block of an image; forming a plurality of pixel groups from the at least two subsets of pixels, each pixel group having at least one pixel from a first of the at least two subsets and at least one pixel from a second of the at least two subsets; producing a plurality of difference values, each pixel group providing one of said difference values, each difference value being based on differences between pixel values of pixels within one of the pixel groups; and modifying pixel values of pixels in less than all of the at least two subsets, thereby embedding a bit value into the block.

Abstract: Methods and apparatus are provided for encoding a pixel domain image with hidden data by modifying the histogram of the pixel domain image to make space for such hidden data.

Abstract: A method for allocating a fair bit rate for an ABR service. Forward and backward RM cells traversing a link 1 are received at an ATM switch. Both the forward and backward RM cells are associated with a session, with the forward RM cells being transmitted from a source to a destination and the backward RM cells being transmitted from the destination to the source. An advertised rate .gamma..sub.l for link 1 is updated when a backward RM cell associated the session is received based on a change in a bottleneck bandwidth .DELTA..lambda. of the session and a change in a bottleneck status .DELTA..beta. of the session. The explicit rate .lambda..sup.ER contained in the backward RM cell is rewritten as a minimum of the advertised rate .gamma..sub.l and the explicit rate .lambda..sup.ER. The backward RM cell is then transmitted to the source of the RM cell.