Modern data communication systems usually consist of a number of routing nodes interconnected by communications links of various types. Because the links are single server elements, queuing in the routing nodes is necessary. However, a network design that eliminates queuing is possible. Erlang's Loss Formula is used as the basis of such a design. By multiplexing a large number of channels across the links between routing nodes, queuing can be eliminated while keeping packet loss acceptably low. Quality of service algorithms can also be eliminated. Because there is no queuing, the delay through the network is constant, meaning that compensation for variation in delay (fitter) is not necessary in real-time applications like voice-over-packet. The network can support packet switching functions in addition to emulating the circuit switched nature of the Public Switched Telephone Network. These characteristics make the network suitable for transport of computer-to-computer traffic (packet oriented) and real-time traffic (circuit oriented).
具体描述
读后感
评分
评分
评分
评分
用户评价
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有