mirror of
https://github.com/torvalds/linux.git
synced 2024-11-18 10:01:43 +00:00
9195948fbf
During unicast link transmission, it's observed very often that because
of one or a few lost/dis-ordered packets, the sending side will fastly
reach the send window limit and must wait for the packets to be arrived
at the receiving side or in the worst case, a retransmission must be
done first. The sending side cannot release a lot of subsequent packets
in its transmq even though all of them might have already been received
by the receiving side.
That is, one or two packets dis-ordered/lost and dozens of packets have
to wait, this obviously reduces the overall throughput!
This commit introduces an algorithm to overcome this by using "Gap ACK
blocks". Basically, a Gap ACK block will consist of <ack, gap> numbers
that describes the link deferdq where packets have been got by the
receiving side but with gaps, for example:
link deferdq: [1 2 3 4 10 11 13 14 15 20]
--> Gap ACK blocks: <4, 5>, <11, 1>, <15, 4>, <20, 0>
The Gap ACK blocks will be sent to the sending side along with the
traditional ACK or NACK message. Immediately when receiving the message
the sending side will now not only release from its transmq the packets
ack-ed by the ACK but also by the Gap ACK blocks! So, more packets can
be enqueued and transmitted.
In addition, the sending side can now do "multi-retransmissions"
according to the Gaps reported in the Gap ACK blocks.
The new algorithm as verified helps greatly improve the TIPC throughput
especially under packet loss condition.
So far, a maximum of 32 blocks is quite enough without any "Too few Gap
ACK blocks" reports with a 5.0% packet loss rate, however this number
can be increased in the furture if needed.
Also, the patch is backward compatible.
Acked-by: Ying Xue <ying.xue@windriver.com>
Acked-by: Jon Maloy <jon.maloy@ericsson.com>
Signed-off-by: Tuong Lien <tuong.t.lien@dektech.com.au>
Signed-off-by: David S. Miller <davem@davemloft.net>
109 lines
4.8 KiB
C
109 lines
4.8 KiB
C
/*
|
|
* net/tipc/node.h: Include file for TIPC node management routines
|
|
*
|
|
* Copyright (c) 2000-2006, 2014-2016, Ericsson AB
|
|
* Copyright (c) 2005, 2010-2014, Wind River Systems
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the names of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* Alternatively, this software may be distributed under the terms of the
|
|
* GNU General Public License ("GPL") version 2 as published by the Free
|
|
* Software Foundation.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef _TIPC_NODE_H
|
|
#define _TIPC_NODE_H
|
|
|
|
#include "addr.h"
|
|
#include "net.h"
|
|
#include "bearer.h"
|
|
#include "msg.h"
|
|
|
|
/* Optional capabilities supported by this code version
|
|
*/
|
|
enum {
|
|
TIPC_SYN_BIT = (1),
|
|
TIPC_BCAST_SYNCH = (1 << 1),
|
|
TIPC_BCAST_STATE_NACK = (1 << 2),
|
|
TIPC_BLOCK_FLOWCTL = (1 << 3),
|
|
TIPC_BCAST_RCAST = (1 << 4),
|
|
TIPC_NODE_ID128 = (1 << 5),
|
|
TIPC_LINK_PROTO_SEQNO = (1 << 6),
|
|
TIPC_MCAST_RBCTL = (1 << 7),
|
|
TIPC_GAP_ACK_BLOCK = (1 << 8)
|
|
};
|
|
|
|
#define TIPC_NODE_CAPABILITIES (TIPC_SYN_BIT | \
|
|
TIPC_BCAST_SYNCH | \
|
|
TIPC_BCAST_STATE_NACK | \
|
|
TIPC_BCAST_RCAST | \
|
|
TIPC_BLOCK_FLOWCTL | \
|
|
TIPC_NODE_ID128 | \
|
|
TIPC_LINK_PROTO_SEQNO | \
|
|
TIPC_MCAST_RBCTL | \
|
|
TIPC_GAP_ACK_BLOCK)
|
|
#define INVALID_BEARER_ID -1
|
|
|
|
void tipc_node_stop(struct net *net);
|
|
bool tipc_node_get_id(struct net *net, u32 addr, u8 *id);
|
|
u32 tipc_node_get_addr(struct tipc_node *node);
|
|
u32 tipc_node_try_addr(struct net *net, u8 *id, u32 addr);
|
|
void tipc_node_check_dest(struct net *net, u32 onode, u8 *peer_id128,
|
|
struct tipc_bearer *bearer,
|
|
u16 capabilities, u32 signature,
|
|
struct tipc_media_addr *maddr,
|
|
bool *respond, bool *dupl_addr);
|
|
void tipc_node_delete_links(struct net *net, int bearer_id);
|
|
void tipc_node_apply_property(struct net *net, struct tipc_bearer *b, int prop);
|
|
int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 node,
|
|
char *linkname, size_t len);
|
|
int tipc_node_xmit(struct net *net, struct sk_buff_head *list, u32 dnode,
|
|
int selector);
|
|
int tipc_node_distr_xmit(struct net *net, struct sk_buff_head *list);
|
|
int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dest,
|
|
u32 selector);
|
|
void tipc_node_subscribe(struct net *net, struct list_head *subscr, u32 addr);
|
|
void tipc_node_unsubscribe(struct net *net, struct list_head *subscr, u32 addr);
|
|
void tipc_node_broadcast(struct net *net, struct sk_buff *skb);
|
|
int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port);
|
|
void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port);
|
|
int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel);
|
|
bool tipc_node_is_up(struct net *net, u32 addr);
|
|
u16 tipc_node_get_capabilities(struct net *net, u32 addr);
|
|
int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb);
|
|
int tipc_nl_node_dump_link(struct sk_buff *skb, struct netlink_callback *cb);
|
|
int tipc_nl_node_reset_link_stats(struct sk_buff *skb, struct genl_info *info);
|
|
int tipc_nl_node_get_link(struct sk_buff *skb, struct genl_info *info);
|
|
int tipc_nl_node_set_link(struct sk_buff *skb, struct genl_info *info);
|
|
int tipc_nl_peer_rm(struct sk_buff *skb, struct genl_info *info);
|
|
|
|
int tipc_nl_node_set_monitor(struct sk_buff *skb, struct genl_info *info);
|
|
int tipc_nl_node_get_monitor(struct sk_buff *skb, struct genl_info *info);
|
|
int tipc_nl_node_dump_monitor(struct sk_buff *skb, struct netlink_callback *cb);
|
|
int tipc_nl_node_dump_monitor_peer(struct sk_buff *skb,
|
|
struct netlink_callback *cb);
|
|
#endif
|