Keyed User Datagram Protocol: Concepts and Operation of an Almost Reliable Connectionless Transport Protocol

Abstract

Departing from the well-known problem of the excessive overhead and latency of connection oriented protocols, this paper describes a new almost reliable connectionless protocol that uses user datagram protocol (UDP) segment format and is UDP compatible. The problem is presented and described, the motivation, the possible areas of interest and the concept and base operation modes for the protocol named keyed UDP are presented (here called KUDP). Also, discussed are some of the possible manners in which the KUDP can be used, addressing potential problems related with current networking technologies. As UDP is a connectionless protocol, and KUDP allows for some degree of detection of loss and re-ordering of segments received out-of-sequence, we also present a proposal for a stream reconstruction algorithm. This paper ends by mentioning some of the research issues that still need to be addressed.INDEX TERMS User datagram protocol, almost reliable protocol, data transmission statistics in UDP, algorithms for data traffic.

NS2 – Based Experimental Analysis of Throughput for TCP and UDP Traffic During Link Failure of The Network

“…UDP is a 'connectionless' protocol that operates at the transport layer [16]. The length, beginning of the port location, objective port location, and the checksum fields are all 8 bytes in a User Datagram Protocol header.…”

Appropriate buffer sizes for Internet nodal devices: A networks' topologies–based solution

“…We term situations where MNBC i < 20 L as very tiny buffers. Since a typical subnetwork will consist of as a minimum, two nodes (as a node cannot be standing on its own in the Internet-it must, in the context of guided media-linked Internet, be connected to at least one other node), and a maximum, which depends on the structure (topology) of the subnetwork: using the extended Ethernet frame length (12 240 bits), shown in Figure 10 (Ethernet-based networks now operate on switching principles), 21 we present in Table 2 specified buffer capacities for star point node, for subnetworks consisting of two to five nodes. Subnetworks with more than T A B L E 2 MBCs computed for star point nodes for subnets with two to five nodes, for some σ = xL, using Ethernet frames…”