“瓶颈”是什么意思？是指带宽吗？
什么是“瓶颈”，特别是在网络带宽方面？
What is a "bottleneck", particularly when used in terms of network bandwidth?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
什么是“瓶颈”，特别是在网络带宽方面？
What is a "bottleneck", particularly when used in terms of network bandwidth?
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
接受 或继续使用网站，即表示您同意使用 Cookies 和您的相关数据。
发布评论
评论（2）
瓶颈是系统中“最慢”的部分。如果您检查啤酒瓶，您会发现瓶颈比底部小，因此限制了您可以喝到的甜美花蜜的量。嗯嗯！啤酒！ （抱歉，得意忘形了）。
就带宽而言，它是链中最慢的设备。例如，如果您的路由器仅以 10meg 运行，那么您的 PC 上拥有千兆位以太网几乎没有什么区别。那里的路由器是瓶颈。
如果您尝试下载的网站使用 80 年代初期的 1200/75 声学调制解调器运行，那么您的以太网卡、路由器和互联网基础设施的速度有多快并不重要。在这种情况下，另一端是瓶颈。
瓶颈无处不在。您的网络设备、PC 中的磁盘、必须从 RAM 而不是 L2 缓存中获取、甘特图上的关键路径、试图送您的孩子去学校，而其中一个是 7 岁的速度守护进程，而另一个是 5 岁的“想要停止”看看每一朵该死的花”类型:-)
基本上，如果它更快，就会使系统（作为一个整体）更快。这是您需要优化的瓶颈，因为那里的投资回报率应该更高。
A bottleneck is the "slowest" part of a system. If you examine a beer bottle, the neck is smaller than the base and so limits the amount of sweet wonderful nectar that you can drink. Mmmm! Beeer! (sorry, got carried away).
In terms of bandwidth, it's the slowest device in the chain. For example, it makes little difference having gigabit ethernet on your PC if your router only runs at 10meg. The router there is the bottleneck.
And it doesn't matter how fast your ethernet card and router and internet infrastructure are, if the site you're trying to download from is running with a 1200/75 acoustic modem from the early '80s. The other end is the bottleneck in that case.
Bottlenecks are everywhere. Your network devices, the disk in your PC, having to fetch from RAM rather than L2 cache, critical paths on your Gantt chart, trying to walk your kids to school when one is a 7yo speed daemon and the other a 5yo "want to stop and look at every single god-damned flower"-type :-)
Basically, it's the thing that, if it was faster, would make the system (as a whole) faster. It's the bottlenecks where you need to optimise since the return on investment should be higher there.
瓶颈术语用于计算机科学领域内的许多领域（以及许多外部领域），在电信环境中，首先应该了解什么是吞吐量，才能将瓶颈理解为两者密切相关，因此：
现在让我们考虑一个示例，客户端和服务器通过两个通信链路和一个路由器连接。
考虑从服务器到客户端的文件传输的吞吐量。令R_{s}表示服务器和路由器之间的链路速率； R_{c}表示路由器和客户端之间的链路速率。
假设整个网络中发送的唯一位是从服务器到客户端的位。现在我们要问，在这个理想的场景中，服务器到客户端的吞吐量是多少？
为了回答这个问题，我们可以将比特视为流体，将通信链路视为管道。显然，服务器无法以高于 R_{s} bps 的速率通过其链路泵送比特；并且路由器无法以高于 R_{c} bps 的速率转发位。
如果 R_{s} < R_{c} ，那么服务器泵送的比特将直接“流”过路由器并以 R_{s} bps 的速率到达客户端，从而提供吞吐量R_{s} bps。另一方面，如果R_{c}＜； R_{s} ，那么路由器将无法像接收比特那样快地转发比特。在这种情况下，比特只会以 R_{c} 速率离开路由器，从而提供 R_{c} 端到端吞吐量。 （另请注意，如果比特继续以 R_{s} 速率到达路由器，并继续以 R_{c} 离开路由器，则积压的比特为等待传输到客户端的路由器会不断增长——这是最不希望的情况！因此，对于这个简单的双链路网络，吞吐量为min{R_{c},R_{s}} ，即是瓶颈链路的传输速率。
那么现在可以给出一个正式的、全面的瓶颈定义：
Curtsy（计算机网络自上而下的方法，第八版，James F. Kurose • Keith W. Ross）。
Bottleneck terminology is used in many areas within the computer science realm (and in many outside), in a telecommunication context first one should understand what is throughput to understand Bottleneck as the two are closely related so:
Now let's consider an example, a client and a server con-nected by two communication links and a router.
Consider the throughput for a file transfer from the server to the client. Let R_{s} denote the rate of the link between the server and the router; and R_{c} denote the rate of the link between the router and the client.
Suppose that the only bits being sent in the entire network are those from the server to the client. We now ask, in this ideal scenario, what is the server-to-client throughput?
To answer this question, we may think of bits as fluid and com-munication links as pipes. Clearly, the server cannot pump bits through its link at a rate faster than R_{s} bps; and the router cannot forward bits at a rate faster than R_{c} bps.
If R_{s} < R_{c} , then the bits pumped by the server will “flow” right through the router and arrive at the client at a rate of R_{s} bps, giving a throughput of R_{s} bps. If, on the other hand, R_{c} < R_{s} , then the router will not be able to forward bits as quickly as it receives them. In this case, bits will only leave the router at rate R_{c} , giving an end-to-end throughput of R_{c} . (Note also that if bits continue to arrive at the router at rate R_{s} , and continue to leave the router at R_{c} , the backlog of bits at the router waiting for transmission to the client will grow and grow—a most undesirable situation! Thus, for this simple two-link network, the throughput is min{R_{c},R_{s}}, that is, it is the transmission rate of the bottleneck link.
So now can give a formal sweat and comprehensive definition of bottleneck:
Curtsy (Computer Networking A Top-Down Approach,EIGHTH EDITION,James F. Kurose • Keith W. Ross).