网络的分组交换问题 [英] Packet-switched problem of networking

问题描述

考虑以稳定的速率传输数据的应用程序（例如，

发送方每k个单位生成一个N位数据单位，其中k很小且

固定）。此外，当这样的应用程序启动时，它将在相对较长的时间内继续运行

。

假设使用了分组交换网络并且是唯一的流量

此网络来自上述应用程序。此外，

假设应用数据速率的总和小于每个链路的

容量。是否需要某种形式的拥堵控制？b $ b？为什么？

期待您的回复。

Consider an application that transmits data at a steady rate (for example, the
sender generates an N-bit unit of data every k time units, where k is small and
fixed). Also, when such an application starts, it will continue running for a
relatively long period of time.
Suppose that a packet-switched network is used and the only traffic in
this network comes from such applications as described above. Furthermore,
assume that the sum of the application data rates is less than the
capacities of each and every link. Is some form of congestion control
needed? Why?
Expect for your reply.

推荐答案

鉴于此类慷慨的链接容量，网络不需要拥塞控制机制。在最差（最可能拥塞）的情况下，所有应用程序同时通过一个或多个特定网络链路进行传输。但是，由于每个链路都提供足够的带宽来处理所有应用程序数据速率的总和，因此不会出现拥塞（排队很少）。

Given such generous link capacities, the network needs no congestion control mechanism. In the worst (most potentially congested) case, all the applications simultaneously transmit over one or more particular network links. However, since each link offers sufficient bandwidth to handle the sum of all of the applications' data rates, no congestion (very little queuing) will occur.

这篇关于网络的分组交换问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！