Abstract: A network appliance that is part of a distributed virtual switch collects network flow information for network flows passing through the network appliance. The network flow information is encapsulated into packets as a data record for transport. Network flow exporter type information is added to the network flow records configured to indicate that the packets are from a distributed exporter. An option template is sent to the network flow data collectors that includes a device identifier that is configured to uniquely identify the network appliance. The packets are exported to the network flow data collector. The network flow data collector uses the network flow exporter type information and the device identifier to associate the network flow information with the distributed virtual switch.

Abstract: In an example embodiment disclosed herein, Wide Area Network optimization modules coupled to peers are configured to maintain peer routing tables. The peer routing table (PRT) is used by the Wide Area Network optimization module to determine the peer for a given destination, such as an Internet Protocol “IP” destination. Each peer is responsible for advertising to other peers which networks the peer is able to reach. This information is advertised when a tunnel is first created and subsequently whenever necessary. Initially, a peer sends out a list of entries corresponding to its directly connected networks, with the exception of the network connected to the interface on which the peer is advertising (e.g. the network used for the tunnel). This enables other peers on the network to populate their PRT entries.

Abstract: Described herein is a flow control scheme suitably adaptable to Transmission Control Protocol (TCP) and Stream Control Transmission Protocol (SCTP). In an example embodiment, the guaranteed and maximum allowable bandwidths are employed to determine the size of the congestion window. For example, the flow congestion window size starts proportional to the guaranteed bandwidth and increases until reaching the maximum allowable bandwidth. In particular embodiments, a fixed value is used for determining how fast the congestion window increases. For example the congestion window may increase exponentially while the current size of the congestion window is at or below a fixed value, and increase linearly when the current size of the congestion window is above the fixed value. In an example embodiment, the fixed value does not change even if a collision is detected and the current amount of unacknowledged data allowed is reset to an initial value.

Abstract: In an example embodiment disclosed herein, Wide Area Network optimization modules coupled to peers are configured to maintain peer routing tables. The peer routing table (PRT) is used by the Wide Area Network optimization module to determine the peer for a given destination, such as an Internet Protocol “IP” destination. Each peer is responsible for advertising to other peers which networks the peer is able to reach. This information is advertised when a tunnel is first created and subsequently whenever necessary. Initially, a peer sends out a list of entries corresponding to its directly connected networks, with the exception of the network connected to the interface on which the peer is advertising (e.g. the network used for the tunnel). This enables other peers on the network to populate their PRT entries.

Abstract: Described herein is a flow control scheme suitably adaptable to Transmission Control Protocol (TCP) and Stream Control Transmission Protocol (SCTP). In an example embodiment, the guaranteed and maximum allowable bandwidths are employed to determine the size of the congestion window. For example, the flow congestion window size starts proportional to the guaranteed bandwidth and increases until reaching the maximum allowable bandwidth. In particular embodiments, a fixed value is used for determining how fast the congestion window increases. For example the congestion window may increase exponentially while the current size of the congestion window is at or below a fixed value, and increase linearly when the current size of the congestion window is above the fixed value. In an example embodiment, the fixed value does not change even if a collision is detected and the current amount of unacknowledged data allowed is reset to an initial value.