当前位置:网站首页>TIPC messaging3
TIPC messaging3
2022-07-02 07:33:00 【云端漫步的程狗子】
Messaging
Datagram messaging
Unicast, anycast or multicast,取决于使用的地址类型、-套接字地址、服务地址或服务范围。
如果有多个套接字与给定的服务地址匹配,则以循环方式选择目标。
1、可靠的节点间传输。
2、接收socket 缓冲过载保护
3、没有端到端的流控制,因此消息仍然可能被接收套接字拒绝。
4、根据发送套接字的配置,被拒绝的消息可能会被丢弃或返回给发送方。
5、如果返回,消息将被截断并带有错误代码。Connections
通过使用服务地址或套接字地址建立连接
1、使用数据传输信息的单向设置(也称为“0-RTT”)
2、或传统的TCP样式设置
1、Stream- or message oriented.
2、End-to-end flow control for socket receive buffer overflow protection.
3、No socket level sequence numbers, acknowledges or retransmissions, - link layer takes care of that.Connection breaks immediately if peer becomes unavailable.
1、Leverages link level heartbeats and kernel/socket cleanup functionality.
2、No socket level “keepalive” heartbeats needed.Communication Groups(通信组)
Communication groups can be described as brokerless message bus instances. Such instances are user created, - the first joining member socket implicitly creates the group. This feature is available from Linux 4.14.
A socket joins a group by indicating a service address, - the address type field serves as group identity, the address instance field serves as member identity.
Groups are closed, - members can only exchange messages with other sockets in the same group.
Each member socket has two addresses: a socket address bound by the system and a service address (group:member tuple) bound by the user. Both addresses are delivered to a message receiving user.
Member sockets may optionally provide the user with join/leave events for other group members, leveraging the service tracking capabilities of the binding table.
Member sockets may optionally receive loopback copies of their own anycast/multicast/broadcast messages.
Within a group there are four different transmission modes available.
Unicast when the sender indicates a socket address as destination.
Anycast when the sender indicates a service address as destination. If there is more than one matching destination, one will be selected by round-robin, but also considering the destination’s load, which can be inferred from the destination’s advertised window.
Multicast when the sender indicates a service range as destination. If there is more than one matching destination, all of them will receive a copy of the sent message.
Broadcast when the sender uses the send() primitive with no destination address. All member sockets, irrespective of member instance number, receive a copy of the message.
Both broadcast and multicast leverage Ethernet broadcast/UDP multicast when possible and deemed favorable.
Delivery and sequence order is guaranteed, even between different transmission modes. Among other things, this implies that all messages must be subject to end-to-end flow control.
Messages will never be dropped because of destination buffer overflow.
Same mechanism covers all tranmsmission modes.
Point-to-point and point-to-multipoint: - “sliding window” algorithm.
Multipoint-to-point: - “coordinated sliding window” algorithm, unique for TIPC.
边栏推荐
- 华为快应用中如何实现同时传递事件对象和自定义参数
- 《实习报告》Skywalking分布式链路追踪?
- MySQL lethal serial question 3 -- are you familiar with MySQL locks?
- PCL projection point cloud
- UVM factory mechanism
- Win11 arm系统配置.net core环境变量
- JSP webshell free -- the basis of JSP
- Record attributeerror: 'nonetype' object has no attribute 'nextcall‘
- Is the account above changtou school safe?
- QT学习日记7——QMainWindow
猜你喜欢
![Luogu p5536 [xr-3] core city (greed + tree DP looking for the center of the tree)](/img/dc/2aa55c9b3f23c292820a56ea72fedd.png)
Luogu p5536 [xr-3] core city (greed + tree DP looking for the center of the tree)

如何使用IDE自动签名调试鸿蒙应用

JSP webshell free -- the basis of JSP

一招快速实现自定义快应用titlebar

Mysql database remote access permission settings

HDU1228 A + B(map映射)
![Binary tree topic -- Luogu p3884 [jloi2009] binary tree problem (DFS for binary tree depth BFS for binary tree width Dijkstra for shortest path)](/img/c2/bb85b681af0f78b380b1d179c7ea49.png)
Binary tree topic -- Luogu p3884 [jloi2009] binary tree problem (DFS for binary tree depth BFS for binary tree width Dijkstra for shortest path)

JSP webshell免杀——JSP的基础

Jsp webshell Free from killing - The Foundation of JSP

快应用中实现自定义抽屉组件
随机推荐
2022-06-17
Matlab processing of distance measurement of experimental electron microscope
华为AppLinking中统一链接的创建和使用
[paid promotion] collection of frequently asked questions, recommended list FAQ
从.bag文件中读取并保存.jpg图片和.pcd点云
力扣(LeetCode)182. 查找重复的电子邮箱(2022.07.01)
最详细MySql安装教程
The most detailed MySQL installation tutorial
Dialogue Wu Gang: why do I believe in the rise of "big country brands"?
Special topic of binary tree -- acwing 19 The next node of the binary tree (find the successor of the node in the tree)
Static variables in static function
PCL Eigen介绍及简单使用
QT学习日记7——QMainWindow
UVM——Callback
Leetcode 182 Find duplicate email (2022.07.01)
Learn open62541 -- [66] UA_ Generation method of string
洛谷 P3398 仓鼠找 sugar(树上倍增 lca 判断树中两条路径是否相交 结论)
【AI应用】海康威视iVMS-4200软件安装
Special topic of binary tree -- [deep base 16. Example 7] ordinary binary tree (simplified version) (multiset seeks the precursor and subsequent sentry Art)
MySQL keyword