Research Article
A Method for Calculating Frame Check Sequences in Tagged Ethernet Frames
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 59 - Issue 12 |
| Published: December 2012 |
| Authors: Hiroshi Matsuda |
10.5120/9604-4231
|
Hiroshi Matsuda . A Method for Calculating Frame Check Sequences in Tagged Ethernet Frames. International Journal of Computer Applications. 59, 12 (December 2012), 39-42. DOI=10.5120/9604-4231
@article{ 10.5120/9604-4231,
author = { Hiroshi Matsuda },
title = { A Method for Calculating Frame Check Sequences in Tagged Ethernet Frames },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 59 },
number = { 12 },
pages = { 39-42 },
doi = { 10.5120/9604-4231 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Hiroshi Matsuda
%T A Method for Calculating Frame Check Sequences in Tagged Ethernet Frames%T
%J International Journal of Computer Applications
%V 59
%N 12
%P 39-42
%R 10.5120/9604-4231
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Like other technologies such as Internet Protocol (IP) or Transmission Control Protocol (TCP), an Ethernet frame also has a field to detect some errors occurred on transmission. This field is referred to as frame check sequence (FCS). Usually, when an Ethernet frame conveys extra information on some feature such as VLAN (Virtual Local Area Network), a field called tagis inserted into the frame and FCS must be recalculated. In this paper we propose a method for calculating a frame check sequence in a tagged frame effectively. Our method utilizes the relationship between an Ethernet frame and its tagged Ethernet frame on FCS. And it is also shown that in most cases the FCS in a tagged Ethernet frame can be easily obtained by just adding the pre-calculated result to the FCS in an original Ethernet frame.
References
- F. J. Macwilliams, N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, NETHERLANDS, 1992.
- H. H. Mathukiya, N. M. Patel," A Novel Approach for Parallel CRC Generation for High Speed Application", 2012 International Conference on Communication Systems and Network Technologies (CSNT), pp. 581 - 585,2012
- J. Peng ,Y. Zhou,Y. Yang," Cyclic redundancy code check algorithm based on small lookup table", IEEE International Conference on Communications Technology and Applications, pp. 596- 599, 2009
- T. Henriksson, H. Eriksson, U. Nordqvist, P. Larsson-Edefors, D. Liu, "VLSI implementation of CRC-32 for 10 Gigabit Ethernet", Proceedings of 2001 IEEE 8th IEEE International Conference on Electronics, Circuits and Systems, vol. 3, pp. 1215-1218, 2001
- G. Albertengo, R. Sisto, "Parallel CRC generation", IEEE Micro, vol. 10, no. 5, pp. 63-71, 1990.
- T. V. Ramabadran, S. S. Gaitonde, "A tutorial on CRC computations", IEEE Micro, vol. 8, no. 4, pp. 62-75, 1988.
- Online Available : IEEE802. 3-2008 http://standards. ieee. org/getieee802/download/802. 3-2008_section1. pdf
- Online Available : IEEE802. 1Q-2011 - IEEE Standard for Local and metropolitan area networks--Media Access Control (MAC) Bridges and Virtual Bridged Local Area Networkshttp://standards. ieee. org/findstds/standard/802. 1Q-2011. html
- Online Available : "Voice Over IP - Per Call BandwidthConsumption" : http://www. cisco. com/en/US/tech/tk652/tk698/technologies_tech_note09186a0080094ae2. shtml
Index Terms
Keywords