当前位置:网站首页>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.
边栏推荐
- QT learning diary 7 - qmainwindow
- AppGallery Connect场景化开发实战—图片存储分享
- 使用华为性能管理服务,按需配置采样率
- Logu p3398 hamster looks for sugar (double LCA on the tree to judge whether the two paths in the tree intersect)
- TIPC 寻址2
- Matlab processing of distance measurement of experimental electron microscope
- Special topic of binary tree -- acwing 47 Path with a certain value in binary tree (preorder traversal)
- C#中索引器
- One trick to quickly realize custom application titlebar
- How to transfer event objects and user-defined parameters simultaneously in Huawei express applications
猜你喜欢

Flick two open, realized a batch lookup join (with source code)

Leetcode+ 76 - 80 storm search topic

【AI应用】海康威视iVMS-4200软件安装

V2x SIM dataset (Shanghai Jiaotong University & New York University)

flink二開,實現了個 batch lookup join(附源碼)

JSP webshell免杀——webshell免杀
![[applinking practical case] share in app pictures through applinking](/img/12/5616f1fa55387b81e25e55a98022b9.png)
[applinking practical case] share in app pictures through applinking

Jsp webshell Free from killing - The Foundation of JSP

js数组常用方法

JSP webshell免殺——JSP的基礎
随机推荐
Flink two Open, implement Batch Lookup join (attached source)
P1055 [noip2008 popularization group] ISBN number
二叉树专题--AcWing 3384. 二叉树遍历(已知先序遍历 边建树 边输出中序遍历)
TIPC Getting Started6
Openmldb meetup No.4 meeting minutes
How to transfer event objects and user-defined parameters simultaneously in Huawei express applications
Learn open62541 -- [66] UA_ Generation method of string
JSP webshell免殺——JSP的基礎
P1055 [NOIP2008 普及组] ISBN 号码
From Read and save in bag file Jpg pictures and PCD point cloud
【深入浅出玩转FPGA学习3-----基本语法】
[AI application] Hikvision ivms-4200 software installation
Binary tree topic -- Luogu p3884 [jloi2009] binary tree problem (DFS for binary tree depth BFS for binary tree width Dijkstra for shortest path)
2022-06-17
实验电镜距离测量之Matlab处理
js数组常用方法
6种单例模式的实现方式
从.bag文件中读取并保存.jpg图片和.pcd点云
Appgallery connect scenario development practice - image storage and sharing
二.Stm32f407芯片GPIO编程,寄存器操作,库函数操作和位段操作