Download Now Free registration required
This paper presents a formula for the throughput of a network considering the bursty nature and delay requirements of real sources by using the established results in the area of guaranteed rate scheduling. The network of which the throughput is derived, implements aggregate scheduling which has been tipped as the solution to address scalability issues in large scale networks. The formula is quite general and is applicable to a wide range of arrival and services processes. The study is useful in the domain of network information theory for estimating the amount of traffic that can be accommodated within a network with a specified bit rate and at the same time ensuring that QoS criteria are met along the path traversed by the input flow.
- Format: PDF
- Size: 143.19 KB