当前位置:网站首页>Kubernetes 集群日志管理
Kubernetes 集群日志管理
2022-06-22 03:41:00 【隔壁老瓦】
Kubernetes 开发了一个 Elasticsearch 附加组件来实现集群的日志管理。这是一个 Elasticsearch、Fluentd 和 Kibana 的组合。Elasticsearch 是一个搜索引擎,负责存储日志并提供查询接口;Fluentd 负责从 Kubernetes 搜集日志并发送给 Elasticsearch;Kibana 提供了一个 Web GUI,用户可以浏览和搜索存储在 Elasticsearch 中的日志。

部署
Elasticsearch 附加组件本身会作为 Kubernetes 的应用在集群里运行,其 YAML 配置文件可从 https://github.com/kubernetes/kubernetes/tree/master/cluster/addons/fluentd-elasticsearch 获取。

可将这些 YAML 文件下载到本地目录,比如 addons ,通过 kubectl apply -f addons/ 部署。
边栏推荐
- Docker install redis
- How to randomly assign 1000 to 10 numbers
- 试用了多款报表工具,终于找到了基于.Net 6开发的一个了
- 3DE recover from design
- Cloud native architecture (02) - what is cloud native
- Introduction to Beifu TwinCAT NC PTP
- LeetCode --- 1221. Split a String in Balanced Strings 解题报告
- Sword finger offer 68 - ii Nearest common ancestor of binary tree
- [netding Cup 2018] fakebook1 reference
- MySQL 45 lecture learning notes (IV) index
猜你喜欢

How to break through the sales dilemma of clothing stores

Dynamic planning - Taking stair climbing with minimum cost as an example

Mysql 45讲学习笔记(一)一条sql语句的执行

Ads communication between Beifu twincat3 controller and controller

Implementation of common function blocks for Beifu twincat3 servo control

Shelling of ESP law of reverse crackme

【Leetcode】17回溯(电话号码的字母组合)

OAK相机如何实现同步?

Irregular naming

3DE robot suction cup grabbing box
随机推荐
Summary of image classification based on pytoch: swing transformer
逆向crackme之ESp定律脱壳
Dart异步是怎么实现
Hierarchical traversal of binary tree
聊聊flink水位线
When 618 attacks, how to choose between Beibei X3 and Jimi h3s? Take you all-round in-depth analysis
Intranet penetration
倍福CX9020(WINCE 7)控制器使用方法和操作
所有项目的资源
剑指 Offer 68 - I. 二叉搜索树的最近公共祖先
The future has come: cloud primary Era
Irregular naming
倍福TwinCAT3控制器和控制器间的Ads通讯
MySQL 45 lecture learning notes (II) execution of SQL update statements
LeetCode --- 1221. Split a String in Balanced Strings 解题报告
How to synchronize the oak camera?
NLog自定义Target之MQTT
std::make_ Shared features
1299. replace each element with the largest element on the right
std::make_shared特点