Abstract: This paper proposes a high capacity reversible image watermarking scheme based on integer-to-integer wavelet transforms. The proposed scheme divides an input image into nonoverlapping blocks and embeds a watermark into the high-frequency wavelet coefficients of each block. The conditions to avoid both underflow and overflow in the spatial domain are derived for an arbitrary wavelet and block size. The payload to be embedded includes not only messages but also side information used to reconstruct the exact original image. To minimize the mean-squared distortion between the original and the watermarked images given a payload, the watermark is adaptively embedded into the image. The experimental results show that the proposed scheme achieves higher embedding capacity while maintaining distortion at a lower level than the existing reversible watermarking schemes.

Abstract: As H.264 digital video becomes more prevalent, the need for copyright protection and authentication methods that are appropriate for this standard will emerge. This paper proposes a robust watermarking algorithm for H.264. We employ a human visual model adapted for a 4 times 4 discrete cosine transform block to increase the payload and robustness while limiting visual distortion. A key-dependent algorithm is used to select a subset of the coefficients that have visual watermarking capacity. Furthermore, the watermark is spread over frequencies and within blocks to avoid error pooling. This increases the payload and robustness without noticeably changing the perceptual quality. We embed the watermark in the coded residuals to avoid decompressing the video; however, we detect the watermark from the decoded video sequence in order to make the algorithm robust to intraprediction mode changes. We build a theoretical framework for watermark detection based on a likelihood ratio test. This framework is used to obtain optimal video watermark detection with controllable detection performance. Our simulation results show that we achieve the desired detection performance in Monte Carlo trials. We demonstrate the robustness of our proposed algorithm to several different attacks

Abstract: A non-volatile memory has a first payload data region and a first redundant memory area associated with the first payload data region. The first redundant memory area has a first portion, a second portion and a third portion. The first portion includes first payload error correction code (ECC) data associated with the first payload data region. The second portion includes first metadata associated with the first payload data region. The third portion includes first metadata ECC data associated with the first metadata.

Abstract: There is an inherent trade-off between epidemic and deterministic tree-based broadcast primitives. Tree-based approaches have a small message complexity in steady-state but are very fragile in the presence of faults. Gossip, or epidemic, protocols have a higher message complexity but also offer much higher resilience. This paper proposes an integrated broadcast scheme that combines both approaches. We use a low cost scheme to build and maintain broadcast trees embedded on a gossip-based overlay. The protocol sends the message payload preferably via tree branches but uses the remaining links of the gossip overlay for fast recovery and expedite tree healing. Experimental evaluation presented in the paper shows that our new strategy has a low overhead and that is able to support large number of faults while maintaining a high reliability.

Abstract: The IPsec series of protocols makes use of various cryptographic algorithms in order to provide security services. The Encapsulating Security Payload (ESP) and the Authentication Header (AH) provide two mechanisms for protecting data being sent over an IPsec Security Association (SA). To ensure interoperability between disparate implementations, it is necessary to specify a set of mandatory-to- implement algorithms to ensure that there is at least one algorithm that all implementations will have available. This document defines the current set of mandatory-to-implement algorithms for ESP and AH as well as specifying algorithms that should be implemented because they may be promoted to mandatory at some future time. [STANDARDS-TRACK]

Abstract: An optical transmission network is inherently asynchronous due to the utilization of a variable overhead ratio (V-OHR). The network architecture makes extensive use of OEO regeneration, i.e., deals with any electronic reconditioning to correct for transmission impairments, such as, for example, FEC encoding, decoding and re-encoding, signal reshaping, retiming as well as signal regeneration. The optical transmission network includes a plesiochronous clocking system with intermediate nodes designed to operate asynchronously with a single local frequency clock without complicated network synchronization schemes employing high cost clocking devices such as phase locked loop (PLL) control with crystal oscillators and other expensive system components. The asynchronous network operation provides for asynchronous remapping or remapping of any client signal utilizing any type of transmission protocol where the line side rate or frequency is always the same frequency for the payload signal and the local frequency at an intermediate node is set to a local reference clock in accordance with the payload type and its overhead ratio, i.e., the overhead ratio is varied to meet the desired difference between the line rate or frequency and the desired client signal payload rate or frequency for the particular client signal payload type.

Abstract: In one embodiment, a method includes receiving packet flow optimization (PFO) configuration data that associates each rule name of multiple PFO rule names with a corresponding method for processing a data packet in a communications network based on data in a payload of a layer 3 protocol of the data packet. A first policy message is received from a policy management process in the communications network. The first policy message includes rule data that indicates a signaled rule name associated with a particular network address in the communications network. In response to receiving the first policy message, a data packet of the particular network address is processed according to a particular method associated with a particular rule name selected based on the signaled rule name. As a result, a PFO policy is controlled from the policy management process.

Abstract: This document specifies a payload format for generic Forward Error Correction (FEC) for media data encapsulated in RTP. It is based on the exclusive-or (parity) operation. The payload format described in this document allows end systems to apply protection using various protection lengths and levels, in addition to using various protection group sizes to adapt to different media and channel characteristics. It enables complete recovery of the protected packets or partial recovery of the critical parts of the payload depending on the packet loss situation. This scheme is completely compatible with non-FEC- capable hosts, so the receivers in a multicast group that do not implement FEC can still work by simply ignoring the protection data. This specification obsoletes RFC 2733 and RFC 3009. The FEC specified in this document is not backward compatible with RFC 2733 and RFC 3009. [STANDARDS-TRACK]

Abstract: This document specifies a Real-time Transport Protocol (RTP) payload format to be used for Adaptive Multi-Rate (AMR) and Adaptive Multi- Rate Wideband (AMR-WB) encoded speech signals. The payload format is designed to be able to interoperate with existing AMR and AMR-WB transport formats on non-IP networks. In addition, a file format is specified for transport of AMR and AMR-WB speech data in storage mode applications such as email. Two separate media type registrations are included, one for AMR and one for AMR-WB, specifying use of both the RTP payload format and the storage format. This document obsoletes RFC 3267. [STANDARDS-TRACK]

Abstract: The IPsec series of protocols makes use of various cryptographic algorithms in order to provide security services. The Encapsulating Security Payload (ESP) and the Authentication Header (AH) provide two mechanisms for protecting data being sent over an IPsec Security Association (SA). To ensure interoperability between disparate implementations, it is necessary to specify a set of mandatory-toimplement algorithms to ensure that there is at least one algorithm that all implementations will have available. This document defines the current set of mandatory-to-implement algorithms for ESP and AH as well as specifying algorithms that should be implemented because they may be promoted to mandatory at some future time.

Abstract: In this paper, we consider hardware-based scanning and analyzing packets payload in order to detect hazardous contents.We present two pattern matching techniques to compare incoming packets against intrusion detection search patterns. The first approach, decoded partial CAM (DpCAM), predecodes incoming characters, aligns the decoded data, and performs logical AND on them to produce the match signal for each pattern. The second approach, perfect hashing memory (PHmem), uses perfect hashing to determine a unique memory location that contains the search pattern and a comparison between incoming data and memory output to determine the match. Both techniques are well suited for reconfigurable logic and match about 2200 intrusion detection patterns using a single Virtex2 field-programmable gate-array device. We show that DpCAM achieves a throughput between 2 and 8 Gb/s requiring 0.58–2.57 logic cells per search character. On the other hand, PHmem designs can support 2–5.7 Gb/s using a few tens of block RAMs (630–1404 kb) and only 0.28–0.65 logic cells per character. We evaluate both approaches in terms of performance and area cost and analyze their efficiency, scalability, and tradeoffs. Finally, we show that our designs achieve at least 30% higher efficiency compared to previous work, measured in throughput per area required per search character

Abstract: We provide a theoretical framework for cross-layer design in multimedia communications to optimize single-user throughput by selecting the transmitted bit rate and payload size as a function of channel conditions for both additive white Gaussian noise (AWGN) and Nakagami-m fading channels. Numerical results reveal that careful payload length adaptation significantly improves the throughput performance at low signal to noise ratios (SNRs), while at higher SNRs, rate adaptation with higher payload lengths provides better throughput performance. Since we are interested in multimedia applications, we do not allow retransmissions in order to minimize latency and to reduce congestion on the wireless link and we assume that packet loss concealment will be used to compensate for lost packets. We also investigate the throughput and packet error rate performance over multipath frequency selective fading channels for typical payload sizes used in voice and video applications. We explore the difference in link adaptation thresholds for these payload sizes using the Nafteli Chayat multipath fading channel model, and we present a link adaptation scheme to maximize the throughput subject to a packet error rate constraint.

Abstract: In Batch Steganography we assume that a Steganographer has to choose how to allocate a fixed amount of data between a large number of covers. Given the existence of a steganalysis method for individual objects (satisfying certain assumptions) we assume that a Warden attempts to detect the payload by pooling the evidence from all the objects. This paper works out the details of a particular method for the Warden, which counts the number of objects of which the detection statistic surpasses a certain threshold. This natural pooling method leads to a game between the Warden and Steganographer, and there are different varieties depending on whether the moves are sequential or simultaneous. The solutions are intriguing, suggesting that the Steganographer should always concentrate the payload in as few covers as possible, or exactly the reverse, but never adopt an intermediate strategy. Furthermore, the Warden's optimal strategies are instructive for the benchmarking of quantitative steganalysis methods. Experimental results show that some steganography and steganalysis methods' empirical performance accords with this theory.

Abstract: A lossless data embedding method that inserts data in images in the spatial domain is proposed in this paper. Though a lossless data embedding method once distorts an original image to embed data into the image, the method restores the original image as well as extracts hidden data from the image in which the data are embedded. To guarantee the losslessness of data embedding, all pixel values after embedding must be in the dynamic range of pixels. Because the proposed method modifies some pixels to embed data and leaves other pixels as their original values in the spatial domain, it can easily keep all pixel values after embedding in the dynamic range of pixels. Thus, both the capacity and the image quality of generated images are simultaneously improved. Moreover, the proposed method uses only one parameter based on the statistics of pixel blocks to embed and extract data. By using this parameter, this method does not require any reference images to extract embedded data nor any memorization of the positions of pixels in which data are hidden to extract embedded data. In addition, the proposed method can control the capacity for hidden data and the quality of images conveying hidden data by controlling the only one parameter. Simulation results show the effectiveness of the proposed method; in particular, it offers images with superior image quality to conventional methods.

Abstract: The dynamic streaming of multimedia data between a data server and one or more clients is disclosed. Dynamic streaming enables the rapid and accurate characterization of the end-to-end path conditions in a server-client streaming session, as well as the rapid and intelligent response to those conditions in terms of source compression prior to data packetization. The most significant bits of an original bit stream can be adaptively and immediately selected in response to network conditions. The adaptive selection process is informed by feedback from the client receiver indicative of a time-to-transit the network from server to client. A control protocol and server architecture, including file format, data structure, data processing procedures, cache control mechanisms, and adaptation algorithms useful in implementing dynamic streaming are also disclosed.

Abstract: A system, architecture and model for facilitating extensible messaging and interaction are provided. The message system may use a messaging architecture that includes a domain message model, and open message model and a wire format. The wire format may implement primitive data types that may be used by the open message model to define additional and/or more complex data formats. The open message model may further specify interaction paradigms, generic messages, and message and transport attributes. The generic messages may include payload data whose meaning and context may be defined using the domain message model. The domain message model may include a content definition model and an item type model for building data and object types and specifying data context and relationships. As such, the message system may use generic messages and formats to create different message and item types.

Abstract: Systems and methods for automatic network optimization are provided. One embodiment comprises receiving a first data packet including an unenhanced payload from a first network device. A portion of the first data packet is then modified, the portion being outside the unenhanced payload of the first data packet, to indicate that a first optimization device is capable of enhanced communication. Next, the modified first data packet is sent from the first optimization device to an endpoint device. An indication of a capability of enhanced payload processing may be received. Based on the indication, an enhanced payload of a second data packet addressed to the endpoint device based on the indication may be generated. Finally, the second data packet including the enhanced payload may be sent to the endpoint device.

Abstract: A method comprises receiving a bit sequence associated with at least one file, the bit sequence comprising payload data in a compressed format and characterization data that maps the compressed format of the payload data. The method continues by encrypting the characterization data that maps the compressed format of the payload data. The method concludes by transmitting the bit sequence such that the characterization data is encrypted and at least a portion of the payload data is unencrypted.

Abstract: Methods and apparatus relating to network packet payload compression/decompression are described. In an embodiment, an uncompressed packet payload may be compressed before being transferred between various components of a computing system. For example, a packet payload may be compressed prior to transfer between network interface cards or controllers (NICs) and storage devices (e.g., including a main system memory and/or cache(s)), as well as between processors (or processor cores) and storage devices (e.g., including main system memory and/or caches). Other embodiments are also disclosed.

Abstract: A switch having a first communications interface to receive a stream of data units, a buffer to store the payload portion of the data unit, a replicator to duplicate at least the payload portion of the data unit, and a second communications interface to enable access to the stream of data units by two or more terminals.

Abstract: Provided is an apparatus and method for varying the length of an error check code of a PDU according to the length of a payload in a broadband wireless communication system. A transmitting apparatus includes a first generator and a second generator. The first generator generates a payload of a PDU. The second generator selects the length of an error check code according to the length of the generated payload, generates an error check code according to the selected length, and suffixes the error check code to the payload.

Abstract: A method and device for transmitting low speed signals in an Optical Transport Network (OTN), including: mapping each channel of low speed signal into an ODU signal; dividing each OPUk payload area into one or more time slots, byte interleaving each channel of OPU payload into the time slots; frame interleaving the OPU justification overhead corresponding to each channel of OPU payload in different frames of OPUk justification overhead; frame interleaving the ODU overhead corresponding to each channel of OPU payload in different frames of ODUk overhead; transforming an ODUk signal containing the OPUk payload, OPUk justification overhead and ODUk overhead into an OTUn signal and transmitting the ODUk signal in an OTN. Therefore the multiplexing and de-multiplexing method and device for implementing the transparent transmission of the low speed signal in the OTN may be implemented.

Abstract: The subject matter described herein includes methods, systems, and computer program products for transferring a message service payload between messaging entities. According to one aspect, the subject matter described herein includes a method for intelligently processing a message service payload being transmitted between messaging entities. A messaging service message comprising a payload being transmitted from an N-generation messaging entity to an M-generation messaging entity is received at a core network, wherein N and M are integers. The payload is decoded to identify a service to be provided. An action is performed to facilitate the providing of the identified service.

Abstract: A method for encrypting data may generate an encryption instruction and combine it with a payload of data to form a packet. The packet is associated with a command and passed to a host file system process. The packet, now associated with a second command, is received from the host file system process. The encryption instruction and the payload of data are extracted from the packet. At least a portion of the payload of data is encrypted based on the encryption instruction. A method for decrypting data may receive a packet and generate a decryption instruction. At least a portion of the packet is decrypted using at least the decryption instruction. The second packet comprising the decrypted packet is passed to a host file system process. A third packet comprising the decrypted packet is received from the host file system process. The decrypted packet is extracted from the third packet.

Abstract: This paper proposes a reversible data hiding method that embeds an L-level data sequence to images in the spatial domain. Though reversible data hiding once distorts the image to hide data into it, the distorted image is completely separated to the original image and the hidden data. The proposed method uses only one parameter to embed and extract data, and it extracts data without any location map. In addition, it can control embedding capacity according to payload for suppression of embedding distortion. Simulation results show the effectiveness of the proposed method.

Abstract: Apparatus for contactless data transmission according to a predetermined transmission protocol providing control information and payload for a data transmission, with a near field communicator and an interface connected to the near field communicator, the interface being operative to exchange, using a first protocol, data with the near field communicator for the contactless transmission. In this context, the first protocol provides a transmission of control information and payload, the payload of the first protocol including the control information and the payload of the predetermined protocol. The apparatus further includes a module coupled to the interface and being operative to exchange, using the payload of the first protocol, the control information and the payload of the predetermined transmission protocol for the data exchanged contactlessly by the near field communicator.

Abstract: Watermark information (denoted WM) consists of several symbols which are embedded continuously by reference sequence modulation in an audio or a video signal. At decoder site the WM is regained using correlation of the received signal with a corresponding reference sequence. The symbols form watermark data frames. The invention uses for the bit values ‘zero’ and ‘one’ in each payload symbol and for each payload symbol in a watermark data frame different reference sequences, without using synchronisation symbols. A logarithmic search is performed in the WM decoder to reduce the numbers of correlations to be calculated. The invention makes watermarking of critical sound signals much more robust.

Abstract: Skype uses strong encryption to secure communications inside the whole Skype network. Clients choose communication ports randomly. Therefore traditional port based or payload based identification of Skype traffic is not feasible. In this paper we introduce a novel flow dynamics based identification method to discover Skype host and voice calls as well. Our method uses only packet headers and the extracted flow level information. The whole identification process is scripted in Transact-SQL, thus it can be executed automatically. We also present the validation of the algorithm together with some analysis of the identification results.