Dictionary
a collection of things wrapped or boxed together (computer science) a message or message fragment a small package or bundle a boat for carrying mail
|
Wikipedia
This article refers to the information technology term. For the historical use, see packet trade.''A packet is the fundamental unit of information carriage in all modern computer networks that use packet switching.
Connectionless packets: Datagrams - Some systems that use packets (e.g. Asynchronous Transfer ModeATM) require a connection setup stage before any packets can be sent, which is why they introduce the term datagram.A datagram is a self-contained packet, one which contains enough information in the header to allow the network to forward it to the destination independently of previous or future datagrams. Thus, no setup is needed before a computer tries to send datagrams to a computer with which it has not previously communicated, unlike with virtual circuit protocols. Other packet switched networks, for instance the Internet Protocol, do not require prior setup, and there the two terms are used interchangeably.
How packets work - A packet consists of three elements: the first element is a !''Header_(information_technolo gy)header'', which contains the information needed to get the packet from the source to the destination, and the second element is a ''data area'', which contains the information of the user who caused the creation of the packet. The third element of packet is a ''Trailer (information technology)trailer'', which often contains techniques ensuring that errors do not occur during transmission.A good analogy is to consider a packet to be like a letter; the header is like the envelope, and the data area is whatever the person puts inside the envelope. The life of one telecommunication connectionconnection will usually comprise a series of packets; in some network designs, they will not necessarily all be routed over the same path through the network.
Delivery not guaranteed - Many networks do not provide guarantees of delivery, nonduplication of packets, or in order delivery of packets, ''e.g.'', the User Datagram ProtocolUDP protocol of the Internet protocol suiteInternet. However, it is possible to layer a transport protocol on top of the packet service which can provide such protection; Transmission Control ProtocolTCP is an example.The term frame (telecommunications)frame is sometimes used to refer to a packet exactly as transmitted over the wire or radio.
A practical illustration: the NASA Deep Space Network - The Consultative Committee for Space Data Systems (CCSDS) packet telemetry standard definesthe protocol used for the transmission of spacecraft instrument data over the deep-space channel. Under this standard, an image or other data set from a spacecraft instrument is transmitted using one or more packets.
CCSDS packet definition - A packet is a block of data with length that can vary between successive packets, ranging from 7to 65,542 bytes, including the packet header. Packetized data are transmitted via frames, which are fixed-length data blocks. The size of a frame, including frame header and control information, can range up to 2048 bytes. Packet sizes are fixed during the mission development phase. Because packet lengths are variable but frame lengths are fixed, packet boundaries usually do not coincide with frame boundaries.
Telecom processing notes - Data in a frame typically are protected from channel errors by error-correcting codes. Even when the channel errors exceed the correction capability of the error-correcting code, the presence of errors nearly always is detected by the error-correcting code or by a separate error-detecting code. Frames for which uncorrectable errors are detected are marked as undecodable and typically are deleted.
Handling data loss - Deleted undecodable whole frames are the principal type of data loss that affects compressed data sets. There generally would be little to gain from attempting to use compressed data from a frame marked as undecodable. When errors are present in a frame, the bits of the subband pixels already decoded before the first bit error will remain intact, but all subsequent decoded bits in the segment usually will be completely corrupted; a single bit error is often just as disruptive as many bit errors. Furthermore, compressed data usually are protected by powerful, long-blocklength error-correcting codes, which are the types of codes most likely to yield substantial fractions of bit errors throughout those frames that are undecodable.Thus, frames with detected errors would be essentially unusable even if they were not deleted by the frame processor.This data loss can be compensated for with the following mechnisms. If an erroneous frame escapes detection, the decompressor will blindly use the frame data as if they were reliable, whereas in the case of detected erroneous frames, the decompressor can base its reconstruction on incomplete, but not misleading, data. Fortunately, it is extremely rare for an erroneous frame to go undetected. For frames coded by the CCSDS Reed–Solomon code, fewer than 1 in 40,000 erroneous frames can escape detection. All frames not employing the Reed–Solomon code use a cyclic redundancy check (CRC) error-detecting code, which has an undetected frame-error rate of less than 1 in 32,000.
See also - Packet snifferPacket switchingGigapacketsCategory:Units of !informationCategory:Packetsda: Datapakkede:Datenpaketes:Datag ramaja:パケッ ;トpl:Pakiet? !telekomunikacyjnypt:pacotezh:å ˆ†ç»„
|
|
|