Computing the internet checksum

Braden, Robert; Borman, David A.; Partridge, Craig

doi:10.1145/378444.378453

Cited by 29 publications

(11 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…All proposed characteristics and speculations have been proved and verified by comprehensive experiments. Our future works include following aspects: (1) exploring more possible applications for Zput; (2) improving Zput performance further by reducing any possible runtime overhead;…”

Section: Discussionmentioning

confidence: 99%

“…Braden et al [2] discussed methods for efficiently computing checksum used by the standard internet protocols such as IP, UDP, and TCP. Genova and Christensen [9] investigated methods using CRC32 for compressing Web URL strings and sharing of URL lists between servers, caches, and URL switches.…”

Section: Related Workmentioning

confidence: 99%

“…It includes two key components: (1) HDFS, a robust and scalable file system playing a prominent role in the Hadoop ecosystem. (2) Map/Reduce, a distributed programming paradigm for massive data processing which divides massive work across many servers in a Hadoop cluster.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An approach of fast data manipulation in HDFS with supplementary mechanisms

Wang

et al. 2014

J Supercomput

View full text Add to dashboard Cite

The Hadoop framework has been widely applied in miscellaneous clusters to build large scalable and powerful systems for massive data processing based on commodity hardware. Hadoop distributed file system (HDFS), the distributed storage component of Hadoop, is responsible for managing vast amount of data effectively in large clusters. To utilize the parallel processing infrastructure of Hadoop, Map/Reduce, the traditional workflow needs to upload data from local file systems to HDFS first. Unfortunately, when dealing with massive data, the uploading procedure becomes extremely time-consuming which causes almost intolerable delay for urgent tasks, along with unnecessary space waste due to replicated data. The primary contribution of this paper is the proposition of Zput and its supplementary mechanism named Zport. After the implementation is described, we introduce several improved details which are significant for runtime efficiency and performance. Evaluation results prove that Zput can accelerate the local data uploading procedure by over 315.4 %, while Zport can boost the remote block distribution by over 190.3 %. Besides, the compatibility for upper-layer applications remains intact.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An approach of fast data manipulation in HDFS with supplementary mechanisms

Wang

et al. 2014

J Supercomput

View full text Add to dashboard Cite

show abstract

“…PROPERTIES Internet Checksum is used by different standard protocols (Internet protocol (IP), transmission control protocol (TCP), UDP) for error detection [30]. Internet checksum, which is a fixed-length tag added to a message at the transmission side, enables the receiver to verify the integrity of the delivered message by recomputing the tag and comparing it with the tag that was sent.…”

Section: Internet Checksum Calculation Andmentioning

confidence: 99%

“…The Internet checksum is a 16-bit field within the protocol header, and is defined as one's complement of the one's complement sum of all the 16-bit words in the computation data [30]. More specifically, the Internet checksum is calculated at the transmission side as follows:…”

Section: A Internet Checksum Definition and Mathematical Propertiesmentioning

confidence: 99%

Checksum-Filtered List Decoding Applied to H.264 and H.265 Video Error Correction

Golaghazadeh

Coulombe

Coudoux

et al. 2018

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

The latest video coding standards, H.264 and H.265, are highly vulnerable in error-prone networks. Reconstructed packets may exhibit significant degradation in terms of PSNR and visual quality. This paper presents a novel list decoding approach exploiting the receiver side user datagram protocol (UDP) checksum. The proposed method identifies the possible locations of errors by analyzing the pattern of the calculated UDP checksum. This permits to considerably reduce the number of candidate bitstreams in comparison to conventional list decoding approaches. When a packet composed of N bits contains a single-bit error, instead of considering N candidate bitstreams, as is the case in conventional list decoding approaches, the proposed approach considers N/32 candidate bitstreams, leading to a reduction of 97% of the number of candidates. For a two-bit error, the reduction increases to 99.6%. The method's performance is evaluated using H.264 and H.265 test model software. Our simulation results reveal that, on average, the error was corrected perfectly 80 to 90% of the time (the original bitstream was recovered). In addition, the proposed approach provides, on average, a 2.79 dB gain over frame copy (FC) error concealment using the Joint Model (JM) and a 3.57 dB gain over our implementation of FC error concealment in the HEVC Test Model (HM).

show abstract

Configurable array logic circuits for computing network error detection codes

Brebner

1993

J VLSI Sign Process Syst Sign Image Video Technol

View full text Add to dashboard Cite

Computing the internet checksum

Cited by 29 publications

References 0 publications

An approach of fast data manipulation in HDFS with supplementary mechanisms

An approach of fast data manipulation in HDFS with supplementary mechanisms

Checksum-Filtered List Decoding Applied to H.264 and H.265 Video Error Correction

Configurable array logic circuits for computing network error detection codes

Contact Info

Product

Resources

About