Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Datagram

From Wikipedia, the free encyclopedia
(Redirected fromIP datagram)
Basic data transfer unit associated with a packet-switched network

Adatagram is a basic transfer unit associated with apacket-switched network. Datagrams are typically structured inheader andpayload sections. Datagrams provide aconnectionless communication service across a packet-switched network. The delivery, arrival time, and order of arrival of datagrams need not be guaranteed by the network.

History

[edit]
See also:Packet switching § History

In the early 1970s, the termdatagram was created by combining the wordsdata andtelegram by theCCITT rapporteur on packet switching,[1]Halvor Bothner-By.[2][3] While the word was new, the concept had already a long history.

In 1964,Paul Baran described, in aRAND Corporation report, a hypothetical military network having to resist a nuclear attack. Small standardizedmessage blocks, bearing source and destination addresses, werestored and forwarded in computer nodes of a highly redundant meshed computer network. Baran wrote: "The network user who has called up avirtual connection to an end station and has transmitted messages ... might also view the system as a black box providing an apparent circuit connection".[4] The concept of what we now call avirtual circuit appears in the design,[5] although no network was built.

In 1967,Donald Davies published a seminal article in which he introduced thepacket andpacket switching. His proposed core network is similar to the one proposed by Paul Baran though developed independently. He assumes that "all users of the network will provide themselves with some kind of error control". His target is a "common-carrier communication network". To support remote access to computer services by user terminals, which at that time were transmitted character by character, he included, at the network periphery, interface computers that convert character flows into packet flows and vice versa.[6] Davies wrote: "we were really rather against the virtual circuit, because we believed that a communication network should only concern itself with packets, and that any protocols involved in assembling these packets should be done end-to-end, between the customers themselves."[5]

In 1970, Lawrence Roberts and Barry D. Wessler published an article aboutARPANET, the first multi-node packet-switching network.[7] An accompanying paper described its switching nodes (theIMPs) and its packet formats.[8] The network core performed datagram switching as in Baran's and Davies' model, but the service offered to hosts by the network wasconnection oriented.[9][10] A reliable message transfer service was thus offered to user computers, thus greatly simplifying the network design. This made the ARPANET what would come to be called avirtual circuit network.[11]

Roberts presented the idea of packet switching to the communication professionals and faced anger and hostility. Before ARPANET was operating, they argued that the router buffers would quickly run out. After the ARPANET was operating, they argued packet switching would never be economic without the government subsidy. Baran faced the same rejection and thus failed to convince the military to construct a packet-switching network.[12]

In 1973,Louis Pouzin presented his design forCYCLADES, the first large-scale network implementing the pure Davies datagram model.[13] The CYCLADES team has thus been the first to tackle the highly complex problem of providing user applications a reliablevirtual circuit service[14] while using theend-to-end principle in a network service known to possibly produce non-negligible datagram losses and reordering.[15] Although Pouzin's concern "in a first stage is not to make breakthrough [sic] in packet switching technology, but to build a reliable communications tool for Cyclades",[13] two members of his team,Hubert Zimmerman andGérard Le Lann, made significant contributions to the design of Internet's TCP thatVint Cerf, its main designer, acknowledged.[16]

In 1981, the Defense Advanced Research Projects Agency (DARPA) issued the first specification theInternet Protocol (IP). It introduced a major evolution of the datagram concept:fragmentation.[17] With fragmentation, some parts of the global network may use large packet size (typicallylocal area networks to minimize processing overhead), while some others may impose smaller packet sizes (typicallywide area networks to minimize response time). Network nodes may fragment a datagram into several smaller packets.

In 1999, theInternet Engineering Task Force (IETF) sanctioned the use of the already largely deployednetwork address translation (NAT) whereby each public address can be shared by several private devices.[18] With it, the forthcomingInternet Address exhaustion was delayed, leaving enough time to introduceIPv6, the new generation of Internet Protocol supporting longer addresses. The initial principle of fullend to end network transparency to datagrams was for this relaxed: NAT nodes had to manage per-connection states, making them in partconnection oriented.

In 2015, theIETF upgraded itsinformational 1998 RFC 2309[19] that datagram switching nodes performactive queue management, to make it a stronger and more detailedbest current practice recommendation through the publication of RFC 7567. While the initial datagram queueing model was simple to implement and needed no more tuning than queue lengths, support of more sophisticated and parametrized mechanisms were found necessary "to improve and preserve Internet performance" (RED,ECN etc.). Further research on the subject was also called for, with a list of identified items.[20]

Definition

[edit]

The termdatagram is defined as follows:[21]

"A self-contained, independent entity of data carrying sufficient information to be routed from the source to the destination computer without reliance on earlier exchanges between this source and destination computer and the transporting network."

— RFC 1594

A datagram needs to be self-contained without reliance on earlier exchanges because there is no connection of fixed duration between the two communicating points as there is, for example, in most voice telephone conversations.[22]

Datagram service is often compared to a mail delivery service; the user only provides the destination address but receives no guarantee of delivery, and no confirmation upon successful receipt. Datagram service is therefore consideredunreliable. Datagram service routes datagrams without first creating a predetermined path. Datagram service is therefore consideredconnectionless. There is also no consideration given to the order in which it and other datagrams are sent or received. In fact, many datagrams in the same group can travel along different paths before reaching the same destination in adifferent order.[23]

Structure

[edit]

Each datagram has two components, aheader and a datapayload. The header contains all the information sufficient for routing from the originating equipment to the destination without relying on prior exchanges between the equipment and the network. Headers may include source and destination addresses as well astype and length fields. The payload is the data to be transported. This process of nesting data payloads in a tagged header is calledencapsulation.

Examples

[edit]
Datagram nomenclature
OSI layerName
Layer 4TCP segment
Layer 3Network packet
Layer 2Ethernet frame (IEEE 802.3)
Wireless LAN frame (IEEE 802.11)
Layer 1Chip (CDMA)

Internet Protocol

[edit]

TheInternet Protocol (IP) defines standards for several types of datagrams. Theinternet layer is a datagram service provided by an IP. For example,UDP is run by a datagram service on the internet layer. IP is an entirely connectionless, best effort, unreliable, message delivery service.TCP is a higher-level protocol running on top of IP that provides a reliable connection-oriented service.

See also

[edit]

References

[edit]
  1. ^Bothner, H. (1975)."The CCITT studies packet switching as part of public data network development".ACM SIGCOMM Computer Communication Review.5 (2):9–17.doi:10.1145/1024916.1024918.
  2. ^Rémi Després (November 2010)."X.25 virtual circuits — Transpac in France — Pre-Internet data networking".IEEE Communications Magazine.48 (10).doi:10.1109/MCOM.2010.5621965.
  3. ^"Comment j'ai inventé le Datagramme" (in French). Archived fromthe original on 2019-02-28.
  4. ^"On distributed communications networks"(PDF). Archived fromthe original(PDF) on 2016-10-26.
  5. ^abPelkey, James L. (May 27, 1988)."Interview of Donald Davies"(PDF). p. 7.
  6. ^"A digital communication network for computers giving rapid response at remote terminals"(PDF).Archived(PDF) from the original on 2022-10-09.
  7. ^Lawrence Roberts; Barry D. Wessler (1970)."Computer network development to achieve resource sharing".Proceedings of the May 5-7, 1970, spring joint computer conference on - AFIPS '70 (Spring). p. 543.doi:10.1145/1476936.1477020.S2CID 9343511.
  8. ^Frank E Heart; R E Kahn; Severo M Ornstein; William R Crowther; David C Walden (1970)."The interface message processor for the ARPA computer network".Proceedings of the May 5-7, 1970, spring joint computer conference on - AFIPS '70 (Spring). pp. 551–567.doi:10.1145/1476936.1477021.ISBN 978-1-4503-7903-8.S2CID 9647377.
  9. ^"INTERFACE MESSAGE PROCESSOR Specifications for the Innterconnection of a Host"(PDF). January 2014.three parameters uniquely specify a connection between source and destination Hosts." "The destination IMP returns a positive acknowledgment for receipt of the message to the source IMP, which in turn passes this acknowledgment to the source Host." "Each link is unidirectional and is controlled by the network so that no more than one message at a time may be sent over it.
  10. ^Pelkey, James."8.4 Transmission Control Protocol (TCP) 1973-1976".Entrepreneurial Capitalism and Innovation: A History of Computer Communications 1968–1988.Arpanet had its deficiencies, however, for it was neither a true datagram network nor did it provide end-to-end error correction.
  11. ^"An Interview with LOUIS POUZIN Conducted by Andrew L. Russell"(PDF). April 2012.Arpanet was virtual circuit." "essentially a virtual circuit service using internal datagram
  12. ^Roberts, L. (1988-01-01),"The arpanet and computer networks",A history of personal workstations, New York, NY, USA: Association for Computing Machinery, pp. 141–172,doi:10.1145/61975.66916,ISBN 978-0-201-11259-7, retrieved2023-11-30
  13. ^abPouzen, Louis."Presentation and major design aspects of the Cyclades network". Archived fromthe original on September 27, 2007.
  14. ^Extending TCP for transactions -- Concepts.doi:10.17487/RFC1379.RFC1379.
  15. ^Bennett, Richard (September 2009)."Designed for Change: End-to-End Arguments, Internet Innovation, and the Net Neutrality Debate"(PDF). Information Technology and Innovation Foundation. pp. 7, 11. Retrieved11 September 2017.
  16. ^V. Cerf;Y. Dalal; C. Sunshine (December 1974).SPECIFICATION OF INTERNET TRANSMISSION CONTROL PROGRAM. Network Working Group.doi:10.17487/RFC0675.RFC675.Obsolete. Obsoleted byRFC 7805. NIC 2. INWG 72.
  17. ^J. Postel, ed. (September 1981).INTERNET PROTOCOL - DARPA INTERNET PROGRAM PROTOCOL SPECIFICATION.IETF.doi:10.17487/RFC0791. STD 5. RFC791. IEN 128, 123, 111, 80, 54, 44, 41, 28, 26.Internet Standard 5. ObsoletesRFC 760. Updated byRFC 1349,2474 and6864.
  18. ^P. Srisuresh; M. Holdrege (August 1999).IP Network Address Translator (NAT) Terminology and Considerations. Network Working Group.doi:10.17487/RFC2663.RFC2663.Informational.
  19. ^Zhang, Lixia; Partridge, Craig; Shenker, Scott; Wroclawski, John T.; Ramakrishnan, K. K.; Peterson, Larry; Clark, David D.; Minshall, Greg; Crowcroft, Jon (1998-04-01)."Recommendations on Queue Management and Congestion Avoidance in the Internet". Internet Engineering Task Force. RFC 2309.
  20. ^F. Baker; G. Fairhurst, eds. (July 2015).IETF Recommendations Regarding Active Queue Management.Internet Engineering Task Force.doi:10.17487/RFC7567.ISSN 2070-1721. BCP 197. RFC7567.Best Current Practice 197. ObsoletesRFC 2309.
  21. ^A. Marine;J. Reynolds; G. Malkin (March 1994).FYI on Questions and Answers - Answers to Commonly asked "New Internet User" Questions. Network Working Group.doi:10.17487/RFC1594. FYI 4. RFC1594.Obsolete. Obsoleted byRFC 2664. ObsoletesRFC 1325.
  22. ^Tanenbaum, Andrew S.; Wetherall, David J. (2011).Computer networks, fifth edition. Pearson. p. 59.ISBN 978-0-13-255317-9.
  23. ^Packet Reordering Metrics. November 2006.doi:10.17487/RFC4737.RFC4737.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Datagram&oldid=1277004641#Internet_Protocol"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp