当前位置:网站首页>TIPC introduction 1
TIPC introduction 1
2022-07-02 11:08:00 【Cheng Gouzi walking in the clouds】
TIPC Implemented as a kernel module , Exists in all major Linux Distribution in . It can be configured to pass UDP Or transmit messages directly through Ethernet . Message passing is sequence guarantee 、 No loss and flow control . The delay time is shorter than any other known Protocol , The maximum throughput is the same as TCP Quite a .
Have you ever wished that even in cluster It can also be used when transmitting data between nodes Unix Domain Socket ? You decide the location of the address you want to bind and use ? You do not have to perform DNS Find and worry IP Address ? You don't have to start a timer to monitor the continuous existence of peer sockets ? But without the disadvantages of this socket type , Like delay inode The risk of ?
Welcome to the transparent interprocess communication service , In short ,TIPC, It provides you with all these , And more .
Service Addressing( Service addressing )
A fundamental concept in TIPC is that of Service Addressing which makes it possible for a programmer to chose his own address, bind it to a server socket and let client programs use only that address for sending messages.
TIPC A basic concept in is service addressing , It allows programmers to choose their own addresses , Bind it to the server socket , And let the client program send messages only with this address .
Service Tracking( Service tracking )
A client wanting to wait for the availablity of a server, uses the Service Tracking mechanism to subscribe for binding and unbinding/close events for sockets with the associated service address.
The service tracking mechanims can also be used for Cluster Topology Tracking, i.e., subscribing for availability/non-availability of cluster nodes.
Likewise, the service tracking mechanims can be used for Cluster Connectivity Tracking, i.e., subscribing for up/down events for individual links between cluster nodes.
Clients who want to wait for server availability use the service tracking mechanism to subscribe to bind and unbind sockets with associated service addresses / Closing event .
The service tracking mechanism can also be used for cluster topology tracking , That is, the availability of subscription cluster nodes / Unavailability .
similarly , The service tracking mechanism can be used for cluster connectivity tracking , namely , Subscribe up for a single link between cluster nodes / Downward event .
Transmission Modes( transmission mode )
Using a service address, a client can send datagram messages to a server socket.
Using the same address type, it can establish a connection towards an accepting server socket.
It can also use a service address to create and join a Communication Group, which is the TIPC manifestation of a brokerless message bus.
Multicast with very good performance and scalability is available both in datagram mode and in communication group mode.
Use the service address , The client can send datagrams to the server socket (datagram) news .
Use the same address type , It can establish a connection to the socket of the receiving server .
It can also create and join communication groups using service addresses , This is agentless message bus TIPC form .
In datagram mode and communication group mode , Multicast has good performance and scalability .
Inter Node Links( Link between nodes )
Communication between any two nodes in a cluster is maintained by one or two Inter Node Links, which both guarantee data traffic integrity and monitor the peer node’s availability.
cluster The communication between any two nodes in is maintained by one or two inter node links , These two links ensure the integrity of data communication , The availability of peer nodes is also monitored .
Cluster Scalability(Cluster Extensibility )
By applying the Overlapping Ring Monitoring algorithm on the inter node links it is possible to scale TIPC clusters up to 1000 nodes with a maintained neighbor failure discovery time of 1-2 seconds. For smaller clusters this time can be made much shorter.
By applying the overlapping ring monitoring algorithm on the link between nodes (Overlapping Ring Moniroring), Can be TIPC The cluster extends to 1000 Nodes , Keep the neighbor fault discovery time as 1-2 second . For smaller clusters , This time can be shortened a lot .
Neighbor Discovery
Neighbor Node Discovery in the cluster is done by Ethernet broadcast or UDP multicast, when any of those services are available. If not, configured peer IP addresses can be used.
When any of these services is available , The neighbor nodes in the cluster are discovered through Ethernet broadcast or UDP Multicast to complete . without , Configured peers can be used IP Address .
Configuration
Run in single node mode TIPC when , No configuration required . When running in cluster mode ,TIPC You must obtain at least one node address ( stay linux4.17 Before ), And tell which interface to connect to .“tipc” Configuration tools make it possible to add and maintain more configuration parameters .
Performance( performance )
TIPC Message transmission latency is better than any other known Protocol . The maximum byte throughput of connections between nodes is still slightly lower than TCP, On the same host , They are better than TCP.
边栏推荐
- Uncover the secrets of Huawei application market application statistics
- [SUCTF2018]followme
- 【付费推广】常见问题合集,推荐榜单FAQ
- Flink two Open, implement Batch Lookup join (attached source)
- 一招快速实现自定义快应用titlebar
- [play with FPGA learning 4 in simple terms ----- talk about state machine design]
- [quick application] there are many words in the text component. How to solve the problem that the div style next to it will be stretched
- 洛谷 P5536 【XR-3】核心城市(贪心 + 树形 dp 寻找树的中心)
- Leetcode 182 Find duplicate email (2022.07.01)
- 如何用list组件实现tabbar标题栏
猜你喜欢

JSP webshell free -- webshell free

最详细MySql安装教程

Common methods of JS array

软件产品管理系统有哪些?12个最佳产品管理工具盘点

Special topic of binary tree -- acwing 3384 Binary tree traversal (known preorder traversal, while building a tree, while outputting middle order traversal)

二叉树专题--AcWing 3384. 二叉树遍历(已知先序遍历 边建树 边输出中序遍历)

【AGC】构建服务3-认证服务示例

TIPC messaging3

The first white paper on agile practice in Chinese enterprises was released | complete download is attached
![[play with FPGA learning 4 in simple terms ----- talk about state machine design]](/img/e0/95f8b8c5116c57455e54ad12372f12.png)
[play with FPGA learning 4 in simple terms ----- talk about state machine design]
随机推荐
Is the account above changtou school safe?
Dialogue Wu Gang: why do I believe in the rise of "big country brands"?
Oracle notes
Creation and use of unified links in Huawei applinking
MySQL keyword
Logu p3398 hamster looks for sugar (double LCA on the tree to judge whether the two paths in the tree intersect)
Special topic of binary tree -- acwing 3540 Binary search tree building (use the board to build a binary search tree and output the pre -, middle -, and post sequence traversal)
二叉树专题--【深基16.例7】普通二叉树(简化版)(multiset 求前驱 后继 哨兵法)
6种单例模式的实现方式
TIPC介绍1
Summary of cases of players' disconnection and reconnection in Huawei online battle service
点云投影图片
Nodejs+express+mysql simple blog building
AppGallery Connect场景化开发实战—图片存储分享
How to implement tabbar title bar with list component
Special topic of binary tree -- [deep base 16. Example 7] ordinary binary tree (simplified version) (multiset seeks the precursor and subsequent sentry Art)
STM32单片机编程学习
二叉树专题--AcWing 18. 重建二叉树(利用前、中序遍历,构建二叉树)
Luogu p5536 [xr-3] core city (greed + tree DP looking for the center of the tree)
How to use ide to automatically sign and debug Hongmeng application