B

Back-to-back user agent. A SIP element that acts as a server toward one side and as a client toward the other, sitting in the call path as a PBX or session border controller does.

Plain language A SIP element acting as server toward one side and client toward the other, like a PBX or session border controller.

Used in RFC 3261 RFC 3323 RFC 3325 RFC 3665 RFC 3725 RFC 4354 RFC 4964 RFC 5079 RFC 5318 RFC 5359 RFC 5362 RFC 5363 RFC 5365 RFC 5369 RFC 5370 RFC 5503 RFC 5606 RFC 5630 RFC 5707 RFC 5853 RFC 6086 RFC 6230 RFC 6442 RFC 6714 and 28 more

A routing protocol defined in RFC 8966 that exchanges routes between neighbouring nodes using UDP. It uses both unicast and multicast communication.

Used in RFC 8966 RFC 8967 RFC 8968

OSPF Area 0 (0.0.0.0). Other areas connect to it, and traffic between areas passes through it.

Plain language OSPF Area 0 (0.0.0.0), the central area that other areas connect to and through which inter-area traffic flows.

Used in RFC 1131 RFC 1167 RFC 1247 RFC 1253 RFC 1583 RFC 1584 RFC 2178 RFC 2328 RFC 2370 RFC 3101 RFC 3509 RFC 4577 RFC 4750 RFC 4915 RFC 5088 RFC 5185 RFC 7524 RFC 9084

The path along which a server sends requests, such as NFS callbacks, back to a client. It can use its own connection or share the client's connection.

Used in RFC 8167 RFC 8881

The network connection from an edge node (such as a cellular base station or remote access point) back to the core network, typically using wired or wireless links like microwave radio.

Plain language The network connection from an edge node (like a base station) back to the core network.

Used in RFC 3057 RFC 8432

The ability of an extension to work correctly with older implementations that do not know about it, or to degrade gracefully when such implementations encounter it.

Plain language The ability of an extension to work with older implementations that do not know about it.

Used in RFC 4485 RFC 6709 RFC 9357

An optional resolver cache of data that failed DNSSEC validation, kept with a small TTL so persistent failures do not trigger endless re-queries.

Plain language An optional resolver cache of DNSSEC validation failures kept with a small TTL to prevent endless re-queries.

Used in RFC 4035 RFC 6840

A configurable limit on how much bandwidth the Class-Types it applies to may reserve on a link. DS-TE allows up to 8 of them per link, named BC0 to BC7.

Plain language A configurable limit on bandwidth that traffic classes may reserve on a link in traffic engineering.

Used in RFC 3556 RFC 4124 RFC 4125 RFC 4126 RFC 4128 RFC 9843

The link's data rate multiplied by its round-trip time. It is the amount of data that can be in flight on a path at once, so a large value means a fast, long-distance path.

Plain language The link's data rate multiplied by its round-trip time, showing how much data can be in flight simultaneously.

Used in RFC 1072 RFC 1185 RFC 1323 RFC 2488 RFC 3135 RFC 3481 RFC 5166 RFC 6077 RFC 6349 RFC 7323 RFC 8289 RFC 9438 RFC 9959

The caller starts speaking or pressing keys while a prompt is still playing. The system can then cut the prompt short so that the caller's input is handled promptly.

Used in RFC 3911 RFC 6787

Hexadecimal encoding, where each byte becomes two characters from 0-9 and A-F. It doubles the size of the data but is easy to read.

Plain language Hexadecimal encoding where each byte becomes two characters from 0-9 and A-F.

Used in RFC 3548 RFC 4425 RFC 4648 RFC 6920 RFC 7433 RFC 7434 RFC 8610 RFC 9741

An encoding that writes data using 32 characters (A-Z and 2-7), five bits at a time, with = padding to a multiple of 8 characters. It avoids lowercase letters and easily confused digits.

Plain language An encoding using 32 characters (A-Z and 2-7), five bits at a time, avoiding lowercase and easily confused digits.

Used in RFC 2938 RFC 3548 RFC 4648 RFC 5155 RFC 5801 RFC 9741

An encoding that turns every 3 octets into 4 printable characters from a 64-character alphabet, padding with = at the end. It makes data about 33 percent larger.

Plain language An encoding turning every 3 bytes into 4 printable characters from a 64-character alphabet.

Used in RFC 1341 RFC 1342 RFC 1421 RFC 1489 RFC 1494 RFC 1521 RFC 1522 RFC 1544 RFC 1554 RFC 1555 RFC 1557 RFC 1641 RFC 1740 RFC 1767 RFC 1844 RFC 1847 RFC 1848 RFC 1864 RFC 1947 RFC 2015 RFC 2045 RFC 2047 RFC 2048 RFC 2049 and 132 more

An encoding scheme that represents binary data using only 64 printable ASCII characters (A-Z, a-z, 0-9, +, /), commonly used in MIME for safe transmission.

Plain language An encoding using 64 printable ASCII characters to represent binary data safely in text systems.

Used in RFC 1522 RFC 1642 RFC 1734 RFC 2426 RFC 2554 RFC 2617 RFC 4134 RFC 4398 RFC 6031 RFC 7022

A URL-safe variant of Base64 from RFC 4648 using a different alphabet. DoH GET requests use it with the padding characters left out.

Plain language A URL-safe Base64 variant using a different alphabet suitable for web addresses.

Used in RFC 4648 RFC 6920 RFC 7493 RFC 7515 RFC 7516 RFC 7517 RFC 7518 RFC 7519 RFC 7520 RFC 7522 RFC 7636 RFC 7638 RFC 7797 RFC 7951 RFC 8037 RFC 8188 RFC 8225 RFC 8292 RFC 8417 RFC 8428 RFC 8473 RFC 8474 RFC 8484 RFC 8555 and 19 more

A form of Network Address Translation that changes only the IP addresses in the packets it forwards and leaves the TCP and UDP ports alone. Many applications that would break under port translation work with it.

Plain language A NAT that rewrites addresses but leaves port numbers alone.

Used in RFC 3235 RFC 7857

A subseries of RFCs recording community consensus on operational practice or IETF process, approved by the IESG after a Last-Call.

Plain language Best Current Practice, an RFC subseries recording community consensus on operational practices or IETF processes.

Used in RFC 1818 RFC 1915 RFC 2008 RFC 2014 RFC 2026 RFC 2028 RFC 2119 RFC 2148 RFC 2182 RFC 2219 RFC 2223 RFC 2277 RFC 2317 RFC 2360 RFC 2379 RFC 2505 RFC 2506 RFC 2606 RFC 2727 RFC 2827 RFC 2850 RFC 2870 RFC 2939 RFC 2978 and 135 more

A physical or logical link, wired or wireless, that connects a customer edge or site to a provider network. One or more attachment circuits may be hosted over the same bearer.

Plain language A physical or logical link (wired or wireless) connecting a customer to a provider network.

Used in RFC 9833 RFC 9834 RFC 9835

A security token that works for whoever holds it. The server does not ask the holder to prove who they are or to show a secret key, so the token must be kept private and sent only over protected connections.

Plain language A security token working for whoever holds it, requiring protection from unauthorized access.

Used in RFC 6749 RFC 6750 RFC 6819 RFC 7235 RFC 7519 RFC 7521 RFC 7522 RFC 7523 RFC 7591 RFC 7592 RFC 7628 RFC 7644 RFC 7662 RFC 7846 RFC 8030 RFC 8252 RFC 8471 RFC 8473 RFC 8485 RFC 8495 RFC 8628 RFC 8693 RFC 8705 RFC 8707 and 15 more

The Blocks Extensible Exchange Protocol, a framework in which peers exchange messages over numbered channels, each channel using a profile that defines its message types.

Plain language The Blocks Extensible Exchange Protocol, a framework where peers exchange messages over numbered channels.

Used in RFC 3081 RFC 3340 RFC 3341 RFC 3529 RFC 3620 RFC 3760 RFC 3767 RFC 3983 RFC 4227 RFC 4744

A named definition of how an application protocol uses a BEEP channel. Each profile is identified by a URI.

Plain language A named definition of how an application protocol uses a BEEP channel, identified by a URI.

Used in RFC 3288 RFC 3340 RFC 3349 RFC 4227

All the packets crossing a link that need the same Diff-Serv behavior. They are marked with the same Diff-Serv code point at the edge of the domain.

Plain language All packets crossing a link that need the same Diff-Serv treatment, marked with the same code point.

Used in RFC 2475 RFC 2996 RFC 3270 RFC 5127 RFC 5670 RFC 8622

The Basic Encoding Rules, a standard way of turning ASN.1 data into bytes. X.500 directories use it, and LDAP can use it for attribute values when asked.

Plain language The Basic Encoding Rules, a standard way of turning ASN.1 data into bytes.

Used in RFC 1065 RFC 1227 RFC 1229 RFC 2252 RFC 2253 RFC 2630 RFC 4514 RFC 4515 RFC 4522 RFC 6482 RFC 8351

A category of RFC documents that provide guidance and recommendations for internet operations, rather than specifying a protocol. Abbreviated BCP.

Plain language Guidelines on the best way to do something on the internet rather than a technical specification.

Used in RFC 2223 RFC 2900 RFC 3935 RFC 5000 RFC 7322 RFC 8700 RFC 8718 RFC 9389

A service model in which the network tries to deliver each packet but promises neither delivery, order nor timing. IP works this way, which is why RFC 1149 can say that loss of a carrier can be tolerated.

Plain language A service model where the network tries to deliver packets but promises no delivery, order, or timing.

Used in RFC 768 RFC 791 RFC 1149 RFC 1633 RFC 1755 RFC 2205 RFC 2211 RFC 2212 RFC 2213 RFC 2331 RFC 2379 RFC 2380 RFC 2381 RFC 2501 RFC 2597 RFC 2688 RFC 2702 RFC 2736 RFC 2814 RFC 2815 RFC 2914 RFC 2998 RFC 3086 RFC 3366 and 12 more

A network service model that treats all packets equally and makes no guarantees about delivery, latency, or reliability; each packet is forwarded on a best-effort basis.

Plain language A network service treating all packets equally with no guarantees about delivery or latency.

Used in RFC 2382 RFC 2386 RFC 2638 RFC 2816 RFC 2990 RFC 3387 RFC 8622 RFC 9956

A number used to identify a Bidirectional Forwarding Detection session or reflector endpoint. In S-BFD, nodes must know the discriminators reserved by other nodes, and they must be unique within an administrative domain.

Plain language A number identifying a Bidirectional Forwarding Detection session, which must be unique within a domain.

Used in RFC 5882 RFC 5883 RFC 7880 RFC 7882 RFC 7886

Border Gateway Protocol: the exterior routing protocol that networks use to exchange reachability for prefixes. Version 4 carries prefix lengths and so supports CIDR.

Plain language Border Gateway Protocol, the exterior routing protocol that networks use to exchange address reachability.

Used in RFC 923 RFC 1093 RFC 1102 RFC 1105 RFC 1125 RFC 1163 RFC 1164 RFC 1222 RFC 1238 RFC 1265 RFC 1266 RFC 1267 RFC 1268 RFC 1269 RFC 1299 RFC 1322 RFC 1364 RFC 1371 RFC 1380 RFC 1383 RFC 1397 RFC 1403 RFC 1467 RFC 1476 and 492 more

An optional feature that a BGP speaker announces when a session starts. Each side learns what the other supports before using the feature.

Plain language An optional feature a BGP speaker announces when a session starts.

Used in RFC 3107 RFC 3392 RFC 4760 RFC 5492 RFC 8277 RFC 8654 RFC 9072

A label attached to a BGP route that routers can match in policy to decide how to accept, filter or distribute it.

Plain language A label attached to a BGP route that routers match in policy to decide how to treat the route.

Used in RFC 1997 RFC 1998 RFC 3765 RFC 3882 RFC 4360 RFC 4384 RFC 5635 RFC 7454 RFC 7611 RFC 7947 RFC 7948 RFC 7999 RFC 8092 RFC 8549 RFC 8642 RFC 9494

A collection of autonomous systems that operates internally as multiple ASs but presents itself to external routers as a single AS, identified by a Confederation Identifier in the AS_PATH.

Plain language A group of autonomous systems operating internally as multiple ASs but presenting to outsiders as one.

Used in RFC 1997 RFC 3065 RFC 5065

A tag attached to a BGP route announcement that carries extra information, such as flags. Its type and sub-type codes are tracked in IANA registries.

Plain language A tag on a BGP route carrying extra information such as flags.

Used in RFC 7900 RFC 7902 RFC 8214 RFC 9047 RFC 9573 RFC 10018

An extension of BGP, often shortened to BGP-LS, that carries link-state and traffic engineering information to external components such as controllers.

Plain language An extension of BGP carrying link-state and traffic engineering information to external controllers.

Used in RFC 8413 RFC 8571 RFC 9857

A protocol that lets a router send copies of its BGP routing data to a monitoring station, so operators can watch routes without being a BGP peer.

Plain language A protocol letting a router send copies of its BGP routing data to a monitoring station.

Used in RFC 8671 RFC 9069 RFC 9232

Border Gateway Protocol - Link State, an extension that carries link-state topology information in BGP using Node, Link and Prefix NLRI types.

Plain language Border Gateway Protocol - Link State, an extension carrying topology information using Node, Link, and Prefix types.

Used in RFC 7399 RFC 7920 RFC 7926 RFC 8379 RFC 8795 RFC 8814 RFC 9085 RFC 9086 RFC 9087 RFC 9104 RFC 9247 RFC 9514 RFC 9552 RFC 9862

An extension to BGP in which routers digitally sign the routing announcements they send, so that receivers can verify them with public keys published in the RPKI.

Plain language An extension to BGP where routers digitally sign route announcements for verification with public keys.

Used in RFC 8207 RFC 8209 RFC 8211 RFC 8374 RFC 8635

A summary of a publication containing metadata such as title, authors, publication date, and retrieval information, similar to a library catalog card.

Used in RFC 1357 RFC 1807

An attack in which a man-in-the-middle manipulates a negotiation so that both sides use a weaker mechanism than the strongest one they both support.

Plain language An attack where a man-in-the-middle tricks both sides into using a weaker mechanism than both support.

Used in RFC 4016 RFC 4567 RFC 5448

A protocol that lets two routers detect a failure of the forwarding path between them. It is abbreviated BFD and defined in RFC 5880.

Plain language A protocol letting two routers quickly detect a failure of the forwarding path between them.

Used in RFC 5641 RFC 5880 RFC 5882 RFC 5883 RFC 5884 RFC 5994 RFC 6213 RFC 7130 RFC 7174 RFC 7431 RFC 7487 RFC 7880 RFC 8562 RFC 8564 RFC 8924 RFC 8971 RFC 9026 RFC 9127 RFC 9247 RFC 9314 RFC 9355 RFC 9468 RFC 9612 RFC 9634 and 3 more

A lightweight protocol in which two neighbors exchange frequent packets to detect quickly that the path between them has failed.

Plain language A protocol where two neighbors exchange frequent packets to detect path failures quickly.

Used in RFC 5881 RFC 5882 RFC 5884 RFC 6428 RFC 7175 RFC 7331 RFC 7419 RFC 7726 RFC 7885 RFC 8563 RFC 9186 RFC 9521 RFC 9764 RFC 9986

Text that mixes left-to-right and right-to-left content on the same line, such as Hebrew words mixed with English in a single sentence.

Plain language Text mixing left-to-right and right-to-left content on the same line.

Used in RFC 1556 RFC 2070 RFC 3454 RFC 3987

Bit Index Explicit Replication, a multicast forwarding architecture that needs no explicit tree-building protocol and no per-tree multicast state in intermediate routers.

Plain language Bit Index Explicit Replication, a multicast forwarding architecture needing no tree-building protocol.

Used in RFC 8279 RFC 8296 RFC 8401 RFC 8444 RFC 8556 RFC 9272 RFC 9573 RFC 9624 RFC 9793

A way of writing a multi-byte number with the most significant byte first. It is also called network order.

Plain language Storing a multi-byte number with the most significant byte first, also called network order.

Used in RFC 1014 RFC 1060 RFC 1132 RFC 1188 RFC 1761 RFC 1832 RFC 3072 RFC 4194 RFC 4506 RFC 6234 RFC 8010 RFC 8949

A mathematical map on elliptic curve points that is linear in both of its inputs and efficiently computable. It is believed hard to invert and underlies identity-based encryption schemes.

Plain language A mathematical map on elliptic curve points that is linear in both inputs and efficiently computable.

Used in RFC 5091 RFC 6508

The association between a mobile node's home address and its current care-of address, registered with a correspondent node to enable direct communication.

Plain language The association between a mobile node's home address and its current location.

Used in RFC 4866 RFC 5842 RFC 7473

A layer-2 attribute, such as a switch port, that is tied to an IP address so a device can tell which attachment point may legitimately use that address as a source.

Plain language A layer-2 attribute (like a switch port) tied to an IP address to legitimize its use.

Used in RFC 6620 RFC 6959 RFC 7039 RFC 7219 RFC 7513

A table kept by home agents and correspondent nodes that maps a mobile node's home address to its current care-of address, along with how long the entry remains valid.

Plain language A table mapping a mobile node's home address to its current location with validity duration.

Used in RFC 4225 RFC 5380 RFC 6275 RFC 6612 RFC 6757

A record maintained by a mobility anchor that maps a mobile node's home address to its current care-of address and associated forwarding tunnels.

Plain language A record mapping a mobile node's home address to its current location and associated tunnels.

Used in RFC 5845 RFC 5846 RFC 6058

A number that names one of the care-of addresses registered for a mobile node, so that traffic can be pointed at that address.

Plain language A label for one of the addresses a mobile node registered, so rules can name it.

Used in RFC 6089 RFC 7629

A SID bound to an SR Policy. A packet that arrives carrying it is steered into the policy, so the whole segment list is attached from one value.

Plain language A SID bound to an SR Policy, steering packets into the policy as a shortcut.

Used in RFC 8402 RFC 9256 RFC 9604 RFC 9857 RFC 9862 RFC 9933 RFC 9960

A message sent by a mobile node to its home agent to register or refresh its current location (care-of address).

Plain language A message a mobile node sends to register or refresh its current location with its home agent.

Used in RFC 3963 RFC 4260 RFC 4283 RFC 4487 RFC 4877 RFC 5149 RFC 5380 RFC 5555 RFC 5648 RFC 5779 RFC 6089 RFC 6097

A session at an IETF meeting used to explore whether an issue merits a working group. It allows market research and technical brainstorming.

Plain language An IETF session exploring whether an issue merits a working group.

Used in RFC 2418 RFC 6756

An attack that exploits the birthday paradox: when many identical queries are outstanding, a forged reply only has to match any one of them. This raises its chance of success.

Plain language An attack exploiting the birthday paradox: with many outstanding queries, a forged reply only needs to match one.

Used in RFC 4344 RFC 4868 RFC 5452

The table a BIER router uses to forward BIER packets. It is derived from the unicast forwarding table by adding BIER-specific information.

Plain language The Bit Index Forwarding Table used by BIER routers, derived from the unicast forwarding table.

Used in RFC 9262 RFC 9793

A string of bits in which each bit position stands for one item or option. A bit set to 1 selects that item, and a bit set to 0 leaves it out.

Plain language A string of bits where each position represents an item, with 1 selecting it and 0 omitting it.

Used in RFC 1731 RFC 9436 RFC 9479 RFC 9492

A router that supports BIER. Depending on the packet, it may be the ingress, an egress or a transit router in the BIER domain.

Used in RFC 8279 RFC 8401

A DNS label type that compactly holds a sequence of up to 256 One-Bit Labels, so records can be stored at any bit boundary.

Plain language A DNS label type compactly holding up to 256 one-bit labels for bit-boundary DNS records.

Used in RFC 2673 RFC 2874

Inserting an extra bit into a data stream so that data is not mistaken for a control sequence. In PPP with HDLC-like framing, a 0 bit goes after five contiguous 1 bits.

Plain language Inserting an extra bit into a data stream to prevent data from being mistaken for a control sequence.

Used in RFC 935 RFC 4814

The string of bits carried in a BIER packet header. Routers read the set bits to decide which copies to make and where to send them.

Used in RFC 8296 RFC 9262

A routing failure in which packets for a destination are sent towards a router that has no working route for them, so they are lost instead of delivered.

Plain language A routing failure where packets destined for a network are sent to a router with no working route.

Used in RFC 5635 RFC 7908 RFC 8899 RFC 8966 RFC 9869

A digital signature on data that the signer does not see, created by using cryptographic blinding to encrypt the data before signing and then removing the encryption from the signature.

Plain language A digital signature on data the signer does not see, created using cryptographic blinding.

Used in RFC 5636 RFC 8816 RFC 9576 RFC 9578

A chunk of immutable binary data, such as an attachment, referred to by an id. The id stands only for the bytes, not for a file name or content type.

Plain language A chunk of immutable binary data referred to by an ID without caring about filename or type.

Used in RFC 8620 RFC 9404

An encryption algorithm that works on fixed-size blocks of data using a secret key. Camellia is an example.

Plain language An encryption algorithm working on fixed-size blocks of data using a secret key.

Used in RFC 2040 RFC 2144 RFC 2268 RFC 2451 RFC 2994 RFC 3566 RFC 3602 RFC 3686 RFC 3713 RFC 4162 RFC 4196 RFC 4269 RFC 4312 RFC 5529 RFC 5647 RFC 5669 RFC 5794 RFC 5830 RFC 5932 RFC 6209 RFC 7253 RFC 7321 RFC 7366 RFC 7801 and 3 more

A CoAP mechanism that splits a large message into numbered blocks, each sent and acknowledged separately, so that no single packet is too big for the network.

Plain language A CoAP mechanism splitting large messages into numbered blocks sent and acknowledged separately.

Used in RFC 7959 RFC 9148 RFC 9177 RFC 9362

Backus-Naur Form, an older notation for describing the grammar of a language using named rules. ABNF is a modified version of it.

Plain language Backus-Naur Form, an older notation for describing language grammar using named rules.

Used in RFC 31 RFC 138 RFC 493 RFC 561 RFC 645 RFC 680 RFC 1459 RFC 1630 RFC 1738 RFC 1857 RFC 2088 RFC 2156 RFC 2234 RFC 2360 RFC 2654 RFC 4234 RFC 4506 RFC 5234 RFC 5511 RFC 6510

The Bootstrap Protocol. Built on UDP and IP, it lets a client learn its IP address and a boot file from a server, and requests can be relayed across routers.

Plain language The Bootstrap Protocol, letting a client learn its IP address and boot file from a server.

Used in RFC 903 RFC 950 RFC 951 RFC 1048 RFC 1060 RFC 1084 RFC 1123 RFC 1256 RFC 1350 RFC 1395 RFC 1497 RFC 1531 RFC 1532 RFC 1533 RFC 1534 RFC 1541 RFC 1542 RFC 2131 RFC 2132 RFC 2226 RFC 2827 RFC 3011 RFC 3074 RFC 3396 and 6 more

The start-up process of a computer, from power-on to a running operating system. Network bootstrapping adds steps: find an address, then fetch a boot image from a server.

Plain language The start-up process of a computer from power-on to running operating system.

Used in RFC 903 RFC 906 RFC 950 RFC 951 RFC 1123 RFC 1350 RFC 4108 RFC 4578 RFC 5030 RFC 5637 RFC 5694 RFC 5859 RFC 5884 RFC 5970 RFC 6080 RFC 6610 RFC 6611 RFC 6696 RFC 7484 RFC 7890 RFC 8366 RFC 8521 RFC 8572 RFC 8576 and 5 more

A PIM router elected from among Candidate-BSRs. It collects the Candidate-RP advertisements and distributes the resulting group-to-RP mappings in Bootstrap messages.

Plain language A PIM router elected to collect Candidate-RP advertisements and distribute group-to-RP mappings.

Used in RFC 2189 RFC 2934 RFC 5059 RFC 5240 RFC 7761

A general algorithm that lets a string of basic code points uniquely and reversibly represent any string of code points from a larger set. Punycode is one setting of its parameters.

Plain language A general algorithm representing any string using only code points from a smaller basic set.

Used in RFC 3492 RFC 5137

A router that exchanges routing information with other domains using exterior routing protocols like BGP or IDRP, typically at the edge of a network domain.

Plain language A router at the edge of a network domain that exchanges routing information with other domains.

Used in RFC 1863 RFC 7102 RFC 8105 RFC 8243

A collection of compromised machines running software robots under a common command and control infrastructure. Their owners are often unaware of them.

Plain language A collection of compromised machines running software under shared command and control.

Used in RFC 4732 RFC 4778 RFC 4948 RFC 5070 RFC 5635 RFC 6545 RFC 6561

A boundary node is a router at the edge of a domain: an area border router between IGP areas, or an AS border router between Autonomous Systems.

Plain language A router at the edge of a domain between IGP areas or between autonomous systems.

Used in RFC 1126 RFC 5441 RFC 7334

A set of standardized elliptic curve groups generated in a verifiably pseudo-random way and compliant with ISO, ANSI, NIST, and SEC standards, offering an alternative to NIST curves.

Plain language A set of standardized elliptic curve groups compliant with ISO, ANSI, NIST, and SEC standards.

Used in RFC 6954 RFC 7027

A device that passes packets through with the data field unmodified, usually from one Ethernet segment to another or from Ethernet to token ring.

Plain language A device passing packets from one network segment to another without changing the data.

Used in RFC 1329 RFC 1356 RFC 1525 RFC 2097 RFC 2674 RFC 3619 RFC 4188 RFC 4363 RFC 5154 RFC 6165 RFC 7623

A message sent by bridges to exchange spanning tree information, used to elect the root bridge and compute tree topology.

Plain language A message sent by bridges to exchange spanning tree information and compute topology.

Used in RFC 3518 RFC 5556

A message sent to every host on a network segment at once. On Ethernet the destination is the all-ones address FF:FF:FF:FF:FF:FF. Routers normally do not forward link-layer broadcasts.

Plain language A message sent to every device on a network segment at once.

Used in RFC 824 RFC 826 RFC 828 RFC 887 RFC 894 RFC 903 RFC 906 RFC 917 RFC 919 RFC 922 RFC 925 RFC 947 RFC 950 RFC 951 RFC 966 RFC 985 RFC 995 RFC 1001 RFC 1027 RFC 1042 RFC 1044 RFC 1057 RFC 1058 RFC 1062 and 114 more

A network segment where all devices can reach each other with a broadcast frame at the data link layer. Routers separate broadcast domains.

Plain language A network segment where all devices can reach each other with a broadcast frame.

Used in RFC 3069 RFC 4840 RFC 5517 RFC 9469 RFC 9573

An attack that tries every possible key until the right one is found. Its cost grows with the number of possible keys, so each added key bit doubles the work.

Plain language An attack trying every possible key until finding the right one.

Used in RFC 2577 RFC 3607 RFC 3766 RFC 4772

A condition where more data arrives than the available memory space can hold, causing data loss or system errors.

Plain language A condition where more data arrives than available memory space can hold.

Used in RFC 59 RFC 1135

A condition where large buffers in network equipment cause excessive queueing delay and poor latency, even when the link has available bandwidth.

Plain language Large buffers in network equipment causing excessive queueing delay and poor latency.

Used in RFC 2309 RFC 7295 RFC 7536 RFC 7928 RFC 8033 RFC 8034 RFC 8289 RFC 8290 RFC 8337 RFC 8868 RFC 9743 RFC 9956

In Multi-link PPP, a collection of multiple connections grouped together and reassembled into a single stream at the bundle head.

Plain language In Multi-link PPP, multiple connections grouped and reassembled into a single stream.

Used in RFC 2701 RFC 4838 RFC 5050 RFC 6927 RFC 7130 RFC 8848 RFC 9171 RFC 9172 RFC 9174

A set of SDP media sections that share a single transport and one set of transport attributes. All RTP-based media in the group belong to one RTP session.

Plain language A set of SDP media sections sharing a single transport and one set of transport attributes.

Used in RFC 8859 RFC 9143

The application-layer protocol of Delay-Tolerant Networking. It builds a store-and-forward overlay network that moves messages called bundles.

Plain language The application-layer protocol of delay-tolerant networking, moving messages called bundles store-and-forward.

Used in RFC 7242 RFC 9172 RFC 9891

A kind of TE link that binds the traffic of a group of one or more TE links into a single subinterface. Its traffic counters are cumulative for everything it binds.

Plain language A TE link binding traffic from multiple TE links into a single subinterface.

Used in RFC 4201 RFC 4220

A pre-built backup LSP that carries traffic around a failed link or node and rejoins the protected path further along.

Plain language A pre-built backup LSP carrying traffic around a failed link or node.

Used in RFC 4090 RFC 8271 RFC 8537 RFC 8679 RFC 8796

The character U+FEFF placed at the start of text. Its encoded bytes can signal which Unicode encoding the text uses.

Plain language The character U+FEFF placed at the start of text to signal which Unicode encoding it uses.

Used in RFC 3023 RFC 3076 RFC 3629 RFC 5198 RFC 7303 RFC 9239

The service TCP offers applications: an ordered sequence of bytes with no message boundaries. TCP may split or combine the bytes into segments however it likes.

Plain language The service TCP offers: an ordered sequence of bytes with no message boundaries.

Used in RFC 107 RFC 176 RFC 285 RFC 793 RFC 1005 RFC 1006 RFC 1007 RFC 1013 RFC 1057 RFC 1952 RFC 2126 RFC 2398 RFC 2781 RFC 5044 RFC 8673 RFC 8922 RFC 9407 RFC 9621 RFC 9622

A trick for multi-line replies: a line that begins with the termination period gets an extra period put in front, and the receiver removes it, so a data line is never mistaken for the end marker.

Plain language Adding an extra character to prevent a data line from being mistaken for a termination marker.

Used in RFC 891 RFC 935 RFC 1055 RFC 1331 RFC 1662 RFC 1939 RFC 2171 RFC 2175 RFC 2615 RFC 2687 RFC 2688 RFC 4425 RFC 4814