enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Packet aggregation - Wikipedia

    en.wikipedia.org/wiki/Packet_aggregation

    The ITU-T G.hn standard, which provides a way to create a high-speed (up to 1 Gigabit/s) Local area network using existing home wiring (power lines, phone lines and coaxial cables), is an example of a protocol that employs packet aggregation to increase efficiency.

  3. Multi-chassis link aggregation group - Wikipedia

    en.wikipedia.org/wiki/Multi-chassis_link...

    A LAG is a method of inverse multiplexing over multiple Ethernet links, thereby increasing bandwidth and providing redundancy. It is defined by the IEEE 802.1AX-2008 standard, which states, "Link Aggregation allows one or more links to be aggregated together to form a Link Aggregation Group, such that a MAC client can treat the Link Aggregation Group as if it were a single link."

  4. Link aggregation - Wikipedia

    en.wikipedia.org/wiki/Link_aggregation

    Link aggregation between a switch and a server In computer networking , link aggregation is the combining ( aggregating ) of multiple network connections in parallel by any of several methods. Link aggregation increases total throughput beyond what a single connection could sustain, and provides redundancy where all but one of the physical ...

  5. Packet concatenation - Wikipedia

    en.wikipedia.org/wiki/Packet_concatenation

    Packet concatenation is a computer networking optimization that coalesces multiple packets under a single header. The use of packet containment reduces the overhead at the physical and link layers. [ 1 ]

  6. Multi-link trunking - Wikipedia

    en.wikipedia.org/wiki/Multi-link_trunking

    Multi-link trunking (MLT) is a link aggregation technology developed at Nortel in 1999. It allows grouping several physical Ethernet links into one logical Ethernet link to provide fault-tolerance and high-speed links between routers, switches, and servers.

  7. Nagle's algorithm - Wikipedia

    en.wikipedia.org/wiki/Nagle's_algorithm

    Nagle's algorithm works by combining a number of small outgoing messages and sending them all at once. Specifically, as long as there is a sent packet for which the sender has received no acknowledgment, the sender should keep buffering its output until it has a full packet's worth of output, thus allowing output to be sent all at once.

  8. pcap - Wikipedia

    en.wikipedia.org/wiki/Pcap

    The pcap API is written in C, so other languages such as Java, .NET languages, and scripting languages generally use a wrapper; no such wrappers are provided by libpcap or WinPcap itself. C++ programs may link directly to the C API or make use of an object-oriented wrapper.

  9. PME Aggregation Function - Wikipedia

    en.wikipedia.org/wiki/PME_Aggregation_Function

    The PME Aggregation function was first defined in IEEE 802.3ah in 2004. The original Loop Aggregation proposal was submitted by Klaus Fosmark from now defunct First Mile Systems in 2001. [1] It was later referenced by ITU-T G.998.2 (Ethernet-based multi-pair bonding) and its ANSI equivalent NIPP-NAI T1.427.02.